%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA001-1 : 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 : n007.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 30.75s 5.70s
% Output : CNFRefutation 30.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 9
% Syntax : Number of clauses : 32 ( 21 unt; 0 nHn; 32 RR)
% Number of literals : 46 ( 0 equ; 17 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 12 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 38 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(drive1,axiom,
( ~ next_to(X1,X5)
| ~ at(X1,X2,X3,X4)
| at(X5,X2,s(s(X3)),drive(X5,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive1) ).
cnf(initial,hypothesis,
at(cheyenne,none,start,initial_situation),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial) ).
cnf(map6,hypothesis,
next_to(cheyenne,northPlatte),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map6) ).
cnf(buy_in_city,axiom,
( ~ at(X1,X2,X3,X4)
| at(X1,s(X2),s(X3),buy(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',buy_in_city) ).
cnf(map7,hypothesis,
next_to(northPlatte,grandIsland),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map7) ).
cnf(map8,hypothesis,
next_to(grandIsland,lincoln),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map8) ).
cnf(map9,hypothesis,
next_to(lincoln,omaha),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map9) ).
cnf(prove_you_gat_get_there_with_bread,negated_conjecture,
~ at(desMoines,s(none),X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_you_gat_get_there_with_bread) ).
cnf(map10,hypothesis,
next_to(omaha,desMoines),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map10) ).
cnf(c_0_9,plain,
( ~ next_to(X1,X5)
| ~ at(X1,X2,X3,X4)
| at(X5,X2,s(s(X3)),drive(X5,X4)) ),
inference(fof_simplification,[status(thm)],[drive1]) ).
cnf(c_0_10,plain,
( ~ next_to(X1,X5)
| ~ at(X1,X2,X3,X4)
| at(X5,X2,s(s(X3)),drive(X5,X4)) ),
c_0_9 ).
cnf(c_0_11,hypothesis,
at(cheyenne,none,start,initial_situation),
initial ).
cnf(c_0_12,hypothesis,
( ~ next_to(cheyenne,X1)
| at(X1,none,s(s(start)),drive(X1,initial_situation)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,hypothesis,
next_to(cheyenne,northPlatte),
map6 ).
cnf(c_0_14,hypothesis,
at(northPlatte,none,s(s(start)),drive(northPlatte,initial_situation)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
( ~ at(X1,X2,X3,X4)
| at(X1,s(X2),s(X3),buy(X4)) ),
inference(fof_simplification,[status(thm)],[buy_in_city]) ).
cnf(c_0_16,hypothesis,
( ~ next_to(northPlatte,X1)
| at(X1,none,s(s(s(s(start)))),drive(X1,drive(northPlatte,initial_situation))) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_17,hypothesis,
next_to(northPlatte,grandIsland),
map7 ).
cnf(c_0_18,plain,
( ~ at(X1,X2,X3,X4)
| at(X1,s(X2),s(X3),buy(X4)) ),
c_0_15 ).
cnf(c_0_19,hypothesis,
at(grandIsland,none,s(s(s(s(start)))),drive(grandIsland,drive(northPlatte,initial_situation))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
at(grandIsland,s(none),s(s(s(s(s(start))))),buy(drive(grandIsland,drive(northPlatte,initial_situation)))),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,hypothesis,
( ~ next_to(grandIsland,X1)
| at(X1,s(none),s(s(s(s(s(s(s(start))))))),drive(X1,buy(drive(grandIsland,drive(northPlatte,initial_situation))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_22,hypothesis,
next_to(grandIsland,lincoln),
map8 ).
cnf(c_0_23,hypothesis,
at(lincoln,s(none),s(s(s(s(s(s(s(start))))))),drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation))))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,hypothesis,
( ~ next_to(lincoln,X1)
| at(X1,s(none),s(s(s(s(s(s(s(s(s(start))))))))),drive(X1,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation)))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_25,hypothesis,
next_to(lincoln,omaha),
map9 ).
cnf(c_0_26,hypothesis,
at(omaha,s(none),s(s(s(s(s(s(s(s(s(start))))))))),drive(omaha,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation)))))),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,negated_conjecture,
~ at(desMoines,s(none),X1,X2),
inference(fof_simplification,[status(thm)],[prove_you_gat_get_there_with_bread]) ).
cnf(c_0_28,hypothesis,
( ~ next_to(omaha,X1)
| at(X1,s(none),s(s(s(s(s(s(s(s(s(s(s(start))))))))))),drive(X1,drive(omaha,drive(lincoln,buy(drive(grandIsland,drive(northPlatte,initial_situation))))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_29,hypothesis,
next_to(omaha,desMoines),
map10 ).
cnf(c_0_30,negated_conjecture,
~ at(desMoines,s(none),X1,X2),
c_0_27 ).
cnf(c_0_31,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : PLA001-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n007.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 03:29:05 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.54 Running first-order theorem proving
% 0.23/0.54 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
% 30.75/5.70 % Version: 3.5.1
% 30.75/5.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 30.75/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.75/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 30.75/5.70 % Starting new_bool_3 with 300s (1) cores
% 30.75/5.70 % Starting new_bool_1 with 300s (1) cores
% 30.75/5.70 % Starting sh5l with 300s (1) cores
% 30.75/5.70 % new_bool_3 with pid 77969 completed with status 9
% 30.75/5.70 % new_bool_1 with pid 77970 completed with status 9
% 30.75/5.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 77965 completed with status 0
% 30.75/5.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 30.75/5.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 30.75/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.75/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 30.75/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 30.75/5.70 % No SInE strategy applied
% 30.75/5.70 % Search class: FHUNF-FFSM21-SFFFFFNN
% 30.75/5.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 30.75/5.70 % Starting SubtermCWHack with 136s (1) cores
% 30.75/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 30.75/5.70 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 30.75/5.70 % Starting new_bool_3 with 136s (1) cores
% 30.75/5.70 % Starting new_bool_1 with 136s (1) cores
% 30.75/5.70 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 77967 completed with status 0
% 30.75/5.70 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 30.75/5.70 % Preprocessing class: FSMSSMSMSSSNFFN.
% 30.75/5.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.75/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 30.75/5.70 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 30.75/5.70 % No SInE strategy applied
% 30.75/5.70 % Search class: FHUNF-FFSM21-SFFFFFNN
% 30.75/5.70 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 30.75/5.70 % Starting SubtermCWHack with 136s (1) cores
% 30.75/5.70 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 30.75/5.70 % Preprocessing time : 0.002 s
% 30.75/5.70 % Presaturation interreduction done
% 30.75/5.70
% 30.75/5.70 % Proof found!
% 30.75/5.70 % SZS status Unsatisfiable
% 30.75/5.70 % SZS output start CNFRefutation
% See solution above
% 30.75/5.70 % Parsed axioms : 16
% 30.75/5.70 % Removed by relevancy pruning/SinE : 0
% 30.75/5.70 % Initial clauses : 16
% 30.75/5.70 % Removed in clause preprocessing : 0
% 30.75/5.70 % Initial clauses in saturation : 16
% 30.75/5.70 % Processed clauses : 9877
% 30.75/5.70 % ...of these trivial : 0
% 30.75/5.70 % ...subsumed : 0
% 30.75/5.70 % ...remaining for further processing : 9877
% 30.75/5.70 % Other redundant clauses eliminated : 0
% 30.75/5.70 % Clauses deleted for lack of memory : 0
% 30.75/5.70 % Backward-subsumed : 0
% 30.75/5.70 % Backward-rewritten : 0
% 30.75/5.70 % Generated clauses : 19692
% 30.75/5.70 % ...of the previous two non-redundant : 19691
% 30.75/5.70 % ...aggressively subsumed : 0
% 30.75/5.70 % Contextual simplify-reflections : 0
% 30.75/5.70 % Paramodulations : 19692
% 30.75/5.70 % Factorizations : 0
% 30.75/5.70 % NegExts : 0
% 30.75/5.70 % Equation resolutions : 0
% 30.75/5.70 % Disequality decompositions : 0
% 30.75/5.70 % Total rewrite steps : 0
% 30.75/5.70 % ...of those cached : 0
% 30.75/5.70 % Propositional unsat checks : 0
% 30.75/5.70 % Propositional check models : 0
% 30.75/5.70 % Propositional check unsatisfiable : 0
% 30.75/5.70 % Propositional clauses : 0
% 30.75/5.70 % Propositional clauses after purity: 0
% 30.75/5.70 % Propositional unsat core size : 0
% 30.75/5.70 % Propositional preprocessing time : 0.000
% 30.75/5.70 % Propositional encoding time : 0.000
% 30.75/5.70 % Propositional solver time : 0.000
% 30.75/5.70 % Success case prop preproc time : 0.000
% 30.75/5.70 % Success case prop encoding time : 0.000
% 30.75/5.70 % Success case prop solver time : 0.000
% 30.75/5.70 % Current number of processed clauses : 9861
% 30.75/5.70 % Positive orientable unit clauses : 3292
% 30.75/5.70 % Positive unorientable unit clauses: 0
% 30.75/5.70 % Negative unit clauses : 1
% 30.75/5.70 % Non-unit-clauses : 6568
% 30.75/5.70 % Current number of unprocessed clauses: 9846
% 30.75/5.70 % ...number of literals in the above : 9846
% 30.75/5.70 % Current number of archived formulas : 0
% 30.75/5.70 % Current number of archived clauses : 16
% 30.75/5.70 % Clause-clause subsumption calls (NU) : 6616514
% 30.75/5.70 % Rec. Clause-clause subsumption calls : 6299902
% 30.75/5.70 % Non-unit clause-clause subsumptions : 0
% 30.75/5.70 % Unit Clause-clause subsumption calls : 187253
% 30.75/5.70 % Rewrite failures with RHS unbound : 0
% 30.75/5.70 % BW rewrite match attempts : 487952
% 30.75/5.70 % BW rewrite match successes : 0
% 30.75/5.70 % Condensation attempts : 0
% 30.75/5.70 % Condensation successes : 0
% 30.75/5.70 % Termbank termtop insertions : 758361
% 30.75/5.70 % Search garbage collected termcells : 13
% 30.75/5.70
% 30.75/5.70 % -------------------------------------------------
% 30.75/5.70 % User time : 4.947 s
% 30.75/5.70 % System time : 0.093 s
% 30.75/5.70 % Total time : 5.039 s
% 30.75/5.70 % Maximum resident set size: 3388 pages
% 30.75/5.70
% 30.75/5.70 % -------------------------------------------------
% 30.75/5.70 % User time : 24.703 s
% 30.75/5.70 % System time : 0.673 s
% 30.75/5.70 % Total time : 25.376 s
% 30.75/5.70 % Maximum resident set size: 4608 pages
% 30.75/5.70 % E exiting
%------------------------------------------------------------------------------