%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC336-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 : n010.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:14 PM UTC 2026
% Result : Unsatisfiable 1.36s 1.73s
% Output : CNFRefutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of clauses : 50 ( 20 unt; 16 nHn; 50 RR)
% Number of literals : 98 ( 35 equ; 37 neg)
% Maximal clause size : 6 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_21,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
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(clause67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause67) ).
cnf(co1_17,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_11,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_18,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_15,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_16,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(clause11,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause11) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(c_0_19,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ totalorderedP(sk1) ),
co1_21 ).
cnf(c_0_20,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
clause67 ).
cnf(c_0_23,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_17 ).
cnf(c_0_24,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_25,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_26,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_27,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_28,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_29,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ totalorderedP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( sk3 = nil
| totalorderedP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_31,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_11 ).
cnf(c_0_33,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_34,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_35,plain,
( segmentP(app(app(X1,X2),X3),X2)
| ~ ssList(app(app(X1,X2),X3))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
co1_18 ).
cnf(c_0_37,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_38,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
co1_15 ).
cnf(c_0_39,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
co1_16 ).
cnf(c_0_40,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk4,sk3) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_41,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]),c_0_34]) ).
cnf(c_0_42,negated_conjecture,
sk3 = nil,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_33])]),c_0_38]),c_0_39]),c_0_40]) ).
cnf(c_0_43,axiom,
~ singletonP(nil),
clause11 ).
cnf(c_0_44,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_47,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_48,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_44]),c_0_45])]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_42]),c_0_42]),c_0_46])]),c_0_47]),c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC336-1 : TPTP v9.2.1. Released v2.4.0.
% 0.00/0.12 % 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.15/0.32 % Computer : n010.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 04:44:21 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.36/1.73 % Version : CSE_E---1.7
% 1.36/1.73 % Problem : theBenchmark.p
% 1.36/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.36/1.73 % SZS output start CNFRefutation
% See solution above
% 1.36/1.74 % Total time : 1.372s
%------------------------------------------------------------------------------