TSTP Solution File: SWC152-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC152-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:23:55 EDT 2024
% Result : Unsatisfiable 0.70s 0.57s
% Output : CNFRefutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 23
% Syntax : Number of clauses : 85 ( 27 unt; 6 nHn; 85 RR)
% Number of literals : 252 ( 59 equ; 176 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 97 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause118,axiom,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_12,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_11,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause119,axiom,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause149,axiom,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause120,axiom,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause70,axiom,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause70) ).
cnf(clause99,axiom,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause185,axiom,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ cyclefreeP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause185) ).
cnf(co1_22,negated_conjecture,
( cons(sk11,nil) = sk3
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_22) ).
cnf(co1_18,negated_conjecture,
( ssItem(sk11)
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause67,axiom,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause67) ).
cnf(co1_13,negated_conjecture,
leq(sk6,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause182,axiom,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause182) ).
cnf(c_0_23,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_24,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_12 ).
cnf(c_0_25,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_26,plain,
( nil = X1
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_23 ).
cnf(c_0_27,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
ssList(sk9),
co1_11 ).
cnf(c_0_29,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_30,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_31,negated_conjecture,
( app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_29 ).
cnf(c_0_33,plain,
( nil = X2
| app(X1,X2) != nil
| ~ ssList(X2)
| ~ ssList(X1) ),
c_0_30 ).
cnf(c_0_34,negated_conjecture,
( app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)) = nil
| sk3 != nil
| ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(app(app(sk7,cons(sk5,nil)),sk8))
| ~ ssList(cons(sk6,nil)) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_37,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_38,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_32]),c_0_36])]) ).
cnf(c_0_39,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_40,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_41,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_37 ).
cnf(c_0_42,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_43,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_32]),c_0_39])]) ).
cnf(c_0_44,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_40 ).
cnf(c_0_45,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_46,axiom,
ssList(nil),
clause8 ).
cnf(c_0_47,negated_conjecture,
( app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_41]),c_0_39]),c_0_36])]) ).
cnf(c_0_48,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_42 ).
cnf(c_0_49,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_50,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause70]) ).
cnf(c_0_51,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_52,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_53,plain,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ cyclefreeP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause185]) ).
cnf(c_0_54,negated_conjecture,
( app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_36])]) ).
cnf(c_0_55,plain,
( cyclefreeP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_50 ).
cnf(c_0_56,negated_conjecture,
( cons(sk11,nil) = sk3
| nil = sk3 ),
co1_22 ).
cnf(c_0_57,negated_conjecture,
( ssItem(sk11)
| nil = sk3 ),
co1_18 ).
cnf(c_0_58,plain,
( cons(X1,X2) != X2
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_59,negated_conjecture,
( cons(sk6,nil) = nil
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_49]),c_0_46])]) ).
cnf(c_0_60,plain,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ cyclefreeP(X6)
| ~ ssList(X6) ),
c_0_53 ).
cnf(c_0_61,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_54]),c_0_28])]) ).
cnf(c_0_62,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_63,negated_conjecture,
( sk3 = nil
| cyclefreeP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_64,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_45]),c_0_46])]) ).
cnf(c_0_65,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause67]) ).
cnf(c_0_66,plain,
( ~ leq(X1,X2)
| ~ leq(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ cyclefreeP(app(app(X3,cons(X2,X4)),cons(X1,X5))) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_67,negated_conjecture,
( app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_48]),c_0_45]),c_0_28])]) ).
cnf(c_0_68,negated_conjecture,
leq(sk6,sk5),
co1_13 ).
cnf(c_0_69,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_62,c_0_25]) ).
cnf(c_0_70,negated_conjecture,
cyclefreeP(sk3),
inference(sr,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_71,plain,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause182]) ).
cnf(c_0_72,plain,
( totalorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_65 ).
cnf(c_0_73,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_45]),c_0_49]),c_0_69]),c_0_28]),c_0_36]),c_0_39]),c_0_70])]) ).
cnf(c_0_74,plain,
( leq(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ totalorderedP(X6)
| ~ ssList(X6) ),
c_0_71 ).
cnf(c_0_75,negated_conjecture,
( sk3 = nil
| totalorderedP(sk3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_56]),c_0_57]) ).
cnf(c_0_76,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_32]),c_0_39])]) ).
cnf(c_0_77,plain,
( leq(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ totalorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_74]) ).
cnf(c_0_78,negated_conjecture,
totalorderedP(sk3),
inference(sr,[status(thm)],[c_0_75,c_0_64]) ).
cnf(c_0_79,negated_conjecture,
( ~ leq(sk5,sk6)
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_44]),c_0_49]),c_0_36])]) ).
cnf(c_0_80,negated_conjecture,
( ~ ssList(app(sk7,cons(sk5,sk8)))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_67]),c_0_45]),c_0_49]),c_0_69]),c_0_28]),c_0_36]),c_0_39]),c_0_78])]),c_0_79]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk5,sk8)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_32]),c_0_39])]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_44]),c_0_49]),c_0_36])]) ).
cnf(c_0_83,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_44]),c_0_45]),c_0_46])]) ).
cnf(c_0_84,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_44]),c_0_49]),c_0_46])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC152-1 : TPTP v8.2.0. Released v2.4.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 03:07:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.70/0.57 # Version: 3.1.0
% 0.70/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.57 # Starting new_bool_3 with 300s (1) cores
% 0.70/0.57 # Starting new_bool_1 with 300s (1) cores
% 0.70/0.57 # Starting sh5l with 300s (1) cores
% 0.70/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1171 completed with status 0
% 0.70/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.70/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.57 # No SInE strategy applied
% 0.70/0.57 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.70/0.57 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.70/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.70/0.57 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.70/0.57 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.70/0.57 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 136s (1) cores
% 0.70/0.57 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1179 completed with status 0
% 0.70/0.57 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.70/0.57 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.70/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.70/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.70/0.57 # No SInE strategy applied
% 0.70/0.57 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.70/0.57 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.70/0.57 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 406s (1) cores
% 0.70/0.57 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.70/0.57 # Preprocessing time : 0.003 s
% 0.70/0.57 # Presaturation interreduction done
% 0.70/0.57
% 0.70/0.57 # Proof found!
% 0.70/0.57 # SZS status Unsatisfiable
% 0.70/0.57 # SZS output start CNFRefutation
% See solution above
% 0.70/0.57 # Parsed axioms : 209
% 0.70/0.57 # Removed by relevancy pruning/SinE : 0
% 0.70/0.57 # Initial clauses : 209
% 0.70/0.57 # Removed in clause preprocessing : 0
% 0.70/0.57 # Initial clauses in saturation : 209
% 0.70/0.57 # Processed clauses : 643
% 0.70/0.57 # ...of these trivial : 16
% 0.70/0.57 # ...subsumed : 67
% 0.70/0.57 # ...remaining for further processing : 560
% 0.70/0.57 # Other redundant clauses eliminated : 73
% 0.70/0.57 # Clauses deleted for lack of memory : 0
% 0.70/0.57 # Backward-subsumed : 52
% 0.70/0.57 # Backward-rewritten : 1
% 0.70/0.57 # Generated clauses : 1431
% 0.70/0.57 # ...of the previous two non-redundant : 1224
% 0.70/0.57 # ...aggressively subsumed : 0
% 0.70/0.57 # Contextual simplify-reflections : 27
% 0.70/0.57 # Paramodulations : 1338
% 0.70/0.57 # Factorizations : 0
% 0.70/0.57 # NegExts : 0
% 0.70/0.57 # Equation resolutions : 78
% 0.70/0.57 # Disequality decompositions : 0
% 0.70/0.57 # Total rewrite steps : 1400
% 0.70/0.57 # ...of those cached : 1274
% 0.70/0.57 # Propositional unsat checks : 0
% 0.70/0.57 # Propositional check models : 0
% 0.70/0.57 # Propositional check unsatisfiable : 0
% 0.70/0.57 # Propositional clauses : 0
% 0.70/0.57 # Propositional clauses after purity: 0
% 0.70/0.57 # Propositional unsat core size : 0
% 0.70/0.57 # Propositional preprocessing time : 0.000
% 0.70/0.57 # Propositional encoding time : 0.000
% 0.70/0.57 # Propositional solver time : 0.000
% 0.70/0.57 # Success case prop preproc time : 0.000
% 0.70/0.57 # Success case prop encoding time : 0.000
% 0.70/0.57 # Success case prop solver time : 0.000
% 0.70/0.57 # Current number of processed clauses : 267
% 0.70/0.57 # Positive orientable unit clauses : 84
% 0.70/0.57 # Positive unorientable unit clauses: 0
% 0.70/0.57 # Negative unit clauses : 5
% 0.70/0.57 # Non-unit-clauses : 178
% 0.70/0.57 # Current number of unprocessed clauses: 968
% 0.70/0.57 # ...number of literals in the above : 5840
% 0.70/0.57 # Current number of archived formulas : 0
% 0.70/0.57 # Current number of archived clauses : 270
% 0.70/0.57 # Clause-clause subsumption calls (NU) : 17156
% 0.70/0.57 # Rec. Clause-clause subsumption calls : 4534
% 0.70/0.57 # Non-unit clause-clause subsumptions : 104
% 0.70/0.57 # Unit Clause-clause subsumption calls : 231
% 0.70/0.57 # Rewrite failures with RHS unbound : 0
% 0.70/0.57 # BW rewrite match attempts : 14
% 0.70/0.57 # BW rewrite match successes : 14
% 0.70/0.57 # Condensation attempts : 0
% 0.70/0.57 # Condensation successes : 0
% 0.70/0.57 # Termbank termtop insertions : 37360
% 0.70/0.57 # Search garbage collected termcells : 547
% 0.70/0.57
% 0.70/0.57 # -------------------------------------------------
% 0.70/0.57 # User time : 0.066 s
% 0.70/0.57 # System time : 0.008 s
% 0.70/0.57 # Total time : 0.074 s
% 0.70/0.57 # Maximum resident set size: 2160 pages
% 0.70/0.57
% 0.70/0.57 # -------------------------------------------------
% 0.70/0.57 # User time : 0.254 s
% 0.70/0.57 # System time : 0.033 s
% 0.70/0.57 # Total time : 0.287 s
% 0.70/0.57 # Maximum resident set size: 1884 pages
% 0.70/0.57 % E---3.1 exiting
% 0.70/0.57 % E exiting
%------------------------------------------------------------------------------