TSTP Solution File: SWC329-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC329-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:40:27 EDT 2023
% Result : Unsatisfiable 1627.20s 205.05s
% Output : CNFRefutation 1627.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 33
% Number of leaves : 67
% Syntax : Number of formulae : 260 ( 54 unt; 0 def)
% Number of atoms : 741 ( 218 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 914 ( 433 ~; 479 |; 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 : 349 ( 35 sgn; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause73) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause149) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause85) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause74) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause144) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause120) ).
cnf(co1_12,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_12) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_6) ).
cnf(clause143,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause143) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause51) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause138) ).
cnf(clause82,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause82) ).
cnf(clause174,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause174) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause13) ).
cnf(clause161,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause71) ).
cnf(clause151,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause151) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause145) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause119) ).
cnf(clause137,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause137) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_5) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause96) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause140) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause98) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause47) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause116) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause157) ).
cnf(co1_13,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_13) ).
cnf(clause172,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause172) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause86) ).
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_15) ).
cnf(co1_9,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_9) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_7) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause1) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause79) ).
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/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause179) ).
cnf(clause168,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause168) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause49) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause56) ).
cnf(clause173,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause173) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause48) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause72) ).
cnf(clause84,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause84) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause60) ).
cnf(clause131,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause131) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause50) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause150) ).
cnf(clause97,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause97) ).
cnf(clause176,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause176) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause104) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause75) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause76) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause64) ).
cnf(clause169,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause169) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause53) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',clause52) ).
cnf(co1_10,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.PttnVXPFV7/E---3.1_8550.p',co1_10) ).
cnf(c_0_65,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_66,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_67,axiom,
ssList(nil),
clause8 ).
cnf(c_0_68,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_69,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_70,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_71,plain,
( app(X1,app(X2,nil)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]),c_0_68]) ).
cnf(c_0_72,plain,
( app(nil,app(X1,X2)) = app(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_69]),c_0_67])]) ).
cnf(c_0_73,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_74,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_12 ).
cnf(c_0_75,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_76,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_77,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_78,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_79,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_80,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_81,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_70]),c_0_68]) ).
cnf(c_0_82,plain,
( app(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_67])]) ).
cnf(c_0_83,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75]) ).
cnf(c_0_84,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_85,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_86,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
clause82 ).
cnf(c_0_87,plain,
( rearsegP(X1,skaf45(X1,X2))
| ~ frontsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80])])]) ).
cnf(c_0_88,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause174 ).
cnf(c_0_89,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_90,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_91,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_92,plain,
( frontsegP(app(nil,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_67])]) ).
cnf(c_0_93,negated_conjecture,
( app(nil,sk3) = cons(sk5,nil)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_82]),c_0_67]),c_0_84])]) ).
cnf(c_0_94,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_95,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_96,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_85]) ).
cnf(c_0_97,plain,
( skaf45(nil,X1) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_80]),c_0_67])]) ).
cnf(c_0_98,plain,
( nil = X1
| frontsegP(X2,skaf82(X1))
| ~ frontsegP(cons(X3,X2),X1)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_90]),c_0_91])]) ).
cnf(c_0_99,negated_conjecture,
( sk3 = nil
| frontsegP(cons(sk5,nil),sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_93]),c_0_84])]) ).
cnf(c_0_100,negated_conjecture,
( sk3 = nil
| sk5 = X1
| ~ memberP(sk3,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_74]),c_0_67])]),c_0_75]),c_0_95]) ).
cnf(c_0_101,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_96,c_0_89]),c_0_90]),c_0_91])]) ).
cnf(c_0_102,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_103,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_104,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_105,plain,
( app(X1,nil) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_97]),c_0_67])]) ).
cnf(c_0_106,negated_conjecture,
( sk3 = nil
| frontsegP(nil,skaf82(sk3)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_67]),c_0_84])]),c_0_75]) ).
cnf(c_0_107,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_108,negated_conjecture,
( skaf83(sk3) = sk5
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_90]),c_0_84])]) ).
cnf(c_0_109,plain,
( X1 = X2
| app(X1,X3) != nil
| nil != X2
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]) ).
cnf(c_0_110,negated_conjecture,
( app(skaf82(sk3),nil) = nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_91])]) ).
cnf(c_0_111,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_112,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_113,plain,
( frontsegP(X1,X2)
| ~ frontsegP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_69]),c_0_67])]) ).
cnf(c_0_114,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_115,negated_conjecture,
( cons(sk5,skaf82(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_108]),c_0_84])]) ).
cnf(c_0_116,negated_conjecture,
( skaf82(sk3) = X1
| sk3 = nil
| nil != X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_67]),c_0_91])]) ).
cnf(c_0_117,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_118,negated_conjecture,
( sk3 = nil
| frontsegP(X1,skaf82(sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_106]),c_0_91])]) ).
cnf(c_0_119,plain,
( skaf82(X1) = tl(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_89]),c_0_90]),c_0_91])]) ).
cnf(c_0_120,negated_conjecture,
( skaf82(sk3) = tl(sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_91])]),c_0_75]) ).
cnf(c_0_121,negated_conjecture,
( skaf82(sk3) = sk4
| sk3 = nil
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_116,c_0_117]) ).
cnf(c_0_122,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_123,negated_conjecture,
( sk3 = nil
| frontsegP(X1,tl(sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_84])]) ).
cnf(c_0_124,negated_conjecture,
( tl(sk3) = sk4
| sk3 = nil
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_125,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_126,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_127,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_128,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_129,plain,
( memberP(X1,X2)
| ~ memberP(X3,X2)
| ~ frontsegP(X1,X3)
| ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_79]),c_0_80])]) ).
cnf(c_0_130,negated_conjecture,
( sk3 = nil
| frontsegP(X1,sk4)
| sk4 != nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_123,c_0_124]) ).
cnf(c_0_131,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_132,negated_conjecture,
( cons(skaf83(sk3),tl(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_120]),c_0_84])]) ).
cnf(c_0_133,negated_conjecture,
( tl(sk3) = nil
| sk3 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_74]),c_0_67])]),c_0_75]) ).
cnf(c_0_134,plain,
( X1 != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_126]),c_0_127]),c_0_67])]) ).
cnf(c_0_135,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_128]) ).
cnf(c_0_136,negated_conjecture,
( sk3 = nil
| memberP(X1,X2)
| sk4 != nil
| ~ memberP(sk4,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_130]),c_0_117])]) ).
cnf(c_0_137,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_13 ).
cnf(c_0_138,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_139,plain,
( app(cons(X1,X2),nil) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_65]),c_0_67])]) ).
cnf(c_0_140,negated_conjecture,
( cons(skaf83(sk3),nil) = sk3
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_132,c_0_133]) ).
cnf(c_0_141,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_134,c_0_135]) ).
cnf(c_0_142,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_143,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
co1_15 ).
cnf(c_0_144,negated_conjecture,
( sk3 = nil
| memberP(X1,sk5)
| sk4 != nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_75]) ).
cnf(c_0_145,plain,
( segmentP(app(X1,X2),X3)
| ~ segmentP(X1,X3)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_138,c_0_69]),c_0_67])]) ).
cnf(c_0_146,negated_conjecture,
( app(sk3,nil) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_90]),c_0_67])]) ).
cnf(c_0_147,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_67])]) ).
cnf(c_0_148,plain,
( cons(skaf44(X1),X2) = app(X1,X2)
| ~ singletonP(X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_126]),c_0_127])]) ).
cnf(c_0_149,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_9 ).
cnf(c_0_150,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_151,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ equalelemsP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_143,c_0_77]),c_0_112]),c_0_77]) ).
cnf(c_0_152,negated_conjecture,
( sk3 = nil
| sk4 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_144]),c_0_67])]),c_0_75]) ).
cnf(c_0_153,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_154,plain,
( segmentP(X1,X2)
| ~ segmentP(nil,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_69]),c_0_67])]) ).
cnf(c_0_155,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_156,negated_conjecture,
( app(nil,sk3) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_146]),c_0_84]),c_0_67])]) ).
cnf(c_0_157,plain,
( app(X1,nil) != nil
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_148]),c_0_127]),c_0_67])]) ).
cnf(c_0_158,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_149]),c_0_84])]),c_0_150]) ).
cnf(c_0_159,negated_conjecture,
( sk4 != nil
| ~ segmentP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153])]) ).
cnf(c_0_160,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_154,c_0_155]) ).
cnf(c_0_161,negated_conjecture,
( app(cons(X1,nil),sk3) = cons(X1,sk3)
| sk3 = nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_156]),c_0_84]),c_0_67])]) ).
cnf(c_0_162,negated_conjecture,
( sk4 = nil
| app(sk3,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_84])]) ).
cnf(c_0_163,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_149]),c_0_150]) ).
cnf(c_0_164,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_159,c_0_160]),c_0_117]),c_0_67])]) ).
cnf(c_0_165,negated_conjecture,
( app(sk3,sk3) = cons(sk5,sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_161,c_0_74]),c_0_75]) ).
cnf(c_0_166,negated_conjecture,
( sk4 = nil
| cons(sk5,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_67])]) ).
cnf(c_0_167,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_149,c_0_164]) ).
cnf(c_0_168,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_169,negated_conjecture,
( app(nil,cons(sk5,sk3)) = cons(sk5,sk3)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_165]),c_0_84])]) ).
cnf(c_0_170,negated_conjecture,
sk3 != nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167]),c_0_164]) ).
cnf(c_0_171,negated_conjecture,
( sk3 = nil
| app(app(X1,cons(sk5,X2)),sk3) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ duplicatefreeP(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_74]),c_0_67])]),c_0_75]) ).
cnf(c_0_172,negated_conjecture,
app(nil,cons(sk5,sk3)) = cons(sk5,sk3),
inference(sr,[status(thm)],[c_0_169,c_0_170]) ).
fof(c_0_173,plain,
( ~ epred2_0
<=> ! [X1] :
( duplicatefreeP(X1)
| ~ ssList(X1) ) ),
introduced(definition) ).
cnf(c_0_174,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_66]),c_0_68]) ).
cnf(c_0_175,negated_conjecture,
( app(sk3,nil) = sk3
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_149]),c_0_67])]),c_0_150]) ).
cnf(c_0_176,axiom,
( app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1
| ~ segmentP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause168 ).
cnf(c_0_177,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_178,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
clause56 ).
cnf(c_0_179,negated_conjecture,
( app(cons(sk5,sk3),sk3) != X1
| ~ ssList(X1)
| ~ duplicatefreeP(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_172]),c_0_84]),c_0_67])]),c_0_170]) ).
cnf(c_0_180,plain,
( epred2_0
| duplicatefreeP(X1)
| ~ ssList(X1) ),
inference(split_equiv,[status(thm)],[c_0_173]) ).
cnf(c_0_181,negated_conjecture,
( sk4 = nil
| ssList(app(X1,sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_175]),c_0_67]),c_0_84])]) ).
cnf(c_0_182,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_183,plain,
( rearsegP(app(X1,X2),X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_78]),c_0_68]) ).
cnf(c_0_184,plain,
( app(skaf47(X1,nil),skaf48(nil,X1)) = X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_65]),c_0_67]),c_0_177])]),c_0_178]) ).
cnf(c_0_185,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_186,negated_conjecture,
( epred2_0
| app(cons(sk5,sk3),sk3) != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_179,c_0_180]) ).
cnf(c_0_187,negated_conjecture,
( sk4 = nil
| ssList(cons(sk5,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_163]),c_0_84])]) ).
cnf(c_0_188,plain,
( segmentP(X1,X2)
| app(X3,X2) != X1
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_65]),c_0_67])]),c_0_68]) ).
cnf(c_0_189,plain,
( rearsegP(X1,skaf48(nil,X1))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185]),c_0_177])]) ).
fof(c_0_190,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_191,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_192,negated_conjecture,
( epred2_0
| ~ ssList(app(cons(sk5,sk3),sk3)) ),
inference(er,[status(thm)],[c_0_186]) ).
cnf(c_0_193,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(sr,[status(thm)],[c_0_187,c_0_164]) ).
cnf(c_0_194,axiom,
( nil = X1
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
clause84 ).
cnf(c_0_195,plain,
( frontsegP(X1,skaf47(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_184]),c_0_185]),c_0_177])]) ).
cnf(c_0_196,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
clause60 ).
cnf(c_0_197,plain,
( segmentP(X1,skaf48(nil,X1))
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_184]),c_0_185]),c_0_177])])]) ).
cnf(c_0_198,plain,
skaf48(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_189]),c_0_185]),c_0_67])]) ).
cnf(c_0_199,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_191,c_0_190]),c_0_173]) ).
cnf(c_0_200,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_68]),c_0_193]),c_0_84])]) ).
cnf(c_0_201,plain,
( app(cons(X1,app(skaf47(X2,X3),X3)),skaf48(X3,X2)) = cons(X1,X2)
| ~ segmentP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(app(skaf47(X2,X3),X3))
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_176]),c_0_185])]) ).
cnf(c_0_202,plain,
skaf47(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_194,c_0_195]),c_0_177]),c_0_67])]) ).
cnf(c_0_203,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_196]),c_0_67])]) ).
cnf(c_0_204,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_197,c_0_198]),c_0_67])]) ).
cnf(c_0_205,plain,
( epred1_0
| ssItem(X1) ),
inference(split_equiv,[status(thm)],[c_0_190]) ).
cnf(c_0_206,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_200])]) ).
cnf(c_0_207,plain,
( ssList(app(cons(X1,X2),X3))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_131]),c_0_68]) ).
cnf(c_0_208,plain,
( app(cons(X1,nil),nil) = cons(X1,nil)
| ~ ssItem(X1) ),
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_201,c_0_202]),c_0_203]),c_0_198]),c_0_203]),c_0_67]),c_0_67])]),c_0_204])]) ).
cnf(c_0_209,axiom,
( app(skaf46(X1,X2),X2) = X1
| ~ rearsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause131 ).
cnf(c_0_210,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_211,plain,
( rearsegP(app(X1,nil),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_82]),c_0_67])]) ).
cnf(c_0_212,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause150 ).
cnf(c_0_213,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_205,c_0_206]) ).
cnf(c_0_214,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_207,c_0_208]),c_0_67])]) ).
cnf(c_0_215,plain,
( segmentP(X1,X2)
| app(X3,X4) != X1
| ~ rearsegP(X3,X2)
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_209]),c_0_210])]) ).
cnf(c_0_216,plain,
( rearsegP(app(nil,X1),X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_211,c_0_82]) ).
cnf(c_0_217,plain,
( X1 = skaf45(X2,X3)
| app(X3,X1) != X2
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_212,c_0_79]),c_0_80])]),c_0_70]) ).
cnf(c_0_218,plain,
app(cons(X1,nil),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_208,c_0_213])]) ).
cnf(c_0_219,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_214,c_0_213])]) ).
cnf(c_0_220,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_73,c_0_213])]) ).
cnf(c_0_221,plain,
( segmentP(X1,X2)
| ~ rearsegP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_215,c_0_65]),c_0_67])])]) ).
cnf(c_0_222,plain,
( rearsegP(X1,skaf45(X1,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_79]),c_0_80]),c_0_67])]),c_0_196]) ).
cnf(c_0_223,plain,
( skaf45(app(X1,X2),X1) = X2
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_217]),c_0_68]) ).
cnf(c_0_224,plain,
app(nil,cons(X1,nil)) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_218]),c_0_219]),c_0_67])]) ).
cnf(c_0_225,axiom,
( hd(cons(X1,X2)) = X1
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause97 ).
cnf(c_0_226,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_150,c_0_164]) ).
cnf(c_0_227,plain,
( segmentP(cons(X1,X2),X3)
| ~ segmentP(cons(X1,nil),X3)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_220]),c_0_219])]) ).
cnf(c_0_228,plain,
( segmentP(X1,skaf45(X1,nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_80])]) ).
cnf(c_0_229,plain,
skaf45(cons(X1,nil),nil) = cons(X1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_219]),c_0_67])]) ).
cnf(c_0_230,plain,
( skaf83(X1) = hd(X1)
| nil = X1
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_89]),c_0_90]),c_0_91])]) ).
cnf(c_0_231,axiom,
( X1 = X3
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause176 ).
cnf(c_0_232,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_233,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_234,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_235,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_236,plain,
( segmentP(app(X1,app(X2,X3)),X4)
| ~ segmentP(X2,X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_138,c_0_66]) ).
cnf(c_0_237,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_167]),c_0_226])]) ).
cnf(c_0_238,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_239,plain,
( segmentP(cons(X1,X2),cons(X1,nil))
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_227,c_0_228]),c_0_229]),c_0_80]),c_0_219])]) ).
cnf(c_0_240,plain,
( cons(hd(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_89,c_0_230]) ).
cnf(c_0_241,plain,
( X1 = hd(X2)
| nil = X2
| ~ frontsegP(cons(X1,X3),X2)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_231,c_0_232]),c_0_233]),c_0_234]) ).
cnf(c_0_242,negated_conjecture,
( sk4 = nil
| frontsegP(cons(sk5,X1),sk3)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_163]),c_0_84])]) ).
cnf(c_0_243,negated_conjecture,
( sk4 = nil
| equalelemsP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_235,c_0_149]),c_0_150]) ).
cnf(c_0_244,negated_conjecture,
( segmentP(app(X1,cons(sk5,X2)),X3)
| ~ segmentP(sk3,X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_236,c_0_237]),c_0_84])]) ).
cnf(c_0_245,plain,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_238,c_0_213])]) ).
cnf(c_0_246,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_247,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_248,plain,
( nil = X1
| segmentP(X1,cons(hd(X1),nil))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_239,c_0_240]),c_0_91])]) ).
cnf(c_0_249,negated_conjecture,
( hd(X1) = sk5
| nil = X1
| ~ frontsegP(sk3,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_241,c_0_167]),c_0_226]),c_0_67])]) ).
cnf(c_0_250,negated_conjecture,
( sk4 = nil
| frontsegP(sk3,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_242,c_0_149]),c_0_67])]) ).
cnf(c_0_251,negated_conjecture,
equalelemsP(sk3),
inference(sr,[status(thm)],[c_0_243,c_0_164]) ).
cnf(c_0_252,negated_conjecture,
( segmentP(X1,X2)
| ~ memberP(X1,sk5)
| ~ segmentP(sk3,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_244,c_0_245]),c_0_246]),c_0_247])]) ).
cnf(c_0_253,negated_conjecture,
( nil = X1
| segmentP(X1,sk3)
| ~ frontsegP(sk3,X1)
| ~ ssList(X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_248,c_0_249]),c_0_167]) ).
cnf(c_0_254,negated_conjecture,
frontsegP(sk3,sk3),
inference(sr,[status(thm)],[c_0_250,c_0_164]) ).
cnf(c_0_255,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
co1_10 ).
cnf(c_0_256,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_151,c_0_251])]) ).
cnf(c_0_257,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_252,c_0_253]),c_0_84]),c_0_254])]),c_0_170]) ).
cnf(c_0_258,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_255,c_0_164]) ).
cnf(c_0_259,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_256,c_0_257]),c_0_258]),c_0_117])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SWC329-1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 02:15:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.PttnVXPFV7/E---3.1_8550.p
% 1627.20/205.05 # Version: 3.1pre001
% 1627.20/205.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1627.20/205.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1627.20/205.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1627.20/205.05 # Starting new_bool_3 with 300s (1) cores
% 1627.20/205.05 # Starting new_bool_1 with 300s (1) cores
% 1627.20/205.05 # Starting sh5l with 300s (1) cores
% 1627.20/205.05 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8628 completed with status 0
% 1627.20/205.05 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1627.20/205.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1627.20/205.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1627.20/205.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1627.20/205.05 # No SInE strategy applied
% 1627.20/205.05 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1627.20/205.05 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1627.20/205.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1627.20/205.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1627.20/205.05 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1627.20/205.05 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1627.20/205.05 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1627.20/205.05 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 8637 completed with status 7
% 1627.20/205.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1627.20/205.05 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 8636 completed with status 7
% 1627.20/205.05 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1627.20/205.05 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 8638 completed with status 7
% 1627.20/205.05 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1627.20/205.05 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8635 completed with status 7
% 1627.20/205.05 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1627.20/205.05 # G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 8682 completed with status 0
% 1627.20/205.05 # Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1627.20/205.05 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1627.20/205.05 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1627.20/205.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1627.20/205.05 # No SInE strategy applied
% 1627.20/205.05 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1627.20/205.05 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1627.20/205.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1627.20/205.05 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1627.20/205.05 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1627.20/205.05 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1627.20/205.05 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1627.20/205.05 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 8637 completed with status 7
% 1627.20/205.05 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1627.20/205.05 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 8636 completed with status 7
% 1627.20/205.05 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1627.20/205.05 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 8638 completed with status 7
% 1627.20/205.05 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1627.20/205.05 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8635 completed with status 7
% 1627.20/205.05 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1627.20/205.05 # Preprocessing time : 0.002 s
% 1627.20/205.05 # Presaturation interreduction done
% 1627.20/205.05
% 1627.20/205.05 # Proof found!
% 1627.20/205.05 # SZS status Unsatisfiable
% 1627.20/205.05 # SZS output start CNFRefutation
% See solution above
% 1627.20/205.05 # Parsed axioms : 200
% 1627.20/205.05 # Removed by relevancy pruning/SinE : 0
% 1627.20/205.05 # Initial clauses : 200
% 1627.20/205.05 # Removed in clause preprocessing : 0
% 1627.20/205.05 # Initial clauses in saturation : 200
% 1627.20/205.05 # Processed clauses : 53005
% 1627.20/205.05 # ...of these trivial : 1099
% 1627.20/205.05 # ...subsumed : 43107
% 1627.20/205.05 # ...remaining for further processing : 8799
% 1627.20/205.05 # Other redundant clauses eliminated : 19798
% 1627.20/205.05 # Clauses deleted for lack of memory : 45044
% 1627.20/205.05 # Backward-subsumed : 947
% 1627.20/205.05 # Backward-rewritten : 783
% 1627.20/205.05 # Generated clauses : 1839996
% 1627.20/205.05 # ...of the previous two non-redundant : 1749222
% 1627.20/205.05 # ...aggressively subsumed : 0
% 1627.20/205.05 # Contextual simplify-reflections : 2504
% 1627.20/205.05 # Paramodulations : 1819002
% 1627.20/205.05 # Factorizations : 3
% 1627.20/205.05 # NegExts : 0
% 1627.20/205.05 # Equation resolutions : 20651
% 1627.20/205.05 # Total rewrite steps : 1265967
% 1627.20/205.05 # Propositional unsat checks : 0
% 1627.20/205.05 # Propositional check models : 0
% 1627.20/205.05 # Propositional check unsatisfiable : 0
% 1627.20/205.05 # Propositional clauses : 0
% 1627.20/205.05 # Propositional clauses after purity: 0
% 1627.20/205.05 # Propositional unsat core size : 0
% 1627.20/205.05 # Propositional preprocessing time : 0.000
% 1627.20/205.05 # Propositional encoding time : 0.000
% 1627.20/205.05 # Propositional solver time : 0.000
% 1627.20/205.05 # Success case prop preproc time : 0.000
% 1627.20/205.05 # Success case prop encoding time : 0.000
% 1627.20/205.05 # Success case prop solver time : 0.000
% 1627.20/205.05 # Current number of processed clauses : 6632
% 1627.20/205.05 # Positive orientable unit clauses : 349
% 1627.20/205.05 # Positive unorientable unit clauses: 0
% 1627.20/205.05 # Negative unit clauses : 368
% 1627.20/205.05 # Non-unit-clauses : 5915
% 1627.20/205.05 # Current number of unprocessed clauses: 865108
% 1627.20/205.05 # ...number of literals in the above : 7061498
% 1627.20/205.05 # Current number of archived formulas : 0
% 1627.20/205.05 # Current number of archived clauses : 2067
% 1627.20/205.05 # Clause-clause subsumption calls (NU) : 13024730
% 1627.20/205.05 # Rec. Clause-clause subsumption calls : 853563
% 1627.20/205.05 # Non-unit clause-clause subsumptions : 25191
% 1627.20/205.05 # Unit Clause-clause subsumption calls : 373721
% 1627.20/205.05 # Rewrite failures with RHS unbound : 0
% 1627.20/205.05 # BW rewrite match attempts : 629
% 1627.20/205.05 # BW rewrite match successes : 165
% 1627.20/205.05 # Condensation attempts : 0
% 1627.20/205.05 # Condensation successes : 0
% 1627.20/205.05 # Termbank termtop insertions : 64168721
% 1627.20/205.05
% 1627.20/205.05 # -------------------------------------------------
% 1627.20/205.05 # User time : 602.871 s
% 1627.20/205.05 # System time : 8.528 s
% 1627.20/205.05 # Total time : 611.400 s
% 1627.20/205.05 # Maximum resident set size: 2156 pages
% 1627.20/205.05
% 1627.20/205.05 # -------------------------------------------------
% 1627.20/205.05 # User time : 1001.577 s
% 1627.20/205.05 # System time : 14.655 s
% 1627.20/205.05 # Total time : 1016.232 s
% 1627.20/205.05 # Maximum resident set size: 1852 pages
% 1627.20/205.05 % E---3.1 exiting
% 1627.20/205.05 % E---3.1 exiting
%------------------------------------------------------------------------------