%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : PUZ019-1 : TPTP v9.3.1. Bugfixed v5.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:02:18 PM UTC 2026
% Result : Unsatisfiable 0.17s 5.55s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of clauses : 33 ( 11 unt; 4 nHn; 31 RR)
% Number of literals : 94 ( 0 equ; 71 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 : 63 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(males_are_not_female,axiom,
( ~ female(X1)
| ~ male(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',males_are_not_female) ).
cnf(find_who_has_each_job,negated_conjecture,
( ~ has_job(X8,boxer)
| ~ has_job(X7,actor)
| ~ has_job(X6,teacher)
| ~ has_job(X5,police)
| ~ has_job(X4,operator)
| ~ has_job(X3,nurse)
| ~ has_job(X2,guard)
| ~ has_job(X1,chef) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_who_has_each_job) ).
cnf(roberta_is_not_boxer,hypothesis,
~ has_job(roberta,boxer),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',roberta_is_not_boxer) ).
cnf(actor_is_male,axiom,
( ~ has_job(X1,actor)
| male(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',actor_is_male) ).
cnf(thelma_is_female,hypothesis,
female(thelma),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thelma_is_female) ).
cnf(every_job_is_used,hypothesis,
( has_job(steve,X1)
| has_job(pete,X1)
| has_job(thelma,X1)
| has_job(roberta,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',every_job_is_used) ).
cnf(roberta_is_not_police,hypothesis,
~ has_job(roberta,police),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',roberta_is_not_police) ).
cnf(nurse_is_male,axiom,
( ~ has_job(X1,nurse)
| male(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nurse_is_male) ).
cnf(c_0_8,plain,
( ~ female(X1)
| ~ male(X1) ),
inference(fof_simplification,[status(thm)],[males_are_not_female]) ).
cnf(c_0_9,negated_conjecture,
( ~ has_job(X8,boxer)
| ~ has_job(X7,actor)
| ~ has_job(X6,teacher)
| ~ has_job(X5,police)
| ~ has_job(X4,operator)
| ~ has_job(X3,nurse)
| ~ has_job(X2,guard)
| ~ has_job(X1,chef) ),
inference(fof_simplification,[status(thm)],[find_who_has_each_job]) ).
cnf(c_0_10,hypothesis,
~ has_job(roberta,boxer),
inference(fof_simplification,[status(thm)],[roberta_is_not_boxer]) ).
cnf(c_0_11,plain,
( ~ has_job(X1,actor)
| male(X1) ),
inference(fof_simplification,[status(thm)],[actor_is_male]) ).
cnf(c_0_12,plain,
( ~ female(X1)
| ~ male(X1) ),
c_0_8 ).
cnf(c_0_13,hypothesis,
female(thelma),
thelma_is_female ).
cnf(c_0_14,negated_conjecture,
( ~ has_job(X8,boxer)
| ~ has_job(X7,actor)
| ~ has_job(X6,teacher)
| ~ has_job(X5,police)
| ~ has_job(X4,operator)
| ~ has_job(X3,nurse)
| ~ has_job(X2,guard)
| ~ has_job(X1,chef) ),
c_0_9 ).
cnf(c_0_15,hypothesis,
( has_job(steve,X1)
| has_job(pete,X1)
| has_job(thelma,X1)
| has_job(roberta,X1) ),
every_job_is_used ).
cnf(c_0_16,hypothesis,
~ has_job(roberta,boxer),
c_0_10 ).
cnf(c_0_17,plain,
( ~ has_job(X1,actor)
| male(X1) ),
c_0_11 ).
cnf(c_0_18,hypothesis,
~ male(thelma),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,hypothesis,
( ~ has_job(X7,chef)
| ~ has_job(X6,guard)
| ~ has_job(X5,nurse)
| ~ has_job(X4,operator)
| ~ has_job(X3,police)
| ~ has_job(X2,teacher)
| ~ has_job(X1,actor) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_14]),c_0_14]) ).
cnf(c_0_20,hypothesis,
( has_job(roberta,actor)
| has_job(pete,actor)
| has_job(steve,actor) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_15]),c_0_18]) ).
cnf(c_0_21,hypothesis,
( ~ has_job(X6,chef)
| ~ has_job(X5,guard)
| ~ has_job(X4,nurse)
| ~ has_job(X3,operator)
| ~ has_job(X2,police)
| ~ has_job(X1,teacher) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_19]),c_0_19]) ).
cnf(c_0_22,hypothesis,
~ has_job(roberta,police),
inference(fof_simplification,[status(thm)],[roberta_is_not_police]) ).
cnf(c_0_23,hypothesis,
( ~ has_job(X5,chef)
| ~ has_job(X4,guard)
| ~ has_job(X3,nurse)
| ~ has_job(X2,operator)
| ~ has_job(X1,police) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_15]),c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_24,hypothesis,
~ has_job(roberta,police),
c_0_22 ).
cnf(c_0_25,plain,
( ~ has_job(X1,nurse)
| male(X1) ),
inference(fof_simplification,[status(thm)],[nurse_is_male]) ).
cnf(c_0_26,hypothesis,
( ~ has_job(X4,chef)
| ~ has_job(X3,guard)
| ~ has_job(X2,nurse)
| ~ has_job(X1,operator) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_24]),c_0_23]),c_0_23]) ).
cnf(c_0_27,plain,
( ~ has_job(X1,nurse)
| male(X1) ),
c_0_25 ).
cnf(c_0_28,hypothesis,
( ~ has_job(X3,chef)
| ~ has_job(X2,guard)
| ~ has_job(X1,nurse) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_15]),c_0_26]),c_0_26]),c_0_26]) ).
cnf(c_0_29,hypothesis,
( has_job(roberta,nurse)
| has_job(pete,nurse)
| has_job(steve,nurse) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_18]) ).
cnf(c_0_30,hypothesis,
( ~ has_job(X2,chef)
| ~ has_job(X1,guard) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]),c_0_28]) ).
cnf(c_0_31,hypothesis,
~ has_job(X1,chef),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_15]),c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_32,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_31]),c_0_31]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ019-1 : TPTP v9.3.1. Bugfixed v5.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/5.39 % Computer : n026.cluster.edu
% 0.13/5.39 % Model : x86_64 x86_64
% 0.13/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.39 % Memory : 8046.5625MB
% 0.13/5.39 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Mon Sep 21 03:47:57 UTC 2026
% 0.16/5.40 % CPUTime :
% 0.16/5.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/5.47 Running first-order theorem proving
% 0.16/5.47 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.17/5.55 % Version: 3.5.1
% 0.17/5.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.17/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.17/5.55 % Starting sh5l with 300s (1) cores
% 0.17/5.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1294745 completed with status 0
% 0.17/5.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 0.17/5.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.55 % No SInE strategy applied
% 0.17/5.55 % Search class: FGHNS-FFMS00-SFFFFFNN
% 0.17/5.55 % partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.17/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/5.55 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.17/5.55 % new_bool_1 with pid 1294753 completed with status 0
% 0.17/5.55 % Result found by new_bool_1
% 0.17/5.55 % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.17/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/5.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.17/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/5.55 % No SInE strategy applied
% 0.17/5.55 % Search class: FGHNS-FFMS00-SFFFFFNN
% 0.17/5.55 % partial match(1): FGHNF-FFMS00-SFFFFFNN
% 0.17/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.17/5.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 0.17/5.55 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.17/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.17/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.17/5.55 % Preprocessing time : 0.003 s
% 0.17/5.55 % Presaturation interreduction done
% 0.17/5.55
% 0.17/5.55 % Proof found!
% 0.17/5.55 % SZS status Unsatisfiable
% 0.17/5.55 % SZS output start CNFRefutation
% See solution above
% 0.17/5.55 % Parsed axioms : 64
% 0.17/5.55 % Removed by relevancy pruning/SinE : 0
% 0.17/5.55 % Initial clauses : 64
% 0.17/5.55 % Removed in clause preprocessing : 0
% 0.17/5.55 % Initial clauses in saturation : 64
% 0.17/5.55 % Processed clauses : 158
% 0.17/5.55 % ...of these trivial : 0
% 0.17/5.55 % ...subsumed : 7
% 0.17/5.55 % ...remaining for further processing : 151
% 0.17/5.55 % Other redundant clauses eliminated : 0
% 0.17/5.55 % Clauses deleted for lack of memory : 0
% 0.17/5.55 % Backward-subsumed : 13
% 0.17/5.55 % Backward-rewritten : 0
% 0.17/5.55 % Generated clauses : 59
% 0.17/5.55 % ...of the previous two non-redundant : 47
% 0.17/5.55 % ...aggressively subsumed : 0
% 0.17/5.55 % Contextual simplify-reflections : 17
% 0.17/5.55 % Paramodulations : 56
% 0.17/5.55 % Factorizations : 0
% 0.17/5.55 % NegExts : 0
% 0.17/5.55 % Equation resolutions : 0
% 0.17/5.55 % Disequality decompositions : 0
% 0.17/5.55 % Total rewrite steps : 10
% 0.17/5.55 % ...of those cached : 3
% 0.17/5.55 % Propositional unsat checks : 0
% 0.17/5.55 % Propositional check models : 0
% 0.17/5.55 % Propositional check unsatisfiable : 0
% 0.17/5.55 % Propositional clauses : 0
% 0.17/5.55 % Propositional clauses after purity: 0
% 0.17/5.55 % Propositional unsat core size : 0
% 0.17/5.55 % Propositional preprocessing time : 0.000
% 0.17/5.55 % Propositional encoding time : 0.000
% 0.17/5.55 % Propositional solver time : 0.000
% 0.17/5.55 % Success case prop preproc time : 0.000
% 0.17/5.55 % Success case prop encoding time : 0.000
% 0.17/5.55 % Success case prop solver time : 0.000
% 0.17/5.55 % Current number of processed clauses : 71
% 0.17/5.55 % Positive orientable unit clauses : 6
% 0.17/5.55 % Positive unorientable unit clauses: 0
% 0.17/5.55 % Negative unit clauses : 40
% 0.17/5.55 % Non-unit-clauses : 25
% 0.17/5.55 % Current number of unprocessed clauses: 14
% 0.17/5.55 % ...number of literals in the above : 117
% 0.17/5.55 % Current number of archived formulas : 0
% 0.17/5.55 % Current number of archived clauses : 80
% 0.17/5.55 % Clause-clause subsumption calls (NU) : 1072
% 0.17/5.55 % Rec. Clause-clause subsumption calls : 194
% 0.17/5.55 % Non-unit clause-clause subsumptions : 30
% 0.17/5.55 % Unit Clause-clause subsumption calls : 70
% 0.17/5.55 % Rewrite failures with RHS unbound : 0
% 0.17/5.55 % BW rewrite match attempts : 26
% 0.17/5.55 % BW rewrite match successes : 0
% 0.17/5.55 % Condensation attempts : 0
% 0.17/5.55 % Condensation successes : 0
% 0.17/5.55 % Termbank termtop insertions : 2560
% 0.17/5.55 % Search garbage collected termcells : 139
% 0.17/5.55
% 0.17/5.55 % -------------------------------------------------
% 0.17/5.55 % User time : 0.016 s
% 0.17/5.55 % System time : 0.006 s
% 0.17/5.55 % Total time : 0.022 s
% 0.17/5.55 % Maximum resident set size: 3636 pages
% 0.17/5.55
% 0.17/5.55 % -------------------------------------------------
% 0.17/5.55 % User time : 0.050 s
% 0.17/5.55 % System time : 0.020 s
% 0.17/5.55 % Total time : 0.070 s
% 0.17/5.55 % Maximum resident set size: 4608 pages
% 0.17/5.55 % E exiting
%------------------------------------------------------------------------------