TSTP Solution File: SWC329-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---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 : n016.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:42:36 EDT 2023
% Result : Unsatisfiable 1791.02s 200.70s
% Output : CNFRefutation 1791.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 53
% Syntax : Number of formulae : 193 ( 39 unt; 0 def)
% Number of atoms : 552 ( 171 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 684 ( 325 ~; 357 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 3 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-2 aty)
% Number of variables : 245 ( 22 sgn; 2 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(clause73,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause149) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause85) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause74) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause144) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause120) ).
cnf(co1_12,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_12) ).
cnf(co1_8,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_8) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause143) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause132) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause51) ).
cnf(clause138,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause138) ).
cnf(clause82,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause174) ).
cnf(clause109,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause109) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause161) ).
cnf(clause71,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause151) ).
cnf(clause145,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause145) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause137) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_5) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause140) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause98) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause47) ).
cnf(clause116,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause157) ).
cnf(co1_13,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause172) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause86) ).
cnf(co1_15,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_15) ).
cnf(co1_9,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_9) ).
cnf(co1_7,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_7) ).
cnf(clause1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause1) ).
cnf(clause79,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.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.xrApAnAS7d/E---3.1_15445.p',clause179) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause72) ).
cnf(clause64,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause64) ).
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.xrApAnAS7d/E---3.1_15445.p',clause173) ).
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.xrApAnAS7d/E---3.1_15445.p',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',clause53) ).
cnf(co1_10,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
file('/export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p',co1_10) ).
cnf(c_0_51,axiom,
( app(X1,nil) = X1
| ~ ssList(X1) ),
clause73 ).
cnf(c_0_52,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause149 ).
cnf(c_0_53,axiom,
ssList(nil),
clause8 ).
cnf(c_0_54,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_55,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
clause74 ).
cnf(c_0_56,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
clause144 ).
cnf(c_0_57,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_51,c_0_52]),c_0_53])]),c_0_54]) ).
cnf(c_0_58,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_52,c_0_55]),c_0_53])]) ).
cnf(c_0_59,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause120 ).
cnf(c_0_60,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk3 ),
co1_12 ).
cnf(c_0_61,negated_conjecture,
( ssItem(sk5)
| nil = sk3 ),
co1_8 ).
cnf(c_0_62,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_63,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_64,axiom,
( rearsegP(X3,X2)
| app(X1,X2) != X3
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause143 ).
cnf(c_0_65,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause132 ).
cnf(c_0_66,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_67,plain,
( frontsegP(app(X1,X2),X1)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_56]),c_0_54]) ).
cnf(c_0_68,plain,
( app(X1,nil) = app(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_53])]) ).
cnf(c_0_69,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk3 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]) ).
cnf(c_0_70,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_71,axiom,
( memberP(cons(X2,X3),X1)
| X1 != X2
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1) ),
clause138 ).
cnf(c_0_72,axiom,
( nil = X1
| ~ rearsegP(nil,X1)
| ~ ssList(X1) ),
clause82 ).
cnf(c_0_73,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_64,c_0_65]),c_0_66])])]) ).
cnf(c_0_74,axiom,
( frontsegP(X2,X4)
| ~ frontsegP(cons(X1,X2),cons(X3,X4))
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssItem(X3)
| ~ ssItem(X1) ),
clause174 ).
cnf(c_0_75,axiom,
( cons(skaf83(X1),skaf82(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause109 ).
cnf(c_0_76,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_77,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_78,plain,
( frontsegP(app(nil,X1),X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_53])]) ).
cnf(c_0_79,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_69,c_0_68]),c_0_53]),c_0_70])]) ).
cnf(c_0_80,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_81,axiom,
( ~ memberP(nil,X1)
| ~ ssItem(X1) ),
clause71 ).
cnf(c_0_82,plain,
( memberP(cons(X1,X2),X1)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_71]) ).
cnf(c_0_83,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_72,c_0_73]),c_0_66]),c_0_53])]) ).
cnf(c_0_84,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_74,c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_85,negated_conjecture,
( sk3 = nil
| frontsegP(cons(sk5,nil),sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_70])]) ).
cnf(c_0_86,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_80,c_0_60]),c_0_53])]),c_0_61]),c_0_81]) ).
cnf(c_0_87,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_82,c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_88,axiom,
( X1 = X3
| app(X1,X2) != app(X3,X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause151 ).
cnf(c_0_89,axiom,
( app(X1,X2) = nil
| nil != X1
| nil != X2
| ~ ssList(X2)
| ~ ssList(X1) ),
clause145 ).
cnf(c_0_90,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause119 ).
cnf(c_0_91,plain,
( app(X1,nil) = nil
| ~ frontsegP(nil,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_83]),c_0_53])]) ).
cnf(c_0_92,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_84,c_0_85]),c_0_53]),c_0_70])]),c_0_61]) ).
cnf(c_0_93,axiom,
( frontsegP(app(X1,X3),X2)
| ~ frontsegP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause137 ).
cnf(c_0_94,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_86,c_0_87]),c_0_76]),c_0_70])]) ).
cnf(c_0_95,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_88,c_0_89]),c_0_90]) ).
cnf(c_0_96,negated_conjecture,
( app(skaf82(sk3),nil) = nil
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_77])]) ).
cnf(c_0_97,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_98,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_99,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_93,c_0_55]),c_0_53])]) ).
cnf(c_0_100,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause96 ).
cnf(c_0_101,negated_conjecture,
( cons(sk5,skaf82(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_94]),c_0_70])]) ).
cnf(c_0_102,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_95,c_0_96]),c_0_53]),c_0_77])]) ).
cnf(c_0_103,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_97,c_0_98]) ).
cnf(c_0_104,negated_conjecture,
( sk3 = nil
| frontsegP(X1,skaf82(sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_92]),c_0_77])]) ).
cnf(c_0_105,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_100,c_0_75]),c_0_76]),c_0_77])]) ).
cnf(c_0_106,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_100,c_0_101]),c_0_77])]),c_0_61]) ).
cnf(c_0_107,negated_conjecture,
( skaf82(sk3) = sk4
| sk3 = nil
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_102,c_0_103]) ).
cnf(c_0_108,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_109,negated_conjecture,
( sk3 = nil
| frontsegP(X1,tl(sk3))
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_70])]) ).
cnf(c_0_110,negated_conjecture,
( tl(sk3) = sk4
| sk3 = nil
| sk4 != nil ),
inference(spm,[status(thm)],[c_0_106,c_0_107]) ).
cnf(c_0_111,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause98 ).
cnf(c_0_112,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
clause101 ).
cnf(c_0_113,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_114,axiom,
( singletonP(X2)
| cons(X1,nil) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause116 ).
cnf(c_0_115,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_108,c_0_65]),c_0_66])]) ).
cnf(c_0_116,negated_conjecture,
( sk3 = nil
| frontsegP(X1,sk4)
| sk4 != nil
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_109,c_0_110]) ).
cnf(c_0_117,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
clause157 ).
cnf(c_0_118,negated_conjecture,
( cons(skaf83(sk3),tl(sk3)) = sk3
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_106]),c_0_70])]) ).
cnf(c_0_119,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_100,c_0_60]),c_0_53])]),c_0_61]) ).
cnf(c_0_120,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_111,c_0_112]),c_0_113]),c_0_53])]) ).
cnf(c_0_121,plain,
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_114]) ).
cnf(c_0_122,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_115,c_0_116]),c_0_103])]) ).
cnf(c_0_123,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk3 ),
co1_13 ).
cnf(c_0_124,axiom,
( segmentP(app(app(X4,X1),X3),X2)
| ~ segmentP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause172 ).
cnf(c_0_125,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_117,c_0_51]),c_0_53])]) ).
cnf(c_0_126,negated_conjecture,
( cons(skaf83(sk3),nil) = sk3
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_118,c_0_119]) ).
cnf(c_0_127,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_120,c_0_121]) ).
cnf(c_0_128,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_129,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
co1_15 ).
cnf(c_0_130,negated_conjecture,
( sk3 = nil
| memberP(X1,sk5)
| sk4 != nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_61]) ).
cnf(c_0_131,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_124,c_0_55]),c_0_53])]) ).
cnf(c_0_132,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_125,c_0_126]),c_0_76]),c_0_53])]) ).
cnf(c_0_133,plain,
( cons(X1,nil) != nil
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_53])]) ).
cnf(c_0_134,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_59,c_0_112]),c_0_113])]) ).
cnf(c_0_135,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
co1_9 ).
cnf(c_0_136,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
co1_7 ).
cnf(c_0_137,negated_conjecture,
( ~ segmentP(sk4,sk3)
| ~ equalelemsP(sk3) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_129,c_0_63]),c_0_98]),c_0_63]) ).
cnf(c_0_138,negated_conjecture,
( sk3 = nil
| sk4 != nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_130]),c_0_53])]),c_0_61]) ).
cnf(c_0_139,axiom,
equalelemsP(nil),
clause1 ).
cnf(c_0_140,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_131,c_0_55]),c_0_53])]) ).
cnf(c_0_141,axiom,
( segmentP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
clause79 ).
cnf(c_0_142,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_58,c_0_132]),c_0_70]),c_0_53])]) ).
cnf(c_0_143,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_133,c_0_134]),c_0_113]),c_0_53])]) ).
cnf(c_0_144,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_135]),c_0_70])]),c_0_136]) ).
cnf(c_0_145,negated_conjecture,
( sk4 != nil
| ~ segmentP(sk4,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139])]) ).
cnf(c_0_146,plain,
( segmentP(X1,X2)
| nil != X2
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(spm,[status(thm)],[c_0_140,c_0_141]) ).
cnf(c_0_147,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_117,c_0_142]),c_0_70]),c_0_53])]) ).
cnf(c_0_148,negated_conjecture,
( sk4 = nil
| app(sk3,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_144]),c_0_70])]) ).
cnf(c_0_149,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| sk4 = nil
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_135]),c_0_136]) ).
cnf(c_0_150,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_146]),c_0_103]),c_0_53])]) ).
cnf(c_0_151,negated_conjecture,
( app(sk3,sk3) = cons(sk5,sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_60]),c_0_61]) ).
cnf(c_0_152,negated_conjecture,
( sk4 = nil
| cons(sk5,nil) != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_53])]) ).
cnf(c_0_153,negated_conjecture,
cons(sk5,nil) = sk3,
inference(sr,[status(thm)],[c_0_135,c_0_150]) ).
cnf(c_0_154,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_155,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_58,c_0_151]),c_0_70])]) ).
cnf(c_0_156,negated_conjecture,
sk3 != nil,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153]),c_0_150]) ).
cnf(c_0_157,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_154,c_0_60]),c_0_53])]),c_0_61]) ).
cnf(c_0_158,negated_conjecture,
app(nil,cons(sk5,sk3)) = cons(sk5,sk3),
inference(sr,[status(thm)],[c_0_155,c_0_156]) ).
fof(c_0_159,plain,
( ~ epred2_0
<=> ! [X1] :
( duplicatefreeP(X1)
| ~ ssList(X1) ) ),
introduced(definition) ).
cnf(c_0_160,plain,
( ssList(app(X1,app(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_52]),c_0_54]) ).
cnf(c_0_161,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_125,c_0_135]),c_0_53])]),c_0_136]) ).
cnf(c_0_162,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_157,c_0_158]),c_0_70]),c_0_53])]),c_0_156]) ).
cnf(c_0_163,plain,
( epred2_0
| duplicatefreeP(X1)
| ~ ssList(X1) ),
inference(split_equiv,[status(thm)],[c_0_159]) ).
cnf(c_0_164,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_160,c_0_161]),c_0_53]),c_0_70])]) ).
cnf(c_0_165,negated_conjecture,
( epred2_0
| app(cons(sk5,sk3),sk3) != X1
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_162,c_0_163]) ).
cnf(c_0_166,negated_conjecture,
( sk4 = nil
| ssList(cons(sk5,sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_164,c_0_149]),c_0_70])]) ).
fof(c_0_167,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_168,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
clause72 ).
cnf(c_0_169,negated_conjecture,
( epred2_0
| ~ ssList(app(cons(sk5,sk3),sk3)) ),
inference(er,[status(thm)],[c_0_165]) ).
cnf(c_0_170,negated_conjecture,
ssList(cons(sk5,sk3)),
inference(sr,[status(thm)],[c_0_166,c_0_150]) ).
cnf(c_0_171,plain,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_168,c_0_167]),c_0_159]) ).
cnf(c_0_172,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_54]),c_0_170]),c_0_70])]) ).
cnf(c_0_173,axiom,
( equalelemsP(cons(X1,nil))
| ~ ssItem(X1) ),
clause64 ).
cnf(c_0_174,axiom,
( segmentP(X4,X2)
| app(app(X1,X2),X3) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4) ),
clause173 ).
cnf(c_0_175,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_136,c_0_150]) ).
cnf(c_0_176,plain,
( epred1_0
| ssItem(X1) ),
inference(split_equiv,[status(thm)],[c_0_167]) ).
cnf(c_0_177,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_171,c_0_172])]) ).
cnf(c_0_178,negated_conjecture,
( sk4 = nil
| equalelemsP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_135]),c_0_136]) ).
cnf(c_0_179,plain,
( segmentP(X1,X2)
| app(X3,app(X2,X4)) != X1
| ~ ssList(X1)
| ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_174,c_0_52]) ).
cnf(c_0_180,negated_conjecture,
( app(sk3,X1) = cons(sk5,X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_153]),c_0_175])]) ).
cnf(c_0_181,axiom,
( app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1
| ~ memberP(X1,X2)
| ~ ssItem(X2)
| ~ ssList(X1) ),
clause169 ).
cnf(c_0_182,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_183,negated_conjecture,
equalelemsP(sk3),
inference(sr,[status(thm)],[c_0_178,c_0_150]) ).
cnf(c_0_184,negated_conjecture,
( segmentP(X1,sk3)
| app(X2,cons(sk5,X3)) != X1
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_70])]) ).
cnf(c_0_185,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_181,c_0_182])]) ).
cnf(c_0_186,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_187,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_188,negated_conjecture,
( memberP(sk4,sk5)
| nil = sk4 ),
co1_10 ).
cnf(c_0_189,negated_conjecture,
~ segmentP(sk4,sk3),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_183])]) ).
cnf(c_0_190,negated_conjecture,
( segmentP(X1,sk3)
| ~ memberP(X1,sk5)
| ~ ssList(X1) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_184,c_0_185]),c_0_186]),c_0_187])])]) ).
cnf(c_0_191,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[c_0_188,c_0_150]) ).
cnf(c_0_192,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_189,c_0_190]),c_0_191]),c_0_103])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWC329-1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n016.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue Oct 3 02:11:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.xrApAnAS7d/E---3.1_15445.p
% 1791.02/200.70 # Version: 3.1pre001
% 1791.02/200.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1791.02/200.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1791.02/200.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1791.02/200.70 # Starting new_bool_3 with 300s (1) cores
% 1791.02/200.70 # Starting new_bool_1 with 300s (1) cores
% 1791.02/200.70 # Starting sh5l with 300s (1) cores
% 1791.02/200.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15522 completed with status 0
% 1791.02/200.70 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1791.02/200.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1791.02/200.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1791.02/200.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1791.02/200.70 # No SInE strategy applied
% 1791.02/200.70 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1791.02/200.70 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1791.02/200.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1791.02/200.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1791.02/200.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1791.02/200.70 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1791.02/200.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1791.02/200.70 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 15532 completed with status 7
% 1791.02/200.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1791.02/200.70 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 15531 completed with status 7
% 1791.02/200.70 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1791.02/200.70 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 15530 completed with status 7
% 1791.02/200.70 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1791.02/200.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15529 completed with status 7
% 1791.02/200.70 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1791.02/200.70 # G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 15598 completed with status 0
% 1791.02/200.70 # Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 1791.02/200.70 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1791.02/200.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1791.02/200.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1791.02/200.70 # No SInE strategy applied
% 1791.02/200.70 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1791.02/200.70 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 1791.02/200.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 1791.02/200.70 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1791.02/200.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1791.02/200.70 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1791.02/200.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 1791.02/200.70 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 15532 completed with status 7
% 1791.02/200.70 # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 136s (1) cores
% 1791.02/200.70 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 15531 completed with status 7
% 1791.02/200.70 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 1791.02/200.70 # G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 15530 completed with status 7
% 1791.02/200.70 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1791.02/200.70 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 15529 completed with status 7
% 1791.02/200.70 # Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 127s (1) cores
% 1791.02/200.70 # Preprocessing time : 0.002 s
% 1791.02/200.70 # Presaturation interreduction done
% 1791.02/200.70
% 1791.02/200.70 # Proof found!
% 1791.02/200.70 # SZS status Unsatisfiable
% 1791.02/200.70 # SZS output start CNFRefutation
% See solution above
% 1791.02/200.70 # Parsed axioms : 200
% 1791.02/200.70 # Removed by relevancy pruning/SinE : 0
% 1791.02/200.70 # Initial clauses : 200
% 1791.02/200.70 # Removed in clause preprocessing : 0
% 1791.02/200.70 # Initial clauses in saturation : 200
% 1791.02/200.70 # Processed clauses : 52967
% 1791.02/200.70 # ...of these trivial : 1097
% 1791.02/200.70 # ...subsumed : 43075
% 1791.02/200.70 # ...remaining for further processing : 8795
% 1791.02/200.70 # Other redundant clauses eliminated : 19798
% 1791.02/200.70 # Clauses deleted for lack of memory : 45114
% 1791.02/200.70 # Backward-subsumed : 946
% 1791.02/200.70 # Backward-rewritten : 784
% 1791.02/200.70 # Generated clauses : 1839206
% 1791.02/200.70 # ...of the previous two non-redundant : 1748437
% 1791.02/200.70 # ...aggressively subsumed : 0
% 1791.02/200.70 # Contextual simplify-reflections : 2504
% 1791.02/200.70 # Paramodulations : 1818211
% 1791.02/200.70 # Factorizations : 3
% 1791.02/200.70 # NegExts : 0
% 1791.02/200.70 # Equation resolutions : 20651
% 1791.02/200.70 # Total rewrite steps : 1264794
% 1791.02/200.70 # Propositional unsat checks : 0
% 1791.02/200.70 # Propositional check models : 0
% 1791.02/200.70 # Propositional check unsatisfiable : 0
% 1791.02/200.70 # Propositional clauses : 0
% 1791.02/200.70 # Propositional clauses after purity: 0
% 1791.02/200.70 # Propositional unsat core size : 0
% 1791.02/200.70 # Propositional preprocessing time : 0.000
% 1791.02/200.70 # Propositional encoding time : 0.000
% 1791.02/200.70 # Propositional solver time : 0.000
% 1791.02/200.70 # Success case prop preproc time : 0.000
% 1791.02/200.70 # Success case prop encoding time : 0.000
% 1791.02/200.70 # Success case prop solver time : 0.000
% 1791.02/200.70 # Current number of processed clauses : 6627
% 1791.02/200.70 # Positive orientable unit clauses : 349
% 1791.02/200.70 # Positive unorientable unit clauses: 0
% 1791.02/200.70 # Negative unit clauses : 366
% 1791.02/200.70 # Non-unit-clauses : 5912
% 1791.02/200.70 # Current number of unprocessed clauses: 864130
% 1791.02/200.70 # ...number of literals in the above : 7052885
% 1791.02/200.70 # Current number of archived formulas : 0
% 1791.02/200.70 # Current number of archived clauses : 2068
% 1791.02/200.70 # Clause-clause subsumption calls (NU) : 13022777
% 1791.02/200.70 # Rec. Clause-clause subsumption calls : 853706
% 1791.02/200.70 # Non-unit clause-clause subsumptions : 25175
% 1791.02/200.70 # Unit Clause-clause subsumption calls : 370838
% 1791.02/200.70 # Rewrite failures with RHS unbound : 0
% 1791.02/200.70 # BW rewrite match attempts : 632
% 1791.02/200.70 # BW rewrite match successes : 166
% 1791.02/200.70 # Condensation attempts : 0
% 1791.02/200.70 # Condensation successes : 0
% 1791.02/200.70 # Termbank termtop insertions : 64145712
% 1791.02/200.70
% 1791.02/200.70 # -------------------------------------------------
% 1791.02/200.70 # User time : 598.738 s
% 1791.02/200.70 # System time : 8.418 s
% 1791.02/200.70 # Total time : 607.156 s
% 1791.02/200.70 # Maximum resident set size: 2152 pages
% 1791.02/200.70
% 1791.02/200.70 # -------------------------------------------------
% 1791.02/200.70 # User time : 980.459 s
% 1791.02/200.70 # System time : 14.403 s
% 1791.02/200.70 # Total time : 994.861 s
% 1791.02/200.70 # Maximum resident set size: 1848 pages
% 1791.02/200.70 % E---3.1 exiting
%------------------------------------------------------------------------------