TSTP Solution File: SWC178-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SWC178-1 : TPTP v8.2.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.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:24:07 EDT 2024
% Result : Unsatisfiable 0.15s 0.48s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 28
% Syntax : Number of clauses : 94 ( 39 unt; 13 nHn; 92 RR)
% Number of literals : 248 ( 44 equ; 147 neg)
% Maximal clause size : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 106 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_13,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause102,axiom,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_12,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(co1_8,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_9,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause86,axiom,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause181,axiom,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
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(clause66,axiom,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(clause101,axiom,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_14,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
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_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause127,axiom,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(clause63,axiom,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause63) ).
cnf(clause183,axiom,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause183) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause56,axiom,
( segmentP(X1,nil)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause5,axiom,
strictorderP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause5) ).
cnf(c_0_28,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_29,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_30,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk1,
co1_12 ).
cnf(c_0_31,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_32,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_33,negated_conjecture,
~ neq(sk5,sk6),
c_0_28 ).
cnf(c_0_34,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssItem(X1)
| ~ ssItem(X2) ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_36,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_37,negated_conjecture,
app(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)),sk8) = sk3,
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
( app(app(X3,X2),X1) = app(X3,app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_41,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_42,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil)))
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_39]),c_0_40])]) ).
cnf(c_0_43,plain,
( ssList(cons(X1,X2))
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_41 ).
cnf(c_0_44,axiom,
ssList(nil),
clause8 ).
cnf(c_0_45,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_46,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(app(sk7,cons(sk5,nil))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35]),c_0_44])]) ).
cnf(c_0_47,plain,
( ssList(app(X2,X1))
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_45 ).
cnf(c_0_48,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_49,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_50,negated_conjecture,
( app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_51,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_52,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_53,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_54,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_55,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_56,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_57,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_58,plain,
( lt(X2,X4)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderedP(X6)
| ~ ssList(X6) ),
c_0_49 ).
cnf(c_0_59,negated_conjecture,
app(app(sk7,cons(sk5,nil)),app(cons(sk5,nil),sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_43]),c_0_35]),c_0_44])]) ).
cnf(c_0_60,plain,
( app(cons(X1,nil),X2) = cons(X1,X2)
| ~ ssItem(X1)
| ~ ssList(X2) ),
c_0_51 ).
cnf(c_0_61,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_62,plain,
( strictorderedP(cons(X1,nil))
| ~ ssItem(X1) ),
c_0_52 ).
cnf(c_0_63,plain,
( cons(skaf44(X1),nil) = X1
| ~ singletonP(X1)
| ~ ssList(X1) ),
c_0_53 ).
cnf(c_0_64,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_65,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
c_0_54 ).
cnf(c_0_66,plain,
( neq(X2,X1)
| X2 = X1
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_55 ).
cnf(c_0_67,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_68,plain,
( lt(X1,X2)
| ~ ssItem(X2)
| ~ ssItem(X1)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5))) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_69,negated_conjecture,
app(app(sk7,cons(sk5,nil)),cons(sk5,sk8)) = sk3,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_35]),c_0_40])]) ).
cnf(c_0_70,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_61,c_0_31]) ).
cnf(c_0_71,plain,
( strictorderedP(X1)
| ~ singletonP(X1)
| ~ ssList(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64])]) ).
cnf(c_0_72,negated_conjecture,
( sk4 = nil
| singletonP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_44])]) ).
cnf(c_0_73,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_74,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[clause63]) ).
cnf(c_0_75,negated_conjecture,
( lt(sk5,sk5)
| ~ strictorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_35]),c_0_70]),c_0_40]),c_0_44]),c_0_48])]) ).
cnf(c_0_76,negated_conjecture,
( sk4 = nil
| strictorderedP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_70])]) ).
cnf(c_0_77,plain,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
inference(fof_simplification,[status(thm)],[clause183]) ).
cnf(c_0_78,plain,
( X2 = X1
| ~ segmentP(X1,X2)
| ~ segmentP(X2,X1)
| ~ ssList(X1)
| ~ ssList(X2) ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_80,plain,
( ~ lt(X1,X1)
| ~ ssItem(X1) ),
c_0_74 ).
cnf(c_0_81,negated_conjecture,
( sk4 = nil
| lt(sk5,sk5) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,plain,
( lt(X2,X4)
| lt(X4,X2)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| ~ ssList(X5)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X4)
| ~ ssItem(X2)
| ~ strictorderP(X6)
| ~ ssList(X6) ),
c_0_77 ).
cnf(c_0_83,negated_conjecture,
( sk3 = sk4
| ~ segmentP(sk3,sk4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_67]),c_0_70])]) ).
cnf(c_0_84,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_35])]) ).
cnf(c_0_85,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_86,plain,
( lt(X1,X2)
| lt(X2,X1)
| ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(app(app(X3,cons(X2,X4)),cons(X1,X5)))
| ~ ssList(X5)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ strictorderP(app(app(X3,cons(X2,X4)),cons(X1,X5))) ),
inference(er,[status(thm)],[c_0_82]) ).
cnf(c_0_87,negated_conjecture,
( sk3 = nil
| ~ segmentP(sk3,nil) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_83,c_0_84]),c_0_84]) ).
cnf(c_0_88,plain,
( segmentP(X1,nil)
| ~ ssList(X1) ),
c_0_85 ).
cnf(c_0_89,negated_conjecture,
( lt(sk5,sk5)
| ~ strictorderP(sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_69]),c_0_35]),c_0_70]),c_0_40]),c_0_44]),c_0_48])]) ).
cnf(c_0_90,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_70])]) ).
cnf(c_0_91,axiom,
strictorderP(nil),
clause5 ).
cnf(c_0_92,negated_conjecture,
lt(sk5,sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_91])]) ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_92]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : SWC178-1 : TPTP v8.2.0. Released v2.4.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n019.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun May 19 03:25:23 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.15/0.48 # Version: 3.1.0
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 # Starting sh5l with 300s (1) cores
% 0.15/0.48 # sh5l with pid 22162 completed with status 0
% 0.15/0.48 # Result found by sh5l
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 # Starting sh5l with 300s (1) cores
% 0.15/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.48 # G-E--_208_C18_F1_SE_CS_SP_PS_S2s with pid 22170 completed with status 0
% 0.15/0.48 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2s
% 0.15/0.48 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.48 # Starting sh5l with 300s (1) cores
% 0.15/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.48 # Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/0.48 # Scheduled 9 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.48 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2s with 82s (1) cores
% 0.15/0.48 # Preprocessing time : 0.003 s
% 0.15/0.48 # Presaturation interreduction done
% 0.15/0.48
% 0.15/0.48 # Proof found!
% 0.15/0.48 # SZS status Unsatisfiable
% 0.15/0.48 # SZS output start CNFRefutation
% See solution above
% 0.15/0.49 # Parsed axioms : 199
% 0.15/0.49 # Removed by relevancy pruning/SinE : 26
% 0.15/0.49 # Initial clauses : 173
% 0.15/0.49 # Removed in clause preprocessing : 0
% 0.15/0.49 # Initial clauses in saturation : 173
% 0.15/0.49 # Processed clauses : 726
% 0.15/0.49 # ...of these trivial : 17
% 0.15/0.49 # ...subsumed : 75
% 0.15/0.49 # ...remaining for further processing : 634
% 0.15/0.49 # Other redundant clauses eliminated : 52
% 0.15/0.49 # Clauses deleted for lack of memory : 0
% 0.15/0.49 # Backward-subsumed : 16
% 0.15/0.49 # Backward-rewritten : 231
% 0.15/0.49 # Generated clauses : 1500
% 0.15/0.49 # ...of the previous two non-redundant : 1418
% 0.15/0.49 # ...aggressively subsumed : 0
% 0.15/0.49 # Contextual simplify-reflections : 11
% 0.15/0.49 # Paramodulations : 1444
% 0.15/0.49 # Factorizations : 0
% 0.15/0.49 # NegExts : 0
% 0.15/0.49 # Equation resolutions : 57
% 0.15/0.49 # Disequality decompositions : 0
% 0.15/0.49 # Total rewrite steps : 2180
% 0.15/0.49 # ...of those cached : 2069
% 0.15/0.49 # Propositional unsat checks : 0
% 0.15/0.49 # Propositional check models : 0
% 0.15/0.49 # Propositional check unsatisfiable : 0
% 0.15/0.49 # Propositional clauses : 0
% 0.15/0.49 # Propositional clauses after purity: 0
% 0.15/0.49 # Propositional unsat core size : 0
% 0.15/0.49 # Propositional preprocessing time : 0.000
% 0.15/0.49 # Propositional encoding time : 0.000
% 0.15/0.49 # Propositional solver time : 0.000
% 0.15/0.49 # Success case prop preproc time : 0.000
% 0.15/0.49 # Success case prop encoding time : 0.000
% 0.15/0.49 # Success case prop solver time : 0.000
% 0.15/0.49 # Current number of processed clauses : 201
% 0.15/0.49 # Positive orientable unit clauses : 62
% 0.15/0.49 # Positive unorientable unit clauses: 0
% 0.15/0.49 # Negative unit clauses : 3
% 0.15/0.49 # Non-unit-clauses : 136
% 0.15/0.49 # Current number of unprocessed clauses: 1019
% 0.15/0.49 # ...number of literals in the above : 4475
% 0.15/0.49 # Current number of archived formulas : 0
% 0.15/0.49 # Current number of archived clauses : 412
% 0.15/0.49 # Clause-clause subsumption calls (NU) : 20504
% 0.15/0.49 # Rec. Clause-clause subsumption calls : 7919
% 0.15/0.49 # Non-unit clause-clause subsumptions : 100
% 0.15/0.49 # Unit Clause-clause subsumption calls : 998
% 0.15/0.49 # Rewrite failures with RHS unbound : 0
% 0.15/0.49 # BW rewrite match attempts : 67
% 0.15/0.49 # BW rewrite match successes : 40
% 0.15/0.49 # Condensation attempts : 0
% 0.15/0.49 # Condensation successes : 0
% 0.15/0.49 # Termbank termtop insertions : 39738
% 0.15/0.49 # Search garbage collected termcells : 601
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.066 s
% 0.15/0.49 # System time : 0.004 s
% 0.15/0.49 # Total time : 0.071 s
% 0.15/0.49 # Maximum resident set size: 2228 pages
% 0.15/0.49
% 0.15/0.49 # -------------------------------------------------
% 0.15/0.49 # User time : 0.067 s
% 0.15/0.49 # System time : 0.007 s
% 0.15/0.49 # Total time : 0.074 s
% 0.15/0.49 # Maximum resident set size: 1876 pages
% 0.15/0.49 % E---3.1 exiting
% 0.15/0.49 % E exiting
%------------------------------------------------------------------------------