%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC403-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 : n009.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:44:16 PM UTC 2026
% Result : Unsatisfiable 0.15s 5.91s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 24
% Syntax : Number of clauses : 83 ( 36 unt; 4 nHn; 64 RR)
% Number of literals : 222 ( 25 equ; 144 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 : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 136 ( 30 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox/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/sandbox/benchmark/Axioms/SWC001-0.ax',clause169) ).
cnf(co1_11,negated_conjecture,
memberP(sk1,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_10,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause52,axiom,
ssList(skaf43(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause52) ).
cnf(clause53,axiom,
ssList(skaf42(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause53) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause149) ).
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(clause140,axiom,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause140) ).
cnf(clause141,axiom,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause141) ).
cnf(clause51,axiom,
ssList(skaf45(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause51) ).
cnf(clause168,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause168) ).
cnf(co1_7,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_12,negated_conjecture,
~ memberP(sk2,sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(clause48,axiom,
ssList(skaf48(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause48) ).
cnf(clause49,axiom,
ssList(skaf47(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause49) ).
cnf(c_0_24,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_25,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_26,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_24 ).
cnf(c_0_27,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_25 ).
cnf(c_0_28,negated_conjecture,
memberP(sk1,sk5),
co1_11 ).
cnf(c_0_29,negated_conjecture,
ssItem(sk5),
co1_10 ).
cnf(c_0_30,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_32,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_33,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_26]) ).
cnf(c_0_34,negated_conjecture,
app(skaf42(sk1,sk5),cons(sk5,skaf43(sk5,sk1))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_35,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_36,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_37,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_31 ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_32 ).
cnf(c_0_39,negated_conjecture,
( ~ duplicatefreeP(app(sk1,cons(sk5,X1)))
| ~ ssList(X1)
| ~ ssList(app(sk1,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_33,c_0_34]),c_0_29]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| duplicatefreeP(app(X2,X3))
| ssItem(X1) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_42,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
inference(fof_simplification,[status(thm)],[clause144]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_30])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_41 ).
cnf(c_0_45,plain,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != X3
| frontsegP(X3,X1) ),
c_0_42 ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(app(sk1,cons(sk5,X2)))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_29])]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| frontsegP(app(X1,X2),X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_45]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(cons(sk5,X2))
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_38]),c_0_30])]) ).
cnf(c_0_49,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_50,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause132]) ).
cnf(c_0_51,negated_conjecture,
( ~ ssList(cons(sk5,skaf43(sk5,sk1)))
| frontsegP(sk1,skaf42(sk1,sk5)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_36])]) ).
cnf(c_0_52,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
inference(fof_simplification,[status(thm)],[clause140]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(X2)
| ssItem(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_44]),c_0_29])]) ).
cnf(c_0_54,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
inference(fof_simplification,[status(thm)],[clause141]) ).
cnf(c_0_55,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_49 ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ frontsegP(X1,X2)
| app(X2,skaf45(X1,X2)) = X1 ),
c_0_50 ).
cnf(c_0_57,negated_conjecture,
frontsegP(sk1,skaf42(sk1,sk5)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_44]),c_0_29]),c_0_35])]) ).
cnf(c_0_58,plain,
( ~ ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ memberP(X1,X2)
| memberP(app(X1,X3),X2) ),
c_0_52 ).
cnf(c_0_59,negated_conjecture,
ssItem(X1),
inference(spm,[status(thm)],[c_0_53,c_0_36]) ).
cnf(c_0_60,plain,
( ~ ssItem(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ memberP(X1,X2)
| memberP(app(X3,X1),X2) ),
c_0_54 ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X3)
| ssList(app(X1,app(X2,X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_55]),c_0_38]) ).
cnf(c_0_62,negated_conjecture,
app(skaf42(sk1,sk5),skaf45(sk1,skaf42(sk1,sk5))) = sk1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_36]),c_0_30])]) ).
cnf(c_0_63,axiom,
ssList(skaf45(X1,X2)),
clause51 ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause168]) ).
cnf(c_0_65,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_66,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_67,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_68,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_69,negated_conjecture,
~ memberP(sk2,sk5),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X3)
| memberP(app(X1,X2),X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_71,negated_conjecture,
( ~ ssList(X1)
| memberP(app(X1,sk1),sk5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_28]),c_0_29]),c_0_30])]) ).
cnf(c_0_72,negated_conjecture,
( ~ ssList(X1)
| ssList(app(X1,sk1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_36])]) ).
cnf(c_0_73,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| app(app(skaf47(X1,X2),X2),skaf48(X2,X1)) = X1 ),
c_0_64 ).
cnf(c_0_74,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_75,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_67,c_0_68]) ).
cnf(c_0_76,negated_conjecture,
~ memberP(sk2,sk5),
c_0_69 ).
cnf(c_0_77,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(X2)
| memberP(app(app(X1,sk1),X2),sk5) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_78,negated_conjecture,
app(app(skaf47(sk4,sk1),sk1),skaf48(sk1,sk4)) = sk4,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_30]),c_0_75])]) ).
cnf(c_0_79,axiom,
ssList(skaf48(X1,X2)),
clause48 ).
cnf(c_0_80,axiom,
ssList(skaf47(X1,X2)),
clause49 ).
cnf(c_0_81,negated_conjecture,
~ memberP(sk4,sk5),
inference(rw,[status(thm)],[c_0_76,c_0_68]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]),c_0_80])]),c_0_81]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC403-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.11/5.51 % Computer : n009.cluster.edu
% 0.11/5.51 % Model : x86_64 x86_64
% 0.11/5.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.51 % Memory : 8046.5625MB
% 0.11/5.51 % OS : Linux 6.8.0-71-generic
% 0.11/5.51 % CPULimit : 300
% 0.11/5.51 % WCLimit : 300
% 0.11/5.51 % DateTime : Mon Sep 21 08:22:05 UTC 2026
% 0.11/5.51 % CPUTime :
% 0.11/5.51 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.54 Running first-order theorem proving
% 0.11/5.54 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
% 0.15/5.91 % Version: 3.5.1
% 0.15/5.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.91 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.91 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.91 % Starting sh5l with 300s (1) cores
% 0.15/5.91 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1303452 completed with status 0
% 0.15/5.91 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.15/5.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.91 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.91 % No SInE strategy applied
% 0.15/5.91 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/5.91 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.91 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.91 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.91 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/5.91 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/5.91 % G-E--_200_B02_F1_SE_CS_SP_PI_S2k with pid 1303461 completed with status 0
% 0.15/5.91 % Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S2k
% 0.15/5.91 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.91 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.91 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/5.91 % No SInE strategy applied
% 0.15/5.91 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.15/5.91 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/5.91 % Starting SubtermCWHack with 136s (1) cores
% 0.15/5.91 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.15/5.91 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/5.91 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.15/5.91 % Preprocessing time : 0.003 s
% 0.15/5.91
% 0.15/5.91 % Proof found!
% 0.15/5.91 % SZS status Unsatisfiable
% 0.15/5.91 % SZS output start CNFRefutation
% See solution above
% 0.15/5.92 % Parsed axioms : 197
% 0.15/5.92 % Removed by relevancy pruning/SinE : 0
% 0.15/5.92 % Initial clauses : 197
% 0.15/5.92 % Removed in clause preprocessing : 0
% 0.15/5.92 % Initial clauses in saturation : 197
% 0.15/5.92 % Processed clauses : 3050
% 0.15/5.92 % ...of these trivial : 54
% 0.15/5.92 % ...subsumed : 1738
% 0.15/5.92 % ...remaining for further processing : 1258
% 0.15/5.92 % Other redundant clauses eliminated : 316
% 0.15/5.92 % Clauses deleted for lack of memory : 0
% 0.15/5.92 % Backward-subsumed : 103
% 0.15/5.92 % Backward-rewritten : 179
% 0.15/5.92 % Generated clauses : 10648
% 0.15/5.92 % ...of the previous two non-redundant : 9365
% 0.15/5.92 % ...aggressively subsumed : 0
% 0.15/5.92 % Contextual simplify-reflections : 95
% 0.15/5.92 % Paramodulations : 10305
% 0.15/5.92 % Factorizations : 0
% 0.15/5.92 % NegExts : 0
% 0.15/5.92 % Equation resolutions : 326
% 0.15/5.92 % Disequality decompositions : 0
% 0.15/5.92 % Total rewrite steps : 12801
% 0.15/5.92 % ...of those cached : 12339
% 0.15/5.92 % Propositional unsat checks : 0
% 0.15/5.92 % Propositional check models : 0
% 0.15/5.92 % Propositional check unsatisfiable : 0
% 0.15/5.92 % Propositional clauses : 0
% 0.15/5.92 % Propositional clauses after purity: 0
% 0.15/5.92 % Propositional unsat core size : 0
% 0.15/5.92 % Propositional preprocessing time : 0.000
% 0.15/5.92 % Propositional encoding time : 0.000
% 0.15/5.92 % Propositional solver time : 0.000
% 0.15/5.92 % Success case prop preproc time : 0.000
% 0.15/5.92 % Success case prop encoding time : 0.000
% 0.15/5.92 % Success case prop solver time : 0.000
% 0.15/5.92 % Current number of processed clauses : 935
% 0.15/5.92 % Positive orientable unit clauses : 167
% 0.15/5.92 % Positive unorientable unit clauses: 0
% 0.15/5.92 % Negative unit clauses : 46
% 0.15/5.92 % Non-unit-clauses : 722
% 0.15/5.92 % Current number of unprocessed clauses: 5776
% 0.15/5.92 % ...number of literals in the above : 27973
% 0.15/5.92 % Current number of archived formulas : 0
% 0.15/5.92 % Current number of archived clauses : 300
% 0.15/5.92 % Clause-clause subsumption calls (NU) : 148151
% 0.15/5.92 % Rec. Clause-clause subsumption calls : 41223
% 0.15/5.92 % Non-unit clause-clause subsumptions : 1230
% 0.15/5.92 % Unit Clause-clause subsumption calls : 4296
% 0.15/5.92 % Rewrite failures with RHS unbound : 0
% 0.15/5.92 % BW rewrite match attempts : 70
% 0.15/5.92 % BW rewrite match successes : 55
% 0.15/5.92 % Condensation attempts : 0
% 0.15/5.92 % Condensation successes : 0
% 0.15/5.92 % Termbank termtop insertions : 220239
% 0.15/5.92 % Search garbage collected termcells : 540
% 0.15/5.92
% 0.15/5.92 % -------------------------------------------------
% 0.15/5.92 % User time : 0.329 s
% 0.15/5.92 % System time : 0.013 s
% 0.15/5.92 % Total time : 0.342 s
% 0.15/5.92 % Maximum resident set size: 3760 pages
% 0.15/5.92
% 0.15/5.92 % -------------------------------------------------
% 0.15/5.92 % User time : 1.624 s
% 0.15/5.92 % System time : 0.087 s
% 0.15/5.92 % Total time : 1.711 s
% 0.15/5.92 % Maximum resident set size: 4864 pages
% 0.15/5.92 % E exiting
%------------------------------------------------------------------------------