%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC264-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 : n004.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:42 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.68s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 24
% Syntax : Number of formulae : 78 ( 30 unt; 0 def)
% Number of atoms : 228 ( 34 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 293 ( 143 ~; 148 |; 0 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 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(clause72,axiom,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
cnf(co1_8,negated_conjecture,
~ totalorderedP(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
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_7,negated_conjecture,
strictorderedP(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(c_0_22,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_23,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_24,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[clause138]) ).
cnf(c_0_25,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_22 ).
cnf(c_0_26,plain,
( ~ ssList(X1)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| app(skaf42(X1,X2),cons(X2,skaf43(X2,X1))) = X1 ),
c_0_23 ).
cnf(c_0_27,axiom,
ssList(skaf43(X1,X2)),
clause52 ).
cnf(c_0_28,axiom,
ssList(skaf42(X1,X2)),
clause53 ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause109]) ).
cnf(c_0_30,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ ssList(X3)
| X1 != X2
| memberP(cons(X2,X3),X1) ),
c_0_24 ).
cnf(c_0_31,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_25,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| cons(skaf83(X1),skaf82(X1)) = X1 ),
c_0_29 ).
cnf(c_0_33,axiom,
ssItem(skaf83(X1)),
clause12 ).
cnf(c_0_34,axiom,
ssList(skaf82(X1)),
clause13 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| memberP(cons(X1,X2),X1) ),
inference(er,[status(thm)],[c_0_30]) ).
cnf(c_0_36,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_31,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_37,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_35,c_0_32]),c_0_33]),c_0_34])]) ).
cnf(c_0_38,plain,
( ~ duplicatefreeP(X2)
| ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X1) != X2
| nil = X1 ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_39,plain,
( ~ epred2_0
<=> ! [X1] :
( ~ ssList(X1)
| duplicatefreeP(X1) ) ),
introduced(definition) ).
cnf(c_0_40,plain,
( ~ duplicatefreeP(app(X1,X1))
| ~ ssList(X1)
| ~ ssList(app(X1,X1))
| nil = X1 ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_41,plain,
( ~ ssList(X1)
| duplicatefreeP(X1)
| epred2_0 ),
inference(split_equiv,[status(thm)],[c_0_39]) ).
cnf(c_0_42,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| ~ ssList(app(X1,X1))
| epred2_0
| nil = X1 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_42 ).
cnf(c_0_45,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
inference(fof_simplification,[status(thm)],[clause72]) ).
cnf(c_0_46,negated_conjecture,
~ totalorderedP(sk1),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_47,plain,
( ~ ssList(X1)
| epred2_0
| nil = X1 ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
fof(c_0_49,plain,
( ~ epred1_0
<=> ! [X2] : ssItem(X2) ),
introduced(definition) ).
cnf(c_0_50,plain,
( ~ ssList(X1)
| ssItem(X2)
| duplicatefreeP(X1) ),
c_0_45 ).
cnf(c_0_51,negated_conjecture,
~ totalorderedP(sk1),
c_0_46 ).
cnf(c_0_52,negated_conjecture,
( epred2_0
| sk1 = nil ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_53,axiom,
totalorderedP(nil),
clause4 ).
cnf(c_0_54,plain,
( ~ epred1_0
| ~ epred2_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_50,c_0_49]),c_0_39]) ).
cnf(c_0_55,negated_conjecture,
epred2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53])]) ).
cnf(c_0_56,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_57,plain,
( ssItem(X1)
| epred1_0 ),
inference(split_equiv,[status(thm)],[c_0_49]) ).
cnf(c_0_58,plain,
~ epred1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]) ).
cnf(c_0_59,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause103]) ).
cnf(c_0_60,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_56 ).
cnf(c_0_61,plain,
ssItem(X1),
inference(sr,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_62,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_63,plain,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ lt(X1,X2)
| leq(X1,X2) ),
c_0_59 ).
cnf(c_0_64,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_60,c_0_61]),c_0_61])]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| app(app(skaf66(X1),cons(skaf64(X1),skaf67(X1))),cons(skaf65(X1),skaf68(X1))) = X1
| totalorderedP(X1) ),
c_0_62 ).
cnf(c_0_66,axiom,
ssList(skaf68(X1)),
clause27 ).
cnf(c_0_67,axiom,
ssList(skaf67(X1)),
clause28 ).
cnf(c_0_68,axiom,
ssList(skaf66(X1)),
clause29 ).
cnf(c_0_69,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
inference(fof_simplification,[status(thm)],[clause91]) ).
cnf(c_0_70,plain,
( ~ lt(X1,X2)
| leq(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_61]),c_0_61])]) ).
cnf(c_0_71,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_64,c_0_65]),c_0_66]),c_0_67]),c_0_68])])]) ).
cnf(c_0_72,plain,
( ~ ssList(X1)
| ~ leq(skaf64(X1),skaf65(X1))
| totalorderedP(X1) ),
c_0_69 ).
cnf(c_0_73,negated_conjecture,
strictorderedP(sk3),
co1_7 ).
cnf(c_0_74,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_75,plain,
( ~ strictorderedP(X1)
| ~ ssList(X1)
| totalorderedP(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).
cnf(c_0_76,negated_conjecture,
strictorderedP(sk1),
inference(rw,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_75]),c_0_48]),c_0_76])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC264-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.40 % Computer : n004.cluster.edu
% 0.17/0.40 % Model : x86_64 x86_64
% 0.17/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.40 % Memory : 8046.5625MB
% 0.17/0.40 % OS : Linux 6.8.0-71-generic
% 0.17/0.41 % CPULimit : 300
% 0.17/0.41 % WCLimit : 300
% 0.17/0.41 % DateTime : Mon Sep 21 08:10:21 UTC 2026
% 0.21/0.41 % CPUTime :
% 0.21/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 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.26/0.68 % Version: 3.5.1
% 0.26/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.68 % Starting sh5l with 300s (1) cores
% 0.26/0.68 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2677195 completed with status 0
% 0.26/0.68 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.26/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.68 % No SInE strategy applied
% 0.26/0.68 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.26/0.68 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.68 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.26/0.68 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.26/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.26/0.68 % G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with pid 2677203 completed with status 0
% 0.26/0.68 % Result found by G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y
% 0.26/0.68 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.68 % No SInE strategy applied
% 0.26/0.68 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.26/0.68 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.68 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.68 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.26/0.68 % Preprocessing time : 0.003 s
% 0.26/0.68 % Presaturation interreduction done
% 0.26/0.68
% 0.26/0.68 % Proof found!
% 0.26/0.68 % SZS status Unsatisfiable
% 0.26/0.68 % SZS output start CNFRefutation
% See solution above
% 0.26/0.68 % Parsed axioms : 193
% 0.26/0.68 % Removed by relevancy pruning/SinE : 0
% 0.26/0.68 % Initial clauses : 193
% 0.26/0.68 % Removed in clause preprocessing : 0
% 0.26/0.68 % Initial clauses in saturation : 193
% 0.26/0.68 % Processed clauses : 787
% 0.26/0.68 % ...of these trivial : 12
% 0.26/0.68 % ...subsumed : 189
% 0.26/0.68 % ...remaining for further processing : 586
% 0.26/0.68 % Other redundant clauses eliminated : 180
% 0.26/0.68 % Clauses deleted for lack of memory : 0
% 0.26/0.68 % Backward-subsumed : 8
% 0.26/0.68 % Backward-rewritten : 97
% 0.26/0.68 % Generated clauses : 2210
% 0.26/0.68 % ...of the previous two non-redundant : 1870
% 0.26/0.68 % ...aggressively subsumed : 0
% 0.26/0.68 % Contextual simplify-reflections : 23
% 0.26/0.68 % Paramodulations : 1983
% 0.26/0.68 % Factorizations : 0
% 0.26/0.68 % NegExts : 0
% 0.26/0.68 % Equation resolutions : 219
% 0.26/0.68 % Disequality decompositions : 0
% 0.26/0.68 % Total rewrite steps : 1423
% 0.26/0.68 % ...of those cached : 1270
% 0.26/0.68 % Propositional unsat checks : 0
% 0.26/0.68 % Propositional check models : 0
% 0.26/0.68 % Propositional check unsatisfiable : 0
% 0.26/0.68 % Propositional clauses : 0
% 0.26/0.68 % Propositional clauses after purity: 0
% 0.26/0.68 % Propositional unsat core size : 0
% 0.26/0.68 % Propositional preprocessing time : 0.000
% 0.26/0.68 % Propositional encoding time : 0.000
% 0.26/0.68 % Propositional solver time : 0.000
% 0.26/0.68 % Success case prop preproc time : 0.000
% 0.26/0.68 % Success case prop encoding time : 0.000
% 0.26/0.68 % Success case prop solver time : 0.000
% 0.26/0.68 % Current number of processed clauses : 283
% 0.26/0.68 % Positive orientable unit clauses : 54
% 0.26/0.68 % Positive unorientable unit clauses: 0
% 0.26/0.68 % Negative unit clauses : 9
% 0.26/0.68 % Non-unit-clauses : 220
% 0.26/0.68 % Current number of unprocessed clauses: 1373
% 0.26/0.68 % ...number of literals in the above : 9175
% 0.26/0.68 % Current number of archived formulas : 0
% 0.26/0.68 % Current number of archived clauses : 295
% 0.26/0.68 % Clause-clause subsumption calls (NU) : 22620
% 0.26/0.68 % Rec. Clause-clause subsumption calls : 5150
% 0.26/0.68 % Non-unit clause-clause subsumptions : 205
% 0.26/0.68 % Unit Clause-clause subsumption calls : 552
% 0.26/0.68 % Rewrite failures with RHS unbound : 0
% 0.26/0.68 % BW rewrite match attempts : 32
% 0.26/0.68 % BW rewrite match successes : 25
% 0.26/0.68 % Condensation attempts : 0
% 0.26/0.68 % Condensation successes : 0
% 0.26/0.68 % Termbank termtop insertions : 46868
% 0.26/0.68 % Search garbage collected termcells : 529
% 0.26/0.68
% 0.26/0.68 % -------------------------------------------------
% 0.26/0.68 % User time : 0.081 s
% 0.26/0.68 % System time : 0.007 s
% 0.26/0.68 % Total time : 0.088 s
% 0.26/0.68 % Maximum resident set size: 3552 pages
% 0.26/0.68
% 0.26/0.68 % -------------------------------------------------
% 0.26/0.68 % User time : 0.393 s
% 0.26/0.68 % System time : 0.042 s
% 0.26/0.68 % Total time : 0.435 s
% 0.26/0.68 % Maximum resident set size: 5120 pages
% 0.26/0.68 % E exiting
%------------------------------------------------------------------------------