%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC113-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 : n017.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:03 PM UTC 2026
% Result : Unsatisfiable 7.52s 1.61s
% Output : CNFRefutation 7.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 26
% Syntax : Number of clauses : 92 ( 26 unt; 18 nHn; 86 RR)
% Number of literals : 234 ( 68 equ; 133 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 101 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(clause99,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause99) ).
cnf(co1_9,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_15,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_11,negated_conjecture,
( nil = sk3
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_8,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
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(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(clause169,axiom,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(co1_12,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause131,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause131) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause50,axiom,
ssList(skaf46(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause50) ).
cnf(co1_14,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause58,axiom,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause58) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause127,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause127) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
inference(fof_simplification,[status(thm)],[clause99]) ).
cnf(c_0_27,negated_conjecture,
( nil = sk4
| cons(sk5,nil) = sk3 ),
co1_9 ).
cnf(c_0_28,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_29,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_30,negated_conjecture,
( nil = sk4
| ssItem(sk5) ),
co1_7 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_32,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_33,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != X2 ),
c_0_26 ).
cnf(c_0_34,negated_conjecture,
( sk2 = nil
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_35,axiom,
ssList(nil),
clause8 ).
cnf(c_0_36,negated_conjecture,
( ssItem(sk5)
| sk2 = nil ),
inference(rw,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_31 ).
cnf(c_0_38,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( sk1 != nil
| sk2 = nil ),
inference(csr,[status(thm)],[inference(cn,[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,
( nil = sk3
| cons(sk5,nil) = sk3 ),
co1_11 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( sk1 != nil
| neq(nil,nil) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( nil = sk3
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_44,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
inference(fof_simplification,[status(thm)],[clause173]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_46,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_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_48,negated_conjecture,
( sk1 = nil
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_29]),c_0_29]) ).
cnf(c_0_49,negated_conjecture,
sk1 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_35])]) ).
cnf(c_0_50,negated_conjecture,
( ssItem(sk5)
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_43,c_0_29]) ).
cnf(c_0_51,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_44 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_45 ).
cnf(c_0_53,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_46 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
inference(fof_simplification,[status(thm)],[clause169]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_47 ).
cnf(c_0_56,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_57,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(app(app(X1,X2),X3))
| segmentP(app(app(X1,X2),X3),X2) ),
inference(er,[status(thm)],[c_0_51]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_52]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_54 ).
cnf(c_0_61,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,X1) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57])]) ).
cnf(c_0_62,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_63,negated_conjecture,
( nil = sk3
| memberP(sk4,sk5) ),
co1_12 ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
inference(fof_simplification,[status(thm)],[clause131]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| segmentP(app(X1,app(X2,X3)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_53]),c_0_59]) ).
cnf(c_0_66,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| app(skaf42(X1,sk5),app(sk1,skaf43(sk5,X1))) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_57]),c_0_62])]) ).
cnf(c_0_67,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_68,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_69,negated_conjecture,
( memberP(sk2,sk5)
| sk1 = nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_29]),c_0_28]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ rearsegP(X1,X2)
| app(skaf46(X1,X2),X2) = X1 ),
c_0_64 ).
cnf(c_0_71,axiom,
ssList(skaf46(X1,X2)),
clause50 ).
cnf(c_0_72,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(X1)
| ~ memberP(X1,sk5)
| segmentP(X1,sk1) ),
inference(cn,[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_62]),c_0_67]),c_0_68])]) ).
cnf(c_0_74,negated_conjecture,
memberP(sk2,sk5),
inference(sr,[status(thm)],[c_0_69,c_0_49]) ).
cnf(c_0_75,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ rearsegP(X1,X3)
| segmentP(app(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_70]),c_0_71])]),c_0_52]) ).
cnf(c_0_77,negated_conjecture,
app(sk1,nil) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_61]),c_0_35])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause58]) ).
cnf(c_0_79,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_72 ).
cnf(c_0_80,negated_conjecture,
segmentP(sk2,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_81,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
inference(fof_simplification,[status(thm)],[clause127]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(X1)
| ~ rearsegP(sk1,X1)
| segmentP(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_35]),c_0_67])]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| rearsegP(X1,nil) ),
c_0_78 ).
cnf(c_0_85,negated_conjecture,
( ~ neq(sk1,nil)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80])]) ).
cnf(c_0_86,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_81 ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ segmentP(X2,X1)
| ~ segmentP(X1,X2)
| X2 = X1 ),
c_0_82 ).
cnf(c_0_88,negated_conjecture,
segmentP(sk1,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_35]),c_0_67])]) ).
cnf(c_0_89,negated_conjecture,
sk2 = nil,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_85,c_0_86]),c_0_67]),c_0_35])]),c_0_49]) ).
cnf(c_0_90,negated_conjecture,
~ segmentP(nil,sk1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_88]),c_0_67]),c_0_35])]),c_0_49]) ).
cnf(c_0_91,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_89]),c_0_90]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC113-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n017.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Mon Sep 21 07:51:57 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 7.52/1.61 % Version: 3.5.1
% 7.52/1.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.52/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.52/1.61 % Starting new_bool_3 with 300s (1) cores
% 7.52/1.61 % Starting new_bool_1 with 300s (1) cores
% 7.52/1.61 % Starting sh5l with 300s (1) cores
% 7.52/1.61 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1828758 completed with status 0
% 7.52/1.61 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.52/1.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.52/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.52/1.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.52/1.61 % No SInE strategy applied
% 7.52/1.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 7.52/1.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 7.52/1.61 % Starting SubtermCWHack with 136s (1) cores
% 7.52/1.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.52/1.61 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 7.52/1.61 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 7.52/1.61 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 7.52/1.61 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1828765 completed with status 0
% 7.52/1.61 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.52/1.61 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.52/1.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.52/1.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.52/1.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.52/1.61 % No SInE strategy applied
% 7.52/1.61 % Search class: FGHSM-FSLM21-MFFFFFNN
% 7.52/1.61 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 7.52/1.61 % Starting SubtermCWHack with 136s (1) cores
% 7.52/1.61 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.52/1.61 % Preprocessing time : 0.006 s
% 7.52/1.61 % Presaturation interreduction done
% 7.52/1.61
% 7.52/1.61 % Proof found!
% 7.52/1.61 % SZS status Unsatisfiable
% 7.52/1.61 % SZS output start CNFRefutation
% See solution above
% 7.52/1.61 % Parsed axioms : 201
% 7.52/1.61 % Removed by relevancy pruning/SinE : 0
% 7.52/1.61 % Initial clauses : 201
% 7.52/1.61 % Removed in clause preprocessing : 0
% 7.52/1.61 % Initial clauses in saturation : 201
% 7.52/1.61 % Processed clauses : 4006
% 7.52/1.61 % ...of these trivial : 41
% 7.52/1.61 % ...subsumed : 2457
% 7.52/1.61 % ...remaining for further processing : 1508
% 7.52/1.61 % Other redundant clauses eliminated : 281
% 7.52/1.61 % Clauses deleted for lack of memory : 0
% 7.52/1.61 % Backward-subsumed : 48
% 7.52/1.61 % Backward-rewritten : 181
% 7.52/1.61 % Generated clauses : 24247
% 7.52/1.61 % ...of the previous two non-redundant : 22404
% 7.52/1.61 % ...aggressively subsumed : 0
% 7.52/1.61 % Contextual simplify-reflections : 238
% 7.52/1.61 % Paramodulations : 23958
% 7.52/1.61 % Factorizations : 0
% 7.52/1.61 % NegExts : 0
% 7.52/1.61 % Equation resolutions : 287
% 7.52/1.61 % Disequality decompositions : 0
% 7.52/1.61 % Total rewrite steps : 19095
% 7.52/1.61 % ...of those cached : 18704
% 7.52/1.61 % Propositional unsat checks : 0
% 7.52/1.61 % Propositional check models : 0
% 7.52/1.61 % Propositional check unsatisfiable : 0
% 7.52/1.61 % Propositional clauses : 0
% 7.52/1.61 % Propositional clauses after purity: 0
% 7.52/1.61 % Propositional unsat core size : 0
% 7.52/1.61 % Propositional preprocessing time : 0.000
% 7.52/1.61 % Propositional encoding time : 0.000
% 7.52/1.61 % Propositional solver time : 0.000
% 7.52/1.61 % Success case prop preproc time : 0.000
% 7.52/1.61 % Success case prop encoding time : 0.000
% 7.52/1.61 % Success case prop solver time : 0.000
% 7.52/1.61 % Current number of processed clauses : 1060
% 7.52/1.61 % Positive orientable unit clauses : 127
% 7.52/1.61 % Positive unorientable unit clauses: 0
% 7.52/1.61 % Negative unit clauses : 37
% 7.52/1.61 % Non-unit-clauses : 896
% 7.52/1.61 % Current number of unprocessed clauses: 18638
% 7.52/1.61 % ...number of literals in the above : 100850
% 7.52/1.61 % Current number of archived formulas : 0
% 7.52/1.61 % Current number of archived clauses : 425
% 7.52/1.61 % Clause-clause subsumption calls (NU) : 177012
% 7.52/1.61 % Rec. Clause-clause subsumption calls : 42995
% 7.52/1.61 % Non-unit clause-clause subsumptions : 1874
% 7.52/1.61 % Unit Clause-clause subsumption calls : 1666
% 7.52/1.61 % Rewrite failures with RHS unbound : 0
% 7.52/1.61 % BW rewrite match attempts : 15
% 7.52/1.61 % BW rewrite match successes : 15
% 7.52/1.61 % Condensation attempts : 0
% 7.52/1.61 % Condensation successes : 0
% 7.52/1.61 % Termbank termtop insertions : 434457
% 7.52/1.61 % Search garbage collected termcells : 538
% 7.52/1.61
% 7.52/1.61 % -------------------------------------------------
% 7.52/1.61 % User time : 1.018 s
% 7.52/1.61 % System time : 0.028 s
% 7.52/1.61 % Total time : 1.046 s
% 7.52/1.61 % Maximum resident set size: 4068 pages
% 7.52/1.61
% 7.52/1.61 % -------------------------------------------------
% 7.52/1.61 % User time : 5.075 s
% 7.52/1.61 % System time : 0.181 s
% 7.52/1.61 % Total time : 5.256 s
% 7.52/1.61 % Maximum resident set size: 5120 pages
% 7.52/1.61 % E exiting
%------------------------------------------------------------------------------