%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PUZ001-2 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:01:19 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.43s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 44 ( 20 unt; 11 nHn; 40 RR)
% Number of literals : 77 ( 25 equ; 34 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(killer_hates_victim,axiom,
( ~ killed(X1,X2)
| hates(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',killer_hates_victim) ).
cnf(noone_else_lives_at_mansion,axiom,
( ~ lives_at_dreadsbury(X1)
| X1 = charles
| X1 = butler
| X1 = aunt_agatha ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',noone_else_lives_at_mansion) ).
cnf(someone_killed_agatha,axiom,
killed(someone,aunt_agatha),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',someone_killed_agatha) ).
cnf(someone_in_mansion,axiom,
lives_at_dreadsbury(someone),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',someone_in_mansion) ).
cnf(noone_hates_everyone,axiom,
~ hates(X1,every_one_but(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',noone_hates_everyone) ).
cnf(butler_and_agatha_hate_the_same_people,axiom,
( ~ hates(aunt_agatha,X1)
| hates(butler,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',butler_and_agatha_hate_the_same_people) ).
cnf(killer_poorer_than_victim,axiom,
( ~ richer(X1,X2)
| ~ killed(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',killer_poorer_than_victim) ).
cnf(charles_and_agatha_hate_different_people,axiom,
( ~ hates(charles,X1)
| ~ hates(aunt_agatha,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',charles_and_agatha_hate_different_people) ).
cnf(butler_hates_poor_people,axiom,
( hates(butler,X1)
| richer(X1,aunt_agatha) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',butler_hates_poor_people) ).
cnf(agatha_is_not_the_butler,axiom,
aunt_agatha != butler,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agatha_is_not_the_butler) ).
cnf(agatha_likes_only_butler,axiom,
( hates(aunt_agatha,X1)
| X1 = butler ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',agatha_likes_only_butler) ).
cnf(prove_agatha_killed_herself,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_agatha_killed_herself) ).
cnf(c_0_12,plain,
( ~ killed(X1,X2)
| hates(X1,X2) ),
inference(fof_simplification,[status(thm)],[killer_hates_victim]) ).
cnf(c_0_13,plain,
( ~ lives_at_dreadsbury(X1)
| X1 = charles
| X1 = butler
| X1 = aunt_agatha ),
inference(fof_simplification,[status(thm)],[noone_else_lives_at_mansion]) ).
cnf(c_0_14,plain,
( ~ killed(X1,X2)
| hates(X1,X2) ),
c_0_12 ).
cnf(c_0_15,axiom,
killed(someone,aunt_agatha),
someone_killed_agatha ).
cnf(c_0_16,plain,
( ~ lives_at_dreadsbury(X1)
| X1 = charles
| X1 = butler
| X1 = aunt_agatha ),
c_0_13 ).
cnf(c_0_17,axiom,
lives_at_dreadsbury(someone),
someone_in_mansion ).
cnf(c_0_18,plain,
~ hates(X1,every_one_but(X1)),
inference(fof_simplification,[status(thm)],[noone_hates_everyone]) ).
cnf(c_0_19,plain,
( ~ hates(aunt_agatha,X1)
| hates(butler,X1) ),
inference(fof_simplification,[status(thm)],[butler_and_agatha_hate_the_same_people]) ).
cnf(c_0_20,plain,
( ~ richer(X1,X2)
| ~ killed(X1,X2) ),
inference(fof_simplification,[status(thm)],[killer_poorer_than_victim]) ).
cnf(c_0_21,plain,
( ~ hates(charles,X1)
| ~ hates(aunt_agatha,X1) ),
inference(fof_simplification,[status(thm)],[charles_and_agatha_hate_different_people]) ).
cnf(c_0_22,plain,
hates(someone,aunt_agatha),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( someone = charles
| someone = butler
| someone = aunt_agatha ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
~ hates(X1,every_one_but(X1)),
c_0_18 ).
cnf(c_0_25,plain,
( ~ hates(aunt_agatha,X1)
| hates(butler,X1) ),
c_0_19 ).
cnf(c_0_26,plain,
( ~ richer(X1,X2)
| ~ killed(X1,X2) ),
c_0_20 ).
cnf(c_0_27,axiom,
( hates(butler,X1)
| richer(X1,aunt_agatha) ),
butler_hates_poor_people ).
cnf(c_0_28,plain,
( ~ hates(charles,X1)
| ~ hates(aunt_agatha,X1) ),
c_0_21 ).
cnf(c_0_29,plain,
( hates(charles,aunt_agatha)
| someone = aunt_agatha
| someone = butler ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
aunt_agatha != butler,
inference(fof_simplification,[status(thm)],[agatha_is_not_the_butler]) ).
cnf(c_0_31,plain,
~ hates(aunt_agatha,every_one_but(butler)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,axiom,
( hates(aunt_agatha,X1)
| X1 = butler ),
agatha_likes_only_butler ).
cnf(c_0_33,plain,
( ~ killed(X1,aunt_agatha)
| hates(butler,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( ~ hates(aunt_agatha,aunt_agatha)
| someone = butler
| someone = aunt_agatha ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
aunt_agatha != butler,
c_0_30 ).
cnf(c_0_36,plain,
every_one_but(butler) = butler,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
hates(butler,someone),
inference(spm,[status(thm)],[c_0_33,c_0_15]) ).
cnf(c_0_38,plain,
( someone = aunt_agatha
| someone = butler ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_32]),c_0_35]) ).
cnf(c_0_39,plain,
~ hates(butler,butler),
inference(spm,[status(thm)],[c_0_24,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
inference(fof_simplification,[status(thm)],[prove_agatha_killed_herself]) ).
cnf(c_0_41,plain,
someone = aunt_agatha,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
~ killed(aunt_agatha,aunt_agatha),
c_0_40 ).
cnf(c_0_43,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_41]),c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ001-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 03:44:35 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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/benchmark/theBenchmark.p
% 0.09/0.43 % Version: 3.5.1
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.43 % Starting sh5l with 300s (1) cores
% 0.09/0.43 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2170669 completed with status 0
% 0.09/0.43 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSF-FFSS11-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.09/0.43 % Starting new_bool_3 with 136s (1) cores
% 0.09/0.43 % Starting new_bool_1 with 136s (1) cores
% 0.09/0.43 % SubtermCWHack with pid 2170673 completed with status 0
% 0.09/0.43 % Result found by SubtermCWHack
% 0.09/0.43 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.43 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.43 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.43 % No SInE strategy applied
% 0.09/0.43 % Search class: FGHSF-FFSS11-SFFFFFNN
% 0.09/0.43 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.43 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.43 % Preprocessing time : 0.001 s
% 0.09/0.43
% 0.09/0.43 % Proof found!
% 0.09/0.43 % SZS status Unsatisfiable
% 0.09/0.43 % SZS output start CNFRefutation
% See solution above
% 0.09/0.43 % Parsed axioms : 15
% 0.09/0.43 % Removed by relevancy pruning/SinE : 0
% 0.09/0.43 % Initial clauses : 15
% 0.09/0.43 % Removed in clause preprocessing : 0
% 0.09/0.43 % Initial clauses in saturation : 15
% 0.09/0.43 % Processed clauses : 40
% 0.09/0.43 % ...of these trivial : 0
% 0.09/0.43 % ...subsumed : 4
% 0.09/0.43 % ...remaining for further processing : 36
% 0.09/0.43 % Other redundant clauses eliminated : 0
% 0.09/0.43 % Clauses deleted for lack of memory : 0
% 0.09/0.43 % Backward-subsumed : 9
% 0.09/0.43 % Backward-rewritten : 6
% 0.09/0.43 % Generated clauses : 43
% 0.09/0.43 % ...of the previous two non-redundant : 40
% 0.09/0.43 % ...aggressively subsumed : 0
% 0.09/0.43 % Contextual simplify-reflections : 0
% 0.09/0.43 % Paramodulations : 38
% 0.09/0.43 % Factorizations : 5
% 0.09/0.43 % NegExts : 0
% 0.09/0.43 % Equation resolutions : 0
% 0.09/0.43 % Disequality decompositions : 0
% 0.09/0.43 % Total rewrite steps : 11
% 0.09/0.43 % ...of those cached : 6
% 0.09/0.43 % Propositional unsat checks : 0
% 0.09/0.43 % Propositional check models : 0
% 0.09/0.43 % Propositional check unsatisfiable : 0
% 0.09/0.43 % Propositional clauses : 0
% 0.09/0.43 % Propositional clauses after purity: 0
% 0.09/0.43 % Propositional unsat core size : 0
% 0.09/0.43 % Propositional preprocessing time : 0.000
% 0.09/0.43 % Propositional encoding time : 0.000
% 0.09/0.43 % Propositional solver time : 0.000
% 0.09/0.43 % Success case prop preproc time : 0.000
% 0.09/0.43 % Success case prop encoding time : 0.000
% 0.09/0.43 % Success case prop solver time : 0.000
% 0.09/0.43 % Current number of processed clauses : 21
% 0.09/0.43 % Positive orientable unit clauses : 6
% 0.09/0.43 % Positive unorientable unit clauses: 0
% 0.09/0.43 % Negative unit clauses : 7
% 0.09/0.43 % Non-unit-clauses : 8
% 0.09/0.43 % Current number of unprocessed clauses: 3
% 0.09/0.43 % ...number of literals in the above : 6
% 0.09/0.43 % Current number of archived formulas : 0
% 0.09/0.43 % Current number of archived clauses : 15
% 0.09/0.43 % Clause-clause subsumption calls (NU) : 21
% 0.09/0.43 % Rec. Clause-clause subsumption calls : 17
% 0.09/0.43 % Non-unit clause-clause subsumptions : 9
% 0.09/0.43 % Unit Clause-clause subsumption calls : 13
% 0.09/0.43 % Rewrite failures with RHS unbound : 0
% 0.09/0.43 % BW rewrite match attempts : 2
% 0.09/0.43 % BW rewrite match successes : 2
% 0.09/0.43 % Condensation attempts : 0
% 0.09/0.43 % Condensation successes : 0
% 0.09/0.43 % Termbank termtop insertions : 525
% 0.09/0.43 % Search garbage collected termcells : 20
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.004 s
% 0.09/0.43 % System time : 0.003 s
% 0.09/0.43 % Total time : 0.007 s
% 0.09/0.43 % Maximum resident set size: 3380 pages
% 0.09/0.43
% 0.09/0.43 % -------------------------------------------------
% 0.09/0.43 % User time : 0.015 s
% 0.09/0.43 % System time : 0.011 s
% 0.09/0.43 % Total time : 0.027 s
% 0.09/0.43 % Maximum resident set size: 4864 pages
% 0.09/0.43 % E exiting
%------------------------------------------------------------------------------