%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC340-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:00 PM UTC 2026
% Result : Unsatisfiable 0.51s 0.58s
% Output : CNFRefutation 0.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 26
% Syntax : Number of formulae : 84 ( 33 unt; 0 def)
% Number of atoms : 237 ( 36 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 300 ( 147 ~; 151 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 3 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-2 aty)
% Number of variables : 123 ( 23 sgn 2 !; 0 ?)
% 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(clause138,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause138) ).
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(clause109,axiom,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause109) ).
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(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(co1_9,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
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(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause4,axiom,
totalorderedP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause4) ).
cnf(clause181,axiom,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(clause103,axiom,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause103) ).
cnf(clause164,axiom,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause164) ).
cnf(clause27,axiom,
ssList(skaf68(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause27) ).
cnf(clause28,axiom,
ssList(skaf67(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause28) ).
cnf(clause29,axiom,
ssList(skaf66(X1)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause29) ).
cnf(clause91,axiom,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause91) ).
cnf(co1_8,negated_conjecture,
strictorderedP(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_27,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_28,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_25 ).
cnf(c_0_29,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_30,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_31,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_32,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_26 ).
cnf(c_0_33,plain,
( ~ duplicatefreeP(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(X1,cons(X2,X3)) != X4 ),
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_34,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_31 ).
cnf(c_0_35,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_36,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
( ~ duplicatefreeP(X3)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ memberP(X2,skaf83(X1))
| app(X2,X1) != X3
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( ~ ssList(X1)
| memberP(X1,skaf83(X1))
| nil = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_35]),c_0_36])]) ).
cnf(c_0_40,plain,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X1) != X2
| nil = X1 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
fof(c_0_41,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_42,plain,
( ~ duplicatefreeP(app(X1,X1))
| ~ ssList(X1)
| ~ ssList(app(X1,X1))
| nil = X1 ),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_45,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_46,negated_conjecture,
segmentP(sk4,sk3),
co1_7 ).
cnf(c_0_47,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| ~ ssList(app(X1,X1))
| epred2_0
| nil = X1 ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_44 ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_51,negated_conjecture,
( ~ totalorderedP(sk1)
| ~ segmentP(sk2,sk1) ),
c_0_45 ).
cnf(c_0_52,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_53,negated_conjecture,
segmentP(sk4,sk1),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| epred2_0
| nil = X1 ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,negated_conjecture,
ssList(sk1),
co1_1 ).
fof(c_0_56,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_57,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_50 ).
cnf(c_0_58,negated_conjecture,
~ totalorderedP(sk1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_59,negated_conjecture,
( epred2_0
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_61,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_57,c_0_56]),c_0_41]) ).
cnf(c_0_62,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60])]) ).
cnf(c_0_63,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
inference(fof_simplification,[status(thm)],[clause181]) ).
cnf(c_0_64,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_56]) ).
cnf(c_0_65,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_66,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_67,plain,
( ~ ssList(X6)
| ~ strictorderedP(X6)
| ~ ssItem(X2)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X5)
| app(app(X1,cons(X2,X3)),cons(X4,X5)) != X6
| lt(X2,X4) ),
c_0_63 ).
cnf(c_0_68,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_64,c_0_65]) ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause164]) ).
cnf(c_0_70,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_66 ).
cnf(c_0_71,plain,
( ~ strictorderedP(X6)
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X6
| lt(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68]),c_0_68])]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
c_0_69 ).
cnf(c_0_73,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_74,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_75,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_76,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_77,plain,
( ~ lt(X1,X2)
| leq(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_68]),c_0_68])]) ).
cnf(c_0_78,plain,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| totalorderedP(X1)
| lt(skaf64(X1),skaf65(X1)) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_73]),c_0_74]),c_0_75])])]) ).
cnf(c_0_79,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
c_0_76 ).
cnf(c_0_80,negated_conjecture,
strictorderedP(sk3),
co1_8 ).
cnf(c_0_81,plain,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_79]) ).
cnf(c_0_82,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_80,c_0_47]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_81]),c_0_55]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC340-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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:16:58 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 0.51/0.58 % Version: 3.5.1
% 0.51/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.58 % Starting new_bool_3 with 300s (1) cores
% 0.51/0.58 % Starting new_bool_1 with 300s (1) cores
% 0.51/0.58 % Starting sh5l with 300s (1) cores
% 0.51/0.58 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1291803 completed with status 0
% 0.51/0.58 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.51/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.58 % No SInE strategy applied
% 0.51/0.58 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.51/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.51/0.58 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.51/0.58 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.51/0.58 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.51/0.58 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 1291811 completed with status 0
% 0.51/0.58 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.51/0.58 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.51/0.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.51/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.51/0.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.51/0.58 % No SInE strategy applied
% 0.51/0.58 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.51/0.58 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.51/0.58 % Starting SubtermCWHack with 136s (1) cores
% 0.51/0.58 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.51/0.58 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.51/0.58 % Preprocessing time : 0.004 s
% 0.51/0.58 % Presaturation interreduction done
% 0.51/0.58
% 0.51/0.58 % Proof found!
% 0.51/0.58 % SZS status Unsatisfiable
% 0.51/0.58 % SZS output start CNFRefutation
% See solution above
% 0.51/0.58 % Parsed axioms : 194
% 0.51/0.58 % Removed by relevancy pruning/SinE : 0
% 0.51/0.58 % Initial clauses : 194
% 0.51/0.58 % Removed in clause preprocessing : 0
% 0.51/0.58 % Initial clauses in saturation : 194
% 0.51/0.58 % Processed clauses : 802
% 0.51/0.58 % ...of these trivial : 9
% 0.51/0.58 % ...subsumed : 192
% 0.51/0.58 % ...remaining for further processing : 601
% 0.51/0.58 % Other redundant clauses eliminated : 192
% 0.51/0.58 % Clauses deleted for lack of memory : 0
% 0.51/0.58 % Backward-subsumed : 7
% 0.51/0.58 % Backward-rewritten : 97
% 0.51/0.58 % Generated clauses : 2219
% 0.51/0.58 % ...of the previous two non-redundant : 1903
% 0.51/0.58 % ...aggressively subsumed : 0
% 0.51/0.58 % Contextual simplify-reflections : 23
% 0.51/0.58 % Paramodulations : 1979
% 0.51/0.58 % Factorizations : 0
% 0.51/0.58 % NegExts : 0
% 0.51/0.58 % Equation resolutions : 232
% 0.51/0.58 % Disequality decompositions : 0
% 0.51/0.58 % Total rewrite steps : 1390
% 0.51/0.58 % ...of those cached : 1239
% 0.51/0.58 % Propositional unsat checks : 0
% 0.51/0.58 % Propositional check models : 0
% 0.51/0.58 % Propositional check unsatisfiable : 0
% 0.51/0.58 % Propositional clauses : 0
% 0.51/0.58 % Propositional clauses after purity: 0
% 0.51/0.58 % Propositional unsat core size : 0
% 0.51/0.58 % Propositional preprocessing time : 0.000
% 0.51/0.58 % Propositional encoding time : 0.000
% 0.51/0.58 % Propositional solver time : 0.000
% 0.51/0.58 % Success case prop preproc time : 0.000
% 0.51/0.59 % Success case prop encoding time : 0.000
% 0.51/0.59 % Success case prop solver time : 0.000
% 0.51/0.59 % Current number of processed clauses : 298
% 0.51/0.59 % Positive orientable unit clauses : 54
% 0.51/0.59 % Positive unorientable unit clauses: 0
% 0.51/0.59 % Negative unit clauses : 9
% 0.51/0.59 % Non-unit-clauses : 235
% 0.51/0.59 % Current number of unprocessed clauses: 1391
% 0.51/0.59 % ...number of literals in the above : 9182
% 0.51/0.59 % Current number of archived formulas : 0
% 0.51/0.59 % Current number of archived clauses : 295
% 0.51/0.59 % Clause-clause subsumption calls (NU) : 22492
% 0.51/0.59 % Rec. Clause-clause subsumption calls : 5141
% 0.51/0.59 % Non-unit clause-clause subsumptions : 207
% 0.51/0.59 % Unit Clause-clause subsumption calls : 557
% 0.51/0.59 % Rewrite failures with RHS unbound : 0
% 0.51/0.59 % BW rewrite match attempts : 32
% 0.51/0.59 % BW rewrite match successes : 25
% 0.51/0.59 % Condensation attempts : 0
% 0.51/0.59 % Condensation successes : 0
% 0.51/0.59 % Termbank termtop insertions : 46890
% 0.51/0.59 % Search garbage collected termcells : 532
% 0.51/0.59
% 0.51/0.59 % -------------------------------------------------
% 0.51/0.59 % User time : 0.127 s
% 0.51/0.59 % System time : 0.007 s
% 0.51/0.59 % Total time : 0.133 s
% 0.51/0.59 % Maximum resident set size: 4064 pages
% 0.51/0.59
% 0.51/0.59 % -------------------------------------------------
% 0.51/0.59 % User time : 0.480 s
% 0.51/0.59 % System time : 0.053 s
% 0.51/0.59 % Total time : 0.534 s
% 0.51/0.59 % Maximum resident set size: 4864 pages
% 0.51/0.59 % E exiting
%------------------------------------------------------------------------------