%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC308-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 : 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:52 PM UTC 2026
% Result : Unsatisfiable 0.24s 0.63s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 24
% Syntax : Number of clauses : 88 ( 23 unt; 21 nHn; 84 RR)
% Number of literals : 263 ( 105 equ; 163 neg)
% Maximal clause size : 11 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 105 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_9,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
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(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
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(clause145,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
cnf(co1_8,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause157,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause157) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause109) ).
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(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(co1_10,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_24,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_25,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_28,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_29,negated_conjecture,
( app(cons(X1,nil),X2) != sk4
| ~ ssList(X2)
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) = sk3 ),
c_0_24 ).
cnf(c_0_30,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_25 ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_26 ).
cnf(c_0_33,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_27 ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_36,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
inference(fof_simplification,[status(thm)],[clause145]) ).
cnf(c_0_38,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_39,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk4
| app(X1,cons(X2,nil)) = sk1 ),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,plain,
( ~ ssList(X1)
| nil = X1
| app(cons(hd(X1),nil),tl(X1)) = X1 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_43,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_44,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| nil != X2
| nil != X1
| app(X1,X2) = nil ),
c_0_37 ).
cnf(c_0_45,axiom,
ssList(nil),
clause8 ).
cnf(c_0_46,negated_conjecture,
( ~ neq(nil,sk2)
| ~ neq(nil,sk2)
| hd(sk2) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk2) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| sk1 != X1
| ~ ssList(X1) ),
c_0_38 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| nil = sk4
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40])]),c_0_41])]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_42 ).
cnf(c_0_50,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,app(X2,X3)) = app(cons(X1,X2),X3) ),
c_0_43 ).
cnf(c_0_51,plain,
app(nil,nil) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_44])]),c_0_45])]) ).
cnf(c_0_52,negated_conjecture,
( ~ neq(nil,sk2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk2) != X4
| tl(sk2) != X2
| sk1 != X1 ),
inference(cn,[status(thm)],[c_0_46]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_47 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(tl(sk4))
| nil = sk4
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_34]),c_0_41])]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(app(cons(X1,nil),X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_32]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| app(cons(X1,nil),nil) = cons(X1,nil) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_45])]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) != sk1 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_36]),c_0_36]),c_0_36])])])])]),c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( nil = sk4
| app(tl(sk4),cons(hd(sk4),nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_33]),c_0_41])]) ).
cnf(c_0_59,plain,
( ~ ssItem(X1)
| ssList(cons(X1,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_45])]) ).
cnf(c_0_60,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
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,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| nil = sk4 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_60 ).
cnf(c_0_65,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_61 ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_62 ).
cnf(c_0_67,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_68,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_69,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_70,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_45]),c_0_41])]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| nil = X1
| hd(X1) = skaf83(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]),c_0_68])]) ).
cnf(c_0_73,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_69 ).
cnf(c_0_74,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_70 ).
cnf(c_0_75,negated_conjecture,
( ~ ssList(tl(sk4))
| nil = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_67]),c_0_41])]) ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| nil = X1
| tl(X1) = skaf82(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_66]),c_0_67]),c_0_68])]) ).
cnf(c_0_77,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_78,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_79,negated_conjecture,
( nil != sk4
| nil = sk1 ),
inference(rw,[status(thm)],[c_0_74,c_0_30]) ).
cnf(c_0_80,negated_conjecture,
nil = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_68]),c_0_41])]) ).
cnf(c_0_81,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_77 ).
cnf(c_0_82,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_78,c_0_36]) ).
cnf(c_0_83,negated_conjecture,
sk4 = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_80]),c_0_80])]) ).
cnf(c_0_84,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_81]) ).
cnf(c_0_85,negated_conjecture,
neq(sk1,sk1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_80]),c_0_83]),c_0_83]) ).
cnf(c_0_86,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_87,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_85]),c_0_86])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC308-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n014.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 08:14:04 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.24/0.63 % Version: 3.5.1
% 0.24/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.63 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.63 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.63 % Starting sh5l with 300s (1) cores
% 0.24/0.63 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 3614248 completed with status 0
% 0.24/0.63 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.24/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.63 % No SInE strategy applied
% 0.24/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.63 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.63 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.24/0.63 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 3614258 completed with status 0
% 0.24/0.63 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.24/0.63 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.63 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.63 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.24/0.63 % No SInE strategy applied
% 0.24/0.63 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.24/0.63 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.24/0.63 % Starting SubtermCWHack with 136s (1) cores
% 0.24/0.63 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.24/0.63 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.24/0.63 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.24/0.63 % Preprocessing time : 0.003 s
% 0.24/0.63
% 0.24/0.63 % Proof found!
% 0.24/0.63 % SZS status Unsatisfiable
% 0.24/0.63 % SZS output start CNFRefutation
% See solution above
% 0.24/0.63 % Parsed axioms : 195
% 0.24/0.63 % Removed by relevancy pruning/SinE : 0
% 0.24/0.63 % Initial clauses : 195
% 0.24/0.63 % Removed in clause preprocessing : 0
% 0.24/0.63 % Initial clauses in saturation : 195
% 0.24/0.63 % Processed clauses : 689
% 0.24/0.63 % ...of these trivial : 2
% 0.24/0.63 % ...subsumed : 309
% 0.24/0.63 % ...remaining for further processing : 378
% 0.24/0.63 % Other redundant clauses eliminated : 153
% 0.24/0.63 % Clauses deleted for lack of memory : 0
% 0.24/0.63 % Backward-subsumed : 16
% 0.24/0.63 % Backward-rewritten : 134
% 0.24/0.63 % Generated clauses : 2074
% 0.24/0.63 % ...of the previous two non-redundant : 1889
% 0.24/0.63 % ...aggressively subsumed : 0
% 0.24/0.63 % Contextual simplify-reflections : 30
% 0.24/0.63 % Paramodulations : 1917
% 0.24/0.63 % Factorizations : 0
% 0.24/0.63 % NegExts : 0
% 0.24/0.63 % Equation resolutions : 161
% 0.24/0.63 % Disequality decompositions : 0
% 0.24/0.63 % Total rewrite steps : 1811
% 0.24/0.63 % ...of those cached : 1718
% 0.24/0.63 % Propositional unsat checks : 0
% 0.24/0.63 % Propositional check models : 0
% 0.24/0.63 % Propositional check unsatisfiable : 0
% 0.24/0.63 % Propositional clauses : 0
% 0.24/0.63 % Propositional clauses after purity: 0
% 0.24/0.63 % Propositional unsat core size : 0
% 0.24/0.63 % Propositional preprocessing time : 0.000
% 0.24/0.63 % Propositional encoding time : 0.000
% 0.24/0.63 % Propositional solver time : 0.000
% 0.24/0.63 % Success case prop preproc time : 0.000
% 0.24/0.63 % Success case prop encoding time : 0.000
% 0.24/0.63 % Success case prop solver time : 0.000
% 0.24/0.63 % Current number of processed clauses : 204
% 0.24/0.63 % Positive orientable unit clauses : 51
% 0.24/0.63 % Positive unorientable unit clauses: 0
% 0.24/0.63 % Negative unit clauses : 1
% 0.24/0.63 % Non-unit-clauses : 152
% 0.24/0.63 % Current number of unprocessed clauses: 1341
% 0.24/0.63 % ...number of literals in the above : 7245
% 0.24/0.63 % Current number of archived formulas : 0
% 0.24/0.63 % Current number of archived clauses : 150
% 0.24/0.63 % Clause-clause subsumption calls (NU) : 17133
% 0.24/0.63 % Rec. Clause-clause subsumption calls : 3396
% 0.24/0.63 % Non-unit clause-clause subsumptions : 267
% 0.24/0.63 % Unit Clause-clause subsumption calls : 597
% 0.24/0.63 % Rewrite failures with RHS unbound : 0
% 0.24/0.63 % BW rewrite match attempts : 7
% 0.24/0.63 % BW rewrite match successes : 7
% 0.24/0.63 % Condensation attempts : 0
% 0.24/0.63 % Condensation successes : 0
% 0.24/0.63 % Termbank termtop insertions : 44201
% 0.24/0.63 % Search garbage collected termcells : 557
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.062 s
% 0.24/0.63 % System time : 0.008 s
% 0.24/0.63 % Total time : 0.070 s
% 0.24/0.63 % Maximum resident set size: 4068 pages
% 0.24/0.63
% 0.24/0.63 % -------------------------------------------------
% 0.24/0.63 % User time : 0.296 s
% 0.24/0.63 % System time : 0.039 s
% 0.24/0.63 % Total time : 0.335 s
% 0.24/0.63 % Maximum resident set size: 5120 pages
% 0.24/0.63 % E exiting
%------------------------------------------------------------------------------