%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC117-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:05 PM UTC 2026
% Result : Unsatisfiable 3.54s 0.94s
% Output : CNFRefutation 3.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 27
% Syntax : Number of clauses : 94 ( 27 unt; 7 nHn; 86 RR)
% Number of literals : 265 ( 53 equ; 186 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 : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 116 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(co1_9,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause56,axiom,
( ~ ssList(X1)
| segmentP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause56) ).
cnf(clause64,axiom,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause101,axiom,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
cnf(clause47,axiom,
ssItem(skaf44(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
cnf(clause116,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).
cnf(clause173,axiom,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause132,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause132) ).
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/sandbox/benchmark/Axioms/SWC001-0.ax',clause178) ).
cnf(co1_10,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause137) ).
cnf(clause12,axiom,
ssItem(skaf83(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause12) ).
cnf(clause13,axiom,
ssList(skaf82(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause13) ).
cnf(clause83,axiom,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(c_0_27,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_27 ).
cnf(c_0_29,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_30,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_31,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
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,
ssList(sk1),
co1_1 ).
cnf(c_0_34,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_35,negated_conjecture,
~ neq(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_30])]) ).
cnf(c_0_36,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_38,axiom,
ssList(nil),
clause8 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_40,negated_conjecture,
( ~ equalelemsP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_34 ).
cnf(c_0_41,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]),c_0_38])]) ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_39 ).
cnf(c_0_43,negated_conjecture,
( ~ equalelemsP(X1)
| ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_41]),c_0_42]) ).
cnf(c_0_44,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause64]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause101]) ).
cnf(c_0_47,negated_conjecture,
( ~ equalelemsP(X1)
| ~ ssList(X1)
| ~ segmentP(sk4,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_36]),c_0_38])]) ).
cnf(c_0_48,plain,
( ~ ssItem(X1)
| equalelemsP(cons(X1,nil)) ),
c_0_44 ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_45 ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ~ singletonP(X1)
| cons(skaf44(X1),nil) = X1 ),
c_0_46 ).
cnf(c_0_51,axiom,
ssItem(skaf44(X1)),
clause47 ).
cnf(c_0_52,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
inference(fof_simplification,[status(thm)],[clause116]) ).
cnf(c_0_53,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_54,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ segmentP(sk4,cons(X1,nil))
| cons(X1,nil) = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_56,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_49,c_0_50]),c_0_51]),c_0_38])]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,nil) != X2
| singletonP(X2) ),
c_0_52 ).
cnf(c_0_58,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_53 ).
cnf(c_0_59,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_54 ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
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)) ),
inference(fof_simplification,[status(thm)],[clause178]) ).
cnf(c_0_62,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(X1)
| ~ singletonP(X1)
| ~ segmentP(sk4,X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_50]),c_0_51])]),c_0_56]) ).
cnf(c_0_64,plain,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| singletonP(cons(X1,nil)) ),
inference(er,[status(thm)],[c_0_57]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| app(X2,X3) != X1
| segmentP(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_38])]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_60 ).
cnf(c_0_67,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_68,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_69,plain,
( ~ ssItem(X3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| X3 != X4
| ~ frontsegP(X1,X2)
| frontsegP(cons(X3,X1),cons(X4,X2)) ),
c_0_61 ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_71,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_62 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause137]) ).
cnf(c_0_73,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ segmentP(sk4,cons(X1,nil)) ),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_74,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| segmentP(X1,X2) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])])]) ).
cnf(c_0_75,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_68,c_0_29]) ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(er,[status(thm)],[c_0_69]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_70 ).
cnf(c_0_78,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_79,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_80,negated_conjecture,
( sk4 != nil
| sk3 != nil ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_71,c_0_30]),c_0_29]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X1,X2)
| frontsegP(app(X1,X3),X2) ),
c_0_72 ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
inference(fof_simplification,[status(thm)],[clause83]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(cons(X1,nil))
| ~ ssItem(X1)
| ~ frontsegP(sk4,cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_75])]) ).
cnf(c_0_84,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_76,c_0_77]),c_0_78]),c_0_79])]) ).
cnf(c_0_85,negated_conjecture,
sk4 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_80,c_0_41])]) ).
cnf(c_0_86,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_81,c_0_59]),c_0_38])]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| nil != X1
| frontsegP(nil,X1) ),
c_0_82 ).
cnf(c_0_88,negated_conjecture,
( ~ ssList(cons(skaf83(sk4),nil))
| ~ frontsegP(skaf82(sk4),nil) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_78]),c_0_38]),c_0_75])]),c_0_85]) ).
cnf(c_0_89,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| nil != X2
| frontsegP(X1,X2) ),
inference(spm,[status(thm)],[c_0_86,c_0_87]) ).
cnf(c_0_90,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_91,negated_conjecture,
~ ssList(cons(skaf83(sk4),nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_88,c_0_89]),c_0_79]),c_0_38])]) ).
cnf(c_0_92,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_90 ).
cnf(c_0_93,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_78]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC117-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n014.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.38 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 07:57:19 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 3.54/0.94 % Version: 3.5.1
% 3.54/0.94 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.54/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.54/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.54/0.94 % Starting new_bool_3 with 300s (1) cores
% 3.54/0.94 % Starting new_bool_1 with 300s (1) cores
% 3.54/0.94 % Starting sh5l with 300s (1) cores
% 3.54/0.94 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3584313 completed with status 0
% 3.54/0.94 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 3.54/0.94 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.54/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.54/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.54/0.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.54/0.94 % No SInE strategy applied
% 3.54/0.94 % Search class: FGHSM-FSLM21-MFFFFFNN
% 3.54/0.94 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 3.54/0.94 % Starting SubtermCWHack with 136s (1) cores
% 3.54/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.54/0.94 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 3.54/0.94 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 3.54/0.94 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 3.54/0.94 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 3584322 completed with status 0
% 3.54/0.94 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 3.54/0.94 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.54/0.94 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.54/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.54/0.94 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.54/0.94 % No SInE strategy applied
% 3.54/0.94 % Search class: FGHSM-FSLM21-MFFFFFNN
% 3.54/0.94 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 3.54/0.94 % Starting SubtermCWHack with 136s (1) cores
% 3.54/0.94 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 3.54/0.94 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 3.54/0.94 % Preprocessing time : 0.004 s
% 3.54/0.94 % Presaturation interreduction done
% 3.54/0.94
% 3.54/0.94 % Proof found!
% 3.54/0.94 % SZS status Unsatisfiable
% 3.54/0.94 % SZS output start CNFRefutation
% See solution above
% 3.54/0.94 % Parsed axioms : 196
% 3.54/0.94 % Removed by relevancy pruning/SinE : 0
% 3.54/0.94 % Initial clauses : 196
% 3.54/0.94 % Removed in clause preprocessing : 0
% 3.54/0.94 % Initial clauses in saturation : 196
% 3.54/0.94 % Processed clauses : 2611
% 3.54/0.94 % ...of these trivial : 61
% 3.54/0.94 % ...subsumed : 1542
% 3.54/0.94 % ...remaining for further processing : 1008
% 3.54/0.94 % Other redundant clauses eliminated : 362
% 3.54/0.94 % Clauses deleted for lack of memory : 0
% 3.54/0.94 % Backward-subsumed : 18
% 3.54/0.94 % Backward-rewritten : 14
% 3.54/0.94 % Generated clauses : 13969
% 3.54/0.94 % ...of the previous two non-redundant : 12731
% 3.54/0.94 % ...aggressively subsumed : 0
% 3.54/0.94 % Contextual simplify-reflections : 180
% 3.54/0.94 % Paramodulations : 13533
% 3.54/0.94 % Factorizations : 0
% 3.54/0.94 % NegExts : 0
% 3.54/0.94 % Equation resolutions : 421
% 3.54/0.94 % Disequality decompositions : 0
% 3.54/0.94 % Total rewrite steps : 8613
% 3.54/0.94 % ...of those cached : 8297
% 3.54/0.94 % Propositional unsat checks : 0
% 3.54/0.94 % Propositional check models : 0
% 3.54/0.94 % Propositional check unsatisfiable : 0
% 3.54/0.94 % Propositional clauses : 0
% 3.54/0.94 % Propositional clauses after purity: 0
% 3.54/0.94 % Propositional unsat core size : 0
% 3.54/0.94 % Propositional preprocessing time : 0.000
% 3.54/0.94 % Propositional encoding time : 0.000
% 3.54/0.94 % Propositional solver time : 0.000
% 3.54/0.94 % Success case prop preproc time : 0.000
% 3.54/0.94 % Success case prop encoding time : 0.000
% 3.54/0.94 % Success case prop solver time : 0.000
% 3.54/0.94 % Current number of processed clauses : 773
% 3.54/0.94 % Positive orientable unit clauses : 67
% 3.54/0.94 % Positive unorientable unit clauses: 0
% 3.54/0.94 % Negative unit clauses : 15
% 3.54/0.94 % Non-unit-clauses : 691
% 3.54/0.94 % Current number of unprocessed clauses: 10424
% 3.54/0.94 % ...number of literals in the above : 72406
% 3.54/0.94 % Current number of archived formulas : 0
% 3.54/0.94 % Current number of archived clauses : 224
% 3.54/0.94 % Clause-clause subsumption calls (NU) : 137375
% 3.54/0.94 % Rec. Clause-clause subsumption calls : 25450
% 3.54/0.94 % Non-unit clause-clause subsumptions : 1233
% 3.54/0.94 % Unit Clause-clause subsumption calls : 2291
% 3.54/0.94 % Rewrite failures with RHS unbound : 0
% 3.54/0.94 % BW rewrite match attempts : 6
% 3.54/0.94 % BW rewrite match successes : 6
% 3.54/0.94 % Condensation attempts : 0
% 3.54/0.94 % Condensation successes : 0
% 3.54/0.94 % Termbank termtop insertions : 263015
% 3.54/0.94 % Search garbage collected termcells : 548
% 3.54/0.94
% 3.54/0.94 % -------------------------------------------------
% 3.54/0.94 % User time : 0.409 s
% 3.54/0.94 % System time : 0.017 s
% 3.54/0.94 % Total time : 0.427 s
% 3.54/0.94 % Maximum resident set size: 4016 pages
% 3.54/0.94
% 3.54/0.94 % -------------------------------------------------
% 3.54/0.94 % User time : 2.125 s
% 3.54/0.94 % System time : 0.098 s
% 3.54/0.94 % Total time : 2.223 s
% 3.54/0.94 % Maximum resident set size: 5120 pages
% 3.54/0.94 % E exiting
%------------------------------------------------------------------------------