%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC309-1 : TPTP v9.2.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n011.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:19:07 PM UTC 2026
% Result : Unsatisfiable 1.32s 1.74s
% Output : CNFRefutation 1.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 33 ( 19 unt; 2 nHn; 29 RR)
% Number of literals : 67 ( 25 equ; 40 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_9,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_12,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk2
| app(X2,cons(X1,nil)) != sk1 ),
co1_8 ).
cnf(c_0_13,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_14,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_15,negated_conjecture,
( app(X2,cons(X1,nil)) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk4 ),
co1_9 ).
cnf(c_0_16,negated_conjecture,
( app(X1,cons(X2,nil)) != sk3
| app(cons(X2,nil),X1) != sk4
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_19,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_21,negated_conjecture,
( cons(X1,X2) != sk4
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_23,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_24,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_25,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_26,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_27,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])])]),c_0_25])]) ).
cnf(c_0_29,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_30,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : SWC309-1 : TPTP v9.2.1. Released v2.4.0.
% 0.12/0.14 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.18/0.35 % Computer : n011.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Tue May 5 04:42:47 EDT 2026
% 0.18/0.35 % CPUTime :
% 0.18/0.36 % start to proof: theBenchmark
% 1.32/1.74 % Version : CSE_E---1.7
% 1.32/1.74 % Problem : theBenchmark.p
% 1.32/1.74 % SZS status Unsatisfiable for theBenchmark.p
% 1.32/1.74 % SZS output start CNFRefutation
% See solution above
% 1.32/1.74 % Total time : 1.371s
%------------------------------------------------------------------------------