%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC107-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:44:57 PM UTC 2026
% Result : Unsatisfiable 272.49s 35.05s
% Output : CNFRefutation 272.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 62
% Syntax : Number of formulae : 280 ( 46 unt; 0 def)
% Number of atoms : 807 ( 260 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 1008 ( 481 ~; 525 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 3 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-2 aty)
% Number of variables : 379 ( 40 sgn 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
cnf(clause161,axiom,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause161) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause71,axiom,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause143,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause168,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(co1_17,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_7,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause82,axiom,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause174,axiom,
( ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| frontsegP(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause174) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(clause151,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause151) ).
cnf(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_16,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(clause127,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
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(co1_13,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause117,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause117) ).
cnf(c_0_60,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_61,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
inference(fof_simplification,[status(thm)],[clause161]) ).
cnf(c_0_62,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_12 ).
cnf(c_0_63,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_64,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_65,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause71]) ).
cnf(c_0_66,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_60 ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_68,plain,
( ~ ssItem(X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ memberP(cons(X1,X2),X3)
| X3 = X1
| memberP(X2,X3) ),
c_0_61 ).
cnf(c_0_69,negated_conjecture,
( sk1 = nil
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63]),c_0_63]) ).
cnf(c_0_70,axiom,
ssList(nil),
clause8 ).
cnf(c_0_71,negated_conjecture,
( ssItem(sk5)
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_64,c_0_63]) ).
cnf(c_0_72,plain,
( ~ ssItem(X1)
| ~ memberP(nil,X1) ),
c_0_65 ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_66]) ).
cnf(c_0_74,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_67 ).
cnf(c_0_75,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_76,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_78,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| sk5 = X1
| sk1 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),c_0_71]),c_0_72]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| memberP(X1,skaf83(X1))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_84,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_85,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_77 ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_78 ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_79 ).
cnf(c_0_88,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_80 ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_91,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_81 ).
cnf(c_0_92,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_93,negated_conjecture,
( sk1 = nil
| skaf83(sk1) = sk5 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_75]),c_0_84])]) ).
cnf(c_0_94,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,tl(cons(X1,X2))) = cons(X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_87]),c_0_88]) ).
cnf(c_0_95,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_89 ).
cnf(c_0_96,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_97,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_90 ).
cnf(c_0_98,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_91]) ).
cnf(c_0_99,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_92 ).
cnf(c_0_100,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_101,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_102,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_103,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_104,negated_conjecture,
( sk1 = nil
| cons(sk5,skaf82(sk1)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_93]),c_0_84])]) ).
cnf(c_0_105,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),tl(X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_95]),c_0_96]),c_0_70])]) ).
cnf(c_0_106,negated_conjecture,
( sk1 = nil
| tl(sk1) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_69]),c_0_70])]),c_0_71]) ).
cnf(c_0_107,negated_conjecture,
( singletonP(sk1)
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_69]),c_0_84])]),c_0_71]) ).
cnf(c_0_108,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| cons(skaf44(X1),X2) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_95]),c_0_96])]) ).
cnf(c_0_109,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_100 ).
cnf(c_0_110,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_101 ).
cnf(c_0_111,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_102 ).
cnf(c_0_112,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_103 ).
cnf(c_0_113,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_114,negated_conjecture,
( sk1 = nil
| skaf82(sk1) = tl(sk1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_104]),c_0_76])]),c_0_71]) ).
cnf(c_0_115,negated_conjecture,
( sk1 = nil
| cons(skaf44(sk1),nil) = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_84])]),c_0_107]) ).
cnf(c_0_116,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ singletonP(X1)
| cons(skaf44(X1),X2) = app(app(X1,nil),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_108]),c_0_96]),c_0_70])]) ).
cnf(c_0_117,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(X1,app(X2,nil)) = app(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_70])]),c_0_111]) ).
cnf(c_0_118,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| app(nil,app(X1,X2)) = app(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_112]),c_0_70])]) ).
cnf(c_0_119,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_113 ).
cnf(c_0_120,negated_conjecture,
( sk1 = nil
| cons(skaf83(sk1),tl(sk1)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_114]),c_0_84])]) ).
cnf(c_0_121,negated_conjecture,
( sk1 = nil
| app(app(sk1,nil),nil) = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_70]),c_0_84])]),c_0_107]) ).
cnf(c_0_122,plain,
( ~ ssList(X1)
| app(X1,nil) = app(nil,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_70])]) ).
cnf(c_0_123,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,X2),nil) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_109]),c_0_70])]) ).
cnf(c_0_124,negated_conjecture,
( sk1 = nil
| cons(skaf83(sk1),nil) = sk1 ),
inference(spm,[status(thm)],[c_0_120,c_0_106]) ).
cnf(c_0_125,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_126,negated_conjecture,
( sk1 = nil
| app(app(nil,sk1),nil) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_84])]) ).
cnf(c_0_127,negated_conjecture,
( sk1 = nil
| app(sk1,nil) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_75]),c_0_70])]) ).
cnf(c_0_128,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_125 ).
cnf(c_0_129,negated_conjecture,
( sk1 = nil
| app(nil,app(sk1,nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_126]),c_0_70]),c_0_84])]) ).
cnf(c_0_130,negated_conjecture,
( ~ ssList(X1)
| sk1 = nil
| app(sk1,X1) = cons(sk5,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_69]),c_0_71]) ).
cnf(c_0_131,negated_conjecture,
( sk1 = nil
| app(nil,sk1) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_127]),c_0_84]),c_0_70])]) ).
cnf(c_0_132,negated_conjecture,
( ~ duplicatefreeP(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X1,cons(sk5,X2)),sk1) != X3
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_69]),c_0_70])]),c_0_71]) ).
cnf(c_0_133,negated_conjecture,
( sk1 = nil
| app(nil,cons(sk5,nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_70])]) ).
fof(c_0_134,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_135,negated_conjecture,
( ~ ssItem(X1)
| sk1 = nil
| app(cons(X1,nil),sk1) = cons(X1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_131]),c_0_84]),c_0_70])]) ).
cnf(c_0_136,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_9 ).
cnf(c_0_137,negated_conjecture,
( ~ duplicatefreeP(X1)
| ~ ssList(X1)
| app(sk1,sk1) != X1
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_70])]) ).
cnf(c_0_138,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_134]) ).
cnf(c_0_139,negated_conjecture,
( sk1 = nil
| cons(skaf44(sk1),sk1) = app(sk1,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_115]),c_0_96])]) ).
cnf(c_0_140,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_141,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_142,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_143,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_144,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_145,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_146,negated_conjecture,
( sk4 = nil
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_136,c_0_63]) ).
cnf(c_0_147,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_7 ).
cnf(c_0_148,negated_conjecture,
( ~ ssList(X1)
| app(sk1,sk1) != X1
| epred2_0
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_137,c_0_138]) ).
cnf(c_0_149,negated_conjecture,
( ssList(app(sk1,sk1))
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_139]),c_0_96]),c_0_84])]) ).
cnf(c_0_150,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause82]) ).
cnf(c_0_151,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
c_0_140 ).
cnf(c_0_152,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_141 ).
cnf(c_0_153,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_154,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_155,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
c_0_142 ).
cnf(c_0_156,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_157,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_143 ).
cnf(c_0_158,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_144 ).
cnf(c_0_159,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_160,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_145 ).
cnf(c_0_161,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_162,negated_conjecture,
( sk1 != nil
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_146]),c_0_70])]),c_0_147]) ).
cnf(c_0_163,negated_conjecture,
( epred2_0
| sk1 = nil ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_148]),c_0_149]) ).
cnf(c_0_164,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
c_0_150 ).
cnf(c_0_165,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| rearsegP(X1,skaf45(X1,X2)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153])])]) ).
cnf(c_0_166,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_154 ).
cnf(c_0_167,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(app(X1,X2),X2) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_151]),c_0_111]) ).
cnf(c_0_168,plain,
( ~ ssList(X1)
| app(skaf47(X1,nil),skaf48(nil,X1)) = X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_109]),c_0_70]),c_0_156])]),c_0_157]) ).
cnf(c_0_169,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_170,plain,
( ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| frontsegP(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause174]) ).
cnf(c_0_171,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_158]),c_0_111]) ).
cnf(c_0_172,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_173,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_159 ).
cnf(c_0_174,negated_conjecture,
( sk1 != nil
| neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_160,c_0_161]) ).
cnf(c_0_175,negated_conjecture,
( epred2_0
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_176,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_177,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| skaf45(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_165]),c_0_153]),c_0_70])]) ).
cnf(c_0_178,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_179,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X3,X2) != X1
| segmentP(X1,X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_109]),c_0_70])]),c_0_111]) ).
cnf(c_0_180,plain,
( ~ ssList(X1)
| rearsegP(X1,skaf48(nil,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_168]),c_0_169]),c_0_156])]) ).
cnf(c_0_181,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_182,plain,
( ~ ssItem(X1)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| frontsegP(X2,X4) ),
c_0_170 ).
cnf(c_0_183,plain,
( ~ ssList(X1)
| frontsegP(app(nil,X1),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_122]),c_0_70])]) ).
cnf(c_0_184,negated_conjecture,
( sk1 = nil
| app(nil,sk1) = cons(sk5,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_122]),c_0_70]),c_0_84])]) ).
fof(c_0_185,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_186,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_172 ).
cnf(c_0_187,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_173]) ).
cnf(c_0_188,negated_conjecture,
( neq(nil,nil)
| epred2_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_163]) ).
cnf(c_0_189,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_176 ).
cnf(c_0_190,plain,
( ~ ssList(X1)
| frontsegP(X1,skaf47(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_168]),c_0_169]),c_0_156])]) ).
cnf(c_0_191,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| app(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_177]),c_0_70])]) ).
cnf(c_0_192,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_178 ).
cnf(c_0_193,plain,
( ~ ssList(X1)
| segmentP(X1,skaf48(nil,X1)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_168]),c_0_169]),c_0_156])])]) ).
cnf(c_0_194,plain,
skaf48(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_180]),c_0_169]),c_0_70])]) ).
cnf(c_0_195,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_181 ).
cnf(c_0_196,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_197,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
inference(fof_simplification,[status(thm)],[clause151]) ).
cnf(c_0_198,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_199,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_200,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ frontsegP(cons(X3,X2),X1)
| frontsegP(X2,skaf82(X1))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_74]),c_0_75]),c_0_76])]) ).
cnf(c_0_201,negated_conjecture,
( frontsegP(cons(sk5,nil),sk1)
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_84])]) ).
cnf(c_0_202,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_186,c_0_185]),c_0_134]) ).
cnf(c_0_203,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_187,c_0_188]),c_0_70])]) ).
cnf(c_0_204,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(skaf47(X2,X3),X3))
| ~ ssItem(X1)
| ~ segmentP(X2,X3)
| app(cons(X1,app(skaf47(X2,X3),X3)),skaf48(X3,X2)) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_155]),c_0_169])]) ).
cnf(c_0_205,plain,
skaf47(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_156]),c_0_70])]) ).
cnf(c_0_206,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_192]),c_0_70])]) ).
cnf(c_0_207,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_193,c_0_194]),c_0_70])]) ).
cnf(c_0_208,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X1)
| ~ rearsegP(X3,X2)
| app(X3,X4) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_195]),c_0_196])]) ).
cnf(c_0_209,negated_conjecture,
( ~ ssList(X1)
| rearsegP(cons(sk5,X1),X1)
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_130]),c_0_84])]) ).
cnf(c_0_210,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_211,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != app(X3,X2)
| X1 = X3 ),
c_0_197 ).
cnf(c_0_212,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_198 ).
cnf(c_0_213,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_199 ).
cnf(c_0_214,negated_conjecture,
( frontsegP(nil,skaf82(sk1))
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_201]),c_0_70]),c_0_84])]),c_0_71]) ).
cnf(c_0_215,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_216,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_185]) ).
cnf(c_0_217,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_202,c_0_203])]) ).
cnf(c_0_218,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(app(cons(X1,X2),X3)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_119]),c_0_111]) ).
cnf(c_0_219,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_204,c_0_205]),c_0_206]),c_0_194]),c_0_206]),c_0_70]),c_0_70])]),c_0_207])]) ).
cnf(c_0_220,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(X2,skaf83(cons(X1,X2)))
| skaf83(cons(X1,X2)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_83]),c_0_75])]),c_0_87]),c_0_88]) ).
cnf(c_0_221,negated_conjecture,
( sk4 = nil
| tl(sk1) = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_97,c_0_146]),c_0_70])]),c_0_147]) ).
cnf(c_0_222,negated_conjecture,
( singletonP(sk1)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_146]),c_0_84])]),c_0_147]) ).
cnf(c_0_223,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_224,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ rearsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_208,c_0_109]),c_0_70])])]) ).
cnf(c_0_225,negated_conjecture,
( rearsegP(sk1,skaf82(sk1))
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_209,c_0_104]),c_0_76])]) ).
cnf(c_0_226,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_210 ).
cnf(c_0_227,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| nil != X2
| app(X1,X3) != nil
| X1 = X2 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_213]) ).
cnf(c_0_228,negated_conjecture,
( sk1 = nil
| app(skaf82(sk1),nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_191,c_0_214]),c_0_76])]) ).
cnf(c_0_229,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_230,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_215 ).
cnf(c_0_231,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_232,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_233,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_216,c_0_217]) ).
cnf(c_0_234,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_218,c_0_219]),c_0_70])]) ).
cnf(c_0_235,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| X1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_95]),c_0_96]),c_0_70])]) ).
cnf(c_0_236,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_166]) ).
cnf(c_0_237,plain,
( ~ ssItem(X1)
| skaf83(cons(X1,nil)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_220]),c_0_75]),c_0_70])]) ).
cnf(c_0_238,negated_conjecture,
( sk4 = nil
| cons(skaf44(sk1),nil) = sk1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_221]),c_0_84])]),c_0_222]) ).
cnf(c_0_239,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
c_0_223 ).
cnf(c_0_240,negated_conjecture,
( segmentP(sk1,skaf82(sk1))
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_84]),c_0_76])]) ).
cnf(c_0_241,negated_conjecture,
( skaf82(sk1) != sk1
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_226,c_0_104]),c_0_76])]),c_0_71]) ).
cnf(c_0_242,negated_conjecture,
( ~ ssList(X1)
| nil != X1
| sk1 = nil
| skaf82(sk1) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_70]),c_0_76])]) ).
cnf(c_0_243,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_229,c_0_161]) ).
cnf(c_0_244,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ neq(sk1,nil)
| sk4 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_230,c_0_161]),c_0_161]) ).
cnf(c_0_245,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_231 ).
cnf(c_0_246,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X1)
| app(X3,app(X2,X4)) != X1
| segmentP(X1,X2) ),
inference(spm,[status(thm)],[c_0_166,c_0_110]) ).
cnf(c_0_247,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_232 ).
cnf(c_0_248,plain,
app(cons(X1,nil),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_219,c_0_233])]) ).
cnf(c_0_249,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_234,c_0_233])]) ).
cnf(c_0_250,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(spm,[status(thm)],[c_0_235,c_0_98]) ).
cnf(c_0_251,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_112]),c_0_70])]),c_0_111]) ).
cnf(c_0_252,plain,
( ~ ssList(X2)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_233])]) ).
cnf(c_0_253,negated_conjecture,
( sk4 = nil
| skaf44(sk1) = skaf83(sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_237,c_0_238]),c_0_96])]) ).
cnf(c_0_254,negated_conjecture,
( ~ segmentP(skaf82(sk1),sk1)
| sk1 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_84]),c_0_76])]),c_0_241]) ).
cnf(c_0_255,negated_conjecture,
( sk4 != nil
| sk1 = nil
| skaf82(sk1) = sk4 ),
inference(spm,[status(thm)],[c_0_242,c_0_243]) ).
cnf(c_0_256,negated_conjecture,
( ~ segmentP(sk4,sk1)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_84]),c_0_70])]),c_0_162]) ).
cnf(c_0_257,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,cons(sk5,X3)) != X1
| segmentP(X1,sk1)
| sk1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_246,c_0_130]),c_0_84])]) ).
cnf(c_0_258,plain,
( ~ ssList(X1)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_247,c_0_233])]) ).
cnf(c_0_259,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_260,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_261,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
co1_13 ).
cnf(c_0_262,plain,
rearsegP(cons(X1,nil),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_248]),c_0_70]),c_0_249])]) ).
cnf(c_0_263,plain,
( ~ ssItem(X1)
| cons(X1,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_250,c_0_87]),c_0_70])]) ).
cnf(c_0_264,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause117]) ).
cnf(c_0_265,plain,
( ~ ssList(X2)
| segmentP(cons(X1,X2),cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_251,c_0_252]),c_0_249])]) ).
cnf(c_0_266,negated_conjecture,
( sk4 = nil
| cons(skaf83(sk1),nil) = sk1 ),
inference(spm,[status(thm)],[c_0_238,c_0_253]) ).
cnf(c_0_267,negated_conjecture,
( ~ segmentP(sk4,sk1)
| sk1 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_254,c_0_255]),c_0_256]) ).
cnf(c_0_268,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk1)
| sk1 = nil ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_257,c_0_258]),c_0_259]),c_0_260])])]) ).
cnf(c_0_269,negated_conjecture,
( memberP(sk4,sk5)
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_261,c_0_63]) ).
cnf(c_0_270,plain,
segmentP(cons(X1,nil),nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_262]),c_0_249]),c_0_70])]) ).
cnf(c_0_271,plain,
cons(X1,nil) != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_263,c_0_233])]) ).
cnf(c_0_272,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_264 ).
cnf(c_0_273,negated_conjecture,
( segmentP(sk1,cons(skaf83(sk1),nil))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_265,c_0_266]),c_0_70])]) ).
cnf(c_0_274,negated_conjecture,
sk1 = nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_267,c_0_268]),c_0_243])]),c_0_269]) ).
cnf(c_0_275,plain,
~ segmentP(nil,cons(X1,nil)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_270]),c_0_249]),c_0_70])]),c_0_271]) ).
cnf(c_0_276,plain,
( ~ ssItem(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_272]) ).
cnf(c_0_277,negated_conjecture,
sk4 = nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_273,c_0_274]),c_0_274]),c_0_275]) ).
cnf(c_0_278,plain,
~ neq(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_276,c_0_233])]) ).
cnf(c_0_279,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_174,c_0_274])]),c_0_277]),c_0_278]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC107-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n004.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:55:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 272.49/35.05 % Version: 3.5.1
% 272.49/35.05 % Preprocessing class: FSLSSMSMSSSNFFN.
% 272.49/35.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.49/35.05 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 272.49/35.05 % Starting new_bool_3 with 300s (1) cores
% 272.49/35.05 % Starting new_bool_1 with 300s (1) cores
% 272.49/35.05 % Starting sh5l with 300s (1) cores
% 272.49/35.05 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2650090 completed with status 0
% 272.49/35.05 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 272.49/35.05 % Preprocessing class: FSLSSMSMSSSNFFN.
% 272.49/35.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.49/35.05 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 272.49/35.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 272.49/35.05 % No SInE strategy applied
% 272.49/35.05 % Search class: FGHSM-FSLM21-MFFFFFNN
% 272.49/35.05 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 272.49/35.05 % Starting SubtermCWHack with 136s (1) cores
% 272.49/35.05 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 272.49/35.05 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 272.49/35.05 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 272.49/35.05 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 272.49/35.05 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2650099 completed with status 0
% 272.49/35.05 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 272.49/35.05 % Preprocessing class: FSLSSMSMSSSNFFN.
% 272.49/35.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 272.49/35.05 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 272.49/35.05 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 272.49/35.05 % No SInE strategy applied
% 272.49/35.05 % Search class: FGHSM-FSLM21-MFFFFFNN
% 272.49/35.05 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 272.49/35.05 % Starting SubtermCWHack with 136s (1) cores
% 272.49/35.05 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 272.49/35.05 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 272.49/35.05 % Preprocessing time : 0.002 s
% 272.49/35.05 % Presaturation interreduction done
% 272.49/35.05
% 272.49/35.05 % Proof found!
% 272.49/35.05 % SZS status Unsatisfiable
% 272.49/35.05 % SZS output start CNFRefutation
% See solution above
% 272.49/35.05 % Parsed axioms : 203
% 272.49/35.05 % Removed by relevancy pruning/SinE : 0
% 272.49/35.05 % Initial clauses : 203
% 272.49/35.05 % Removed in clause preprocessing : 0
% 272.49/35.05 % Initial clauses in saturation : 203
% 272.49/35.05 % Processed clauses : 41371
% 272.49/35.05 % ...of these trivial : 928
% 272.49/35.05 % ...subsumed : 33678
% 272.49/35.05 % ...remaining for further processing : 6764
% 272.49/35.05 % Other redundant clauses eliminated : 12116
% 272.49/35.05 % Clauses deleted for lack of memory : 0
% 272.49/35.05 % Backward-subsumed : 584
% 272.49/35.05 % Backward-rewritten : 2941
% 272.49/35.05 % Generated clauses : 1131069
% 272.49/35.05 % ...of the previous two non-redundant : 1087014
% 272.49/35.05 % ...aggressively subsumed : 0
% 272.49/35.05 % Contextual simplify-reflections : 1864
% 272.49/35.05 % Paramodulations : 1118021
% 272.49/35.05 % Factorizations : 0
% 272.49/35.05 % NegExts : 0
% 272.49/35.05 % Equation resolutions : 12897
% 272.49/35.05 % Disequality decompositions : 0
% 272.49/35.05 % Total rewrite steps : 725707
% 272.49/35.05 % ...of those cached : 715418
% 272.49/35.05 % Propositional unsat checks : 0
% 272.49/35.05 % Propositional check models : 0
% 272.49/35.05 % Propositional check unsatisfiable : 0
% 272.49/35.05 % Propositional clauses : 0
% 272.49/35.05 % Propositional clauses after purity: 0
% 272.49/35.05 % Propositional unsat core size : 0
% 272.49/35.05 % Propositional preprocessing time : 0.000
% 272.49/35.05 % Propositional encoding time : 0.000
% 272.49/35.05 % Propositional solver time : 0.000
% 272.49/35.05 % Success case prop preproc time : 0.000
% 272.49/35.05 % Success case prop encoding time : 0.000
% 272.49/35.05 % Success case prop solver time : 0.000
% 272.49/35.05 % Current number of processed clauses : 2960
% 272.49/35.05 % Positive orientable unit clauses : 97
% 272.49/35.05 % Positive unorientable unit clauses: 0
% 272.49/35.05 % Negative unit clauses : 94
% 272.49/35.05 % Non-unit-clauses : 2769
% 272.49/35.05 % Current number of unprocessed clauses: 1037630
% 272.49/35.05 % ...number of literals in the above : 9437955
% 272.49/35.05 % Current number of archived formulas : 0
% 272.49/35.05 % Current number of archived clauses : 3725
% 272.49/35.05 % Clause-clause subsumption calls (NU) : 5672765
% 272.49/35.05 % Rec. Clause-clause subsumption calls : 1189726
% 272.49/35.05 % Non-unit clause-clause subsumptions : 34331
% 272.49/35.05 % Unit Clause-clause subsumption calls : 204426
% 272.49/35.05 % Rewrite failures with RHS unbound : 0
% 272.49/35.05 % BW rewrite match attempts : 123
% 272.49/35.05 % BW rewrite match successes : 77
% 272.49/35.05 % Condensation attempts : 0
% 272.49/35.05 % Condensation successes : 0
% 272.49/35.05 % Termbank termtop insertions : 31394303
% 272.49/35.05 % Search garbage collected termcells : 548
% 272.49/35.05
% 272.49/35.05 % -------------------------------------------------
% 272.49/35.05 % User time : 33.037 s
% 272.49/35.05 % System time : 0.929 s
% 272.49/35.05 % Total time : 33.965 s
% 272.49/35.05 % Maximum resident set size: 4072 pages
% 272.49/35.05
% 272.49/35.05 % -------------------------------------------------
% 272.49/35.05 % User time : 165.498 s
% 272.49/35.05 % System time : 5.226 s
% 272.49/35.05 % Total time : 170.724 s
% 272.49/35.05 % Maximum resident set size: 5120 pages
% 272.49/35.05 % E exiting
%------------------------------------------------------------------------------