%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC178-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:43:21 PM UTC 2026
% Result : Unsatisfiable 0.40s 0.48s
% Output : CNFRefutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 29
% Syntax : Number of clauses : 99 ( 36 unt; 8 nHn; 97 RR)
% Number of literals : 255 ( 64 equ; 162 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 101 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
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(co1_13,negated_conjecture,
~ neq(sk5,sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_11,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(clause119,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause119) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause65,axiom,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause65) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(co1_14,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
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_10,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,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(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause152,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause152) ).
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(clause80,axiom,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause79,axiom,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause79) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
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,negated_conjecture,
~ neq(sk5,sk6),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_33,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_29 ).
cnf(c_0_35,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_36,negated_conjecture,
ssList(sk8),
co1_11 ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_38,negated_conjecture,
~ neq(sk5,sk6),
c_0_32 ).
cnf(c_0_39,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
ssItem(sk5),
co1_8 ).
cnf(c_0_41,negated_conjecture,
ssItem(sk6),
co1_9 ).
cnf(c_0_42,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause149]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
inference(fof_simplification,[status(thm)],[clause119]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(app(app(sk7,cons(sk5,nil)),cons(sk6,nil)))
| sk3 != nil
| app(app(sk7,cons(sk5,nil)),cons(sk6,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_37 ).
cnf(c_0_46,negated_conjecture,
sk6 = sk5,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41])]) ).
cnf(c_0_47,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_48,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_42 ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X2 ),
c_0_43 ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| sk3 != nil
| app(app(sk7,cons(sk5,nil)),cons(sk5,nil)) = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_46]) ).
cnf(c_0_52,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_47 ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| 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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_48]),c_0_46]),c_0_46]),c_0_36])]) ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_49 ).
cnf(c_0_55,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause65]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_58,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_60,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_61,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| sk3 != nil
| cons(sk5,nil) = nil ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_63,negated_conjecture,
ssList(sk7),
co1_10 ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_65,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_52]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,nil)))
| 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_53,c_0_54]),c_0_40]),c_0_36])]) ).
cnf(c_0_67,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_55,c_0_31]) ).
cnf(c_0_68,axiom,
ssList(nil),
clause8 ).
cnf(c_0_69,plain,
( ~ ssItem(X1)
| duplicatefreeP(cons(X1,nil)) ),
c_0_56 ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_57 ).
cnf(c_0_71,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_72,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
c_0_58 ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_59 ).
cnf(c_0_74,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
inference(fof_simplification,[status(thm)],[clause152]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_45]),c_0_63])]) ).
cnf(c_0_78,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_64 ).
cnf(c_0_79,negated_conjecture,
( ~ duplicatefreeP(sk3)
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,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(spm,[status(thm)],[c_0_65,c_0_66]),c_0_40]),c_0_67]),c_0_36]),c_0_68]),c_0_63])]) ).
cnf(c_0_80,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| duplicatefreeP(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71])]) ).
cnf(c_0_81,negated_conjecture,
( singletonP(sk3)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_74]),c_0_68])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause80]) ).
cnf(c_0_83,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ segmentP(X2,X3)
| ~ segmentP(X1,X2)
| segmentP(X1,X3) ),
c_0_75 ).
cnf(c_0_84,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_85,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_76 ).
cnf(c_0_86,negated_conjecture,
( sk3 != nil
| cons(sk5,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_40]),c_0_68])]) ).
cnf(c_0_87,negated_conjecture,
( ~ duplicatefreeP(sk3)
| ~ ssList(cons(sk5,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_45]),c_0_63])]) ).
cnf(c_0_88,negated_conjecture,
( duplicatefreeP(sk3)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_67])]) ).
cnf(c_0_89,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause79]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| ~ segmentP(nil,X1)
| nil = X1 ),
c_0_82 ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| ~ segmentP(X1,sk4)
| segmentP(X1,sk3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_67]),c_0_74])]) ).
cnf(c_0_92,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_40]),c_0_68])]) ).
cnf(c_0_93,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_87,c_0_88]) ).
cnf(c_0_94,plain,
( ~ ssList(X1)
| nil != X1
| segmentP(nil,X1) ),
c_0_89 ).
cnf(c_0_95,negated_conjecture,
~ segmentP(nil,sk4),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_67]),c_0_68])]),c_0_92]) ).
cnf(c_0_96,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_78]),c_0_40]),c_0_68])]) ).
cnf(c_0_97,plain,
segmentP(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_94]),c_0_68])]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC178-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 08:02:48 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.40/0.48 % Version: 3.5.1
% 0.40/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.40/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.40/0.48 % Starting sh5l with 300s (1) cores
% 0.40/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2441176 completed with status 0
% 0.40/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.40/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.48 % No SInE strategy applied
% 0.40/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.40/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.48 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.40/0.48 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.40/0.48 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.40/0.48 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2441184 completed with status 0
% 0.40/0.48 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.40/0.48 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.40/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.40/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.40/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.40/0.48 % No SInE strategy applied
% 0.40/0.48 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.40/0.48 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.40/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.40/0.48 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.40/0.48 % Preprocessing time : 0.002 s
% 0.40/0.48 % Presaturation interreduction done
% 0.40/0.48
% 0.40/0.48 % Proof found!
% 0.40/0.48 % SZS status Unsatisfiable
% 0.40/0.48 % SZS output start CNFRefutation
% See solution above
% 0.40/0.48 % Parsed axioms : 199
% 0.40/0.48 % Removed by relevancy pruning/SinE : 0
% 0.40/0.48 % Initial clauses : 199
% 0.40/0.48 % Removed in clause preprocessing : 0
% 0.40/0.48 % Initial clauses in saturation : 199
% 0.40/0.48 % Processed clauses : 568
% 0.40/0.48 % ...of these trivial : 2
% 0.40/0.48 % ...subsumed : 75
% 0.40/0.48 % ...remaining for further processing : 491
% 0.40/0.48 % Other redundant clauses eliminated : 73
% 0.40/0.48 % Clauses deleted for lack of memory : 0
% 0.40/0.48 % Backward-subsumed : 15
% 0.40/0.48 % Backward-rewritten : 23
% 0.40/0.48 % Generated clauses : 1274
% 0.40/0.48 % ...of the previous two non-redundant : 1103
% 0.40/0.48 % ...aggressively subsumed : 0
% 0.40/0.48 % Contextual simplify-reflections : 2
% 0.40/0.48 % Paramodulations : 1197
% 0.40/0.48 % Factorizations : 0
% 0.40/0.48 % NegExts : 0
% 0.40/0.48 % Equation resolutions : 78
% 0.40/0.48 % Disequality decompositions : 0
% 0.40/0.48 % Total rewrite steps : 1254
% 0.40/0.48 % ...of those cached : 1142
% 0.40/0.48 % Propositional unsat checks : 0
% 0.40/0.48 % Propositional check models : 0
% 0.40/0.48 % Propositional check unsatisfiable : 0
% 0.40/0.48 % Propositional clauses : 0
% 0.40/0.48 % Propositional clauses after purity: 0
% 0.40/0.48 % Propositional unsat core size : 0
% 0.40/0.48 % Propositional preprocessing time : 0.000
% 0.40/0.48 % Propositional encoding time : 0.000
% 0.40/0.48 % Propositional solver time : 0.000
% 0.40/0.48 % Success case prop preproc time : 0.000
% 0.40/0.48 % Success case prop encoding time : 0.000
% 0.40/0.48 % Success case prop solver time : 0.000
% 0.40/0.48 % Current number of processed clauses : 239
% 0.40/0.48 % Positive orientable unit clauses : 67
% 0.40/0.48 % Positive unorientable unit clauses: 0
% 0.40/0.48 % Negative unit clauses : 4
% 0.40/0.48 % Non-unit-clauses : 168
% 0.40/0.48 % Current number of unprocessed clauses: 906
% 0.40/0.48 % ...number of literals in the above : 5461
% 0.40/0.48 % Current number of archived formulas : 0
% 0.40/0.48 % Current number of archived clauses : 229
% 0.40/0.48 % Clause-clause subsumption calls (NU) : 15458
% 0.40/0.48 % Rec. Clause-clause subsumption calls : 3860
% 0.40/0.48 % Non-unit clause-clause subsumptions : 64
% 0.40/0.48 % Unit Clause-clause subsumption calls : 178
% 0.40/0.48 % Rewrite failures with RHS unbound : 0
% 0.40/0.48 % BW rewrite match attempts : 3
% 0.40/0.48 % BW rewrite match successes : 2
% 0.40/0.48 % Condensation attempts : 0
% 0.40/0.48 % Condensation successes : 0
% 0.40/0.48 % Termbank termtop insertions : 35977
% 0.40/0.48 % Search garbage collected termcells : 532
% 0.40/0.48
% 0.40/0.48 % -------------------------------------------------
% 0.40/0.48 % User time : 0.035 s
% 0.40/0.48 % System time : 0.006 s
% 0.40/0.48 % Total time : 0.041 s
% 0.40/0.48 % Maximum resident set size: 4068 pages
% 0.40/0.48
% 0.40/0.48 % -------------------------------------------------
% 0.40/0.48 % User time : 0.154 s
% 0.40/0.48 % System time : 0.031 s
% 0.40/0.48 % Total time : 0.185 s
% 0.40/0.48 % Maximum resident set size: 5120 pages
% 0.40/0.48 % E exiting
%------------------------------------------------------------------------------