%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC418-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 : n015.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:20 PM UTC 2026
% Result : Unsatisfiable 0.66s 0.56s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 18
% Syntax : Number of clauses : 73 ( 18 unt; 17 nHn; 73 RR)
% Number of literals : 230 ( 91 equ; 149 neg)
% Maximal clause size : 12 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 76 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_2) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_8,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_1) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(clause120,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause120) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_18,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_19,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ neq(nil,sk4)
| hd(sk4) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk4) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| sk3 = X1 ),
c_0_18 ).
cnf(c_0_20,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk4)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk4) != X4
| tl(sk4) != X2
| sk3 = X1 ),
inference(cn,[status(thm)],[c_0_19]) ).
cnf(c_0_24,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_22 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_27,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_28,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])])])])])]),c_0_25]) ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_26 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_32,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_33,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| sk4 = nil
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_34,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_32 ).
cnf(c_0_35,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_36,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssList(cons(hd(sk4),nil))
| sk4 = nil
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_31])]) ).
cnf(c_0_38,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_35 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_40,negated_conjecture,
( app(app(X3,cons(X1,nil)),X2) != sk1
| app(app(X2,cons(X1,nil)),X3) != sk2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssItem(X1) ),
c_0_36 ).
cnf(c_0_41,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_42,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_43,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| sk4 = nil
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_31])]) ).
cnf(c_0_44,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_39 ).
cnf(c_0_45,negated_conjecture,
( ~ ssList(X3)
| ~ ssList(X1)
| ~ ssItem(X2)
| app(app(X3,cons(X2,nil)),X1) != sk4
| app(app(X1,cons(X2,nil)),X3) != sk3 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_21]) ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_42 ).
cnf(c_0_47,negated_conjecture,
( ~ ssItem(hd(sk4))
| sk4 = nil
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_30])]) ).
cnf(c_0_48,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_49,negated_conjecture,
( ~ ssList(X2)
| ~ ssList(app(X2,cons(X1,nil)))
| ~ ssItem(X1)
| app(X2,cons(X1,nil)) != sk3
| app(app(nil,cons(X1,nil)),X2) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_30])]) ).
cnf(c_0_50,negated_conjecture,
( sk4 = nil
| app(tl(sk4),cons(hd(sk4),nil)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_34]),c_0_31])]) ).
cnf(c_0_51,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_48,c_0_41]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| app(app(nil,cons(hd(sk4),nil)),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51])]) ).
cnf(c_0_53,negated_conjecture,
( ~ ssList(tl(sk4))
| app(app(nil,cons(hd(sk4),nil)),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_34]),c_0_31])]) ).
cnf(c_0_54,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_55,negated_conjecture,
( app(app(nil,cons(hd(sk4),nil)),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_31])]) ).
cnf(c_0_56,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
( ~ ssList(cons(hd(sk4),nil))
| app(cons(hd(sk4),nil),tl(sk4)) != sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssItem(hd(sk4))
| app(cons(hd(sk4),nil),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_44]),c_0_30])]) ).
cnf(c_0_59,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_60,negated_conjecture,
( app(cons(hd(sk4),nil),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_34]),c_0_31])]) ).
cnf(c_0_61,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_59 ).
cnf(c_0_62,negated_conjecture,
( ~ ssList(tl(sk4))
| ~ ssItem(hd(sk4))
| cons(hd(sk4),tl(sk4)) != sk4
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_63,negated_conjecture,
( ~ ssList(tl(sk4))
| cons(hd(sk4),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_34]),c_0_31])]) ).
cnf(c_0_64,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_65,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_66,negated_conjecture,
( cons(hd(sk4),tl(sk4)) != sk4
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_38]),c_0_31])]) ).
cnf(c_0_67,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_64 ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_65 ).
cnf(c_0_69,negated_conjecture,
sk4 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_31])]) ).
cnf(c_0_70,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_71,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_24,c_0_69]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC418-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.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 08:26:20 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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.66/0.56 % Version: 3.5.1
% 0.66/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.66/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.66/0.56 % Starting sh5l with 300s (1) cores
% 0.66/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1031731 completed with status 0
% 0.66/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.56 % No SInE strategy applied
% 0.66/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.66/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.56 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.66/0.56 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.66/0.56 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.66/0.56 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1031738 completed with status 0
% 0.66/0.56 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.66/0.56 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.66/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.66/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.66/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.66/0.56 % No SInE strategy applied
% 0.66/0.56 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.66/0.56 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.66/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.66/0.56 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.66/0.56 % Preprocessing time : 0.004 s
% 0.66/0.56 % Presaturation interreduction done
% 0.66/0.56
% 0.66/0.56 % Proof found!
% 0.66/0.56 % SZS status Unsatisfiable
% 0.66/0.56 % SZS output start CNFRefutation
% See solution above
% 0.66/0.56 % Parsed axioms : 195
% 0.66/0.56 % Removed by relevancy pruning/SinE : 0
% 0.66/0.56 % Initial clauses : 195
% 0.66/0.56 % Removed in clause preprocessing : 0
% 0.66/0.56 % Initial clauses in saturation : 195
% 0.66/0.56 % Processed clauses : 1025
% 0.66/0.56 % ...of these trivial : 2
% 0.66/0.56 % ...subsumed : 320
% 0.66/0.56 % ...remaining for further processing : 703
% 0.66/0.56 % Other redundant clauses eliminated : 160
% 0.66/0.56 % Clauses deleted for lack of memory : 0
% 0.66/0.56 % Backward-subsumed : 121
% 0.66/0.56 % Backward-rewritten : 102
% 0.66/0.56 % Generated clauses : 2587
% 0.66/0.56 % ...of the previous two non-redundant : 2282
% 0.66/0.56 % ...aggressively subsumed : 0
% 0.66/0.56 % Contextual simplify-reflections : 66
% 0.66/0.56 % Paramodulations : 2426
% 0.66/0.56 % Factorizations : 0
% 0.66/0.56 % NegExts : 0
% 0.66/0.56 % Equation resolutions : 165
% 0.66/0.56 % Disequality decompositions : 0
% 0.66/0.56 % Total rewrite steps : 2058
% 0.66/0.56 % ...of those cached : 1968
% 0.66/0.56 % Propositional unsat checks : 0
% 0.66/0.56 % Propositional check models : 0
% 0.66/0.56 % Propositional check unsatisfiable : 0
% 0.66/0.56 % Propositional clauses : 0
% 0.66/0.56 % Propositional clauses after purity: 0
% 0.66/0.56 % Propositional unsat core size : 0
% 0.66/0.56 % Propositional preprocessing time : 0.000
% 0.66/0.56 % Propositional encoding time : 0.000
% 0.66/0.56 % Propositional solver time : 0.000
% 0.66/0.56 % Success case prop preproc time : 0.000
% 0.66/0.56 % Success case prop encoding time : 0.000
% 0.66/0.56 % Success case prop solver time : 0.000
% 0.66/0.56 % Current number of processed clauses : 269
% 0.66/0.56 % Positive orientable unit clauses : 63
% 0.66/0.56 % Positive unorientable unit clauses: 0
% 0.66/0.56 % Negative unit clauses : 2
% 0.66/0.56 % Non-unit-clauses : 204
% 0.66/0.56 % Current number of unprocessed clauses: 1587
% 0.66/0.56 % ...number of literals in the above : 10488
% 0.66/0.56 % Current number of archived formulas : 0
% 0.66/0.56 % Current number of archived clauses : 410
% 0.66/0.56 % Clause-clause subsumption calls (NU) : 29843
% 0.66/0.56 % Rec. Clause-clause subsumption calls : 5390
% 0.66/0.56 % Non-unit clause-clause subsumptions : 440
% 0.66/0.56 % Unit Clause-clause subsumption calls : 181
% 0.66/0.56 % Rewrite failures with RHS unbound : 0
% 0.66/0.56 % BW rewrite match attempts : 4
% 0.66/0.56 % BW rewrite match successes : 4
% 0.66/0.56 % Condensation attempts : 0
% 0.66/0.56 % Condensation successes : 0
% 0.66/0.56 % Termbank termtop insertions : 62231
% 0.66/0.56 % Search garbage collected termcells : 561
% 0.66/0.56
% 0.66/0.56 % -------------------------------------------------
% 0.66/0.56 % User time : 0.126 s
% 0.66/0.56 % System time : 0.006 s
% 0.66/0.56 % Total time : 0.132 s
% 0.66/0.56 % Maximum resident set size: 4068 pages
% 0.66/0.56
% 0.66/0.56 % -------------------------------------------------
% 0.66/0.56 % User time : 0.562 s
% 0.66/0.56 % System time : 0.037 s
% 0.66/0.56 % Total time : 0.598 s
% 0.66/0.56 % Maximum resident set size: 5120 pages
% 0.66/0.56 % E exiting
%------------------------------------------------------------------------------