%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA031-1.002 : TPTP v9.3.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:54 PM UTC 2026
% Result : Unsatisfiable 4.71s 1.45s
% Output : CNFRefutation 4.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 18
% Syntax : Number of clauses : 65 ( 30 unt; 0 nHn; 65 RR)
% Number of literals : 109 ( 0 equ; 47 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-7 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 200 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( ~ path(X4,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| s(X1,X2,X3,X8,X5,X6,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',walk1) ).
cnf(init,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(map7,axiom,
path(s1,p2_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map7) ).
cnf(board1,axiom,
( ~ neq(X5,truck1)
| ~ s(X1,X2,X3,X4,X5,X4,X6)
| s(X1,X2,X3,truck1,X5,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board1) ).
cnf(map6,axiom,
path(p2_1,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map6) ).
cnf(drive1,axiom,
( ~ link(X5,X7)
| ~ s(X1,X2,X3,truck1,X4,X5,X6)
| s(X1,X2,X3,truck1,X4,X7,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive1) ).
cnf(neq22,axiom,
neq(s1,truck1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq22) ).
cnf(load9,axiom,
( ~ s(X1,X2,X3,X4,X5,X3,X6)
| s(X1,X2,truck1,X4,X5,X3,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load9) ).
cnf(map12,axiom,
link(s2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map12) ).
cnf(load5,axiom,
( ~ s(X1,X2,X3,X4,X5,X2,X6)
| s(X1,truck1,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load5) ).
cnf(load1,axiom,
( ~ s(X1,X2,X3,X4,X5,X1,X6)
| s(truck1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load1) ).
cnf(load6,axiom,
( ~ s(X1,truck1,X3,X4,X5,X2,X6)
| s(X1,X2,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load6) ).
cnf(map10,axiom,
link(s1,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map10) ).
cnf(load2,axiom,
( ~ s(truck1,X2,X3,X4,X5,X1,X6)
| s(X1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load2) ).
cnf(load10,axiom,
( ~ s(X1,X2,truck1,X4,X5,X3,X6)
| s(X1,X2,X3,X4,X5,X3,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load10) ).
cnf(map14,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map14) ).
cnf(board2,axiom,
( ~ s(X1,X2,X3,truck1,X5,X4,X6)
| s(X1,X2,X3,X4,X5,X4,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board2) ).
cnf(goal,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_18,plain,
( ~ path(X4,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| s(X1,X2,X3,X8,X5,X6,X7) ),
inference(fof_simplification,[status(thm)],[walk1]) ).
cnf(c_0_19,plain,
( ~ path(X4,X8)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| s(X1,X2,X3,X8,X5,X6,X7) ),
c_0_18 ).
cnf(c_0_20,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
init ).
cnf(c_0_21,plain,
( ~ path(s1,X1)
| s(s1,s1,s1,X1,s1,s2,s0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,axiom,
path(s1,p2_1),
map7 ).
cnf(c_0_23,plain,
s(s1,s1,s1,p2_1,s1,s2,s0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
( ~ neq(X5,truck1)
| ~ s(X1,X2,X3,X4,X5,X4,X6)
| s(X1,X2,X3,truck1,X5,X4,X6) ),
inference(fof_simplification,[status(thm)],[board1]) ).
cnf(c_0_25,plain,
( ~ path(p2_1,X1)
| s(s1,s1,s1,X1,s1,s2,s0) ),
inference(spm,[status(thm)],[c_0_19,c_0_23]) ).
cnf(c_0_26,axiom,
path(p2_1,s2),
map6 ).
cnf(c_0_27,plain,
( ~ link(X5,X7)
| ~ s(X1,X2,X3,truck1,X4,X5,X6)
| s(X1,X2,X3,truck1,X4,X7,X6) ),
inference(fof_simplification,[status(thm)],[drive1]) ).
cnf(c_0_28,plain,
( ~ neq(X5,truck1)
| ~ s(X1,X2,X3,X4,X5,X4,X6)
| s(X1,X2,X3,truck1,X5,X4,X6) ),
c_0_24 ).
cnf(c_0_29,plain,
s(s1,s1,s1,s2,s1,s2,s0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,axiom,
neq(s1,truck1),
neq22 ).
cnf(c_0_31,plain,
( ~ link(X5,X7)
| ~ s(X1,X2,X3,truck1,X4,X5,X6)
| s(X1,X2,X3,truck1,X4,X7,X6) ),
c_0_27 ).
cnf(c_0_32,plain,
s(s1,s1,s1,truck1,s1,s2,s0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_33,plain,
( ~ s(X1,X2,X3,X4,X5,X3,X6)
| s(X1,X2,truck1,X4,X5,X3,X6) ),
inference(fof_simplification,[status(thm)],[load9]) ).
cnf(c_0_34,plain,
( ~ link(s2,X1)
| s(s1,s1,s1,truck1,s1,X1,s0) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,axiom,
link(s2,s1),
map12 ).
cnf(c_0_36,plain,
( ~ s(X1,X2,X3,X4,X5,X2,X6)
| s(X1,truck1,X3,X4,X5,X2,X6) ),
inference(fof_simplification,[status(thm)],[load5]) ).
cnf(c_0_37,plain,
( ~ s(X1,X2,X3,X4,X5,X3,X6)
| s(X1,X2,truck1,X4,X5,X3,X6) ),
c_0_33 ).
cnf(c_0_38,plain,
s(s1,s1,s1,truck1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( ~ s(X1,X2,X3,X4,X5,X1,X6)
| s(truck1,X2,X3,X4,X5,X1,X6) ),
inference(fof_simplification,[status(thm)],[load1]) ).
cnf(c_0_40,plain,
( ~ s(X1,X2,X3,X4,X5,X2,X6)
| s(X1,truck1,X3,X4,X5,X2,X6) ),
c_0_36 ).
cnf(c_0_41,plain,
s(s1,s1,truck1,truck1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( ~ s(X1,X2,X3,X4,X5,X1,X6)
| s(truck1,X2,X3,X4,X5,X1,X6) ),
c_0_39 ).
cnf(c_0_43,plain,
s(s1,truck1,truck1,truck1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
s(truck1,truck1,truck1,truck1,s1,s1,s0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( ~ s(X1,truck1,X3,X4,X5,X2,X6)
| s(X1,X2,X3,X4,X5,X2,X6) ),
inference(fof_simplification,[status(thm)],[load6]) ).
cnf(c_0_46,plain,
( ~ link(s1,X1)
| s(truck1,truck1,truck1,truck1,s1,X1,s0) ),
inference(spm,[status(thm)],[c_0_31,c_0_44]) ).
cnf(c_0_47,axiom,
link(s1,s0),
map10 ).
cnf(c_0_48,plain,
( ~ s(truck1,X2,X3,X4,X5,X1,X6)
| s(X1,X2,X3,X4,X5,X1,X6) ),
inference(fof_simplification,[status(thm)],[load2]) ).
cnf(c_0_49,plain,
( ~ s(X1,truck1,X3,X4,X5,X2,X6)
| s(X1,X2,X3,X4,X5,X2,X6) ),
c_0_45 ).
cnf(c_0_50,plain,
s(truck1,truck1,truck1,truck1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ s(truck1,X2,X3,X4,X5,X1,X6)
| s(X1,X2,X3,X4,X5,X1,X6) ),
c_0_48 ).
cnf(c_0_52,plain,
s(truck1,s0,truck1,truck1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
s(s0,s0,truck1,truck1,s1,s0,s0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
( ~ s(X1,X2,truck1,X4,X5,X3,X6)
| s(X1,X2,X3,X4,X5,X3,X6) ),
inference(fof_simplification,[status(thm)],[load10]) ).
cnf(c_0_55,plain,
( ~ link(s0,X1)
| s(s0,s0,truck1,truck1,s1,X1,s0) ),
inference(spm,[status(thm)],[c_0_31,c_0_53]) ).
cnf(c_0_56,axiom,
link(s0,s2),
map14 ).
cnf(c_0_57,plain,
( ~ s(X1,X2,X3,truck1,X5,X4,X6)
| s(X1,X2,X3,X4,X5,X4,X6) ),
inference(fof_simplification,[status(thm)],[board2]) ).
cnf(c_0_58,plain,
( ~ s(X1,X2,truck1,X4,X5,X3,X6)
| s(X1,X2,X3,X4,X5,X3,X6) ),
c_0_54 ).
cnf(c_0_59,plain,
s(s0,s0,truck1,truck1,s1,s2,s0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_60,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_61,plain,
( ~ s(X1,X2,X3,truck1,X5,X4,X6)
| s(X1,X2,X3,X4,X5,X4,X6) ),
c_0_57 ).
cnf(c_0_62,plain,
s(s0,s0,s2,truck1,s1,s2,s0),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
c_0_60 ).
cnf(c_0_64,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : PLA031-1.002 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.59 % Computer : n016.cluster.edu
% 0.18/0.59 % Model : x86_64 x86_64
% 0.18/0.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.59 % Memory : 8046.5625MB
% 0.18/0.59 % OS : Linux 6.8.0-71-generic
% 0.18/0.59 % CPULimit : 300
% 0.18/0.59 % WCLimit : 300
% 0.18/0.59 % DateTime : Mon Sep 21 03:38:08 UTC 2026
% 0.18/0.59 % CPUTime :
% 0.18/0.59 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.22/0.65 Running first-order theorem proving
% 0.22/0.66 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
% 4.71/1.45 % Version: 3.5.1
% 4.71/1.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 4.71/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.71/1.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.71/1.45 % Starting new_bool_3 with 300s (1) cores
% 4.71/1.45 % Starting new_bool_1 with 300s (1) cores
% 4.71/1.45 % Starting sh5l with 300s (1) cores
% 4.71/1.45 % new_bool_3 with pid 1468830 completed with status 9
% 4.71/1.45 % new_bool_1 with pid 1468831 completed with status 9
% 4.71/1.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1468829 completed with status 0
% 4.71/1.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 4.71/1.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 4.71/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.71/1.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.71/1.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.71/1.45 % No SInE strategy applied
% 4.71/1.45 % Search class: FHUNF-FFMM00-SFFFFFNN
% 4.71/1.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.71/1.45 % Starting SubtermCWHack with 136s (1) cores
% 4.71/1.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 4.71/1.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.71/1.45 % Starting new_bool_3 with 136s (1) cores
% 4.71/1.45 % Starting new_bool_1 with 136s (1) cores
% 4.71/1.45 % SubtermCWHack with pid 1468833 completed with status 0
% 4.71/1.45 % Result found by SubtermCWHack
% 4.71/1.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 4.71/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.71/1.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 4.71/1.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.71/1.45 % No SInE strategy applied
% 4.71/1.45 % Search class: FHUNF-FFMM00-SFFFFFNN
% 4.71/1.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.71/1.45 % Starting SubtermCWHack with 136s (1) cores
% 4.71/1.45 % Preprocessing time : 0.002 s
% 4.71/1.45
% 4.71/1.45 % Proof found!
% 4.71/1.45 % SZS status Unsatisfiable
% 4.71/1.45 % SZS output start CNFRefutation
% See solution above
% 4.71/1.45 % Parsed axioms : 91
% 4.71/1.45 % Removed by relevancy pruning/SinE : 0
% 4.71/1.45 % Initial clauses : 91
% 4.71/1.45 % Removed in clause preprocessing : 0
% 4.71/1.45 % Initial clauses in saturation : 91
% 4.71/1.45 % Processed clauses : 8166
% 4.71/1.45 % ...of these trivial : 3530
% 4.71/1.45 % ...subsumed : 48
% 4.71/1.45 % ...remaining for further processing : 4588
% 4.71/1.45 % Other redundant clauses eliminated : 0
% 4.71/1.45 % Clauses deleted for lack of memory : 0
% 4.71/1.45 % Backward-subsumed : 0
% 4.71/1.45 % Backward-rewritten : 0
% 4.71/1.45 % Generated clauses : 24193
% 4.71/1.45 % ...of the previous two non-redundant : 16431
% 4.71/1.45 % ...aggressively subsumed : 0
% 4.71/1.45 % Contextual simplify-reflections : 0
% 4.71/1.45 % Paramodulations : 24193
% 4.71/1.45 % Factorizations : 0
% 4.71/1.45 % NegExts : 0
% 4.71/1.45 % Equation resolutions : 0
% 4.71/1.45 % Disequality decompositions : 0
% 4.71/1.45 % Total rewrite steps : 13366
% 4.71/1.45 % ...of those cached : 9878
% 4.71/1.45 % Propositional unsat checks : 0
% 4.71/1.45 % Propositional check models : 0
% 4.71/1.45 % Propositional check unsatisfiable : 0
% 4.71/1.45 % Propositional clauses : 0
% 4.71/1.45 % Propositional clauses after purity: 0
% 4.71/1.45 % Propositional unsat core size : 0
% 4.71/1.45 % Propositional preprocessing time : 0.000
% 4.71/1.45 % Propositional encoding time : 0.000
% 4.71/1.45 % Propositional solver time : 0.000
% 4.71/1.45 % Success case prop preproc time : 0.000
% 4.71/1.45 % Success case prop encoding time : 0.000
% 4.71/1.45 % Success case prop solver time : 0.000
% 4.71/1.45 % Current number of processed clauses : 4588
% 4.71/1.45 % Positive orientable unit clauses : 3557
% 4.71/1.45 % Positive unorientable unit clauses: 0
% 4.71/1.45 % Negative unit clauses : 8
% 4.71/1.45 % Non-unit-clauses : 1023
% 4.71/1.45 % Current number of unprocessed clauses: 8356
% 4.71/1.45 % ...number of literals in the above : 16709
% 4.71/1.45 % Current number of archived formulas : 0
% 4.71/1.45 % Current number of archived clauses : 0
% 4.71/1.45 % Clause-clause subsumption calls (NU) : 48299
% 4.71/1.45 % Rec. Clause-clause subsumption calls : 48299
% 4.71/1.45 % Non-unit clause-clause subsumptions : 0
% 4.71/1.45 % Unit Clause-clause subsumption calls : 271185
% 4.71/1.45 % Rewrite failures with RHS unbound : 0
% 4.71/1.45 % BW rewrite match attempts : 358963
% 4.71/1.45 % BW rewrite match successes : 0
% 4.71/1.45 % Condensation attempts : 0
% 4.71/1.45 % Condensation successes : 0
% 4.71/1.45 % Termbank termtop insertions : 308357
% 4.71/1.45 % Search garbage collected termcells : 96
% 4.71/1.45
% 4.71/1.45 % -------------------------------------------------
% 4.71/1.45 % User time : 0.708 s
% 4.71/1.45 % System time : 0.048 s
% 4.71/1.45 % Total time : 0.756 s
% 4.71/1.45 % Maximum resident set size: 3628 pages
% 4.71/1.45
% 4.71/1.45 % -------------------------------------------------
% 4.71/1.45 % User time : 3.710 s
% 4.71/1.45 % System time : 0.231 s
% 4.71/1.45 % Total time : 3.941 s
% 4.71/1.45 % Maximum resident set size: 4864 pages
% 4.71/1.45 % E exiting
%------------------------------------------------------------------------------