TSTP Solution File: SWC396-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SWC396-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:48 EDT 2023
% Result : Unsatisfiable 1.19s 0.65s
% Output : CNFRefutation 1.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 24
% Syntax : Number of clauses : 84 ( 24 unt; 37 nHn; 84 RR)
% Number of literals : 255 ( 92 equ; 141 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 73 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_12) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause85) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_1) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_6) ).
cnf(clause100,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause100) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause8) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_10) ).
cnf(clause76,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause76) ).
cnf(clause75,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause75) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause86) ).
cnf(clause104,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause104) ).
cnf(clause133,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause133) ).
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause118) ).
cnf(clause123,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause123) ).
cnf(co1_8,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_8) ).
cnf(clause140,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause140) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_7) ).
cnf(clause175,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause175) ).
cnf(co1_9,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_9) ).
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.6FuZyFz1sL/E---3.1_7316.p',clause161) ).
cnf(co1_11,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',co1_11) ).
cnf(clause115,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/tmp/tmp.6FuZyFz1sL/E---3.1_7316.p',clause115) ).
cnf(c_0_24,negated_conjecture,
( sk4 = X1
| ~ neq(sk4,nil)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| tl(sk3) != X2
| app(X2,X3) != X1
| ~ ssItem(X4)
| cons(X4,nil) != X3
| hd(sk3) != X4
| ~ neq(nil,sk3)
| ~ neq(nil,sk3) ),
co1_12 ).
cnf(c_0_25,negated_conjecture,
( sk4 = X1
| tl(sk3) != X2
| hd(sk3) != X4
| app(X2,X3) != X1
| cons(X4,nil) != X3
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ neq(nil,sk3)
| ~ neq(sk4,nil) ),
inference(cn,[status(thm)],[c_0_24]) ).
cnf(c_0_26,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
clause85 ).
cnf(c_0_27,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_28,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_29,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| ~ neq(nil,sk3)
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_25])])])]),c_0_26]) ).
cnf(c_0_30,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
clause100 ).
cnf(c_0_31,axiom,
ssList(nil),
clause8 ).
cnf(c_0_32,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_34,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_35,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ neq(sk4,nil)
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( nil = sk3
| nil != sk4 ),
co1_10 ).
cnf(c_0_38,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_30]),c_0_36]),c_0_31])]),c_0_37]) ).
cnf(c_0_39,axiom,
( ssItem(hd(X1))
| nil = X1
| ~ ssList(X1) ),
clause76 ).
cnf(c_0_40,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_32])]) ).
cnf(c_0_41,axiom,
( ssList(tl(X1))
| nil = X1
| ~ ssList(X1) ),
clause75 ).
cnf(c_0_42,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_32])]) ).
cnf(c_0_43,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
clause86 ).
cnf(c_0_44,axiom,
( cons(hd(X1),tl(X1)) = X1
| nil = X1
| ~ ssList(X1) ),
clause104 ).
cnf(c_0_45,axiom,
( nil = X2
| tl(app(X2,X1)) = app(tl(X2),X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause133 ).
cnf(c_0_46,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
clause118 ).
cnf(c_0_47,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_31])]) ).
cnf(c_0_48,plain,
( cons(hd(app(X1,X2)),app(tl(X1),X2)) = app(X1,X2)
| nil = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_26]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
( app(tl(sk3),cons(hd(sk3),nil)) = sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_32])]) ).
cnf(c_0_51,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_31])]) ).
cnf(c_0_52,negated_conjecture,
( cons(hd(app(sk3,cons(hd(sk3),nil))),sk4) = app(sk3,cons(hd(sk3),nil))
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_32])]) ).
cnf(c_0_53,axiom,
( nil = X2
| hd(app(X2,X1)) = hd(X2)
| ~ ssList(X1)
| ~ ssList(X2) ),
clause123 ).
cnf(c_0_54,negated_conjecture,
memberP(sk1,sk5),
co1_8 ).
cnf(c_0_55,negated_conjecture,
( app(sk3,cons(hd(sk3),nil)) = cons(hd(sk3),sk4)
| sk3 = nil
| ~ ssList(cons(hd(sk3),nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_32])]) ).
cnf(c_0_56,axiom,
( memberP(app(X1,X3),X2)
| ~ memberP(X1,X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2) ),
clause140 ).
cnf(c_0_57,negated_conjecture,
memberP(sk3,sk5),
inference(rw,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_58,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_59,negated_conjecture,
( app(sk3,cons(hd(sk3),nil)) = cons(hd(sk3),sk4)
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_43]),c_0_31])]) ).
cnf(c_0_60,negated_conjecture,
( memberP(app(sk3,X1),sk5)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_32])]) ).
cnf(c_0_61,negated_conjecture,
( app(sk3,cons(hd(sk3),nil)) = cons(hd(sk3),sk4)
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_39]),c_0_32])]) ).
cnf(c_0_62,axiom,
( memberP(X4,X2)
| app(X1,cons(X2,X3)) != X4
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssList(X4) ),
clause175 ).
cnf(c_0_63,negated_conjecture,
( sk3 = nil
| memberP(cons(hd(sk3),sk4),sk5)
| ~ ssList(cons(hd(sk3),nil)) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_64,plain,
( memberP(app(X1,cons(X2,X3)),X2)
| ~ ssItem(X2)
| ~ ssList(app(X1,cons(X2,X3)))
| ~ ssList(X3)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_62]) ).
cnf(c_0_65,negated_conjecture,
( sk3 = nil
| memberP(cons(hd(sk3),sk4),sk5)
| ~ ssItem(hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_43]),c_0_31])]) ).
cnf(c_0_66,negated_conjecture,
~ memberP(sk2,sk5),
co1_9 ).
cnf(c_0_67,negated_conjecture,
( sk3 = nil
| memberP(sk4,hd(sk3))
| ~ ssItem(hd(sk3))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_49]),c_0_36]),c_0_31])]) ).
cnf(c_0_68,axiom,
( memberP(X2,X3)
| X3 = X1
| ~ memberP(cons(X1,X2),X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X3) ),
clause161 ).
cnf(c_0_69,negated_conjecture,
( sk3 = nil
| memberP(cons(hd(sk3),sk4),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_39]),c_0_32])]) ).
cnf(c_0_70,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_66,c_0_34]) ).
cnf(c_0_71,negated_conjecture,
( sk3 = nil
| memberP(sk4,hd(sk3))
| ~ ssList(tl(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_39]),c_0_32])]) ).
cnf(c_0_72,negated_conjecture,
( hd(sk3) = sk5
| sk3 = nil
| ~ ssItem(hd(sk3)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_58]),c_0_36])]),c_0_70]) ).
cnf(c_0_73,negated_conjecture,
( neq(sk3,nil)
| ~ neq(sk4,nil) ),
co1_11 ).
cnf(c_0_74,negated_conjecture,
( sk3 = nil
| memberP(sk4,hd(sk3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_41]),c_0_32])]) ).
cnf(c_0_75,negated_conjecture,
( hd(sk3) = sk5
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_39]),c_0_32])]) ).
cnf(c_0_76,axiom,
( X1 != X2
| ~ neq(X1,X2)
| ~ ssList(X2)
| ~ ssList(X1) ),
clause115 ).
cnf(c_0_77,negated_conjecture,
( sk4 = nil
| neq(sk3,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_30]),c_0_36]),c_0_31])]) ).
cnf(c_0_78,negated_conjecture,
sk3 = nil,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_70]) ).
cnf(c_0_79,plain,
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(er,[status(thm)],[c_0_76]) ).
cnf(c_0_80,negated_conjecture,
( sk4 = nil
| neq(nil,nil) ),
inference(rw,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_81,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_31])]) ).
cnf(c_0_82,negated_conjecture,
~ memberP(nil,sk5),
inference(rw,[status(thm)],[c_0_70,c_0_81]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_78]),c_0_82]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.15 % Problem : SWC396-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.16 % Command : run_E %s %d THM
% 0.16/0.37 % Computer : n017.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.38 % CPULimit : 2400
% 0.16/0.38 % WCLimit : 300
% 0.16/0.38 % DateTime : Tue Oct 3 01:25:56 EDT 2023
% 0.16/0.38 % CPUTime :
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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.6FuZyFz1sL/E---3.1_7316.p
% 1.19/0.65 # Version: 3.1pre001
% 1.19/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.65 # Starting sh5l with 300s (1) cores
% 1.19/0.65 # sh5l with pid 7481 completed with status 0
% 1.19/0.65 # Result found by sh5l
% 1.19/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.65 # Starting sh5l with 300s (1) cores
% 1.19/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.19/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.19/0.65 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.19/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.19/0.65 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 7489 completed with status 0
% 1.19/0.65 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 1.19/0.65 # Preprocessing class: FSLSSMSMSSSNFFN.
% 1.19/0.65 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.19/0.65 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.19/0.65 # Starting new_bool_3 with 300s (1) cores
% 1.19/0.65 # Starting new_bool_1 with 300s (1) cores
% 1.19/0.65 # Starting sh5l with 300s (1) cores
% 1.19/0.65 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.19/0.65 # Search class: FGHSM-FSLM21-MFFFFFNN
% 1.19/0.65 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 1.19/0.65 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 1.19/0.65 # Preprocessing time : 0.003 s
% 1.19/0.65 # Presaturation interreduction done
% 1.19/0.65
% 1.19/0.65 # Proof found!
% 1.19/0.65 # SZS status Unsatisfiable
% 1.19/0.65 # SZS output start CNFRefutation
% See solution above
% 1.19/0.65 # Parsed axioms : 197
% 1.19/0.65 # Removed by relevancy pruning/SinE : 33
% 1.19/0.65 # Initial clauses : 164
% 1.19/0.65 # Removed in clause preprocessing : 0
% 1.19/0.65 # Initial clauses in saturation : 164
% 1.19/0.65 # Processed clauses : 858
% 1.19/0.65 # ...of these trivial : 2
% 1.19/0.65 # ...subsumed : 270
% 1.19/0.65 # ...remaining for further processing : 585
% 1.19/0.65 # Other redundant clauses eliminated : 49
% 1.19/0.65 # Clauses deleted for lack of memory : 0
% 1.19/0.65 # Backward-subsumed : 108
% 1.19/0.65 # Backward-rewritten : 84
% 1.19/0.65 # Generated clauses : 1807
% 1.19/0.65 # ...of the previous two non-redundant : 1623
% 1.19/0.65 # ...aggressively subsumed : 0
% 1.19/0.65 # Contextual simplify-reflections : 70
% 1.19/0.65 # Paramodulations : 1757
% 1.19/0.65 # Factorizations : 0
% 1.19/0.65 # NegExts : 0
% 1.19/0.65 # Equation resolutions : 54
% 1.19/0.65 # Total rewrite steps : 1375
% 1.19/0.65 # Propositional unsat checks : 0
% 1.19/0.65 # Propositional check models : 0
% 1.19/0.65 # Propositional check unsatisfiable : 0
% 1.19/0.65 # Propositional clauses : 0
% 1.19/0.65 # Propositional clauses after purity: 0
% 1.19/0.65 # Propositional unsat core size : 0
% 1.19/0.65 # Propositional preprocessing time : 0.000
% 1.19/0.65 # Propositional encoding time : 0.000
% 1.19/0.65 # Propositional solver time : 0.000
% 1.19/0.65 # Success case prop preproc time : 0.000
% 1.19/0.65 # Success case prop encoding time : 0.000
% 1.19/0.65 # Success case prop solver time : 0.000
% 1.19/0.65 # Current number of processed clauses : 216
% 1.19/0.65 # Positive orientable unit clauses : 44
% 1.19/0.65 # Positive unorientable unit clauses: 0
% 1.19/0.65 # Negative unit clauses : 1
% 1.19/0.65 # Non-unit-clauses : 171
% 1.19/0.65 # Current number of unprocessed clauses: 1056
% 1.19/0.65 # ...number of literals in the above : 6665
% 1.19/0.65 # Current number of archived formulas : 0
% 1.19/0.65 # Current number of archived clauses : 348
% 1.19/0.65 # Clause-clause subsumption calls (NU) : 25035
% 1.19/0.65 # Rec. Clause-clause subsumption calls : 3874
% 1.19/0.65 # Non-unit clause-clause subsumptions : 448
% 1.19/0.65 # Unit Clause-clause subsumption calls : 229
% 1.19/0.65 # Rewrite failures with RHS unbound : 0
% 1.19/0.65 # BW rewrite match attempts : 3
% 1.19/0.65 # BW rewrite match successes : 3
% 1.19/0.65 # Condensation attempts : 0
% 1.19/0.65 # Condensation successes : 0
% 1.19/0.65 # Termbank termtop insertions : 41556
% 1.19/0.65
% 1.19/0.65 # -------------------------------------------------
% 1.19/0.65 # User time : 0.085 s
% 1.19/0.65 # System time : 0.006 s
% 1.19/0.65 # Total time : 0.091 s
% 1.19/0.65 # Maximum resident set size: 2184 pages
% 1.19/0.65
% 1.19/0.65 # -------------------------------------------------
% 1.19/0.65 # User time : 0.088 s
% 1.19/0.65 # System time : 0.009 s
% 1.19/0.65 # Total time : 0.097 s
% 1.19/0.65 # Maximum resident set size: 1848 pages
% 1.19/0.65 % E---3.1 exiting
% 1.19/0.65 % E---3.1 exiting
%------------------------------------------------------------------------------