%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC030-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 : n016.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:17:58 PM UTC 2026
% Result : Unsatisfiable 1.29s 1.73s
% Output : CNFRefutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 43 ( 23 unt; 2 nHn; 43 RR)
% Number of literals : 73 ( 54 equ; 31 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
app(sk6,sk5) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
app(sk5,sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_8,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_11,negated_conjecture,
( nil = sk2
| nil = sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(c_0_13,negated_conjecture,
app(sk6,sk5) = sk3,
co1_10 ).
cnf(c_0_14,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_15,negated_conjecture,
app(sk5,sk6) = sk4,
co1_9 ).
cnf(c_0_16,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_17,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_18,negated_conjecture,
app(sk6,sk5) = sk1,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_20,negated_conjecture,
ssList(sk6),
co1_8 ).
cnf(c_0_21,negated_conjecture,
app(sk5,sk6) = sk2,
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
( sk5 = nil
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_20])]) ).
cnf(c_0_23,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_24,negated_conjecture,
( app(nil,sk6) = sk2
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_26,negated_conjecture,
( app(sk6,nil) = sk1
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( sk6 = sk2
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_20])]) ).
cnf(c_0_28,negated_conjecture,
( sk6 = sk1
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_20])]) ).
cnf(c_0_29,negated_conjecture,
( nil != sk1
| nil != sk2 ),
co1_14 ).
cnf(c_0_30,negated_conjecture,
( sk2 = sk1
| sk1 != nil ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
( sk6 = nil
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_20]),c_0_19])]) ).
cnf(c_0_32,negated_conjecture,
( nil = sk2
| nil = sk1 ),
co1_11 ).
cnf(c_0_33,negated_conjecture,
sk1 != nil,
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( app(sk5,nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_21,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
app(sk5,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35]),c_0_35])]) ).
cnf(c_0_37,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,negated_conjecture,
sk6 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_35])]) ).
cnf(c_0_40,negated_conjecture,
sk5 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_36]),c_0_19])]) ).
cnf(c_0_41,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_37])]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_39]),c_0_40]),c_0_41]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC030-1 : TPTP v9.2.1. Released v2.4.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 : n016.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 04:18:36 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.29/1.73 % Version : CSE_E---1.7
% 1.29/1.73 % Problem : theBenchmark.p
% 1.29/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.29/1.73 % SZS output start CNFRefutation
% See solution above
% 1.29/1.73 % Total time : 1.374s
%------------------------------------------------------------------------------