%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA002-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 : n017.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 01:58:47 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.59s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 13
% Syntax : Number of clauses : 63 ( 13 unt; 8 nHn; 51 RR)
% Number of literals : 153 ( 0 equ; 89 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 57 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(go_f_to_d,hypothesis,
( ~ situation(X1)
| ~ at(f,X1)
| at(d,go(d,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_f_to_d) ).
cnf(climb_mountain_d_to_b,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| ~ warm(X1)
| at(b,climb(b,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_mountain_d_to_b) ).
cnf(initial,hypothesis,
at(f,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).
cnf(initial_situation,hypothesis,
situation(s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).
cnf(warm_or_cold,hypothesis,
( ~ situation(X2)
| ~ situation(X1)
| cold(X2)
| warm(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',warm_or_cold) ).
cnf(go_situation,hypothesis,
( ~ situation(X1)
| situation(go(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_situation) ).
cnf(walk_b_to_a,hypothesis,
( ~ situation(X1)
| ~ at(b,X1)
| at(a,walk(a,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_b_to_a) ).
cnf(climb_situation,hypothesis,
( ~ situation(X1)
| situation(climb(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_situation) ).
cnf(prove_you_can_get_to_a_in_a_situation,negated_conjecture,
( ~ situation(X1)
| ~ at(a,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_can_get_to_a_in_a_situation) ).
cnf(go_d_to_c,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| at(c,go(c,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_d_to_c) ).
cnf(walk_situation,hypothesis,
( ~ situation(X1)
| situation(walk(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk_situation) ).
cnf(cross_river_c_to_b,hypothesis,
( ~ situation(X1)
| ~ at(c,X1)
| ~ cold(X1)
| at(b,skate(b,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cross_river_c_to_b) ).
cnf(skate_situation,hypothesis,
( ~ situation(X1)
| situation(skate(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',skate_situation) ).
cnf(c_0_13,hypothesis,
( ~ situation(X1)
| ~ at(f,X1)
| at(d,go(d,X1)) ),
inference(fof_simplification,[status(thm)],[go_f_to_d]) ).
cnf(c_0_14,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| ~ warm(X1)
| at(b,climb(b,X1)) ),
inference(fof_simplification,[status(thm)],[climb_mountain_d_to_b]) ).
cnf(c_0_15,hypothesis,
( ~ situation(X1)
| ~ at(f,X1)
| at(d,go(d,X1)) ),
c_0_13 ).
cnf(c_0_16,hypothesis,
at(f,s0),
initial ).
cnf(c_0_17,hypothesis,
situation(s0),
initial_situation ).
cnf(c_0_18,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| ~ warm(X1)
| at(b,climb(b,X1)) ),
c_0_14 ).
cnf(c_0_19,hypothesis,
at(d,go(d,s0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,hypothesis,
( ~ situation(X2)
| ~ situation(X1)
| cold(X2)
| warm(X1) ),
inference(fof_simplification,[status(thm)],[warm_or_cold]) ).
cnf(c_0_21,hypothesis,
( ~ warm(go(d,s0))
| ~ situation(go(d,s0))
| at(b,climb(b,go(d,s0))) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
( ~ situation(X2)
| ~ situation(X1)
| cold(X2)
| warm(X1) ),
c_0_20 ).
cnf(c_0_23,hypothesis,
( ~ situation(X1)
| situation(go(X2,X1)) ),
inference(fof_simplification,[status(thm)],[go_situation]) ).
cnf(c_0_24,hypothesis,
( ~ situation(X1)
| ~ at(b,X1)
| at(a,walk(a,X1)) ),
inference(fof_simplification,[status(thm)],[walk_b_to_a]) ).
cnf(c_0_25,hypothesis,
( ~ situation(X1)
| ~ situation(go(d,s0))
| cold(X1)
| at(b,climb(b,go(d,s0))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,hypothesis,
( ~ situation(X1)
| situation(go(X2,X1)) ),
c_0_23 ).
cnf(c_0_27,hypothesis,
( ~ situation(X1)
| ~ at(b,X1)
| at(a,walk(a,X1)) ),
c_0_24 ).
cnf(c_0_28,hypothesis,
( ~ situation(X1)
| cold(X1)
| at(b,climb(b,go(d,s0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_17])]) ).
cnf(c_0_29,hypothesis,
( ~ situation(X1)
| situation(climb(X2,X1)) ),
inference(fof_simplification,[status(thm)],[climb_situation]) ).
cnf(c_0_30,hypothesis,
( ~ situation(X1)
| ~ situation(climb(b,go(d,s0)))
| cold(X1)
| at(a,walk(a,climb(b,go(d,s0)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,hypothesis,
( ~ situation(X1)
| situation(climb(X2,X1)) ),
c_0_29 ).
cnf(c_0_32,negated_conjecture,
( ~ situation(X1)
| ~ at(a,X1) ),
inference(fof_simplification,[status(thm)],[prove_you_can_get_to_a_in_a_situation]) ).
cnf(c_0_33,hypothesis,
( ~ situation(X1)
| ~ situation(go(d,s0))
| cold(X1)
| at(a,walk(a,climb(b,go(d,s0)))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| at(c,go(c,X1)) ),
inference(fof_simplification,[status(thm)],[go_d_to_c]) ).
cnf(c_0_35,negated_conjecture,
( ~ situation(X1)
| ~ at(a,X1) ),
c_0_32 ).
cnf(c_0_36,hypothesis,
( ~ situation(X1)
| cold(X1)
| at(a,walk(a,climb(b,go(d,s0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_26]),c_0_17])]) ).
cnf(c_0_37,hypothesis,
( ~ situation(X1)
| situation(walk(X2,X1)) ),
inference(fof_simplification,[status(thm)],[walk_situation]) ).
cnf(c_0_38,hypothesis,
( ~ situation(X1)
| ~ at(d,X1)
| at(c,go(c,X1)) ),
c_0_34 ).
cnf(c_0_39,negated_conjecture,
( ~ situation(X1)
| ~ situation(walk(a,climb(b,go(d,s0))))
| cold(X1) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,hypothesis,
( ~ situation(X1)
| situation(walk(X2,X1)) ),
c_0_37 ).
cnf(c_0_41,hypothesis,
( ~ situation(X1)
| ~ at(c,X1)
| ~ cold(X1)
| at(b,skate(b,X1)) ),
inference(fof_simplification,[status(thm)],[cross_river_c_to_b]) ).
cnf(c_0_42,hypothesis,
( ~ situation(go(d,s0))
| at(c,go(c,go(d,s0))) ),
inference(spm,[status(thm)],[c_0_38,c_0_19]) ).
cnf(c_0_43,hypothesis,
( ~ situation(X1)
| ~ situation(climb(b,go(d,s0)))
| cold(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,hypothesis,
( ~ situation(X1)
| ~ at(c,X1)
| ~ cold(X1)
| at(b,skate(b,X1)) ),
c_0_41 ).
cnf(c_0_45,hypothesis,
at(c,go(c,go(d,s0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_26]),c_0_17])]) ).
cnf(c_0_46,hypothesis,
( ~ situation(X1)
| ~ situation(go(d,s0))
| cold(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
cnf(c_0_47,hypothesis,
( ~ cold(go(c,go(d,s0)))
| ~ situation(go(c,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,hypothesis,
( ~ situation(X1)
| cold(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_26]),c_0_17])]) ).
cnf(c_0_49,hypothesis,
( ~ situation(go(c,go(d,s0)))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_50,hypothesis,
( ~ situation(go(d,s0))
| at(b,skate(b,go(c,go(d,s0)))) ),
inference(spm,[status(thm)],[c_0_49,c_0_26]) ).
cnf(c_0_51,hypothesis,
at(b,skate(b,go(c,go(d,s0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_26]),c_0_17])]) ).
cnf(c_0_52,hypothesis,
( ~ situation(X1)
| situation(skate(X2,X1)) ),
inference(fof_simplification,[status(thm)],[skate_situation]) ).
cnf(c_0_53,hypothesis,
( ~ situation(skate(b,go(c,go(d,s0))))
| at(a,walk(a,skate(b,go(c,go(d,s0))))) ),
inference(spm,[status(thm)],[c_0_27,c_0_51]) ).
cnf(c_0_54,hypothesis,
( ~ situation(X1)
| situation(skate(X2,X1)) ),
c_0_52 ).
cnf(c_0_55,hypothesis,
( ~ situation(go(c,go(d,s0)))
| at(a,walk(a,skate(b,go(c,go(d,s0))))) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_56,hypothesis,
( ~ situation(go(d,s0))
| at(a,walk(a,skate(b,go(c,go(d,s0))))) ),
inference(spm,[status(thm)],[c_0_55,c_0_26]) ).
cnf(c_0_57,hypothesis,
at(a,walk(a,skate(b,go(c,go(d,s0))))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_26]),c_0_17])]) ).
cnf(c_0_58,negated_conjecture,
~ situation(walk(a,skate(b,go(c,go(d,s0))))),
inference(spm,[status(thm)],[c_0_35,c_0_57]) ).
cnf(c_0_59,hypothesis,
~ situation(skate(b,go(c,go(d,s0)))),
inference(spm,[status(thm)],[c_0_58,c_0_40]) ).
cnf(c_0_60,hypothesis,
~ situation(go(c,go(d,s0))),
inference(spm,[status(thm)],[c_0_59,c_0_54]) ).
cnf(c_0_61,hypothesis,
~ situation(go(d,s0)),
inference(spm,[status(thm)],[c_0_60,c_0_26]) ).
cnf(c_0_62,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_26]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA002-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.12/0.51 % Computer : n017.cluster.edu
% 0.12/0.51 % Model : x86_64 x86_64
% 0.12/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.51 % Memory : 8046.5625MB
% 0.12/0.51 % OS : Linux 6.8.0-71-generic
% 0.12/0.51 % CPULimit : 300
% 0.12/0.51 % WCLimit : 300
% 0.12/0.51 % DateTime : Mon Sep 21 03:26:57 UTC 2026
% 0.12/0.52 % CPUTime :
% 0.12/0.52 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.56 Running first-order theorem proving
% 0.17/0.56 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.17/0.59 % Version: 3.5.1
% 0.17/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.59 % Starting new_bool_3 with 300s (1) cores
% 0.17/0.59 % Starting new_bool_1 with 300s (1) cores
% 0.17/0.59 % Starting sh5l with 300s (1) cores
% 0.17/0.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1333103 completed with status 0
% 0.17/0.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.59 % No SInE strategy applied
% 0.17/0.59 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.17/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.59 % Starting new_bool_1 with 136s (1) cores
% 0.17/0.59 % new_bool_3 with pid 1333113 completed with status 0
% 0.17/0.59 % Result found by new_bool_3
% 0.17/0.59 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.17/0.59 % No SInE strategy applied
% 0.17/0.59 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.17/0.59 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.59 % Starting SubtermCWHack with 136s (1) cores
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.17/0.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.17/0.59 % Starting new_bool_3 with 136s (1) cores
% 0.17/0.59 % Preprocessing time : 0.001 s
% 0.17/0.59 % Presaturation interreduction done
% 0.17/0.59
% 0.17/0.59 % Proof found!
% 0.17/0.59 % SZS status Unsatisfiable
% 0.17/0.59 % SZS output start CNFRefutation
% See solution above
% 0.17/0.59 % Parsed axioms : 23
% 0.17/0.59 % Removed by relevancy pruning/SinE : 0
% 0.17/0.59 % Initial clauses : 23
% 0.17/0.59 % Removed in clause preprocessing : 0
% 0.17/0.59 % Initial clauses in saturation : 23
% 0.17/0.59 % Processed clauses : 85
% 0.17/0.59 % ...of these trivial : 0
% 0.17/0.59 % ...subsumed : 3
% 0.17/0.59 % ...remaining for further processing : 82
% 0.17/0.59 % Other redundant clauses eliminated : 0
% 0.17/0.59 % Clauses deleted for lack of memory : 0
% 0.17/0.59 % Backward-subsumed : 13
% 0.17/0.59 % Backward-rewritten : 13
% 0.17/0.59 % Generated clauses : 56
% 0.17/0.59 % ...of the previous two non-redundant : 55
% 0.17/0.59 % ...aggressively subsumed : 0
% 0.17/0.59 % Contextual simplify-reflections : 0
% 0.17/0.59 % Paramodulations : 56
% 0.17/0.59 % Factorizations : 0
% 0.17/0.59 % NegExts : 0
% 0.17/0.59 % Equation resolutions : 0
% 0.17/0.59 % Disequality decompositions : 0
% 0.17/0.59 % Total rewrite steps : 26
% 0.17/0.59 % ...of those cached : 18
% 0.17/0.59 % Propositional unsat checks : 0
% 0.17/0.59 % Propositional check models : 0
% 0.17/0.59 % Propositional check unsatisfiable : 0
% 0.17/0.59 % Propositional clauses : 0
% 0.17/0.59 % Propositional clauses after purity: 0
% 0.17/0.59 % Propositional unsat core size : 0
% 0.17/0.59 % Propositional preprocessing time : 0.000
% 0.17/0.59 % Propositional encoding time : 0.000
% 0.17/0.59 % Propositional solver time : 0.000
% 0.17/0.59 % Success case prop preproc time : 0.000
% 0.17/0.59 % Success case prop encoding time : 0.000
% 0.17/0.59 % Success case prop solver time : 0.000
% 0.17/0.59 % Current number of processed clauses : 35
% 0.17/0.59 % Positive orientable unit clauses : 10
% 0.17/0.59 % Positive unorientable unit clauses: 0
% 0.17/0.59 % Negative unit clauses : 4
% 0.17/0.59 % Non-unit-clauses : 21
% 0.17/0.59 % Current number of unprocessed clauses: 13
% 0.17/0.59 % ...number of literals in the above : 39
% 0.17/0.59 % Current number of archived formulas : 0
% 0.17/0.59 % Current number of archived clauses : 47
% 0.17/0.59 % Clause-clause subsumption calls (NU) : 254
% 0.17/0.59 % Rec. Clause-clause subsumption calls : 166
% 0.17/0.59 % Non-unit clause-clause subsumptions : 14
% 0.17/0.59 % Unit Clause-clause subsumption calls : 34
% 0.17/0.59 % Rewrite failures with RHS unbound : 0
% 0.17/0.59 % BW rewrite match attempts : 8
% 0.17/0.59 % BW rewrite match successes : 7
% 0.17/0.59 % Condensation attempts : 0
% 0.17/0.59 % Condensation successes : 0
% 0.17/0.59 % Termbank termtop insertions : 2392
% 0.17/0.59 % Search garbage collected termcells : 59
% 0.17/0.59
% 0.17/0.59 % -------------------------------------------------
% 0.17/0.59 % User time : 0.008 s
% 0.17/0.59 % System time : 0.003 s
% 0.17/0.59 % Total time : 0.011 s
% 0.17/0.59 % Maximum resident set size: 3648 pages
% 0.17/0.59
% 0.17/0.59 % -------------------------------------------------
% 0.17/0.59 % User time : 0.047 s
% 0.17/0.59 % System time : 0.019 s
% 0.17/0.59 % Total time : 0.066 s
% 0.17/0.59 % Maximum resident set size: 4864 pages
% 0.17/0.59 % E exiting
%------------------------------------------------------------------------------