%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWC244-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 : n005.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:18:52 PM UTC 2026
% Result : Unsatisfiable 27.74s 16.34s
% Output : CNFRefutation 27.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 28
% Syntax : Number of clauses : 95 ( 43 unt; 18 nHn; 83 RR)
% Number of literals : 205 ( 65 equ; 104 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-3 aty)
% Number of variables : 94 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
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(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause179,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_12,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(c_0_28,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_29,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_30,negated_conjecture,
nil != sk1,
co1_9 ).
cnf(c_0_31,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_32,negated_conjecture,
ssItem(hd(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,negated_conjecture,
( app(cons(hd(sk1),nil),X1) = cons(hd(sk1),X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_38,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_39,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_40,negated_conjecture,
app(cons(hd(sk1),nil),sk4) = cons(hd(sk1),sk4),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_42,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_43,negated_conjecture,
frontsegP(sk4,sk1),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_45,negated_conjecture,
( ssList(cons(hd(sk1),sk4))
| ~ ssList(cons(hd(sk1),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_36])]) ).
cnf(c_0_46,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_47,negated_conjecture,
( cons(skaf83(sk4),skaf82(sk4)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_41,c_0_36]) ).
cnf(c_0_48,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_49,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_50,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_51,negated_conjecture,
app(sk1,skaf45(sk4,sk1)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_29]),c_0_36])]) ).
cnf(c_0_52,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_53,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_54,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_55,negated_conjecture,
( frontsegP(cons(hd(sk1),sk4),nil)
| ~ ssList(cons(hd(sk1),nil)) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_56,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_57,axiom,
ssList(nil),
clause8 ).
cnf(c_0_58,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_59,negated_conjecture,
( skaf83(sk4) = hd(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_60,negated_conjecture,
sk4 != nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_29])]),c_0_30]) ).
cnf(c_0_61,negated_conjecture,
hd(sk4) = hd(sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_29]),c_0_52])]),c_0_30]) ).
cnf(c_0_62,negated_conjecture,
( skaf82(sk4) = tl(sk4)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_47]),c_0_48]),c_0_49])]) ).
cnf(c_0_63,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_64,negated_conjecture,
frontsegP(cons(hd(sk1),sk4),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_32]),c_0_57])]) ).
cnf(c_0_65,plain,
app(nil,skaf45(X1,X2)) = skaf45(X1,X2),
inference(spm,[status(thm)],[c_0_58,c_0_52]) ).
cnf(c_0_66,axiom,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
clause179 ).
cnf(c_0_67,negated_conjecture,
skaf83(sk4) = hd(sk1),
inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_68,negated_conjecture,
skaf82(sk4) = tl(sk4),
inference(sr,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
( sk4 = nil
| ssList(tl(sk4)) ),
inference(spm,[status(thm)],[c_0_63,c_0_36]) ).
cnf(c_0_70,plain,
( app(nil,cons(X1,X2)) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_58,c_0_56]) ).
cnf(c_0_71,negated_conjecture,
( skaf45(cons(hd(sk1),sk4),nil) = cons(hd(sk1),sk4)
| ~ ssList(cons(hd(sk1),sk4)) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_64]),c_0_57])]),c_0_65]) ).
cnf(c_0_72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_73,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_74,negated_conjecture,
cons(hd(sk1),tl(sk4)) = sk4,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[c_0_47,c_0_60]),c_0_67]),c_0_68]) ).
cnf(c_0_75,negated_conjecture,
ssList(tl(sk4)),
inference(sr,[status(thm)],[c_0_69,c_0_60]) ).
cnf(c_0_76,negated_conjecture,
( app(nil,cons(hd(sk1),X1)) = cons(hd(sk1),X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_70,c_0_32]) ).
cnf(c_0_77,negated_conjecture,
skaf45(cons(hd(sk1),sk4),nil) = cons(hd(sk1),sk4),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_56]),c_0_32]),c_0_36])]) ).
cnf(c_0_78,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(hd(sk1),sk4))
| ~ ssList(cons(hd(sk1),nil)) ),
inference(spm,[status(thm)],[c_0_72,c_0_45]) ).
cnf(c_0_79,negated_conjecture,
( ~ ssList(app(app(X1,cons(hd(sk1),X2)),sk4))
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X1,cons(hd(sk1),X2)),sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_32]),c_0_75])]) ).
cnf(c_0_80,negated_conjecture,
app(nil,cons(hd(sk1),nil)) = cons(hd(sk1),nil),
inference(spm,[status(thm)],[c_0_76,c_0_57]) ).
cnf(c_0_81,negated_conjecture,
ssList(cons(hd(sk1),sk4)),
inference(spm,[status(thm)],[c_0_52,c_0_77]) ).
cnf(c_0_82,negated_conjecture,
( ssItem(X1)
| duplicatefreeP(cons(hd(sk1),sk4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_56]),c_0_32]),c_0_57])]) ).
cnf(c_0_83,negated_conjecture,
~ duplicatefreeP(cons(hd(sk1),sk4)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_40]),c_0_81]),c_0_57]),c_0_40])]) ).
cnf(c_0_84,negated_conjecture,
( memberP(X2,sk5(X3,X2,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,cons(X1,nil)),X3) != sk1 ),
co1_12 ).
cnf(c_0_85,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_82,c_0_83]) ).
cnf(c_0_86,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_87,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_88,negated_conjecture,
( memberP(X1,sk5(X2,X1,X3))
| app(app(X1,cons(X3,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).
cnf(c_0_89,plain,
~ memberP(nil,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_85])]) ).
cnf(c_0_90,negated_conjecture,
ssList(tl(sk1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_29]),c_0_30]) ).
cnf(c_0_91,negated_conjecture,
cons(hd(sk1),tl(sk1)) = sk1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_29]),c_0_30]) ).
cnf(c_0_92,negated_conjecture,
( app(cons(hd(sk1),nil),X1) != sk1
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_80]),c_0_57])]),c_0_89]) ).
cnf(c_0_93,negated_conjecture,
app(cons(hd(sk1),nil),tl(sk1)) = sk1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_90]),c_0_91]) ).
cnf(c_0_94,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_90]),c_0_93])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC244-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.17/0.33 % Computer : n005.cluster.edu
% 0.17/0.33 % Model : x86_64 x86_64
% 0.17/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.33 % Memory : 8042.1875MB
% 0.17/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.33 % CPULimit : 300
% 0.17/0.33 % WCLimit : 300
% 0.17/0.33 % DateTime : Tue May 5 04:38:30 EDT 2026
% 0.17/0.33 % CPUTime :
% 0.17/0.34 % start to proof: theBenchmark
% 27.74/16.34 % Version : CSE_E---1.7
% 27.74/16.34 % Problem : theBenchmark.p
% 27.74/16.34 % SZS status Unsatisfiable for theBenchmark.p
% 27.74/16.34 % SZS output start CNFRefutation
% See solution above
% 27.84/16.45 % Total time : 12.397s
%------------------------------------------------------------------------------