%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : PLA031-1.004 : 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 58.23s 8.91s
% Output : CNFRefutation 58.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 17
% Syntax : Number of clauses : 61 ( 25 unt; 0 nHn; 61 RR)
% Number of literals : 115 ( 0 equ; 57 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-9 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 279 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(load3,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X1)
| s(truck2,X2,X3,X4,X5,X6,X7,X8,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load3) ).
cnf(board3,axiom,
( ~ neq(X7,truck2)
| ~ neq(X6,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X5)
| s(X1,X2,X3,X4,truck2,X6,X7,X8,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board3) ).
cnf(init,axiom,
s(s1,s0,s2,s0,s1,s2,s2,s0,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',init) ).
cnf(drive2,axiom,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,truck2,X5,X6,X7,X8)
| s(X1,X2,X3,X4,truck2,X5,X6,X7,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive2) ).
cnf(neq38,axiom,
neq(s2,truck2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',neq38) ).
cnf(load15,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X4)
| s(X1,X2,X3,truck2,X5,X6,X7,X8,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load15) ).
cnf(map15,axiom,
link(s1,s0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map15) ).
cnf(load4,axiom,
( ~ s(truck2,X2,X3,X4,X5,X6,X7,X8,X1)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load4) ).
cnf(load16,axiom,
( ~ s(X1,X2,X3,truck2,X5,X6,X7,X8,X4)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load16) ).
cnf(map13,axiom,
link(s0,s2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map13) ).
cnf(board4,axiom,
( ~ s(X1,X2,X3,X4,truck2,X6,X7,X8,X5)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board4) ).
cnf(load11,axiom,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X3)
| s(X1,X2,truck2,X4,X5,X6,X7,X8,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load11) ).
cnf(board11,axiom,
( ~ neq(X6,truck2)
| ~ neq(X5,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X7)
| s(X1,X2,X3,X4,X5,X6,truck2,X8,X7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',board11) ).
cnf(drive6,axiom,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,truck2,X7,X8)
| s(X1,X2,X3,X4,X5,X6,truck2,X7,X9) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drive6) ).
cnf(load12,axiom,
( ~ s(X1,X2,truck2,X4,X5,X6,X7,X8,X3)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',load12) ).
cnf(map17,axiom,
link(s2,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',map17) ).
cnf(goal,negated_conjecture,
~ s(s0,s0,s1,s2,s2,X1,X2,s0,s1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(c_0_17,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X1)
| s(truck2,X2,X3,X4,X5,X6,X7,X8,X1) ),
inference(fof_simplification,[status(thm)],[load3]) ).
cnf(c_0_18,plain,
( ~ neq(X7,truck2)
| ~ neq(X6,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X5)
| s(X1,X2,X3,X4,truck2,X6,X7,X8,X5) ),
inference(fof_simplification,[status(thm)],[board3]) ).
cnf(c_0_19,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X1)
| s(truck2,X2,X3,X4,X5,X6,X7,X8,X1) ),
c_0_17 ).
cnf(c_0_20,axiom,
s(s1,s0,s2,s0,s1,s2,s2,s0,s1),
init ).
cnf(c_0_21,plain,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,truck2,X5,X6,X7,X8)
| s(X1,X2,X3,X4,truck2,X5,X6,X7,X9) ),
inference(fof_simplification,[status(thm)],[drive2]) ).
cnf(c_0_22,plain,
( ~ neq(X7,truck2)
| ~ neq(X6,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X5)
| s(X1,X2,X3,X4,truck2,X6,X7,X8,X5) ),
c_0_18 ).
cnf(c_0_23,plain,
s(truck2,s0,s2,s0,s1,s2,s2,s0,s1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,axiom,
neq(s2,truck2),
neq38 ).
cnf(c_0_25,plain,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,truck2,X5,X6,X7,X8)
| s(X1,X2,X3,X4,truck2,X5,X6,X7,X9) ),
c_0_21 ).
cnf(c_0_26,plain,
s(truck2,s0,s2,s0,truck2,s2,s2,s0,s1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X4)
| s(X1,X2,X3,truck2,X5,X6,X7,X8,X4) ),
inference(fof_simplification,[status(thm)],[load15]) ).
cnf(c_0_28,plain,
( ~ link(s1,X1)
| s(truck2,s0,s2,s0,truck2,s2,s2,s0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,axiom,
link(s1,s0),
map15 ).
cnf(c_0_30,plain,
( ~ s(truck2,X2,X3,X4,X5,X6,X7,X8,X1)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X1) ),
inference(fof_simplification,[status(thm)],[load4]) ).
cnf(c_0_31,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X4)
| s(X1,X2,X3,truck2,X5,X6,X7,X8,X4) ),
c_0_27 ).
cnf(c_0_32,plain,
s(truck2,s0,s2,s0,truck2,s2,s2,s0,s0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ s(truck2,X2,X3,X4,X5,X6,X7,X8,X1)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X1) ),
c_0_30 ).
cnf(c_0_34,plain,
s(truck2,s0,s2,truck2,truck2,s2,s2,s0,s0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
s(s0,s0,s2,truck2,truck2,s2,s2,s0,s0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,plain,
( ~ s(X1,X2,X3,truck2,X5,X6,X7,X8,X4)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X4) ),
inference(fof_simplification,[status(thm)],[load16]) ).
cnf(c_0_37,plain,
( ~ link(s0,X1)
| s(s0,s0,s2,truck2,truck2,s2,s2,s0,X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_38,axiom,
link(s0,s2),
map13 ).
cnf(c_0_39,plain,
( ~ s(X1,X2,X3,X4,truck2,X6,X7,X8,X5)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X5) ),
inference(fof_simplification,[status(thm)],[board4]) ).
cnf(c_0_40,plain,
( ~ s(X1,X2,X3,truck2,X5,X6,X7,X8,X4)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X4) ),
c_0_36 ).
cnf(c_0_41,plain,
s(s0,s0,s2,truck2,truck2,s2,s2,s0,s2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X3)
| s(X1,X2,truck2,X4,X5,X6,X7,X8,X3) ),
inference(fof_simplification,[status(thm)],[load11]) ).
cnf(c_0_43,plain,
( ~ s(X1,X2,X3,X4,truck2,X6,X7,X8,X5)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X5) ),
c_0_39 ).
cnf(c_0_44,plain,
s(s0,s0,s2,s2,truck2,s2,s2,s0,s2),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( ~ neq(X6,truck2)
| ~ neq(X5,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X7)
| s(X1,X2,X3,X4,X5,X6,truck2,X8,X7) ),
inference(fof_simplification,[status(thm)],[board11]) ).
cnf(c_0_46,plain,
( ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X3)
| s(X1,X2,truck2,X4,X5,X6,X7,X8,X3) ),
c_0_42 ).
cnf(c_0_47,plain,
s(s0,s0,s2,s2,s2,s2,s2,s0,s2),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,truck2,X7,X8)
| s(X1,X2,X3,X4,X5,X6,truck2,X7,X9) ),
inference(fof_simplification,[status(thm)],[drive6]) ).
cnf(c_0_49,plain,
( ~ neq(X6,truck2)
| ~ neq(X5,truck2)
| ~ s(X1,X2,X3,X4,X5,X6,X7,X8,X7)
| s(X1,X2,X3,X4,X5,X6,truck2,X8,X7) ),
c_0_45 ).
cnf(c_0_50,plain,
s(s0,s0,truck2,s2,s2,s2,s2,s0,s2),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_51,plain,
( ~ link(X8,X9)
| ~ s(X1,X2,X3,X4,X5,X6,truck2,X7,X8)
| s(X1,X2,X3,X4,X5,X6,truck2,X7,X9) ),
c_0_48 ).
cnf(c_0_52,plain,
s(s0,s0,truck2,s2,s2,s2,truck2,s0,s2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_24])]) ).
cnf(c_0_53,plain,
( ~ s(X1,X2,truck2,X4,X5,X6,X7,X8,X3)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X3) ),
inference(fof_simplification,[status(thm)],[load12]) ).
cnf(c_0_54,plain,
( ~ link(s2,X1)
| s(s0,s0,truck2,s2,s2,s2,truck2,s0,X1) ),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,axiom,
link(s2,s1),
map17 ).
cnf(c_0_56,negated_conjecture,
~ s(s0,s0,s1,s2,s2,X1,X2,s0,s1),
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_57,plain,
( ~ s(X1,X2,truck2,X4,X5,X6,X7,X8,X3)
| s(X1,X2,X3,X4,X5,X6,X7,X8,X3) ),
c_0_53 ).
cnf(c_0_58,plain,
s(s0,s0,truck2,s2,s2,s2,truck2,s0,s1),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_59,negated_conjecture,
~ s(s0,s0,s1,s2,s2,X1,X2,s0,s1),
c_0_56 ).
cnf(c_0_60,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PLA031-1.004 : TPTP v9.3.1. Released v3.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 03:37:54 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 58.23/8.91 % Version: 3.5.1
% 58.23/8.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.23/8.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.23/8.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.23/8.91 % Starting new_bool_3 with 300s (1) cores
% 58.23/8.91 % Starting new_bool_1 with 300s (1) cores
% 58.23/8.91 % Starting sh5l with 300s (1) cores
% 58.23/8.91 % sh5l with pid 1468391 completed with status 0
% 58.23/8.91 % Result found by sh5l
% 58.23/8.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.23/8.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.23/8.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.23/8.91 % Starting new_bool_3 with 300s (1) cores
% 58.23/8.91 % Starting new_bool_1 with 300s (1) cores
% 58.23/8.91 % Starting sh5l with 300s (1) cores
% 58.23/8.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 58.23/8.91 % SinE strategy is gf500_gu_R04_F100_L20000
% 58.23/8.91 % Search class: FHUNF-FFMM00-SFFFFFNN
% 58.23/8.91 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 58.23/8.91 % Starting SubtermCWHack with 31s (1) cores
% 58.23/8.91 % SubtermCWHack with pid 1468392 completed with status 0
% 58.23/8.91 % Result found by SubtermCWHack
% 58.23/8.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 58.23/8.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 58.23/8.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 58.23/8.91 % Starting new_bool_3 with 300s (1) cores
% 58.23/8.91 % Starting new_bool_1 with 300s (1) cores
% 58.23/8.91 % Starting sh5l with 300s (1) cores
% 58.23/8.91 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 58.23/8.91 % SinE strategy is gf500_gu_R04_F100_L20000
% 58.23/8.91 % Search class: FHUNF-FFMM00-SFFFFFNN
% 58.23/8.91 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 58.23/8.91 % Starting SubtermCWHack with 31s (1) cores
% 58.23/8.91 % Preprocessing time : 0.002 s
% 58.23/8.91
% 58.23/8.91 % Proof found!
% 58.23/8.91 % SZS status Unsatisfiable
% 58.23/8.91 % SZS output start CNFRefutation
% See solution above
% 58.23/8.91 % Parsed axioms : 138
% 58.23/8.91 % Removed by relevancy pruning/SinE : 0
% 58.23/8.91 % Initial clauses : 138
% 58.23/8.91 % Removed in clause preprocessing : 0
% 58.23/8.91 % Initial clauses in saturation : 138
% 58.23/8.91 % Processed clauses : 46045
% 58.23/8.91 % ...of these trivial : 18658
% 58.23/8.91 % ...subsumed : 4597
% 58.23/8.91 % ...remaining for further processing : 22790
% 58.23/8.91 % Other redundant clauses eliminated : 0
% 58.23/8.91 % Clauses deleted for lack of memory : 0
% 58.23/8.91 % Backward-subsumed : 785
% 58.23/8.91 % Backward-rewritten : 0
% 58.23/8.91 % Generated clauses : 225867
% 58.23/8.91 % ...of the previous two non-redundant : 185054
% 58.23/8.91 % ...aggressively subsumed : 0
% 58.23/8.91 % Contextual simplify-reflections : 0
% 58.23/8.91 % Paramodulations : 225867
% 58.23/8.91 % Factorizations : 0
% 58.23/8.91 % NegExts : 0
% 58.23/8.91 % Equation resolutions : 0
% 58.23/8.91 % Disequality decompositions : 0
% 58.23/8.91 % Total rewrite steps : 101338
% 58.23/8.91 % ...of those cached : 88851
% 58.23/8.91 % Propositional unsat checks : 0
% 58.23/8.91 % Propositional check models : 0
% 58.23/8.91 % Propositional check unsatisfiable : 0
% 58.23/8.91 % Propositional clauses : 0
% 58.23/8.91 % Propositional clauses after purity: 0
% 58.23/8.91 % Propositional unsat core size : 0
% 58.23/8.91 % Propositional preprocessing time : 0.000
% 58.23/8.91 % Propositional encoding time : 0.000
% 58.23/8.91 % Propositional solver time : 0.000
% 58.23/8.91 % Success case prop preproc time : 0.000
% 58.23/8.91 % Success case prop encoding time : 0.000
% 58.23/8.91 % Success case prop solver time : 0.000
% 58.23/8.91 % Current number of processed clauses : 22005
% 58.23/8.91 % Positive orientable unit clauses : 12572
% 58.23/8.91 % Positive unorientable unit clauses: 0
% 58.23/8.91 % Negative unit clauses : 10
% 58.23/8.91 % Non-unit-clauses : 9423
% 58.23/8.91 % Current number of unprocessed clauses: 138419
% 58.23/8.91 % ...number of literals in the above : 342106
% 58.23/8.91 % Current number of archived formulas : 0
% 58.23/8.91 % Current number of archived clauses : 785
% 58.23/8.91 % Clause-clause subsumption calls (NU) : 10279035
% 58.23/8.91 % Rec. Clause-clause subsumption calls : 9487572
% 58.23/8.91 % Non-unit clause-clause subsumptions : 3746
% 58.23/8.91 % Unit Clause-clause subsumption calls : 3501790
% 58.23/8.91 % Rewrite failures with RHS unbound : 0
% 58.23/8.91 % BW rewrite match attempts : 5195306
% 58.23/8.91 % BW rewrite match successes : 341
% 58.23/8.91 % Condensation attempts : 0
% 58.23/8.91 % Condensation successes : 0
% 58.23/8.91 % Termbank termtop insertions : 3590020
% 58.23/8.91 % Search garbage collected termcells : 140
% 58.23/8.91
% 58.23/8.91 % -------------------------------------------------
% 58.23/8.91 % User time : 7.731 s
% 58.23/8.91 % System time : 0.213 s
% 58.23/8.91 % Total time : 7.944 s
% 58.23/8.91 % Maximum resident set size: 3712 pages
% 58.23/8.91
% 58.23/8.91 % -------------------------------------------------
% 58.23/8.91 % User time : 7.732 s
% 58.23/8.91 % System time : 0.221 s
% 58.23/8.91 % Total time : 7.953 s
% 58.23/8.91 % Maximum resident set size: 4608 pages
% 58.23/8.91 % E exiting
%------------------------------------------------------------------------------