%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC119-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 : n011.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 56.08s 8.90s
% Output : CNFRefutation 56.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of clauses : 88 ( 25 unt; 10 nHn; 78 RR)
% Number of literals : 226 ( 49 equ; 149 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 106 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_8,negated_conjecture,
( nil != sk1
| nil != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = 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_11,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_9,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(clause179,axiom,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause179) ).
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(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_12,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(clause172,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause172) ).
cnf(clause57,axiom,
( ~ ssList(X1)
| segmentP(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
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(clause102,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause102) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
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(c_0_24,negated_conjecture,
( nil != sk1
| nil != sk2 ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_25,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_26,negated_conjecture,
( nil != sk1
| nil != sk2 ),
c_0_24 ).
cnf(c_0_27,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_28,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_30,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_31,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_25 ).
cnf(c_0_32,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_33,negated_conjecture,
( nil != sk4
| nil != sk1 ),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_35,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
inference(fof_simplification,[status(thm)],[clause179]) ).
cnf(c_0_36,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_37,negated_conjecture,
( ~ neq(sk4,nil)
| memberP(sk4,sk5) ),
c_0_28 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_29 ).
cnf(c_0_39,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_40,axiom,
ssList(nil),
clause8 ).
cnf(c_0_41,negated_conjecture,
nil != sk4,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_42,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk5) ),
c_0_34 ).
cnf(c_0_43,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_44,plain,
( ~ ssList(X5)
| ~ duplicatefreeP(X5)
| ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| app(app(X1,cons(X2,X3)),cons(X2,X4)) != X5 ),
c_0_35 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_36 ).
cnf(c_0_46,negated_conjecture,
memberP(sk4,sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),c_0_41]) ).
cnf(c_0_47,negated_conjecture,
ssItem(sk5),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_38]),c_0_39]),c_0_40])]),c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk3 ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ duplicatefreeP(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(app(app(X2,cons(X1,X3)),cons(X1,X4)))
| ~ ssItem(X1) ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_50,negated_conjecture,
app(skaf42(sk4,sk5),cons(sk5,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_39])]) ).
cnf(c_0_51,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_52,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_53,negated_conjecture,
( ~ neq(sk4,nil)
| cons(sk5,nil) = sk1 ),
inference(rw,[status(thm)],[c_0_48,c_0_32]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_55,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_56,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_57,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_58,negated_conjecture,
( ~ duplicatefreeP(app(sk4,cons(sk5,X1)))
| ~ ssList(X1)
| ~ ssList(app(sk4,cons(sk5,X1))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_47]),c_0_51]),c_0_52])]) ).
cnf(c_0_59,negated_conjecture,
cons(sk5,nil) = sk1,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_39]),c_0_40])]),c_0_41]) ).
cnf(c_0_60,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_54 ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_55 ).
cnf(c_0_62,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
inference(fof_simplification,[status(thm)],[clause172]) ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
inference(fof_simplification,[status(thm)],[clause57]) ).
cnf(c_0_64,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_65,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ neq(sk1,nil) ),
c_0_56 ).
cnf(c_0_66,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause102]) ).
cnf(c_0_67,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_57 ).
cnf(c_0_68,negated_conjecture,
( ~ duplicatefreeP(app(sk4,sk1))
| ~ ssList(app(sk4,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_40])]) ).
cnf(c_0_69,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_70,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X4)
| ~ ssList(X3)
| ~ segmentP(X1,X2)
| segmentP(app(app(X4,X1),X3),X2) ),
c_0_62 ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| segmentP(X1,X1) ),
c_0_63 ).
cnf(c_0_73,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_74,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_64 ).
cnf(c_0_75,negated_conjecture,
( ~ segmentP(sk4,sk1)
| ~ neq(sk1,nil) ),
inference(rw,[status(thm)],[c_0_65,c_0_27]) ).
cnf(c_0_76,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_66 ).
cnf(c_0_77,negated_conjecture,
nil != sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_59]),c_0_47]),c_0_40])]) ).
cnf(c_0_78,negated_conjecture,
( ~ ssList(app(sk4,sk1))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_39]),c_0_70])]) ).
cnf(c_0_79,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(app(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_73 ).
cnf(c_0_81,negated_conjecture,
( ~ ssList(X1)
| cons(sk5,X1) = app(sk1,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_59]),c_0_47])]) ).
cnf(c_0_82,negated_conjecture,
( ~ ssItem(nil)
| ~ ssItem(sk1)
| ~ segmentP(sk4,sk1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]) ).
cnf(c_0_83,negated_conjecture,
ssItem(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_61]),c_0_39]),c_0_70])]) ).
cnf(c_0_84,plain,
( ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| segmentP(app(X1,app(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_85,negated_conjecture,
app(skaf42(sk4,sk5),app(sk1,skaf43(sk5,sk4))) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_81]),c_0_51])]) ).
cnf(c_0_86,negated_conjecture,
~ segmentP(sk4,sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_82,c_0_83]),c_0_83])]) ).
cnf(c_0_87,negated_conjecture,
$false,
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_84,c_0_85]),c_0_52]),c_0_51]),c_0_70])]),c_0_86]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC119-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.12/0.37 % Computer : n011.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.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 07:57:11 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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
% 56.08/8.90 % Version: 3.5.1
% 56.08/8.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 56.08/8.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.08/8.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 56.08/8.90 % Starting new_bool_3 with 300s (1) cores
% 56.08/8.90 % Starting new_bool_1 with 300s (1) cores
% 56.08/8.90 % Starting sh5l with 300s (1) cores
% 56.08/8.90 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1400546 completed with status 0
% 56.08/8.90 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 56.08/8.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 56.08/8.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.08/8.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 56.08/8.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 56.08/8.90 % No SInE strategy applied
% 56.08/8.90 % Search class: FGHSM-FSLM21-MFFFFFNN
% 56.08/8.90 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 56.08/8.90 % Starting SubtermCWHack with 136s (1) cores
% 56.08/8.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 56.08/8.90 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 56.08/8.90 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 56.08/8.90 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 56.08/8.90 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1400555 completed with status 0
% 56.08/8.90 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 56.08/8.90 % Preprocessing class: FSLSSMSMSSSNFFN.
% 56.08/8.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 56.08/8.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 56.08/8.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 56.08/8.90 % No SInE strategy applied
% 56.08/8.90 % Search class: FGHSM-FSLM21-MFFFFFNN
% 56.08/8.90 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 56.08/8.90 % Starting SubtermCWHack with 136s (1) cores
% 56.08/8.90 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 56.08/8.90 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 56.08/8.90 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 56.08/8.90 % Preprocessing time : 0.006 s
% 56.08/8.90
% 56.08/8.90 % Proof found!
% 56.08/8.90 % SZS status Unsatisfiable
% 56.08/8.90 % SZS output start CNFRefutation
% See solution above
% 56.08/8.90 % Parsed axioms : 197
% 56.08/8.90 % Removed by relevancy pruning/SinE : 0
% 56.08/8.90 % Initial clauses : 197
% 56.08/8.90 % Removed in clause preprocessing : 0
% 56.08/8.90 % Initial clauses in saturation : 197
% 56.08/8.90 % Processed clauses : 18927
% 56.08/8.90 % ...of these trivial : 272
% 56.08/8.90 % ...subsumed : 14311
% 56.08/8.90 % ...remaining for further processing : 4344
% 56.08/8.90 % Other redundant clauses eliminated : 2541
% 56.08/8.90 % Clauses deleted for lack of memory : 0
% 56.08/8.90 % Backward-subsumed : 163
% 56.08/8.90 % Backward-rewritten : 417
% 56.08/8.90 % Generated clauses : 301544
% 56.08/8.90 % ...of the previous two non-redundant : 285785
% 56.08/8.90 % ...aggressively subsumed : 0
% 56.08/8.90 % Contextual simplify-reflections : 733
% 56.08/8.90 % Paramodulations : 298954
% 56.08/8.90 % Factorizations : 0
% 56.08/8.90 % NegExts : 0
% 56.08/8.90 % Equation resolutions : 2590
% 56.08/8.90 % Disequality decompositions : 0
% 56.08/8.90 % Total rewrite steps : 261114
% 56.08/8.90 % ...of those cached : 258344
% 56.08/8.90 % Propositional unsat checks : 0
% 56.08/8.90 % Propositional check models : 0
% 56.08/8.90 % Propositional check unsatisfiable : 0
% 56.08/8.90 % Propositional clauses : 0
% 56.08/8.90 % Propositional clauses after purity: 0
% 56.08/8.90 % Propositional unsat core size : 0
% 56.08/8.90 % Propositional preprocessing time : 0.000
% 56.08/8.90 % Propositional encoding time : 0.000
% 56.08/8.90 % Propositional solver time : 0.000
% 56.08/8.90 % Success case prop preproc time : 0.000
% 56.08/8.90 % Success case prop encoding time : 0.000
% 56.08/8.90 % Success case prop solver time : 0.000
% 56.08/8.90 % Current number of processed clauses : 3738
% 56.08/8.90 % Positive orientable unit clauses : 519
% 56.08/8.90 % Positive unorientable unit clauses: 0
% 56.08/8.90 % Negative unit clauses : 649
% 56.08/8.90 % Non-unit-clauses : 2570
% 56.08/8.90 % Current number of unprocessed clauses: 265243
% 56.08/8.90 % ...number of literals in the above : 1813615
% 56.08/8.90 % Current number of archived formulas : 0
% 56.08/8.90 % Current number of archived clauses : 581
% 56.08/8.90 % Clause-clause subsumption calls (NU) : 2077230
% 56.08/8.90 % Rec. Clause-clause subsumption calls : 352209
% 56.08/8.90 % Non-unit clause-clause subsumptions : 5841
% 56.08/8.90 % Unit Clause-clause subsumption calls : 162215
% 56.08/8.90 % Rewrite failures with RHS unbound : 0
% 56.08/8.90 % BW rewrite match attempts : 711
% 56.08/8.90 % BW rewrite match successes : 153
% 56.08/8.90 % Condensation attempts : 0
% 56.08/8.90 % Condensation successes : 0
% 56.08/8.90 % Termbank termtop insertions : 7906687
% 56.08/8.90 % Search garbage collected termcells : 545
% 56.08/8.90
% 56.08/8.90 % -------------------------------------------------
% 56.08/8.90 % User time : 7.860 s
% 56.08/8.90 % System time : 0.239 s
% 56.08/8.90 % Total time : 8.099 s
% 56.08/8.90 % Maximum resident set size: 4068 pages
% 56.08/8.90
% 56.08/8.90 % -------------------------------------------------
% 56.08/8.90 % User time : 38.223 s
% 56.08/8.90 % System time : 1.127 s
% 56.08/8.90 % Total time : 39.350 s
% 56.08/8.90 % Maximum resident set size: 5120 pages
% 56.08/8.90 % E exiting
%------------------------------------------------------------------------------