%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC125-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 : n019.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:07 PM UTC 2026
% Result : Unsatisfiable 38.11s 6.82s
% Output : CNFRefutation 38.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 28
% Syntax : Number of clauses : 99 ( 25 unt; 13 nHn; 97 RR)
% Number of literals : 284 ( 61 equ; 186 neg)
% Maximal clause size : 6 ( 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 : 132 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(clause143,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
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(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_8,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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(clause82,axiom,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause82) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(co1_10,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
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(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(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause60,axiom,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause60) ).
cnf(clause112,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| strictorderedP(cons(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause112) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause144,axiom,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause144) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(c_0_28,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_29,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
inference(fof_simplification,[status(thm)],[clause143]) ).
cnf(c_0_30,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_31,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_33,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_34,negated_conjecture,
segmentP(sk4,sk3),
co1_8 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause82]) ).
cnf(c_0_38,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(X1,X2) != X3
| rearsegP(X3,X2) ),
c_0_29 ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_30 ).
cnf(c_0_40,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_41,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_42,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_31,c_0_32]),c_0_33]),c_0_34]),c_0_33])]) ).
cnf(c_0_43,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_35 ).
cnf(c_0_44,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause56]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ rearsegP(nil,X1)
| nil = X1 ),
c_0_37 ).
cnf(c_0_48,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ frontsegP(X1,X2)
| rearsegP(X1,skaf45(X1,X2)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])])]) ).
cnf(c_0_49,negated_conjecture,
( ~ strictorderedP(X1)
| ~ segmentP(X1,sk3)
| ~ segmentP(sk4,X1)
| ~ neq(sk3,X1)
| ~ ssList(X1) ),
c_0_41 ).
cnf(c_0_50,negated_conjecture,
sk3 = 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_44]),c_0_45])]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| segmentP(X1,nil) ),
c_0_46 ).
cnf(c_0_52,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_53,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_55,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
inference(fof_simplification,[status(thm)],[clause157]) ).
cnf(c_0_56,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| skaf45(nil,X1) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40]),c_0_45])]) ).
cnf(c_0_58,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
inference(fof_simplification,[status(thm)],[clause60]) ).
cnf(c_0_59,negated_conjecture,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(sk4,X1)
| ~ neq(nil,X1) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_50]),c_0_50]),c_0_51]) ).
cnf(c_0_60,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| strictorderedP(cons(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause112]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_62,plain,
( ~ ssList(X4)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| app(app(X1,X2),X3) != X4
| segmentP(X4,X2) ),
c_0_52 ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_53 ).
cnf(c_0_64,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_66,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_54 ).
cnf(c_0_67,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_55 ).
cnf(c_0_68,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_56 ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ frontsegP(nil,X1)
| app(X1,nil) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_57]),c_0_45])]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| frontsegP(X1,nil) ),
c_0_58 ).
cnf(c_0_71,negated_conjecture,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| ~ segmentP(sk4,X1)
| X1 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_43]),c_0_45])]) ).
cnf(c_0_72,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| nil != X1
| strictorderedP(cons(X2,X1)) ),
c_0_60 ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_61 ).
cnf(c_0_74,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_62,c_0_63]),c_0_45])]) ).
cnf(c_0_75,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_76,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_64 ).
cnf(c_0_77,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_65 ).
cnf(c_0_78,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssItem(X1)
| ssList(cons(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]) ).
cnf(c_0_81,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_45])]) ).
cnf(c_0_82,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_83,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ segmentP(sk4,cons(X2,X1))
| nil != X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_68]),c_0_73]) ).
cnf(c_0_84,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_74,c_0_39]),c_0_40])])]) ).
cnf(c_0_85,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_75,c_0_32]) ).
cnf(c_0_86,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| cons(X2,X3) != X1
| frontsegP(X1,cons(X2,nil)) ),
inference(spm,[status(thm)],[c_0_76,c_0_77]) ).
cnf(c_0_87,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_78 ).
cnf(c_0_88,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_79 ).
cnf(c_0_89,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_45])]) ).
cnf(c_0_90,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_82 ).
cnf(c_0_91,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ frontsegP(sk4,cons(X2,X1))
| nil != X1 ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]),c_0_68]) ).
cnf(c_0_92,plain,
( ~ ssList(X1)
| frontsegP(X1,cons(hd(X1),nil))
| nil = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87])]),c_0_88]),c_0_89]),c_0_90]) ).
cnf(c_0_93,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_94,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_45]),c_0_85])]) ).
cnf(c_0_95,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_93,c_0_32]) ).
cnf(c_0_96,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_94,c_0_90]),c_0_85])]) ).
cnf(c_0_97,negated_conjecture,
~ neq(nil,nil),
inference(rw,[status(thm)],[c_0_42,c_0_50]) ).
cnf(c_0_98,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96]),c_0_97]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC125-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n019.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 07:57:49 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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
% 38.11/6.82 % Version: 3.5.1
% 38.11/6.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 38.11/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.11/6.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.11/6.82 % Starting new_bool_3 with 300s (1) cores
% 38.11/6.82 % Starting new_bool_1 with 300s (1) cores
% 38.11/6.82 % Starting sh5l with 300s (1) cores
% 38.11/6.82 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2083992 completed with status 0
% 38.11/6.82 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 38.11/6.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 38.11/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.11/6.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.11/6.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 38.11/6.82 % No SInE strategy applied
% 38.11/6.82 % Search class: FGHSM-FSLM21-MFFFFFNN
% 38.11/6.82 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 38.11/6.82 % Starting SubtermCWHack with 136s (1) cores
% 38.11/6.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 38.11/6.82 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 38.11/6.82 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 38.11/6.82 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 38.11/6.82 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2084000 completed with status 0
% 38.11/6.82 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 38.11/6.82 % Preprocessing class: FSLSSMSSSSSNFFN.
% 38.11/6.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.11/6.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 38.11/6.82 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 38.11/6.82 % No SInE strategy applied
% 38.11/6.82 % Search class: FGHSM-FSLM21-MFFFFFNN
% 38.11/6.82 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 38.11/6.82 % Starting SubtermCWHack with 136s (1) cores
% 38.11/6.82 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 38.11/6.82 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 38.11/6.82 % Preprocessing time : 0.004 s
% 38.11/6.82 % Presaturation interreduction done
% 38.11/6.82
% 38.11/6.82 % Proof found!
% 38.11/6.82 % SZS status Unsatisfiable
% 38.11/6.82 % SZS output start CNFRefutation
% See solution above
% 38.11/6.82 % Parsed axioms : 196
% 38.11/6.82 % Removed by relevancy pruning/SinE : 0
% 38.11/6.82 % Initial clauses : 196
% 38.11/6.82 % Removed in clause preprocessing : 0
% 38.11/6.82 % Initial clauses in saturation : 196
% 38.11/6.82 % Processed clauses : 13746
% 38.11/6.82 % ...of these trivial : 614
% 38.11/6.82 % ...subsumed : 10384
% 38.11/6.82 % ...remaining for further processing : 2748
% 38.11/6.82 % Other redundant clauses eliminated : 2075
% 38.11/6.82 % Clauses deleted for lack of memory : 0
% 38.11/6.82 % Backward-subsumed : 60
% 38.11/6.82 % Backward-rewritten : 906
% 38.11/6.82 % Generated clauses : 123731
% 38.11/6.82 % ...of the previous two non-redundant : 113394
% 38.11/6.82 % ...aggressively subsumed : 0
% 38.11/6.82 % Contextual simplify-reflections : 685
% 38.11/6.82 % Paramodulations : 121391
% 38.11/6.82 % Factorizations : 0
% 38.11/6.82 % NegExts : 0
% 38.11/6.82 % Equation resolutions : 2320
% 38.11/6.82 % Disequality decompositions : 0
% 38.11/6.82 % Total rewrite steps : 99129
% 38.11/6.82 % ...of those cached : 98075
% 38.11/6.82 % Propositional unsat checks : 0
% 38.11/6.82 % Propositional check models : 0
% 38.11/6.82 % Propositional check unsatisfiable : 0
% 38.11/6.82 % Propositional clauses : 0
% 38.11/6.82 % Propositional clauses after purity: 0
% 38.11/6.82 % Propositional unsat core size : 0
% 38.11/6.82 % Propositional preprocessing time : 0.000
% 38.11/6.82 % Propositional encoding time : 0.000
% 38.11/6.82 % Propositional solver time : 0.000
% 38.11/6.82 % Success case prop preproc time : 0.000
% 38.11/6.82 % Success case prop encoding time : 0.000
% 38.11/6.82 % Success case prop solver time : 0.000
% 38.11/6.82 % Current number of processed clauses : 1577
% 38.11/6.82 % Positive orientable unit clauses : 66
% 38.11/6.82 % Positive unorientable unit clauses: 0
% 38.11/6.82 % Negative unit clauses : 10
% 38.11/6.82 % Non-unit-clauses : 1501
% 38.11/6.82 % Current number of unprocessed clauses: 99670
% 38.11/6.82 % ...number of literals in the above : 824617
% 38.11/6.82 % Current number of archived formulas : 0
% 38.11/6.82 % Current number of archived clauses : 1158
% 38.11/6.82 % Clause-clause subsumption calls (NU) : 1768414
% 38.11/6.82 % Rec. Clause-clause subsumption calls : 470388
% 38.11/6.82 % Non-unit clause-clause subsumptions : 10172
% 38.11/6.82 % Unit Clause-clause subsumption calls : 5818
% 38.11/6.82 % Rewrite failures with RHS unbound : 0
% 38.11/6.82 % BW rewrite match attempts : 7
% 38.11/6.82 % BW rewrite match successes : 7
% 38.11/6.82 % Condensation attempts : 0
% 38.11/6.82 % Condensation successes : 0
% 38.11/6.82 % Termbank termtop insertions : 3079140
% 38.11/6.82 % Search garbage collected termcells : 543
% 38.11/6.82
% 38.11/6.82 % -------------------------------------------------
% 38.11/6.82 % User time : 6.087 s
% 38.11/6.82 % System time : 0.152 s
% 38.11/6.82 % Total time : 6.238 s
% 38.11/6.82 % Maximum resident set size: 4068 pages
% 38.11/6.82
% 38.11/6.82 % -------------------------------------------------
% 38.11/6.82 % User time : 25.797 s
% 38.11/6.82 % System time : 0.799 s
% 38.11/6.82 % Total time : 26.596 s
% 38.11/6.82 % Maximum resident set size: 4864 pages
% 38.11/6.82 % E exiting
%------------------------------------------------------------------------------