%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PLA031-1.002 : TPTP v9.2.1. Released v3.5.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 05:01:26 PM UTC 2026
% Result : Unsatisfiable 4.01s 3.00s
% Output : CNFRefutation 4.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 20
% Syntax : Number of clauses : 66 ( 35 unt; 0 nHn; 66 RR)
% Number of literals : 105 ( 0 equ; 41 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 : 159 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( s(X1,X2,X3,X8,X5,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk1) ).
cnf(init,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',init) ).
cnf(map7,axiom,
path(s1,p2_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map7) ).
cnf(map6,axiom,
path(p2_1,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map6) ).
cnf(walk2,axiom,
( s(X1,X2,X3,X4,X8,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk2) ).
cnf(board5,axiom,
( s(X1,X2,X3,X4,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board5) ).
cnf(neq29,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neq29) ).
cnf(drive3,axiom,
( s(X1,X2,X3,X4,truck1,X7,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive3) ).
cnf(map12,axiom,
link(s2,s1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map12) ).
cnf(load5,axiom,
( s(X1,truck1,X3,X4,X5,X2,X6)
| ~ s(X1,X2,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load5) ).
cnf(load1,axiom,
( s(truck1,X2,X3,X4,X5,X1,X6)
| ~ s(X1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load1) ).
cnf(map10,axiom,
link(s1,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map10) ).
cnf(board6,axiom,
( s(X1,X2,X3,X4,X5,X5,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board6) ).
cnf(load6,axiom,
( s(X1,X2,X3,X4,X5,X2,X6)
| ~ s(X1,truck1,X3,X4,X5,X2,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load6) ).
cnf(load2,axiom,
( s(X1,X2,X3,X4,X5,X1,X6)
| ~ s(truck1,X2,X3,X4,X5,X1,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load2) ).
cnf(map9,axiom,
link(s0,s1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map9) ).
cnf(load9,axiom,
( s(X1,X2,truck1,X4,X5,X3,X6)
| ~ s(X1,X2,X3,X4,X5,X3,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load9) ).
cnf(map11,axiom,
link(s1,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map11) ).
cnf(load10,axiom,
( s(X1,X2,X3,X4,X5,X3,X6)
| ~ s(X1,X2,truck1,X4,X5,X3,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load10) ).
cnf(goal,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_20,axiom,
( s(X1,X2,X3,X8,X5,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X4,X8) ),
walk1 ).
cnf(c_0_21,axiom,
s(s1,s1,s1,s1,s1,s2,s0),
init ).
cnf(c_0_22,plain,
( s(s1,s1,s1,X1,s1,s2,s0)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,axiom,
path(s1,p2_1),
map7 ).
cnf(c_0_24,plain,
s(s1,s1,s1,p2_1,s1,s2,s0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( s(s1,s1,s1,X1,s1,s2,s0)
| ~ path(p2_1,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_26,axiom,
path(p2_1,s2),
map6 ).
cnf(c_0_27,axiom,
( s(X1,X2,X3,X4,X8,X6,X7)
| ~ s(X1,X2,X3,X4,X5,X6,X7)
| ~ path(X5,X8) ),
walk2 ).
cnf(c_0_28,plain,
s(s1,s1,s1,s2,s1,s2,s0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
( s(s1,s1,s1,s2,X1,s2,s0)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
s(s1,s1,s1,s2,p2_1,s2,s0),
inference(spm,[status(thm)],[c_0_29,c_0_23]) ).
cnf(c_0_31,axiom,
( s(X1,X2,X3,X4,truck1,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X5,X6)
| ~ neq(X4,truck1) ),
board5 ).
cnf(c_0_32,axiom,
neq(s2,truck1),
neq29 ).
cnf(c_0_33,plain,
( s(s1,s1,s1,s2,X1,s2,s0)
| ~ path(p2_1,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_30]) ).
cnf(c_0_34,plain,
( s(X1,X2,X3,s2,truck1,X4,X5)
| ~ s(X1,X2,X3,s2,X4,X4,X5) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
s(s1,s1,s1,s2,s2,s2,s0),
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_36,axiom,
( s(X1,X2,X3,X4,truck1,X7,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6)
| ~ link(X5,X7) ),
drive3 ).
cnf(c_0_37,plain,
s(s1,s1,s1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( s(s1,s1,s1,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,axiom,
link(s2,s1),
map12 ).
cnf(c_0_40,axiom,
( s(X1,truck1,X3,X4,X5,X2,X6)
| ~ s(X1,X2,X3,X4,X5,X2,X6) ),
load5 ).
cnf(c_0_41,plain,
s(s1,s1,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,axiom,
( s(truck1,X2,X3,X4,X5,X1,X6)
| ~ s(X1,X2,X3,X4,X5,X1,X6) ),
load1 ).
cnf(c_0_43,plain,
s(s1,truck1,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
s(truck1,truck1,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( s(truck1,truck1,s1,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_44]) ).
cnf(c_0_46,axiom,
link(s1,s0),
map10 ).
cnf(c_0_47,axiom,
( s(X1,X2,X3,X4,X5,X5,X6)
| ~ s(X1,X2,X3,X4,truck1,X5,X6) ),
board6 ).
cnf(c_0_48,plain,
s(truck1,truck1,s1,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_49,axiom,
( s(X1,X2,X3,X4,X5,X2,X6)
| ~ s(X1,truck1,X3,X4,X5,X2,X6) ),
load6 ).
cnf(c_0_50,plain,
s(truck1,truck1,s1,s2,s0,s0,s0),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_51,axiom,
( s(X1,X2,X3,X4,X5,X1,X6)
| ~ s(truck1,X2,X3,X4,X5,X1,X6) ),
load2 ).
cnf(c_0_52,plain,
s(truck1,s0,s1,s2,s0,s0,s0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
s(s0,s0,s1,s2,s0,s0,s0),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
s(s0,s0,s1,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_34,c_0_53]) ).
cnf(c_0_55,plain,
( s(s0,s0,s1,s2,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_54]) ).
cnf(c_0_56,axiom,
link(s0,s1),
map9 ).
cnf(c_0_57,axiom,
( s(X1,X2,truck1,X4,X5,X3,X6)
| ~ s(X1,X2,X3,X4,X5,X3,X6) ),
load9 ).
cnf(c_0_58,plain,
s(s0,s0,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,plain,
s(s0,s0,truck1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_60,plain,
( s(s0,s0,truck1,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_59]) ).
cnf(c_0_61,axiom,
link(s1,s2),
map11 ).
cnf(c_0_62,axiom,
( s(X1,X2,X3,X4,X5,X3,X6)
| ~ s(X1,X2,truck1,X4,X5,X3,X6) ),
load10 ).
cnf(c_0_63,plain,
s(s0,s0,truck1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
~ s(s0,s0,s2,s2,X1,s2,X2),
goal ).
cnf(c_0_65,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PLA031-1.002 : TPTP v9.2.1. Released v3.5.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n021.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 01:31:10 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.35 % start to proof: theBenchmark
% 4.01/3.00 % Version : CSE_E---1.7
% 4.01/3.00 % Problem : theBenchmark.p
% 4.01/3.00 % SZS status Unsatisfiable for theBenchmark.p
% 4.01/3.00 % SZS output start CNFRefutation
% See solution above
% 4.01/3.01 % Total time : 2.371s
%------------------------------------------------------------------------------