TSTP Solution File: SWC099-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC099-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 21 04:23:19 EDT 2024
% Result : Unsatisfiable 15.19s 2.37s
% Output : CNFRefutation 15.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 56
% Syntax : Number of clauses : 224 ( 53 unt; 44 nHn; 195 RR)
% Number of literals : 656 ( 180 equ; 416 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-2 aty)
% Number of variables : 343 ( 44 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause84,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
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(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause136,axiom,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause136) ).
cnf(clause58,axiom,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
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(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
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(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
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(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
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(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause171,axiom,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause171) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
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(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(co1_9,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
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(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(clause117,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(co1_12,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_56,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_57,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
cnf(c_0_58,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_59,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_60,negated_conjecture,
( nil = sk2
| ~ neq(sk1,nil)
| ~ frontsegP(sk2,sk1) ),
c_0_56 ).
cnf(c_0_61,negated_conjecture,
frontsegP(sk2,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_62,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_63,negated_conjecture,
( sk2 = nil
| ~ neq(sk1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_61])]) ).
cnf(c_0_64,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_62 ).
cnf(c_0_65,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_66,axiom,
ssList(nil),
clause8 ).
cnf(c_0_67,plain,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_68,negated_conjecture,
( sk1 = nil
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]),c_0_66])]) ).
cnf(c_0_69,plain,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
c_0_67 ).
cnf(c_0_70,negated_conjecture,
( sk1 = nil
| frontsegP(nil,sk1) ),
inference(spm,[status(thm)],[c_0_61,c_0_68]) ).
cnf(c_0_71,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_72,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_65])]) ).
cnf(c_0_73,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_74,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
frontsegP(sk2,nil),
inference(rw,[status(thm)],[c_0_61,c_0_72]) ).
cnf(c_0_76,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_77,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_78,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
app(nil,skaf45(sk2,nil)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_66]),c_0_76])]) ).
cnf(c_0_80,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_81,plain,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
c_0_77 ).
cnf(c_0_82,negated_conjecture,
skaf45(sk2,nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])]) ).
cnf(c_0_83,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_81]) ).
cnf(c_0_84,negated_conjecture,
app(nil,sk2) = sk2,
inference(rw,[status(thm)],[c_0_79,c_0_82]) ).
cnf(c_0_85,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_86,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_87,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_88,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_89,negated_conjecture,
( segmentP(app(sk2,X1),sk2)
| ~ ssList(app(sk2,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_76]),c_0_66])]) ).
cnf(c_0_90,plain,
( app(X1,nil) = X1
| ~ ssList(X1) ),
c_0_85 ).
cnf(c_0_91,plain,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_86 ).
cnf(c_0_92,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_93,plain,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_88 ).
cnf(c_0_94,negated_conjecture,
segmentP(sk2,sk2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_76]),c_0_66])]) ).
cnf(c_0_95,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_91]),c_0_92]) ).
cnf(c_0_96,negated_conjecture,
app(app(skaf47(sk2,sk2),sk2),skaf48(sk2,sk2)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_94]),c_0_76])]) ).
cnf(c_0_97,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_98,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_99,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_100,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_101,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_102,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause136]) ).
cnf(c_0_103,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_104,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_105,negated_conjecture,
( rearsegP(sk2,skaf48(sk2,sk2))
| ~ ssList(app(skaf47(sk2,sk2),sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_96]),c_0_97])]) ).
cnf(c_0_106,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_107,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_98 ).
cnf(c_0_108,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_99 ).
cnf(c_0_109,plain,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_100 ).
cnf(c_0_110,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_101 ).
cnf(c_0_111,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause133]) ).
cnf(c_0_112,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_113,plain,
( rearsegP(app(X3,X1),X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_102 ).
cnf(c_0_114,plain,
( rearsegP(X1,nil)
| ~ ssList(X1) ),
c_0_103 ).
cnf(c_0_115,plain,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_104 ).
cnf(c_0_116,negated_conjecture,
rearsegP(sk2,skaf48(sk2,sk2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_92]),c_0_106]),c_0_76])]) ).
cnf(c_0_117,plain,
( nil = X1
| tl(X1) != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110]) ).
cnf(c_0_118,plain,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_111 ).
cnf(c_0_119,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_112 ).
cnf(c_0_120,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_121,plain,
( rearsegP(app(X1,X2),nil)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_114]),c_0_66])]) ).
cnf(c_0_122,negated_conjecture,
app(skaf46(sk2,skaf48(sk2,sk2)),skaf48(sk2,sk2)) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_97]),c_0_76])]) ).
cnf(c_0_123,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_124,plain,
( nil = X1
| app(tl(X1),X2) != app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_92]),c_0_119]) ).
cnf(c_0_125,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_126,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_127,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_128,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_129,plain,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_120 ).
cnf(c_0_130,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_131,negated_conjecture,
rearsegP(sk2,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_123]),c_0_97])]) ).
cnf(c_0_132,plain,
( nil = X1
| tl(X1) != app(X1,nil)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_90]),c_0_66])]),c_0_109]) ).
cnf(c_0_133,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_125 ).
cnf(c_0_134,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_126 ).
cnf(c_0_135,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_127 ).
cnf(c_0_136,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_137,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_128 ).
cnf(c_0_138,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_139,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_129]) ).
cnf(c_0_140,plain,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_130 ).
cnf(c_0_141,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_142,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_143,negated_conjecture,
app(skaf46(sk2,nil),nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_131]),c_0_66]),c_0_76])]) ).
cnf(c_0_144,plain,
( app(cons(X1,X2),nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_134]),c_0_135]) ).
cnf(c_0_145,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_136 ).
cnf(c_0_146,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_147,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_137]) ).
cnf(c_0_148,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
c_0_138 ).
cnf(c_0_149,plain,
( nil = X1
| memberP(X1,skaf83(X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_141]),c_0_142])]) ).
cnf(c_0_150,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_151,negated_conjecture,
skaf46(sk2,nil) = sk2,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_143]),c_0_123])]) ).
cnf(c_0_152,plain,
( cons(X1,app(X2,nil)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_66])]) ).
cnf(c_0_153,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_146 ).
cnf(c_0_154,plain,
( nil = X1
| ~ ssList(app(app(X2,cons(skaf83(X1),X3)),X1))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(app(app(X2,cons(skaf83(X1),X3)),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_140]),c_0_141]),c_0_142])]) ).
cnf(c_0_155,plain,
( app(skaf42(X1,skaf83(X1)),cons(skaf83(X1),skaf43(skaf83(X1),X1))) = X1
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_141])]) ).
cnf(c_0_156,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_157,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_158,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_159,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause171]) ).
cnf(c_0_160,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_150 ).
cnf(c_0_161,negated_conjecture,
app(sk2,nil) = sk2,
inference(rw,[status(thm)],[c_0_143,c_0_151]) ).
cnf(c_0_162,plain,
( cons(X1,app(X2,app(X3,nil))) != app(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_153]),c_0_66])]),c_0_92]) ).
cnf(c_0_163,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_164,plain,
( nil = X1
| ~ ssList(app(X1,X1))
| ~ ssList(X1)
| ~ duplicatefreeP(app(X1,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_155]),c_0_156]),c_0_157])]) ).
cnf(c_0_165,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_158 ).
cnf(c_0_166,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_167,plain,
( X4 = X2
| cons(X1,X2) != cons(X3,X4)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X4)
| ~ ssList(X2) ),
c_0_159 ).
cnf(c_0_168,plain,
( cons(hd(X1),tl(app(X1,X2))) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_160]),c_0_92]),c_0_119]) ).
cnf(c_0_169,plain,
( nil = X1
| ssList(app(tl(X1),X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_118]),c_0_92]),c_0_119]) ).
cnf(c_0_170,negated_conjecture,
( app(tl(sk2),nil) = tl(sk2)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_161]),c_0_76]),c_0_66])]) ).
cnf(c_0_171,plain,
( cons(X1,app(X2,nil)) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(app(X2,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_78]),c_0_66])]) ).
cnf(c_0_172,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_163 ).
cnf(c_0_173,plain,
( nil = X1
| ssItem(X2)
| ~ ssList(app(X1,X1))
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_174,plain,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_166 ).
cnf(c_0_175,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_176,plain,
( skaf82(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_140]),c_0_141]),c_0_142])])]),c_0_134]),c_0_135]) ).
cnf(c_0_177,negated_conjecture,
( cons(hd(sk2),tl(sk2)) = sk2
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_161]),c_0_76]),c_0_66])]) ).
cnf(c_0_178,negated_conjecture,
( sk2 = nil
| ssList(tl(sk2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_170]),c_0_76]),c_0_66])]) ).
cnf(c_0_179,plain,
( cons(X1,X2) != app(nil,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_171,c_0_90]) ).
cnf(c_0_180,plain,
( app(nil,skaf45(X1,nil)) = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_172]),c_0_66])]) ).
cnf(c_0_181,plain,
( nil = X1
| ssItem(X2)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_173,c_0_92]) ).
cnf(c_0_182,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_145]),c_0_134]) ).
cnf(c_0_183,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_174])]),c_0_66])]) ).
cnf(c_0_184,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_185,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_175 ).
cnf(c_0_186,negated_conjecture,
( skaf82(sk2) = tl(sk2)
| sk2 = nil
| ~ ssItem(hd(sk2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_178]) ).
cnf(c_0_187,plain,
( cons(X1,skaf45(X2,nil)) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_80])]) ).
cnf(c_0_188,plain,
( skaf45(X1,X2) = nil
| ssItem(X3) ),
inference(spm,[status(thm)],[c_0_181,c_0_80]) ).
cnf(c_0_189,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_66])]) ).
cnf(c_0_190,negated_conjecture,
( ~ ssList(X1)
| ~ neq(sk3,X1)
| ~ frontsegP(sk4,X1)
| ~ segmentP(X1,sk3)
| ~ equalelemsP(X1) ),
c_0_184 ).
cnf(c_0_191,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_192,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_185]) ).
cnf(c_0_193,negated_conjecture,
( skaf82(sk2) = tl(sk2)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_186,c_0_110]),c_0_76])]) ).
cnf(c_0_194,plain,
( ssItem(X1)
| ~ ssItem(X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188])]),c_0_189]) ).
cnf(c_0_195,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_196,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_197,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_198,negated_conjecture,
( ~ neq(sk1,X1)
| ~ frontsegP(sk2,X1)
| ~ segmentP(X1,sk1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_190,c_0_59]),c_0_58]),c_0_59]) ).
cnf(c_0_199,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_191 ).
cnf(c_0_200,plain,
( frontsegP(cons(X1,X2),cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_172]),c_0_66])]) ).
cnf(c_0_201,negated_conjecture,
( cons(skaf83(sk2),tl(sk2)) = sk2
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_193]),c_0_76])]) ).
cnf(c_0_202,plain,
ssItem(X1),
inference(spm,[status(thm)],[c_0_194,c_0_195]) ).
cnf(c_0_203,plain,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_196 ).
cnf(c_0_204,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_205,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_197 ).
cnf(c_0_206,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_207,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_208,negated_conjecture,
( ~ neq(nil,X1)
| ~ frontsegP(sk2,X1)
| ~ ssList(X1)
| ~ equalelemsP(X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_198,c_0_72]),c_0_72]),c_0_199]) ).
cnf(c_0_209,negated_conjecture,
( sk2 = nil
| frontsegP(sk2,cons(skaf83(sk2),nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_201]),c_0_141])]),c_0_178]) ).
cnf(c_0_210,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_189,c_0_202])]) ).
cnf(c_0_211,plain,
equalelemsP(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_203,c_0_202])]) ).
cnf(c_0_212,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_204 ).
cnf(c_0_213,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_205]),c_0_66])]) ).
cnf(c_0_214,plain,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
c_0_206 ).
cnf(c_0_215,negated_conjecture,
( neq(sk2,nil)
| nil != sk1 ),
c_0_207 ).
cnf(c_0_216,negated_conjecture,
( sk2 = nil
| ~ neq(nil,cons(skaf83(sk2),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_208,c_0_209]),c_0_210]),c_0_211])]) ).
cnf(c_0_217,plain,
( X1 = X2
| neq(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_202]),c_0_202])]) ).
cnf(c_0_218,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_213,c_0_202])]) ).
cnf(c_0_219,plain,
( ~ neq(X1,X1)
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_214]) ).
cnf(c_0_220,negated_conjecture,
neq(sk2,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_215,c_0_72])]) ).
cnf(c_0_221,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_217]),c_0_218]) ).
cnf(c_0_222,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_202])]) ).
cnf(c_0_223,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_220,c_0_221]),c_0_222]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC099-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.09 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n004.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Sun May 19 03:15:53 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.14/0.40 Running first-order theorem proving
% 0.14/0.40 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.19/2.37 # Version: 3.1.0
% 15.19/2.37 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.19/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.19/2.37 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.19/2.37 # Starting new_bool_3 with 300s (1) cores
% 15.19/2.37 # Starting new_bool_1 with 300s (1) cores
% 15.19/2.37 # Starting sh5l with 300s (1) cores
% 15.19/2.37 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 9342 completed with status 0
% 15.19/2.37 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 15.19/2.37 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.19/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.19/2.37 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.19/2.37 # No SInE strategy applied
% 15.19/2.37 # Search class: FGHSM-FSLM21-MFFFFFNN
% 15.19/2.37 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 15.19/2.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 15.19/2.37 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 15.19/2.37 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 15.19/2.37 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 15.19/2.37 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 15.19/2.37 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 9348 completed with status 0
% 15.19/2.37 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 15.19/2.37 # Preprocessing class: FSLSSMSSSSSNFFN.
% 15.19/2.37 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.19/2.37 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 15.19/2.37 # No SInE strategy applied
% 15.19/2.37 # Search class: FGHSM-FSLM21-MFFFFFNN
% 15.19/2.37 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 15.19/2.37 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 15.19/2.37 # Preprocessing time : 0.002 s
% 15.19/2.37 # Presaturation interreduction done
% 15.19/2.37
% 15.19/2.37 # Proof found!
% 15.19/2.37 # SZS status Unsatisfiable
% 15.19/2.37 # SZS output start CNFRefutation
% See solution above
% 15.19/2.37 # Parsed axioms : 198
% 15.19/2.37 # Removed by relevancy pruning/SinE : 0
% 15.19/2.37 # Initial clauses : 198
% 15.19/2.37 # Removed in clause preprocessing : 0
% 15.19/2.37 # Initial clauses in saturation : 198
% 15.19/2.37 # Processed clauses : 13625
% 15.19/2.37 # ...of these trivial : 85
% 15.19/2.37 # ...subsumed : 10678
% 15.19/2.37 # ...remaining for further processing : 2862
% 15.19/2.37 # Other redundant clauses eliminated : 807
% 15.19/2.37 # Clauses deleted for lack of memory : 0
% 15.19/2.37 # Backward-subsumed : 97
% 15.19/2.37 # Backward-rewritten : 1215
% 15.19/2.37 # Generated clauses : 69904
% 15.19/2.37 # ...of the previous two non-redundant : 66201
% 15.19/2.37 # ...aggressively subsumed : 0
% 15.19/2.37 # Contextual simplify-reflections : 482
% 15.19/2.37 # Paramodulations : 69075
% 15.19/2.37 # Factorizations : 2
% 15.19/2.37 # NegExts : 0
% 15.19/2.37 # Equation resolutions : 828
% 15.19/2.37 # Disequality decompositions : 0
% 15.19/2.37 # Total rewrite steps : 72564
% 15.19/2.37 # ...of those cached : 71637
% 15.19/2.37 # Propositional unsat checks : 0
% 15.19/2.37 # Propositional check models : 0
% 15.19/2.37 # Propositional check unsatisfiable : 0
% 15.19/2.37 # Propositional clauses : 0
% 15.19/2.37 # Propositional clauses after purity: 0
% 15.19/2.37 # Propositional unsat core size : 0
% 15.19/2.37 # Propositional preprocessing time : 0.000
% 15.19/2.37 # Propositional encoding time : 0.000
% 15.19/2.37 # Propositional solver time : 0.000
% 15.19/2.37 # Success case prop preproc time : 0.000
% 15.19/2.37 # Success case prop encoding time : 0.000
% 15.19/2.37 # Success case prop solver time : 0.000
% 15.19/2.37 # Current number of processed clauses : 1337
% 15.19/2.37 # Positive orientable unit clauses : 96
% 15.19/2.37 # Positive unorientable unit clauses: 0
% 15.19/2.37 # Negative unit clauses : 36
% 15.19/2.37 # Non-unit-clauses : 1205
% 15.19/2.37 # Current number of unprocessed clauses: 50764
% 15.19/2.37 # ...number of literals in the above : 285186
% 15.19/2.37 # Current number of archived formulas : 0
% 15.19/2.37 # Current number of archived clauses : 1502
% 15.19/2.37 # Clause-clause subsumption calls (NU) : 815966
% 15.19/2.37 # Rec. Clause-clause subsumption calls : 182531
% 15.19/2.37 # Non-unit clause-clause subsumptions : 7923
% 15.19/2.37 # Unit Clause-clause subsumption calls : 4586
% 15.19/2.37 # Rewrite failures with RHS unbound : 0
% 15.19/2.37 # BW rewrite match attempts : 90
% 15.19/2.37 # BW rewrite match successes : 67
% 15.19/2.37 # Condensation attempts : 0
% 15.19/2.37 # Condensation successes : 0
% 15.19/2.37 # Termbank termtop insertions : 1436756
% 15.19/2.37 # Search garbage collected termcells : 549
% 15.19/2.37
% 15.19/2.37 # -------------------------------------------------
% 15.19/2.37 # User time : 1.838 s
% 15.19/2.37 # System time : 0.058 s
% 15.19/2.37 # Total time : 1.896 s
% 15.19/2.37 # Maximum resident set size: 2148 pages
% 15.19/2.37
% 15.19/2.37 # -------------------------------------------------
% 15.19/2.37 # User time : 9.170 s
% 15.19/2.37 # System time : 0.348 s
% 15.19/2.37 # Total time : 9.519 s
% 15.19/2.37 # Maximum resident set size: 1876 pages
% 15.19/2.37 % E---3.1 exiting
% 15.19/2.37 % E exiting
%------------------------------------------------------------------------------