%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC343-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:15 PM UTC 2026
% Result : Unsatisfiable 15.34s 9.69s
% Output : CNFRefutation 15.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 23
% Syntax : Number of clauses : 73 ( 19 unt; 21 nHn; 73 RR)
% Number of literals : 250 ( 116 equ; 166 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 62 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
app(sk3,sk5) = sk4,
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,
strictorderedP(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_7,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_21,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_20,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
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(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_13,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_11,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssItem(X3)
| ~ ssList(X4)
| app(X4,cons(X3,nil)) != sk3
| ~ lt(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_18,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_15,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_19,negated_conjecture,
( lt(sk8(X1),sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_16,negated_conjecture,
( ssItem(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_12,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_17,negated_conjecture,
( ssList(sk9(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_14,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(c_0_23,negated_conjecture,
app(sk3,sk5) = sk4,
co1_8 ).
cnf(c_0_24,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_25,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_26,negated_conjecture,
strictorderedP(sk3),
co1_9 ).
cnf(c_0_27,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_28,negated_conjecture,
app(sk1,sk5) = sk2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_29,negated_conjecture,
ssList(sk5),
co1_7 ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_21 ).
cnf(c_0_32,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_33,negated_conjecture,
( sk5 = nil
| sk2 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_34,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( app(sk1,nil) = sk2
| sk2 != nil ),
inference(spm,[status(thm)],[c_0_28,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( sk7(nil) = nil
| sk2 != nil
| ~ ssList(cons(sk6(nil),nil))
| ~ ssList(sk7(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34])]),c_0_35])]),c_0_36]) ).
cnf(c_0_38,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_39,negated_conjecture,
( ssList(sk7(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_20 ).
cnf(c_0_40,negated_conjecture,
( sk7(nil) = nil
| sk2 != nil
| ~ ssItem(sk6(nil))
| ~ ssList(sk7(nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_35])]) ).
cnf(c_0_41,negated_conjecture,
( ssList(sk7(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_32])]) ).
cnf(c_0_42,negated_conjecture,
( sk7(nil) = nil
| sk2 != nil
| ~ ssItem(sk6(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_35])]),c_0_36]) ).
cnf(c_0_43,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_44,negated_conjecture,
( app(cons(sk6(nil),nil),nil) = nil
| sk2 != nil
| ~ ssItem(sk6(nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_42]),c_0_35])]),c_0_36]) ).
cnf(c_0_45,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause99 ).
cnf(c_0_46,negated_conjecture,
( cons(sk6(nil),nil) = nil
| sk2 != nil
| ~ ssItem(sk6(nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35])]) ).
cnf(c_0_47,negated_conjecture,
( ssItem(sk6(X1))
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1)
| nil != sk2 ),
co1_13 ).
cnf(c_0_48,negated_conjecture,
( sk2 != nil
| ~ ssItem(sk6(nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_35])]) ).
cnf(c_0_49,negated_conjecture,
( ssItem(sk6(X1))
| app(sk1,X1) != sk2
| sk2 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
( nil = sk4
| nil != sk3 ),
co1_11 ).
cnf(c_0_51,negated_conjecture,
( ~ ssItem(X1)
| ~ ssList(X2)
| app(cons(X1,nil),X2) != sk5
| ~ ssItem(X3)
| ~ ssList(X4)
| app(X4,cons(X3,nil)) != sk3
| ~ lt(X3,X1) ),
co1_10 ).
cnf(c_0_52,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_18 ).
cnf(c_0_53,negated_conjecture,
sk2 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_35])]),c_0_36]) ).
cnf(c_0_54,negated_conjecture,
( sk2 = nil
| sk1 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_25]),c_0_24]) ).
cnf(c_0_55,negated_conjecture,
( app(X1,cons(X2,nil)) != sk1
| app(cons(X3,nil),X4) != sk5
| ~ lt(X2,X3)
| ~ ssItem(X2)
| ~ ssItem(X3)
| ~ ssList(X1)
| ~ ssList(X4) ),
inference(rw,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_56,negated_conjecture,
( app(sk9(X1),cons(sk8(X1),nil)) = sk1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_32])]) ).
cnf(c_0_57,negated_conjecture,
sk1 != nil,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_58,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_15 ).
cnf(c_0_59,negated_conjecture,
( app(cons(X1,nil),X2) != sk5
| app(sk1,X3) != sk2
| ~ lt(sk8(X3),X1)
| ~ ssItem(sk8(X3))
| ~ ssItem(X1)
| ~ ssList(sk9(X3))
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_60,negated_conjecture,
( app(cons(sk6(X1),nil),sk7(X1)) = X1
| sk1 = nil
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_32])]) ).
cnf(c_0_61,negated_conjecture,
( lt(sk8(X1),sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_19 ).
cnf(c_0_62,negated_conjecture,
( ssItem(sk8(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_16 ).
cnf(c_0_63,negated_conjecture,
( ssItem(sk6(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_12 ).
cnf(c_0_64,negated_conjecture,
( ssList(sk9(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_17 ).
cnf(c_0_65,negated_conjecture,
( ssList(sk7(X1))
| nil = sk1
| ~ ssList(X1)
| app(sk1,X1) != sk2
| ~ strictorderedP(sk1) ),
co1_14 ).
cnf(c_0_66,negated_conjecture,
( app(sk1,X1) != sk2
| ~ lt(sk8(X1),sk6(sk5))
| ~ ssItem(sk8(X1))
| ~ ssItem(sk6(sk5))
| ~ ssList(sk9(X1))
| ~ ssList(sk7(sk5))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_57])]),c_0_28]),c_0_29])]) ).
cnf(c_0_67,negated_conjecture,
( sk1 = nil
| lt(sk8(X1),sk6(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_32])]) ).
cnf(c_0_68,negated_conjecture,
( sk1 = nil
| ssItem(sk8(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_32])]) ).
cnf(c_0_69,negated_conjecture,
( sk1 = nil
| ssItem(sk6(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_32])]) ).
cnf(c_0_70,negated_conjecture,
( sk1 = nil
| ssList(sk9(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_32])]) ).
cnf(c_0_71,negated_conjecture,
( sk1 = nil
| ssList(sk7(X1))
| app(sk1,X1) != sk2
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_32])]) ).
cnf(c_0_72,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_66,c_0_67,c_0_68,c_0_69,c_0_70,c_0_71,c_0_57,c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC343-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.16/0.32 % Computer : n010.cluster.edu
% 0.16/0.32 % Model : x86_64 x86_64
% 0.16/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32 % Memory : 8042.1875MB
% 0.16/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32 % CPULimit : 300
% 0.16/0.32 % WCLimit : 300
% 0.16/0.32 % DateTime : Tue May 5 04:45:06 EDT 2026
% 0.16/0.32 % CPUTime :
% 0.16/0.33 % start to proof: theBenchmark
% 15.34/9.69 % Version : CSE_E---1.7
% 15.34/9.69 % Problem : theBenchmark.p
% 15.34/9.69 % SZS status Unsatisfiable for theBenchmark.p
% 15.34/9.69 % SZS output start CNFRefutation
% See solution above
% 15.44/9.75 % Total time : 7.385s
%------------------------------------------------------------------------------