TSTP Solution File: SWC377-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWC377-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 04:29:21 EDT 2024
% Result : Unsatisfiable 152.12s 19.77s
% Output : CNFRefutation 152.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 39
% Syntax : Number of clauses : 185 ( 26 unt; 57 nHn; 174 RR)
% Number of literals : 568 ( 144 equ; 341 neg)
% Maximal clause size : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 8 con; 0-2 aty)
% Number of variables : 245 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause123) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause98,axiom,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_12,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_11,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause96,axiom,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause132,axiom,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause132) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause74,axiom,
( app(nil,X1) = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_14,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_8,negated_conjecture,
( memberP(sk2,sk5)
| memberP(sk1,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause157,axiom,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_9,negated_conjecture,
( ~ memberP(sk2,sk5)
| ~ memberP(sk1,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause60,axiom,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause144,axiom,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause72,axiom,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause150,axiom,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause150) ).
cnf(clause83,axiom,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause178,axiom,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause158,axiom,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause158) ).
cnf(clause141,axiom,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause139,axiom,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause139) ).
cnf(c_0_39,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_41,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_42,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_43,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_39 ).
cnf(c_0_44,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause123]) ).
cnf(c_0_46,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_47,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_48,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk3
| ~ neq(sk4,nil) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_50,negated_conjecture,
( X1 = sk4
| neq(sk4,X1)
| ~ ssList(X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_51,axiom,
ssList(nil),
clause8 ).
cnf(c_0_52,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_53,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_54,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_55,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_56,plain,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_57,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_46 ).
cnf(c_0_58,plain,
( cons(X1,X2) != nil
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_47 ).
cnf(c_0_59,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk1
| ~ neq(sk4,nil) ),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| neq(sk4,nil) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,negated_conjecture,
( ssList(sk7)
| ~ neq(sk4,nil) ),
c_0_52 ).
cnf(c_0_62,negated_conjecture,
( ssItem(sk6)
| ~ neq(sk4,nil) ),
c_0_53 ).
cnf(c_0_63,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_64,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_65,plain,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
c_0_54 ).
cnf(c_0_66,plain,
( tl(cons(X1,X2)) = X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_55 ).
cnf(c_0_67,plain,
( hd(app(cons(X1,X2),X3)) = hd(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_68,negated_conjecture,
( app(cons(sk6,nil),sk7) = sk1
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_69,negated_conjecture,
( sk4 = nil
| ssList(sk7) ),
inference(spm,[status(thm)],[c_0_61,c_0_60]) ).
cnf(c_0_70,negated_conjecture,
( sk4 = nil
| ssItem(sk6) ),
inference(spm,[status(thm)],[c_0_62,c_0_60]) ).
cnf(c_0_71,plain,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
c_0_63 ).
cnf(c_0_72,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_64 ).
cnf(c_0_73,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_74,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_75,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_76,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_77,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_78,plain,
( cons(hd(cons(X1,X2)),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_57]),c_0_58]) ).
cnf(c_0_79,negated_conjecture,
( hd(cons(sk6,nil)) = hd(sk1)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_51])]),c_0_69]),c_0_70]) ).
cnf(c_0_80,plain,
( ssItem(hd(cons(X1,X2)))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_57]),c_0_58]) ).
cnf(c_0_81,negated_conjecture,
( cons(sk6,sk7) = sk1
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_68]),c_0_69]),c_0_70]) ).
cnf(c_0_82,plain,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
c_0_73 ).
cnf(c_0_83,plain,
( app(X2,skaf45(X1,X2)) = X1
| ~ frontsegP(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_74 ).
cnf(c_0_84,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_85,negated_conjecture,
( memberP(sk2,sk5)
| memberP(sk1,sk5) ),
co1_8 ).
cnf(c_0_86,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_87,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_88,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_89,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_75 ).
cnf(c_0_90,plain,
( app(nil,X1) = X1
| ~ ssList(X1) ),
c_0_76 ).
cnf(c_0_91,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| ~ neq(sk4,nil) ),
c_0_77 ).
cnf(c_0_92,negated_conjecture,
( cons(hd(sk1),nil) = cons(sk6,nil)
| sk4 = nil ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_51])]),c_0_70]) ).
cnf(c_0_93,negated_conjecture,
( sk4 = nil
| ssItem(hd(sk1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_69]),c_0_70]) ).
cnf(c_0_94,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_82,c_0_83]),c_0_84])]) ).
cnf(c_0_95,negated_conjecture,
( memberP(sk4,sk5)
| memberP(sk1,sk5) ),
inference(rw,[status(thm)],[c_0_85,c_0_41]) ).
cnf(c_0_96,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_97,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_98,negated_conjecture,
( nil = sk3
| nil != sk4 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_99,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_100,plain,
( app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ duplicatefreeP(X5)
| ~ ssList(X5) ),
c_0_86 ).
cnf(c_0_101,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_87 ).
cnf(c_0_102,plain,
( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_88 ).
cnf(c_0_103,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_89,c_0_90]),c_0_51])]) ).
cnf(c_0_104,negated_conjecture,
( app(sk7,cons(sk6,nil)) = sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_91,c_0_60]) ).
cnf(c_0_105,negated_conjecture,
( sk4 = nil
| ssList(cons(sk6,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_92]),c_0_51])]),c_0_93]) ).
cnf(c_0_106,negated_conjecture,
( memberP(sk4,sk5)
| memberP(X1,sk5)
| ~ frontsegP(X1,sk1)
| ~ ssList(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_97])]) ).
cnf(c_0_107,negated_conjecture,
( nil = sk3
| nil != sk4 ),
c_0_98 ).
cnf(c_0_108,negated_conjecture,
( ~ memberP(sk2,sk5)
| ~ memberP(sk1,sk5) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_109,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_99 ).
cnf(c_0_110,plain,
( ~ ssItem(X1)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4))) ),
inference(er,[status(thm)],[c_0_100]) ).
cnf(c_0_111,plain,
( ssList(cons(X1,app(X2,X3)))
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_57]) ).
cnf(c_0_112,negated_conjecture,
( app(nil,sk4) = sk4
| sk4 = nil ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_103,c_0_104]),c_0_69]),c_0_105]) ).
cnf(c_0_113,negated_conjecture,
( memberP(sk4,sk5)
| ~ frontsegP(sk4,sk1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(ef,[status(thm)],[c_0_106]),c_0_44])]) ).
cnf(c_0_114,negated_conjecture,
( sk1 = nil
| sk4 != nil ),
inference(rw,[status(thm)],[c_0_107,c_0_49]) ).
cnf(c_0_115,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_116,negated_conjecture,
( ~ memberP(sk2,sk5)
| ~ memberP(sk1,sk5) ),
c_0_108 ).
cnf(c_0_117,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_118,plain,
( app(X1,X2) = nil
| app(X1,app(X2,X3)) != nil
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_89]),c_0_101]) ).
cnf(c_0_119,plain,
( ~ ssItem(X1)
| ~ ssList(app(cons(X1,X2),cons(X1,X3)))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(app(cons(X1,X2),cons(X1,X3))) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_90]),c_0_51])]),c_0_57]) ).
cnf(c_0_120,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_121,negated_conjecture,
( sk4 = nil
| ssList(cons(X1,sk4))
| ~ ssItem(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_44]),c_0_51])]) ).
cnf(c_0_122,negated_conjecture,
( memberP(sk4,sk5)
| sk4 != nil
| ~ frontsegP(sk4,nil) ),
inference(spm,[status(thm)],[c_0_113,c_0_114]) ).
cnf(c_0_123,plain,
( frontsegP(X1,nil)
| ~ ssList(X1) ),
c_0_115 ).
cnf(c_0_124,negated_conjecture,
( ~ memberP(sk1,sk5)
| ~ memberP(sk4,sk5) ),
inference(rw,[status(thm)],[c_0_116,c_0_41]) ).
cnf(c_0_125,plain,
( frontsegP(X3,X1)
| app(X1,X2) != X3
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_117 ).
cnf(c_0_126,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
inference(fof_simplification,[status(thm)],[clause150]) ).
cnf(c_0_127,plain,
( app(X1,nil) = nil
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_90]),c_0_51])]) ).
cnf(c_0_128,plain,
( ~ ssItem(X1)
| ~ ssList(cons(X1,app(X2,cons(X1,X3))))
| ~ ssList(X3)
| ~ ssList(X2)
| ~ duplicatefreeP(cons(X1,app(X2,cons(X1,X3)))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_102]),c_0_57]) ).
cnf(c_0_129,plain,
( duplicatefreeP(X1)
| ssItem(X2)
| ~ ssList(X1) ),
c_0_120 ).
cnf(c_0_130,negated_conjecture,
( sk4 = nil
| ssList(cons(sk6,sk4)) ),
inference(spm,[status(thm)],[c_0_121,c_0_70]) ).
cnf(c_0_131,negated_conjecture,
( memberP(sk4,sk5)
| sk4 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_44])]) ).
cnf(c_0_132,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_133,negated_conjecture,
( sk4 != nil
| ~ memberP(nil,sk5)
| ~ memberP(sk4,sk5) ),
inference(spm,[status(thm)],[c_0_124,c_0_114]) ).
cnf(c_0_134,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_135,negated_conjecture,
( sk4 = nil
| frontsegP(X1,sk7)
| sk4 != X1
| ~ ssList(cons(sk6,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_104]),c_0_69]) ).
cnf(c_0_136,plain,
( X2 = X3
| app(X1,X2) != app(X1,X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3) ),
c_0_126 ).
cnf(c_0_137,plain,
( app(nil,nil) = nil
| X1 != nil
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_90]),c_0_51])]) ).
cnf(c_0_138,negated_conjecture,
( sk4 = nil
| ~ duplicatefreeP(cons(sk6,sk4)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_104]),c_0_51])]),c_0_69]),c_0_121]),c_0_70]) ).
cnf(c_0_139,negated_conjecture,
( sk4 = nil
| ssItem(X1)
| duplicatefreeP(cons(sk6,sk4)) ),
inference(spm,[status(thm)],[c_0_129,c_0_130]) ).
cnf(c_0_140,negated_conjecture,
( memberP(X1,sk5)
| sk4 != nil
| ~ frontsegP(X1,sk4)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_131]),c_0_96]),c_0_44])]) ).
cnf(c_0_141,plain,
( frontsegP(nil,X1)
| nil != X1
| ~ ssList(X1) ),
c_0_132 ).
cnf(c_0_142,negated_conjecture,
( sk4 != nil
| ~ memberP(nil,sk5) ),
inference(spm,[status(thm)],[c_0_133,c_0_131]) ).
cnf(c_0_143,plain,
( frontsegP(cons(X3,X1),cons(X4,X2))
| ~ frontsegP(X1,X2)
| X3 != X4
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X3) ),
c_0_134 ).
cnf(c_0_144,negated_conjecture,
( sk4 = nil
| frontsegP(X1,sk7)
| sk4 != X1
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_57]),c_0_51])]),c_0_70]) ).
cnf(c_0_145,negated_conjecture,
( cons(sk6,nil) = X1
| sk4 = nil
| app(sk7,X1) != sk4
| ~ ssList(cons(sk6,nil))
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_104]),c_0_69]) ).
cnf(c_0_146,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
inference(fof_simplification,[status(thm)],[clause158]) ).
cnf(c_0_147,plain,
app(nil,nil) = nil,
inference(spm,[status(thm)],[c_0_137,c_0_51]) ).
cnf(c_0_148,negated_conjecture,
( sk4 = nil
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_138,c_0_139]) ).
cnf(c_0_149,negated_conjecture,
sk4 != nil,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_141]),c_0_51]),c_0_44])]),c_0_142]) ).
cnf(c_0_150,plain,
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ frontsegP(X2,X3)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2) ),
inference(er,[status(thm)],[c_0_143]) ).
cnf(c_0_151,negated_conjecture,
( sk4 = nil
| frontsegP(sk4,sk7) ),
inference(spm,[status(thm)],[c_0_144,c_0_44]) ).
cnf(c_0_152,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_153,negated_conjecture,
( cons(sk6,nil) = X1
| sk4 = nil
| app(sk7,X1) != sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_57]),c_0_51])]),c_0_70]) ).
cnf(c_0_154,plain,
( memberP(X2,X3)
| memberP(X1,X3)
| ~ memberP(app(X1,X2),X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X3) ),
c_0_146 ).
cnf(c_0_155,plain,
( ssList(cons(X1,nil))
| ~ ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_147]),c_0_51])]) ).
cnf(c_0_156,negated_conjecture,
ssItem(X1),
inference(sr,[status(thm)],[c_0_148,c_0_149]) ).
cnf(c_0_157,negated_conjecture,
( sk4 = nil
| frontsegP(cons(sk6,X1),sk1)
| ~ frontsegP(X1,sk7)
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_150,c_0_81]),c_0_69]),c_0_148]) ).
cnf(c_0_158,negated_conjecture,
frontsegP(sk4,sk7),
inference(sr,[status(thm)],[c_0_151,c_0_149]) ).
cnf(c_0_159,negated_conjecture,
( sk4 = nil
| ssList(cons(X1,sk4)) ),
inference(spm,[status(thm)],[c_0_121,c_0_148]) ).
cnf(c_0_160,plain,
( memberP(app(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssItem(X2) ),
c_0_152 ).
cnf(c_0_161,negated_conjecture,
( skaf45(X1,sk7) = cons(sk6,nil)
| sk4 = nil
| X1 != sk4
| ~ ssList(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_153,c_0_83]),c_0_84])]),c_0_69]),c_0_144]) ).
cnf(c_0_162,plain,
( memberP(cons(X1,nil),X2)
| memberP(X3,X2)
| ~ memberP(cons(X1,X3),X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil))
| ~ ssList(X3) ),
inference(spm,[status(thm)],[c_0_154,c_0_72]) ).
cnf(c_0_163,plain,
ssList(cons(X1,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_155,c_0_156])]) ).
cnf(c_0_164,negated_conjecture,
frontsegP(cons(sk6,sk4),sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_44])]),c_0_149]) ).
cnf(c_0_165,negated_conjecture,
ssList(cons(X1,sk4)),
inference(sr,[status(thm)],[c_0_159,c_0_149]) ).
cnf(c_0_166,plain,
( memberP(X1,X2)
| ~ memberP(skaf45(X1,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_160,c_0_83]),c_0_84])]) ).
cnf(c_0_167,negated_conjecture,
( skaf45(sk4,sk7) = cons(sk6,nil)
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_161,c_0_44]) ).
cnf(c_0_168,plain,
( memberP(cons(X1,nil),X2)
| memberP(X3,X2)
| ~ memberP(cons(X1,X3),X2)
| ~ ssList(X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_162,c_0_156]),c_0_156])]),c_0_163])]) ).
cnf(c_0_169,negated_conjecture,
( memberP(cons(sk6,sk4),sk5)
| memberP(sk4,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_164]),c_0_165])]) ).
cnf(c_0_170,plain,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause139]) ).
cnf(c_0_171,negated_conjecture,
( sk4 = nil
| memberP(sk1,X1)
| ~ memberP(cons(sk6,nil),X1)
| ~ ssItem(X1)
| ~ ssList(cons(sk6,nil)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_68]),c_0_69]) ).
cnf(c_0_172,negated_conjecture,
( sk4 = nil
| memberP(sk4,X1)
| ~ memberP(cons(sk6,nil),X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_166,c_0_167]),c_0_44])]),c_0_69]),c_0_148]),c_0_151]) ).
cnf(c_0_173,negated_conjecture,
( memberP(cons(sk6,nil),sk5)
| memberP(sk4,sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_168,c_0_169]),c_0_44])]) ).
cnf(c_0_174,plain,
( memberP(cons(X3,X1),X2)
| ~ memberP(X1,X2)
| ~ ssList(X1)
| ~ ssItem(X3)
| ~ ssItem(X2) ),
c_0_170 ).
cnf(c_0_175,negated_conjecture,
( sk4 = nil
| memberP(sk1,X1)
| ~ memberP(cons(sk6,nil),X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_171,c_0_57]),c_0_51])]),c_0_70]) ).
cnf(c_0_176,negated_conjecture,
( sk4 = nil
| memberP(cons(sk6,nil),X1)
| memberP(sk7,X1)
| ~ memberP(sk4,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_154,c_0_104]),c_0_69]),c_0_105]),c_0_148]) ).
cnf(c_0_177,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_172,c_0_173]),c_0_149]) ).
cnf(c_0_178,negated_conjecture,
( sk4 = nil
| memberP(sk1,X1)
| ~ memberP(sk7,X1)
| ~ ssItem(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_81]),c_0_69]),c_0_70]) ).
cnf(c_0_179,negated_conjecture,
( memberP(sk1,X1)
| ~ memberP(cons(sk6,nil),X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_175,c_0_156])]),c_0_149]) ).
cnf(c_0_180,negated_conjecture,
( memberP(cons(sk6,nil),sk5)
| memberP(sk7,sk5) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_176,c_0_177]),c_0_149]) ).
cnf(c_0_181,negated_conjecture,
~ memberP(sk1,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_124,c_0_177])]) ).
cnf(c_0_182,negated_conjecture,
( memberP(sk1,X1)
| ~ memberP(sk7,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_178,c_0_156])]),c_0_149]) ).
cnf(c_0_183,negated_conjecture,
memberP(sk7,sk5),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_181]) ).
cnf(c_0_184,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_182,c_0_183]),c_0_181]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SWC377-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun May 19 03:06:52 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 152.12/19.77 # Version: 3.1.0
% 152.12/19.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 152.12/19.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.12/19.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 152.12/19.77 # Starting new_bool_3 with 300s (1) cores
% 152.12/19.77 # Starting new_bool_1 with 300s (1) cores
% 152.12/19.77 # Starting sh5l with 300s (1) cores
% 152.12/19.77 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 10931 completed with status 0
% 152.12/19.77 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 152.12/19.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 152.12/19.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.12/19.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 152.12/19.77 # No SInE strategy applied
% 152.12/19.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 152.12/19.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 152.12/19.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 152.12/19.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 152.12/19.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 152.12/19.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 152.12/19.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 152.12/19.77 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with pid 10941 completed with status 0
% 152.12/19.77 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN
% 152.12/19.77 # Preprocessing class: FSLSSMSMSSSNFFN.
% 152.12/19.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 152.12/19.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 152.12/19.77 # No SInE strategy applied
% 152.12/19.77 # Search class: FGHSM-FSLM21-MFFFFFNN
% 152.12/19.77 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 152.12/19.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 152.12/19.77 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 152.12/19.77 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 152.12/19.77 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 152.12/19.77 # Preprocessing time : 0.004 s
% 152.12/19.77
% 152.12/19.77 # Proof found!
% 152.12/19.77 # SZS status Unsatisfiable
% 152.12/19.77 # SZS output start CNFRefutation
% See solution above
% 152.12/19.77 # Parsed axioms : 199
% 152.12/19.77 # Removed by relevancy pruning/SinE : 0
% 152.12/19.77 # Initial clauses : 199
% 152.12/19.77 # Removed in clause preprocessing : 0
% 152.12/19.77 # Initial clauses in saturation : 199
% 152.12/19.77 # Processed clauses : 13510
% 152.12/19.77 # ...of these trivial : 448
% 152.12/19.77 # ...subsumed : 6869
% 152.12/19.77 # ...remaining for further processing : 6193
% 152.12/19.77 # Other redundant clauses eliminated : 456
% 152.12/19.77 # Clauses deleted for lack of memory : 0
% 152.12/19.77 # Backward-subsumed : 1023
% 152.12/19.77 # Backward-rewritten : 762
% 152.12/19.77 # Generated clauses : 459085
% 152.12/19.77 # ...of the previous two non-redundant : 447697
% 152.12/19.77 # ...aggressively subsumed : 0
% 152.12/19.77 # Contextual simplify-reflections : 1225
% 152.12/19.77 # Paramodulations : 457475
% 152.12/19.77 # Factorizations : 431
% 152.12/19.77 # NegExts : 0
% 152.12/19.77 # Equation resolutions : 914
% 152.12/19.77 # Disequality decompositions : 0
% 152.12/19.77 # Total rewrite steps : 210609
% 152.12/19.77 # ...of those cached : 206224
% 152.12/19.77 # Propositional unsat checks : 1
% 152.12/19.77 # Propositional check models : 0
% 152.12/19.77 # Propositional check unsatisfiable : 0
% 152.12/19.77 # Propositional clauses : 0
% 152.12/19.77 # Propositional clauses after purity: 0
% 152.12/19.77 # Propositional unsat core size : 0
% 152.12/19.77 # Propositional preprocessing time : 0.000
% 152.12/19.77 # Propositional encoding time : 1.346
% 152.12/19.77 # Propositional solver time : 0.470
% 152.12/19.77 # Success case prop preproc time : 0.000
% 152.12/19.77 # Success case prop encoding time : 0.000
% 152.12/19.77 # Success case prop solver time : 0.000
% 152.12/19.77 # Current number of processed clauses : 4138
% 152.12/19.77 # Positive orientable unit clauses : 249
% 152.12/19.77 # Positive unorientable unit clauses: 0
% 152.12/19.77 # Negative unit clauses : 80
% 152.12/19.77 # Non-unit-clauses : 3809
% 152.12/19.77 # Current number of unprocessed clauses: 411621
% 152.12/19.77 # ...number of literals in the above : 2387073
% 152.12/19.77 # Current number of archived formulas : 0
% 152.12/19.77 # Current number of archived clauses : 2050
% 152.12/19.77 # Clause-clause subsumption calls (NU) : 2138687
% 152.12/19.77 # Rec. Clause-clause subsumption calls : 598583
% 152.12/19.77 # Non-unit clause-clause subsumptions : 7375
% 152.12/19.77 # Unit Clause-clause subsumption calls : 80468
% 152.12/19.77 # Rewrite failures with RHS unbound : 0
% 152.12/19.77 # BW rewrite match attempts : 361
% 152.12/19.77 # BW rewrite match successes : 142
% 152.12/19.77 # Condensation attempts : 0
% 152.12/19.77 # Condensation successes : 0
% 152.12/19.77 # Termbank termtop insertions : 19063236
% 152.12/19.77 # Search garbage collected termcells : 539
% 152.12/19.77
% 152.12/19.77 # -------------------------------------------------
% 152.12/19.77 # User time : 18.330 s
% 152.12/19.77 # System time : 0.554 s
% 152.12/19.77 # Total time : 18.884 s
% 152.12/19.77 # Maximum resident set size: 2140 pages
% 152.12/19.77
% 152.12/19.77 # -------------------------------------------------
% 152.12/19.77 # User time : 92.402 s
% 152.12/19.77 # System time : 2.564 s
% 152.12/19.77 # Total time : 94.966 s
% 152.12/19.77 # Maximum resident set size: 1876 pages
% 152.12/19.77 % E---3.1 exiting
%------------------------------------------------------------------------------