TSTP Solution File: PUZ019-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : PUZ019-1 : TPTP v8.1.2. Bugfixed v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:12:40 EDT 2023
% Result : Unsatisfiable 0.15s 0.41s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 29 ( 11 unt; 4 nHn; 27 RR)
% Number of literals : 80 ( 0 equ; 59 neg)
% Maximal clause size : 8 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 12 con; 0-0 aty)
% Number of variables : 52 ( 44 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(males_are_not_female,axiom,
( ~ male(X1)
| ~ female(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',males_are_not_female) ).
cnf(thelma_is_female,hypothesis,
female(thelma),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',thelma_is_female) ).
cnf(find_who_has_each_job,negated_conjecture,
( ~ has_job(X1,chef)
| ~ has_job(X2,guard)
| ~ has_job(X3,nurse)
| ~ has_job(X4,operator)
| ~ has_job(X5,police)
| ~ has_job(X6,teacher)
| ~ has_job(X7,actor)
| ~ has_job(X8,boxer) ),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',find_who_has_each_job) ).
cnf(every_job_is_used,hypothesis,
( has_job(roberta,X1)
| has_job(thelma,X1)
| has_job(pete,X1)
| has_job(steve,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',every_job_is_used) ).
cnf(roberta_is_not_chef,hypothesis,
~ has_job(roberta,chef),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',roberta_is_not_chef) ).
cnf(nurse_is_male,axiom,
( male(X1)
| ~ has_job(X1,nurse) ),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',nurse_is_male) ).
cnf(roberta_is_not_police,hypothesis,
~ has_job(roberta,police),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',roberta_is_not_police) ).
cnf(actor_is_male,axiom,
( male(X1)
| ~ has_job(X1,actor) ),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',actor_is_male) ).
cnf(roberta_is_not_boxer,hypothesis,
~ has_job(roberta,boxer),
file('/export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p',roberta_is_not_boxer) ).
cnf(c_0_9,axiom,
( ~ male(X1)
| ~ female(X1) ),
males_are_not_female ).
cnf(c_0_10,hypothesis,
female(thelma),
thelma_is_female ).
cnf(c_0_11,negated_conjecture,
( ~ has_job(X1,chef)
| ~ has_job(X2,guard)
| ~ has_job(X3,nurse)
| ~ has_job(X4,operator)
| ~ has_job(X5,police)
| ~ has_job(X6,teacher)
| ~ has_job(X7,actor)
| ~ has_job(X8,boxer) ),
find_who_has_each_job ).
cnf(c_0_12,hypothesis,
( has_job(roberta,X1)
| has_job(thelma,X1)
| has_job(pete,X1)
| has_job(steve,X1) ),
every_job_is_used ).
cnf(c_0_13,hypothesis,
~ has_job(roberta,chef),
roberta_is_not_chef ).
cnf(c_0_14,axiom,
( male(X1)
| ~ has_job(X1,nurse) ),
nurse_is_male ).
cnf(c_0_15,hypothesis,
~ male(thelma),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,hypothesis,
( ~ has_job(X1,boxer)
| ~ has_job(X2,actor)
| ~ has_job(X3,teacher)
| ~ has_job(X4,police)
| ~ has_job(X5,operator)
| ~ has_job(X6,nurse)
| ~ has_job(X7,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_11]),c_0_11]) ).
cnf(c_0_17,hypothesis,
( has_job(roberta,nurse)
| has_job(pete,nurse)
| has_job(steve,nurse) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_12]),c_0_15]) ).
cnf(c_0_18,hypothesis,
( ~ has_job(X1,boxer)
| ~ has_job(X2,actor)
| ~ has_job(X3,teacher)
| ~ has_job(X4,police)
| ~ has_job(X5,operator)
| ~ has_job(X6,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_16]),c_0_16]) ).
cnf(c_0_19,hypothesis,
~ has_job(roberta,police),
roberta_is_not_police ).
cnf(c_0_20,axiom,
( male(X1)
| ~ has_job(X1,actor) ),
actor_is_male ).
cnf(c_0_21,hypothesis,
( ~ has_job(X1,boxer)
| ~ has_job(X2,actor)
| ~ has_job(X3,teacher)
| ~ has_job(X4,operator)
| ~ has_job(X5,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_12]),c_0_19]),c_0_18]),c_0_18]) ).
cnf(c_0_22,hypothesis,
( has_job(roberta,actor)
| has_job(pete,actor)
| has_job(steve,actor) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_12]),c_0_15]) ).
cnf(c_0_23,hypothesis,
( ~ has_job(X1,boxer)
| ~ has_job(X2,teacher)
| ~ has_job(X3,operator)
| ~ has_job(X4,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_21]),c_0_21]) ).
cnf(c_0_24,hypothesis,
~ has_job(roberta,boxer),
roberta_is_not_boxer ).
cnf(c_0_25,hypothesis,
( ~ has_job(X1,teacher)
| ~ has_job(X2,operator)
| ~ has_job(X3,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_24]),c_0_23]),c_0_23]) ).
cnf(c_0_26,hypothesis,
( ~ has_job(X1,teacher)
| ~ has_job(X2,operator) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_12]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_27,hypothesis,
~ has_job(X1,teacher),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_12]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_28,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_12]),c_0_27]),c_0_27]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : PUZ019-1 : TPTP v8.1.2. Bugfixed v5.1.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 2400
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Mon Oct 2 18:54:57 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order model finding
% 0.15/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.BwN2Vry8CL/E---3.1_31831.p
% 0.15/0.41 # Version: 3.1pre001
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.41 # Starting sh5l with 300s (1) cores
% 0.15/0.41 # new_bool_3 with pid 31944 completed with status 0
% 0.15/0.41 # Result found by new_bool_3
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.15/0.41 # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.15/0.41 # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 31949 completed with status 0
% 0.15/0.41 # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.15/0.41 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.15/0.41 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.41 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.15/0.41 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.41 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.41 # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.15/0.41 # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.15/0.41 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.41 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.15/0.41 # Preprocessing time : 0.001 s
% 0.15/0.41
% 0.15/0.41 # Proof found!
% 0.15/0.41 # SZS status Unsatisfiable
% 0.15/0.41 # SZS output start CNFRefutation
% See solution above
% 0.15/0.41 # Parsed axioms : 64
% 0.15/0.41 # Removed by relevancy pruning/SinE : 0
% 0.15/0.41 # Initial clauses : 64
% 0.15/0.41 # Removed in clause preprocessing : 0
% 0.15/0.41 # Initial clauses in saturation : 64
% 0.15/0.41 # Processed clauses : 120
% 0.15/0.41 # ...of these trivial : 0
% 0.15/0.41 # ...subsumed : 20
% 0.15/0.41 # ...remaining for further processing : 100
% 0.15/0.41 # Other redundant clauses eliminated : 0
% 0.15/0.41 # Clauses deleted for lack of memory : 0
% 0.15/0.41 # Backward-subsumed : 9
% 0.15/0.41 # Backward-rewritten : 0
% 0.15/0.41 # Generated clauses : 171
% 0.15/0.41 # ...of the previous two non-redundant : 146
% 0.15/0.41 # ...aggressively subsumed : 0
% 0.15/0.41 # Contextual simplify-reflections : 16
% 0.15/0.41 # Paramodulations : 169
% 0.15/0.41 # Factorizations : 0
% 0.15/0.41 # NegExts : 0
% 0.15/0.41 # Equation resolutions : 0
% 0.15/0.41 # Total rewrite steps : 22
% 0.15/0.41 # Propositional unsat checks : 0
% 0.15/0.41 # Propositional check models : 0
% 0.15/0.41 # Propositional check unsatisfiable : 0
% 0.15/0.41 # Propositional clauses : 0
% 0.15/0.41 # Propositional clauses after purity: 0
% 0.15/0.41 # Propositional unsat core size : 0
% 0.15/0.41 # Propositional preprocessing time : 0.000
% 0.15/0.41 # Propositional encoding time : 0.000
% 0.15/0.41 # Propositional solver time : 0.000
% 0.15/0.41 # Success case prop preproc time : 0.000
% 0.15/0.41 # Success case prop encoding time : 0.000
% 0.15/0.41 # Success case prop solver time : 0.000
% 0.15/0.41 # Current number of processed clauses : 89
% 0.15/0.41 # Positive orientable unit clauses : 6
% 0.15/0.41 # Positive unorientable unit clauses: 0
% 0.15/0.41 # Negative unit clauses : 41
% 0.15/0.41 # Non-unit-clauses : 42
% 0.15/0.41 # Current number of unprocessed clauses: 87
% 0.15/0.41 # ...number of literals in the above : 763
% 0.15/0.41 # Current number of archived formulas : 0
% 0.15/0.41 # Current number of archived clauses : 11
% 0.15/0.41 # Clause-clause subsumption calls (NU) : 1615
% 0.15/0.41 # Rec. Clause-clause subsumption calls : 230
% 0.15/0.41 # Non-unit clause-clause subsumptions : 43
% 0.15/0.41 # Unit Clause-clause subsumption calls : 142
% 0.15/0.41 # Rewrite failures with RHS unbound : 0
% 0.15/0.41 # BW rewrite match attempts : 15
% 0.15/0.41 # BW rewrite match successes : 0
% 0.15/0.41 # Condensation attempts : 0
% 0.15/0.41 # Condensation successes : 0
% 0.15/0.41 # Termbank termtop insertions : 4249
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.008 s
% 0.15/0.41 # System time : 0.002 s
% 0.15/0.41 # Total time : 0.010 s
% 0.15/0.41 # Maximum resident set size: 1836 pages
% 0.15/0.41
% 0.15/0.41 # -------------------------------------------------
% 0.15/0.41 # User time : 0.009 s
% 0.15/0.41 # System time : 0.004 s
% 0.15/0.41 # Total time : 0.013 s
% 0.15/0.41 # Maximum resident set size: 1716 pages
% 0.15/0.41 % E---3.1 exiting
%------------------------------------------------------------------------------