%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : PLA031-1.001 : 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 : n009.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.36s 3.11s
% Output : CNFRefutation 4.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 22
% Syntax : Number of clauses : 68 ( 38 unt; 0 nHn; 68 RR)
% Number of literals : 110 ( 0 equ; 44 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-6 aty)
% Number of functors : 7 ( 7 usr; 7 con; 0-0 aty)
% Number of variables : 128 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(walk1,axiom,
( s(X1,X2,X7,X4,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X6)
| ~ path(X3,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk1) ).
cnf(init,axiom,
s(s2,s2,s0,s1,s0,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',init) ).
cnf(map7,axiom,
path(s0,p2_0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map7) ).
cnf(map6,axiom,
path(p2_0,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map6) ).
cnf(walk2,axiom,
( s(X1,X2,X3,X7,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X6)
| ~ path(X4,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',walk2) ).
cnf(map11,axiom,
path(s1,p2_1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map11) ).
cnf(board7,axiom,
( s(X1,X2,X3,truck2,X5,X4)
| ~ s(X1,X2,X3,X4,X5,X4)
| ~ neq(X3,truck2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board7) ).
cnf(neq34,axiom,
neq(s2,truck2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neq34) ).
cnf(map10,axiom,
path(p2_1,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map10) ).
cnf(drive4,axiom,
( s(X1,X2,X3,truck2,X4,X6)
| ~ s(X1,X2,X3,truck2,X4,X5)
| ~ link(X5,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive4) ).
cnf(map16,axiom,
link(s2,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map16) ).
cnf(board5,axiom,
( s(X1,X2,X3,truck1,X4,X5)
| ~ s(X1,X2,X3,X4,X4,X5)
| ~ neq(X3,truck1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board5) ).
cnf(neq33,axiom,
neq(s2,truck1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',neq33) ).
cnf(board8,axiom,
( s(X1,X2,X3,X4,X5,X4)
| ~ s(X1,X2,X3,truck2,X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board8) ).
cnf(drive3,axiom,
( s(X1,X2,X3,truck1,X6,X5)
| ~ s(X1,X2,X3,truck1,X4,X5)
| ~ link(X4,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',drive3) ).
cnf(map15,axiom,
link(s0,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map15) ).
cnf(load5,axiom,
( s(X1,truck1,X3,X4,X2,X5)
| ~ s(X1,X2,X3,X4,X2,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load5) ).
cnf(map18,axiom,
link(s2,s1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map18) ).
cnf(load6,axiom,
( s(X1,X2,X3,X4,X2,X5)
| ~ s(X1,truck1,X3,X4,X2,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',load6) ).
cnf(map17,axiom,
link(s1,s2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',map17) ).
cnf(board6,axiom,
( s(X1,X2,X3,X4,X4,X5)
| ~ s(X1,X2,X3,truck1,X4,X5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',board6) ).
cnf(goal,negated_conjecture,
~ s(s2,s1,s2,s2,s2,s0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).
cnf(c_0_22,axiom,
( s(X1,X2,X7,X4,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X6)
| ~ path(X3,X7) ),
walk1 ).
cnf(c_0_23,axiom,
s(s2,s2,s0,s1,s0,s2),
init ).
cnf(c_0_24,plain,
( s(s2,s2,X1,s1,s0,s2)
| ~ path(s0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,axiom,
path(s0,p2_0),
map7 ).
cnf(c_0_26,plain,
s(s2,s2,p2_0,s1,s0,s2),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( s(s2,s2,X1,s1,s0,s2)
| ~ path(p2_0,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_28,axiom,
path(p2_0,s2),
map6 ).
cnf(c_0_29,axiom,
( s(X1,X2,X3,X7,X5,X6)
| ~ s(X1,X2,X3,X4,X5,X6)
| ~ path(X4,X7) ),
walk2 ).
cnf(c_0_30,plain,
s(s2,s2,s2,s1,s0,s2),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,plain,
( s(s2,s2,s2,X1,s0,s2)
| ~ path(s1,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,axiom,
path(s1,p2_1),
map11 ).
cnf(c_0_33,plain,
s(s2,s2,s2,p2_1,s0,s2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_34,axiom,
( s(X1,X2,X3,truck2,X5,X4)
| ~ s(X1,X2,X3,X4,X5,X4)
| ~ neq(X3,truck2) ),
board7 ).
cnf(c_0_35,axiom,
neq(s2,truck2),
neq34 ).
cnf(c_0_36,plain,
( s(s2,s2,s2,X1,s0,s2)
| ~ path(p2_1,X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_33]) ).
cnf(c_0_37,axiom,
path(p2_1,s2),
map10 ).
cnf(c_0_38,plain,
( s(X1,X2,s2,truck2,X3,X4)
| ~ s(X1,X2,s2,X4,X3,X4) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
s(s2,s2,s2,s2,s0,s2),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,axiom,
( s(X1,X2,X3,truck2,X4,X6)
| ~ s(X1,X2,X3,truck2,X4,X5)
| ~ link(X5,X6) ),
drive4 ).
cnf(c_0_41,plain,
s(s2,s2,s2,truck2,s0,s2),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,plain,
( s(s2,s2,s2,truck2,s0,X1)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,axiom,
link(s2,s0),
map16 ).
cnf(c_0_44,axiom,
( s(X1,X2,X3,truck1,X4,X5)
| ~ s(X1,X2,X3,X4,X4,X5)
| ~ neq(X3,truck1) ),
board5 ).
cnf(c_0_45,axiom,
neq(s2,truck1),
neq33 ).
cnf(c_0_46,axiom,
( s(X1,X2,X3,X4,X5,X4)
| ~ s(X1,X2,X3,truck2,X5,X4) ),
board8 ).
cnf(c_0_47,plain,
s(s2,s2,s2,truck2,s0,s0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( s(X1,X2,s2,truck1,X3,X4)
| ~ s(X1,X2,s2,X3,X3,X4) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_49,plain,
s(s2,s2,s2,s0,s0,s0),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,axiom,
( s(X1,X2,X3,truck1,X6,X5)
| ~ s(X1,X2,X3,truck1,X4,X5)
| ~ link(X4,X6) ),
drive3 ).
cnf(c_0_51,plain,
s(s2,s2,s2,truck1,s0,s0),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_52,plain,
( s(s2,s2,s2,truck1,X1,s0)
| ~ link(s0,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_53,axiom,
link(s0,s2),
map15 ).
cnf(c_0_54,axiom,
( s(X1,truck1,X3,X4,X2,X5)
| ~ s(X1,X2,X3,X4,X2,X5) ),
load5 ).
cnf(c_0_55,plain,
s(s2,s2,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,plain,
s(s2,truck1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_57,plain,
( s(s2,truck1,s2,truck1,X1,s0)
| ~ link(s2,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_56]) ).
cnf(c_0_58,axiom,
link(s2,s1),
map18 ).
cnf(c_0_59,axiom,
( s(X1,X2,X3,X4,X2,X5)
| ~ s(X1,truck1,X3,X4,X2,X5) ),
load6 ).
cnf(c_0_60,plain,
s(s2,truck1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_61,plain,
s(s2,s1,s2,truck1,s1,s0),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_62,plain,
( s(s2,s1,s2,truck1,X1,s0)
| ~ link(s1,X1) ),
inference(spm,[status(thm)],[c_0_50,c_0_61]) ).
cnf(c_0_63,axiom,
link(s1,s2),
map17 ).
cnf(c_0_64,axiom,
( s(X1,X2,X3,X4,X4,X5)
| ~ s(X1,X2,X3,truck1,X4,X5) ),
board6 ).
cnf(c_0_65,plain,
s(s2,s1,s2,truck1,s2,s0),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
~ s(s2,s1,s2,s2,s2,s0),
goal ).
cnf(c_0_67,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PLA031-1.001 : TPTP v9.2.1. Released v3.5.0.
% 0.00/0.11 % 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 : n009.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:26:26 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 4.36/3.11 % Version : CSE_E---1.7
% 4.36/3.11 % Problem : theBenchmark.p
% 4.36/3.11 % SZS status Unsatisfiable for theBenchmark.p
% 4.36/3.11 % SZS output start CNFRefutation
% See solution above
% 4.47/3.12 % Total time : 2.372s
%------------------------------------------------------------------------------