TSTP Solution File: PUZ019-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---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 : n010.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:11:39 EDT 2023
% Result : Unsatisfiable 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 9 unt; 4 nHn; 25 RR)
% Number of literals : 78 ( 0 equ; 57 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/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',males_are_not_female) ).
cnf(thelma_is_female,hypothesis,
female(thelma),
file('/export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.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/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.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/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',every_job_is_used) ).
cnf(roberta_is_not_boxer,hypothesis,
~ has_job(roberta,boxer),
file('/export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',roberta_is_not_boxer) ).
cnf(actor_is_male,axiom,
( male(X1)
| ~ has_job(X1,actor) ),
file('/export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',actor_is_male) ).
cnf(roberta_is_not_police,hypothesis,
~ has_job(roberta,police),
file('/export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',roberta_is_not_police) ).
cnf(nurse_is_male,axiom,
( male(X1)
| ~ has_job(X1,nurse) ),
file('/export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p',nurse_is_male) ).
cnf(c_0_8,axiom,
( ~ male(X1)
| ~ female(X1) ),
males_are_not_female ).
cnf(c_0_9,hypothesis,
female(thelma),
thelma_is_female ).
cnf(c_0_10,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_11,hypothesis,
( has_job(roberta,X1)
| has_job(thelma,X1)
| has_job(pete,X1)
| has_job(steve,X1) ),
every_job_is_used ).
cnf(c_0_12,hypothesis,
~ has_job(roberta,boxer),
roberta_is_not_boxer ).
cnf(c_0_13,axiom,
( male(X1)
| ~ has_job(X1,actor) ),
actor_is_male ).
cnf(c_0_14,hypothesis,
~ male(thelma),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
( ~ has_job(X1,actor)
| ~ has_job(X2,teacher)
| ~ has_job(X3,police)
| ~ has_job(X4,operator)
| ~ has_job(X5,nurse)
| ~ has_job(X6,guard)
| ~ has_job(X7,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_10]),c_0_10]) ).
cnf(c_0_16,hypothesis,
( has_job(steve,actor)
| has_job(pete,actor)
| has_job(roberta,actor) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
cnf(c_0_17,hypothesis,
( ~ has_job(X1,teacher)
| ~ has_job(X2,police)
| ~ has_job(X3,operator)
| ~ has_job(X4,nurse)
| ~ has_job(X5,guard)
| ~ has_job(X6,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_15]),c_0_15]) ).
cnf(c_0_18,hypothesis,
( ~ has_job(X1,police)
| ~ has_job(X2,operator)
| ~ has_job(X3,nurse)
| ~ has_job(X4,guard)
| ~ has_job(X5,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_19,hypothesis,
~ has_job(roberta,police),
roberta_is_not_police ).
cnf(c_0_20,hypothesis,
( ~ has_job(X1,operator)
| ~ has_job(X2,nurse)
| ~ has_job(X3,guard)
| ~ has_job(X4,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_11]),c_0_19]),c_0_18]),c_0_18]) ).
cnf(c_0_21,axiom,
( male(X1)
| ~ has_job(X1,nurse) ),
nurse_is_male ).
cnf(c_0_22,hypothesis,
( ~ has_job(X1,nurse)
| ~ has_job(X2,guard)
| ~ has_job(X3,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_11]),c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_23,hypothesis,
( has_job(steve,nurse)
| has_job(pete,nurse)
| has_job(roberta,nurse) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_14]) ).
cnf(c_0_24,hypothesis,
( ~ has_job(X1,guard)
| ~ has_job(X2,chef) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_22]),c_0_22]) ).
cnf(c_0_25,hypothesis,
~ has_job(X1,chef),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_11]),c_0_24]),c_0_24]),c_0_24]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_11]),c_0_25]),c_0_25]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PUZ019-1 : TPTP v8.1.2. Bugfixed v5.1.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n010.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 18:44:35 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.LQiP2LWEn4/E---3.1_27161.p
% 0.21/0.51 # Version: 3.1pre001
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 27276 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.21/0.51 # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting sh5l with 136s (1) cores
% 0.21/0.51 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 27282 completed with status 0
% 0.21/0.51 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.21/0.51 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHNS-FFMS00-SFFFFFNN
% 0.21/0.51 # partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 811s (1) cores
% 0.21/0.51 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Unsatisfiable
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 64
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 64
% 0.21/0.51 # Removed in clause preprocessing : 0
% 0.21/0.51 # Initial clauses in saturation : 64
% 0.21/0.51 # Processed clauses : 162
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 6
% 0.21/0.51 # ...remaining for further processing : 156
% 0.21/0.51 # Other redundant clauses eliminated : 0
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 15
% 0.21/0.51 # Backward-rewritten : 0
% 0.21/0.51 # Generated clauses : 72
% 0.21/0.51 # ...of the previous two non-redundant : 57
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 17
% 0.21/0.51 # Paramodulations : 67
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 0
% 0.21/0.51 # Total rewrite steps : 13
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 72
% 0.21/0.51 # Positive orientable unit clauses : 6
% 0.21/0.51 # Positive unorientable unit clauses: 0
% 0.21/0.51 # Negative unit clauses : 40
% 0.21/0.51 # Non-unit-clauses : 26
% 0.21/0.51 # Current number of unprocessed clauses: 17
% 0.21/0.51 # ...number of literals in the above : 126
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 84
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 1251
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 229
% 0.21/0.51 # Non-unit clause-clause subsumptions : 30
% 0.21/0.51 # Unit Clause-clause subsumption calls : 162
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 30
% 0.21/0.51 # BW rewrite match successes : 0
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2281
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.008 s
% 0.21/0.51 # System time : 0.004 s
% 0.21/0.51 # Total time : 0.012 s
% 0.21/0.51 # Maximum resident set size: 1736 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.047 s
% 0.21/0.51 # System time : 0.009 s
% 0.21/0.51 # Total time : 0.056 s
% 0.21/0.51 # Maximum resident set size: 1716 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E---3.1 exiting
%------------------------------------------------------------------------------