%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC421-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 : n017.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:21 PM UTC 2026
% Result : Unsatisfiable 0.61s 0.51s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 19
% Syntax : Number of clauses : 74 ( 19 unt; 17 nHn; 74 RR)
% Number of literals : 230 ( 85 equ; 150 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 : 80 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_11,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(clause74,axiom,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
cnf(co1_7,negated_conjecture,
neq(sk2,nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
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(clause76,axiom,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).
cnf(clause104,axiom,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause104) ).
cnf(clause75,axiom,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause75) ).
cnf(co1_10,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(clause73,axiom,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
cnf(co1_2,negated_conjecture,
ssList(sk2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_2) ).
cnf(clause115,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause115) ).
cnf(c_0_19,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_20,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_21,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_19 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_24,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
inference(fof_simplification,[status(thm)],[clause74]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(nil,sk3)
| ~ neq(nil,sk3)
| hd(sk3) != X4
| cons(X4,nil) != X3
| ~ ssItem(X4)
| app(X2,X3) != X1
| tl(sk3) != X2
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ neq(sk4,nil)
| sk4 = X1 ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
neq(sk2,nil),
co1_7 ).
cnf(c_0_27,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_28,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_21,c_0_22]),c_0_23]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| app(nil,X1) = X1 ),
c_0_24 ).
cnf(c_0_30,axiom,
ssList(nil),
clause8 ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_32,negated_conjecture,
( ~ neq(sk4,nil)
| ~ neq(nil,sk3)
| ~ ssItem(X4)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| cons(X4,nil) != X3
| app(X2,X3) != X1
| hd(sk3) != X4
| tl(sk3) != X2
| sk4 = X1 ),
inference(cn,[status(thm)],[c_0_25]) ).
cnf(c_0_33,negated_conjecture,
neq(sk4,nil),
inference(rw,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_34,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_27 ).
cnf(c_0_35,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_37,negated_conjecture,
( ~ ssList(X1)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk3
| app(app(X1,cons(X2,nil)),nil) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_38,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_31 ).
cnf(c_0_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| ~ neq(nil,sk3)
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
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_32,c_0_33])])])])])]),c_0_34]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_35 ).
cnf(c_0_42,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_43,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
inference(fof_simplification,[status(thm)],[clause76]) ).
cnf(c_0_44,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| app(cons(X2,nil),X1) != sk3
| app(app(X1,cons(X2,nil)),nil) != sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_30])]) ).
cnf(c_0_45,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_39 ).
cnf(c_0_46,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
inference(fof_simplification,[status(thm)],[clause104]) ).
cnf(c_0_47,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| ~ ssItem(hd(sk3))
| sk3 = nil
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]),c_0_42])]) ).
cnf(c_0_48,plain,
( ~ ssList(X1)
| nil = X1
| ssItem(hd(X1)) ),
c_0_43 ).
cnf(c_0_49,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
inference(fof_simplification,[status(thm)],[clause75]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,X1) != sk3
| app(app(X1,cons(X2,nil)),nil) != sk4 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,plain,
( ~ ssList(X1)
| nil = X1
| cons(hd(X1),tl(X1)) = X1 ),
c_0_46 ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssList(cons(hd(sk3),nil))
| sk3 = nil
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_42])]) ).
cnf(c_0_53,plain,
( ~ ssList(X1)
| nil = X1
| ssList(tl(X1)) ),
c_0_49 ).
cnf(c_0_54,negated_conjecture,
( ~ ssList(tl(sk3))
| ~ ssItem(hd(sk3))
| app(app(tl(sk3),cons(hd(sk3),nil)),nil) != sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51])]),c_0_42])]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(hd(sk3),nil))
| sk3 = nil
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_42])]) ).
cnf(c_0_56,negated_conjecture,
( ~ ssList(tl(sk3))
| app(app(tl(sk3),cons(hd(sk3),nil)),nil) != sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_48]),c_0_42])]) ).
cnf(c_0_57,negated_conjecture,
( ~ ssItem(hd(sk3))
| sk3 = nil
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_38]),c_0_30])]) ).
cnf(c_0_58,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_59,negated_conjecture,
( app(app(tl(sk3),cons(hd(sk3),nil)),nil) != sk4
| sk3 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_53]),c_0_42])]) ).
cnf(c_0_60,negated_conjecture,
( sk3 = nil
| app(tl(sk3),cons(hd(sk3),nil)) = sk4 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_48]),c_0_42])]) ).
cnf(c_0_61,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
inference(fof_simplification,[status(thm)],[clause73]) ).
cnf(c_0_62,negated_conjecture,
ssList(sk2),
co1_2 ).
cnf(c_0_63,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
inference(fof_simplification,[status(thm)],[clause115]) ).
cnf(c_0_64,negated_conjecture,
( ~ neq(sk4,nil)
| neq(sk3,nil) ),
c_0_58 ).
cnf(c_0_65,negated_conjecture,
( app(sk4,nil) != sk4
| sk3 = nil ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,plain,
( ~ ssList(X1)
| app(X1,nil) = X1 ),
c_0_61 ).
cnf(c_0_67,negated_conjecture,
ssList(sk4),
inference(rw,[status(thm)],[c_0_62,c_0_23]) ).
cnf(c_0_68,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| ~ neq(X1,X2)
| X1 != X2 ),
c_0_63 ).
cnf(c_0_69,negated_conjecture,
neq(sk3,nil),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_33])]) ).
cnf(c_0_70,negated_conjecture,
sk3 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67])]) ).
cnf(c_0_71,plain,
( ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(er,[status(thm)],[c_0_68]) ).
cnf(c_0_72,negated_conjecture,
neq(nil,nil),
inference(rw,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC421-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.10/0.36 % Computer : n017.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.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 08:18:42 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 0.61/0.51 % Version: 3.5.1
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.61/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.61/0.51 % Starting sh5l with 300s (1) cores
% 0.61/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1881588 completed with status 0
% 0.61/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.51 % No SInE strategy applied
% 0.61/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.61/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.51 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 0.61/0.51 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 0.61/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.61/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1881600 completed with status 0
% 0.61/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.61/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.61/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.61/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.51 % No SInE strategy applied
% 0.61/0.51 % Search class: FGHSM-FSLM21-MFFFFFNN
% 0.61/0.51 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.61/0.51 % Preprocessing time : 0.004 s
% 0.61/0.51 % Presaturation interreduction done
% 0.61/0.51
% 0.61/0.51 % Proof found!
% 0.61/0.51 % SZS status Unsatisfiable
% 0.61/0.51 % SZS output start CNFRefutation
% See solution above
% 0.61/0.51 % Parsed axioms : 196
% 0.61/0.51 % Removed by relevancy pruning/SinE : 0
% 0.61/0.51 % Initial clauses : 196
% 0.61/0.51 % Removed in clause preprocessing : 0
% 0.61/0.51 % Initial clauses in saturation : 196
% 0.61/0.51 % Processed clauses : 648
% 0.61/0.51 % ...of these trivial : 2
% 0.61/0.51 % ...subsumed : 130
% 0.61/0.51 % ...remaining for further processing : 516
% 0.61/0.51 % Other redundant clauses eliminated : 101
% 0.61/0.51 % Clauses deleted for lack of memory : 0
% 0.61/0.51 % Backward-subsumed : 34
% 0.61/0.51 % Backward-rewritten : 52
% 0.61/0.51 % Generated clauses : 1566
% 0.61/0.51 % ...of the previous two non-redundant : 1325
% 0.61/0.51 % ...aggressively subsumed : 0
% 0.61/0.51 % Contextual simplify-reflections : 19
% 0.61/0.51 % Paramodulations : 1464
% 0.61/0.51 % Factorizations : 0
% 0.61/0.51 % NegExts : 0
% 0.61/0.51 % Equation resolutions : 106
% 0.61/0.51 % Disequality decompositions : 0
% 0.61/0.51 % Total rewrite steps : 1156
% 0.61/0.51 % ...of those cached : 1075
% 0.61/0.51 % Propositional unsat checks : 0
% 0.61/0.51 % Propositional check models : 0
% 0.61/0.51 % Propositional check unsatisfiable : 0
% 0.61/0.51 % Propositional clauses : 0
% 0.61/0.51 % Propositional clauses after purity: 0
% 0.61/0.51 % Propositional unsat core size : 0
% 0.61/0.51 % Propositional preprocessing time : 0.000
% 0.61/0.51 % Propositional encoding time : 0.000
% 0.61/0.51 % Propositional solver time : 0.000
% 0.61/0.51 % Success case prop preproc time : 0.000
% 0.61/0.51 % Success case prop encoding time : 0.000
% 0.61/0.51 % Success case prop solver time : 0.000
% 0.61/0.51 % Current number of processed clauses : 218
% 0.61/0.51 % Positive orientable unit clauses : 64
% 0.61/0.51 % Positive unorientable unit clauses: 0
% 0.61/0.51 % Negative unit clauses : 2
% 0.61/0.51 % Non-unit-clauses : 152
% 0.61/0.51 % Current number of unprocessed clauses: 1050
% 0.61/0.51 % ...number of literals in the above : 7088
% 0.61/0.51 % Current number of archived formulas : 0
% 0.61/0.51 % Current number of archived clauses : 274
% 0.61/0.51 % Clause-clause subsumption calls (NU) : 17155
% 0.61/0.51 % Rec. Clause-clause subsumption calls : 2319
% 0.61/0.51 % Non-unit clause-clause subsumptions : 169
% 0.61/0.51 % Unit Clause-clause subsumption calls : 22
% 0.61/0.51 % Rewrite failures with RHS unbound : 0
% 0.61/0.51 % BW rewrite match attempts : 3
% 0.61/0.51 % BW rewrite match successes : 3
% 0.61/0.51 % Condensation attempts : 0
% 0.61/0.51 % Condensation successes : 0
% 0.61/0.51 % Termbank termtop insertions : 42369
% 0.61/0.51 % Search garbage collected termcells : 562
% 0.61/0.51
% 0.61/0.51 % -------------------------------------------------
% 0.61/0.51 % User time : 0.076 s
% 0.61/0.51 % System time : 0.006 s
% 0.61/0.51 % Total time : 0.083 s
% 0.61/0.51 % Maximum resident set size: 4068 pages
% 0.61/0.51
% 0.61/0.51 % -------------------------------------------------
% 0.61/0.51 % User time : 0.374 s
% 0.61/0.51 % System time : 0.029 s
% 0.61/0.51 % Total time : 0.402 s
% 0.61/0.51 % Maximum resident set size: 5120 pages
% 0.61/0.51 % E exiting
%------------------------------------------------------------------------------