%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC099-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 : n007.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:00 PM UTC 2026
% Result : Unsatisfiable 0.53s 0.55s
% Output : CNFRefutation 0.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 26
% Syntax : Number of clauses : 93 ( 24 unt; 9 nHn; 87 RR)
% Number of literals : 255 ( 56 equ; 170 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_7,negated_conjecture,
frontsegP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_9,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause84,axiom,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause84) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause64,axiom,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause178,axiom,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
cnf(clause137,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_13,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_12,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_26,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_27,negated_conjecture,
frontsegP(sk4,sk3),
co1_7 ).
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,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil = sk2 ),
c_0_26 ).
cnf(c_0_31,negated_conjecture,
frontsegP(sk2,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_33,negated_conjecture,
( ~ neq(sk1,nil)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_32 ).
cnf(c_0_35,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_36,axiom,
ssList(nil),
clause8 ).
cnf(c_0_37,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause84]) ).
cnf(c_0_39,negated_conjecture,
( sk2 = nil
| sk1 = nil ),
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,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ frontsegP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_37 ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| nil = X1 ),
c_0_38 ).
cnf(c_0_42,negated_conjecture,
( frontsegP(nil,sk1)
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_44,negated_conjecture,
( ~ equalelemsP(X1)
| ~ ssList(X1)
| ~ segmentP(X1,sk1)
| ~ frontsegP(sk2,X1)
| ~ neq(sk1,X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_29]),c_0_28]),c_0_29]) ).
cnf(c_0_45,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_46,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_43 ).
cnf(c_0_47,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_48,negated_conjecture,
( ~ equalelemsP(X1)
| ~ ssList(X1)
| ~ frontsegP(sk2,X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_45]),c_0_46]) ).
cnf(c_0_49,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
c_0_47 ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk2,cons(X1,nil))
| ~ neq(nil,cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_50 ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_51 ).
cnf(c_0_55,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_57,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk2,cons(X1,nil))
| cons(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_34]),c_0_36])]) ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| X1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_36])]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_56 ).
cnf(c_0_61,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_57 ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_65,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ~ frontsegP(sk2,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_54]),c_0_55])]),c_0_59]) ).
cnf(c_0_66,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_60]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_61]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_62 ).
cnf(c_0_69,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_70,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
c_0_63 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_64 ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_74,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk2,cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_75,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(skaf82(X1),X2)
| frontsegP(X1,cons(skaf83(X1),X2))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_69]),c_0_70])]) ).
cnf(c_0_76,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(nil,X2)
| frontsegP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_36])]) ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_73 ).
cnf(c_0_79,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil != sk1 ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_80,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(cons(skaf83(sk2),nil))
| ~ frontsegP(skaf82(sk2),nil)
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_69]),c_0_36]),c_0_76])]) ).
cnf(c_0_82,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| frontsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_77,c_0_78]) ).
cnf(c_0_83,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_84,negated_conjecture,
( ~ frontsegP(sk2,sk1)
| ~ neq(sk1,nil)
| nil != sk1 ),
c_0_79 ).
cnf(c_0_85,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
c_0_80 ).
cnf(c_0_86,negated_conjecture,
( ~ ssList(cons(skaf83(sk2),nil))
| sk2 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_82]),c_0_70]),c_0_36])]) ).
cnf(c_0_87,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_83 ).
cnf(c_0_88,negated_conjecture,
( ~ neq(sk1,nil)
| sk1 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_31])]) ).
cnf(c_0_89,negated_conjecture,
neq(sk2,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_85,c_0_45])]) ).
cnf(c_0_90,negated_conjecture,
sk2 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_69]),c_0_36])]) ).
cnf(c_0_91,negated_conjecture,
~ neq(nil,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_88,c_0_45]),c_0_45])]) ).
cnf(c_0_92,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_89,c_0_90]),c_0_91]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC099-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.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 07:53:36 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.53/0.55 % Version: 3.5.1
% 0.53/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.53/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.53/0.55 % Starting sh5l with 300s (1) cores
% 0.53/0.55 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 581828 completed with status 0
% 0.53/0.55 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.53/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.55 % No SInE strategy applied
% 0.53/0.55 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.53/0.55 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.53/0.55 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.55 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.53/0.55 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.53/0.55 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 581836 completed with status 0
% 0.53/0.55 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.53/0.55 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.53/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.53/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.53/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.53/0.55 % No SInE strategy applied
% 0.53/0.55 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.53/0.55 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.53/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.53/0.55 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.53/0.55 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.53/0.55 % Preprocessing time : 0.002 s
% 0.53/0.55 % Presaturation interreduction done
% 0.53/0.55
% 0.53/0.55 % Proof found!
% 0.53/0.55 % SZS status Unsatisfiable
% 0.53/0.55 % SZS output start CNFRefutation
% See solution above
% 0.53/0.55 % Parsed axioms : 198
% 0.53/0.55 % Removed by relevancy pruning/SinE : 0
% 0.53/0.55 % Initial clauses : 198
% 0.53/0.55 % Removed in clause preprocessing : 0
% 0.53/0.55 % Initial clauses in saturation : 198
% 0.53/0.55 % Processed clauses : 1434
% 0.53/0.55 % ...of these trivial : 104
% 0.53/0.55 % ...subsumed : 602
% 0.53/0.55 % ...remaining for further processing : 728
% 0.53/0.55 % Other redundant clauses eliminated : 128
% 0.53/0.55 % Clauses deleted for lack of memory : 0
% 0.53/0.55 % Backward-subsumed : 18
% 0.53/0.55 % Backward-rewritten : 92
% 0.53/0.55 % Generated clauses : 4587
% 0.53/0.55 % ...of the previous two non-redundant : 3976
% 0.53/0.55 % ...aggressively subsumed : 0
% 0.53/0.55 % Contextual simplify-reflections : 88
% 0.53/0.55 % Paramodulations : 4420
% 0.53/0.55 % Factorizations : 0
% 0.53/0.55 % NegExts : 0
% 0.53/0.55 % Equation resolutions : 156
% 0.53/0.55 % Disequality decompositions : 0
% 0.53/0.55 % Total rewrite steps : 3456
% 0.53/0.55 % ...of those cached : 3264
% 0.53/0.55 % Propositional unsat checks : 0
% 0.53/0.55 % Propositional check models : 0
% 0.53/0.55 % Propositional check unsatisfiable : 0
% 0.53/0.55 % Propositional clauses : 0
% 0.53/0.55 % Propositional clauses after purity: 0
% 0.53/0.55 % Propositional unsat core size : 0
% 0.53/0.55 % Propositional preprocessing time : 0.000
% 0.53/0.55 % Propositional encoding time : 0.000
% 0.53/0.55 % Propositional solver time : 0.000
% 0.53/0.55 % Success case prop preproc time : 0.000
% 0.53/0.55 % Success case prop encoding time : 0.000
% 0.53/0.55 % Success case prop solver time : 0.000
% 0.53/0.55 % Current number of processed clauses : 415
% 0.53/0.55 % Positive orientable unit clauses : 60
% 0.53/0.55 % Positive unorientable unit clauses: 0
% 0.53/0.55 % Negative unit clauses : 7
% 0.53/0.55 % Non-unit-clauses : 348
% 0.53/0.55 % Current number of unprocessed clauses: 2775
% 0.53/0.55 % ...number of literals in the above : 18854
% 0.53/0.55 % Current number of archived formulas : 0
% 0.53/0.55 % Current number of archived clauses : 304
% 0.53/0.55 % Clause-clause subsumption calls (NU) : 44125
% 0.53/0.55 % Rec. Clause-clause subsumption calls : 6760
% 0.53/0.55 % Non-unit clause-clause subsumptions : 600
% 0.53/0.55 % Unit Clause-clause subsumption calls : 1343
% 0.53/0.55 % Rewrite failures with RHS unbound : 0
% 0.53/0.55 % BW rewrite match attempts : 6
% 0.53/0.55 % BW rewrite match successes : 6
% 0.53/0.55 % Condensation attempts : 0
% 0.53/0.55 % Condensation successes : 0
% 0.53/0.55 % Termbank termtop insertions : 90112
% 0.53/0.55 % Search garbage collected termcells : 549
% 0.53/0.55
% 0.53/0.55 % -------------------------------------------------
% 0.53/0.55 % User time : 0.089 s
% 0.53/0.55 % System time : 0.003 s
% 0.53/0.55 % Total time : 0.092 s
% 0.53/0.55 % Maximum resident set size: 4068 pages
% 0.53/0.55
% 0.53/0.55 % -------------------------------------------------
% 0.53/0.55 % User time : 0.393 s
% 0.53/0.55 % System time : 0.034 s
% 0.53/0.55 % Total time : 0.428 s
% 0.53/0.55 % Maximum resident set size: 4864 pages
% 0.53/0.55 % E exiting
%------------------------------------------------------------------------------