%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC322-1 : TPTP v9.2.1. Released v2.4.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:19:11 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.71s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of clauses : 41 ( 12 unt; 6 nHn; 41 RR)
% Number of literals : 86 ( 50 equ; 43 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_15,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_14,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_10,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
( app(cons(X1,nil),X2) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_12,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_9,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_13,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(c_0_15,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_8 ).
cnf(c_0_16,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_17,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_18,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_19,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
co1_15 ).
cnf(c_0_20,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
co1_14 ).
cnf(c_0_21,negated_conjecture,
( sk1 = nil
| sk2 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).
cnf(c_0_23,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_24,axiom,
ssList(nil),
clause8 ).
cnf(c_0_25,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_26,negated_conjecture,
( cons(sk5,nil) = nil
| sk2 != nil
| ~ ssItem(sk5) ),
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,negated_conjecture,
( sk2 != nil
| ~ ssItem(sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_24])]) ).
cnf(c_0_28,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
co1_10 ).
cnf(c_0_29,negated_conjecture,
( app(cons(X1,nil),X2) = sk3
| ~ ssItem(X1)
| ~ ssList(X2)
| app(X2,cons(X1,nil)) != sk4 ),
co1_7 ).
cnf(c_0_30,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil = sk2 ),
co1_12 ).
cnf(c_0_31,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21]) ).
cnf(c_0_32,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
co1_9 ).
cnf(c_0_33,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
co1_11 ).
cnf(c_0_34,negated_conjecture,
( app(cons(X1,nil),X2) = sk1
| app(X2,cons(X1,nil)) != sk2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_16]),c_0_17]) ).
cnf(c_0_35,negated_conjecture,
app(sk6,cons(sk5,nil)) = sk2,
inference(sr,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
ssList(sk6),
inference(sr,[status(thm)],[c_0_33,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) != sk1 ),
co1_13 ).
cnf(c_0_39,negated_conjecture,
app(cons(sk5,nil),sk6) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SWC322-1 : TPTP v9.2.1. Released v2.4.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.14/0.32 % Computer : n009.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:43:26 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.33 % start to proof: theBenchmark
% 1.29/1.71 % Version : CSE_E---1.7
% 1.29/1.71 % Problem : theBenchmark.p
% 1.29/1.71 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.71 % SZS output start CNFRefutation
% See solution above
% 1.29/1.72 % Total time : 1.373s
%------------------------------------------------------------------------------