%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SWC299-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 : 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:45:46 PM UTC 2026
% Result : Unsatisfiable 1.21s 0.77s
% Output : CNFRefutation 1.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 21
% Syntax : Number of clauses : 72 ( 29 unt; 5 nHn; 72 RR)
% Number of literals : 185 ( 40 equ; 121 neg)
% Maximal clause size : 9 ( 2 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_12,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(clause149,axiom,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause149) ).
cnf(co1_9,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_10,negated_conjecture,
ssList(sk8),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
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(clause118,axiom,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause118) ).
cnf(co1_7,negated_conjecture,
ssItem(sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause181) ).
cnf(co1_11,negated_conjecture,
ssList(sk9),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(clause85,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).
cnf(clause114,axiom,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause114) ).
cnf(co1_13,negated_conjecture,
lt(sk6,sk5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_8,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
cnf(clause3,axiom,
strictorderedP(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause3) ).
cnf(clause86,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).
cnf(clause66,axiom,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause66) ).
cnf(co1_24,negated_conjecture,
( nil = sk3
| cons(sk10,nil) = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_24) ).
cnf(co1_15,negated_conjecture,
( nil = sk3
| ssItem(sk10) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_1,negated_conjecture,
ssList(sk1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_1) ).
cnf(c_0_21,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk1,
co1_12 ).
cnf(c_0_22,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_23,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_24,negated_conjecture,
app(app(app(app(sk7,cons(sk5,nil)),sk8),cons(sk6,nil)),sk9) = sk3,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| app(app(X3,X2),X1) = app(X3,app(X2,X1)) ),
c_0_23 ).
cnf(c_0_26,negated_conjecture,
ssList(sk7),
co1_9 ).
cnf(c_0_27,negated_conjecture,
ssList(sk8),
co1_10 ).
cnf(c_0_28,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_29,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
inference(fof_simplification,[status(thm)],[clause118]) ).
cnf(c_0_30,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,app(cons(sk5,nil),sk8)),cons(sk6,nil)),sk9) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27])]) ).
cnf(c_0_31,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_28 ).
cnf(c_0_32,negated_conjecture,
ssItem(sk5),
co1_7 ).
cnf(c_0_33,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_34,plain,
( ~ ssList(X1)
| ~ ssList(X2)
| app(X1,X2) != nil
| nil = X1 ),
c_0_29 ).
cnf(c_0_35,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| app(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)),sk9) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_27])]) ).
cnf(c_0_36,negated_conjecture,
ssList(sk9),
co1_11 ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
inference(fof_simplification,[status(thm)],[clause85]) ).
cnf(c_0_38,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause114]) ).
cnf(c_0_39,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_33 ).
cnf(c_0_40,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)))
| sk3 != nil
| app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)) = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_41,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| ssList(app(X2,X1)) ),
c_0_37 ).
cnf(c_0_42,plain,
( ~ ssItem(X2)
| ~ ssItem(X1)
| ~ lt(X2,X1)
| ~ lt(X1,X2) ),
c_0_38 ).
cnf(c_0_43,negated_conjecture,
lt(sk6,sk5),
co1_13 ).
cnf(c_0_44,negated_conjecture,
ssItem(sk6),
co1_8 ).
cnf(c_0_45,plain,
( ~ strictorderedP(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssList(X3)
| ~ ssList(X4)
| ~ ssList(X5)
| ~ ssList(app(app(X3,cons(X1,X4)),cons(X2,X5)))
| ~ ssItem(X1)
| ~ ssItem(X2)
| lt(X1,X2) ),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| sk3 != nil
| app(app(sk7,cons(sk5,sk8)),cons(sk6,nil)) = nil ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,axiom,
ssList(nil),
clause8 ).
cnf(c_0_48,axiom,
strictorderedP(nil),
clause3 ).
cnf(c_0_49,negated_conjecture,
~ lt(sk5,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_32])]) ).
cnf(c_0_50,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| sk3 != nil ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_44]),c_0_32]),c_0_47]),c_0_27]),c_0_26]),c_0_48])]),c_0_49]) ).
cnf(c_0_51,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
inference(fof_simplification,[status(thm)],[clause86]) ).
cnf(c_0_52,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_41]),c_0_26])]) ).
cnf(c_0_53,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| ssList(cons(X1,X2)) ),
c_0_51 ).
cnf(c_0_54,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
inference(fof_simplification,[status(thm)],[clause66]) ).
cnf(c_0_55,negated_conjecture,
( ~ ssList(cons(sk6,nil))
| ~ ssList(cons(sk5,nil))
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_32]),c_0_27])]) ).
cnf(c_0_56,plain,
( ~ ssItem(X1)
| strictorderedP(cons(X1,nil)) ),
c_0_54 ).
cnf(c_0_57,negated_conjecture,
( nil = sk3
| cons(sk10,nil) = sk3 ),
co1_24 ).
cnf(c_0_58,negated_conjecture,
( nil = sk3
| ssItem(sk10) ),
co1_15 ).
cnf(c_0_59,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| sk3 != nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_53]),c_0_44]),c_0_47])]) ).
cnf(c_0_60,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),app(cons(sk6,nil),sk9)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_35]),c_0_36])]) ).
cnf(c_0_61,negated_conjecture,
ssList(sk1),
co1_1 ).
cnf(c_0_62,negated_conjecture,
( strictorderedP(sk3)
| sk3 = nil ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).
cnf(c_0_63,negated_conjecture,
sk3 != nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_53]),c_0_32]),c_0_47])]) ).
cnf(c_0_64,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8)))
| app(app(sk7,cons(sk5,sk8)),cons(sk6,sk9)) = sk3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_31]),c_0_44]),c_0_36])]) ).
cnf(c_0_65,negated_conjecture,
ssList(sk3),
inference(rw,[status(thm)],[c_0_61,c_0_22]) ).
cnf(c_0_66,negated_conjecture,
strictorderedP(sk3),
inference(sr,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil))
| ~ ssList(app(sk7,cons(sk5,sk8))) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_64]),c_0_44]),c_0_32]),c_0_65]),c_0_36]),c_0_27]),c_0_26]),c_0_66])]),c_0_49]) ).
cnf(c_0_68,negated_conjecture,
( ~ ssList(cons(sk5,sk8))
| ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_41]),c_0_26])]) ).
cnf(c_0_69,negated_conjecture,
( ~ ssList(cons(sk5,nil))
| ~ ssList(cons(sk6,nil)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_53]),c_0_32]),c_0_27])]) ).
cnf(c_0_70,negated_conjecture,
~ ssList(cons(sk5,nil)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_53]),c_0_44]),c_0_47])]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_53]),c_0_32]),c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC299-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.46 % Computer : n004.cluster.edu
% 0.20/0.46 % Model : x86_64 x86_64
% 0.20/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.46 % Memory : 8046.5625MB
% 0.20/0.46 % OS : Linux 6.8.0-71-generic
% 0.20/0.46 % CPULimit : 300
% 0.20/0.46 % WCLimit : 300
% 0.20/0.46 % DateTime : Mon Sep 21 08:13:19 UTC 2026
% 0.20/0.46 % CPUTime :
% 0.20/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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
% 1.21/0.77 % Version: 3.5.1
% 1.21/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/0.77 % Starting new_bool_3 with 300s (1) cores
% 1.21/0.77 % Starting new_bool_1 with 300s (1) cores
% 1.21/0.77 % Starting sh5l with 300s (1) cores
% 1.21/0.77 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2682514 completed with status 0
% 1.21/0.77 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.21/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.21/0.77 % No SInE strategy applied
% 1.21/0.77 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.21/0.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.77 % Starting SubtermCWHack with 136s (1) cores
% 1.21/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.21/0.77 % Starting G-E--_107_C45_F1_PI_AE_Q7_CS_SP_PS_S0Y with 136s (1) cores
% 1.21/0.77 % Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 1.21/0.77 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 1.21/0.77 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2682520 completed with status 0
% 1.21/0.77 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.21/0.77 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.21/0.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.21/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.21/0.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.21/0.77 % No SInE strategy applied
% 1.21/0.77 % Search class: FGHSM-FSLM21-MFFFFFNN
% 1.21/0.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 1.21/0.77 % Starting SubtermCWHack with 136s (1) cores
% 1.21/0.77 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.21/0.77 % Preprocessing time : 0.006 s
% 1.21/0.77 % Presaturation interreduction done
% 1.21/0.77
% 1.21/0.77 % Proof found!
% 1.21/0.77 % SZS status Unsatisfiable
% 1.21/0.77 % SZS output start CNFRefutation
% See solution above
% 1.21/0.77 % Parsed axioms : 212
% 1.21/0.77 % Removed by relevancy pruning/SinE : 0
% 1.21/0.77 % Initial clauses : 212
% 1.21/0.77 % Removed in clause preprocessing : 0
% 1.21/0.77 % Initial clauses in saturation : 212
% 1.21/0.77 % Processed clauses : 917
% 1.21/0.77 % ...of these trivial : 25
% 1.21/0.77 % ...subsumed : 139
% 1.21/0.77 % ...remaining for further processing : 753
% 1.21/0.77 % Other redundant clauses eliminated : 80
% 1.21/0.77 % Clauses deleted for lack of memory : 0
% 1.21/0.77 % Backward-subsumed : 109
% 1.21/0.77 % Backward-rewritten : 2
% 1.21/0.77 % Generated clauses : 3105
% 1.21/0.77 % ...of the previous two non-redundant : 2811
% 1.21/0.77 % ...aggressively subsumed : 0
% 1.21/0.77 % Contextual simplify-reflections : 48
% 1.21/0.77 % Paramodulations : 2996
% 1.21/0.77 % Factorizations : 0
% 1.21/0.77 % NegExts : 0
% 1.21/0.77 % Equation resolutions : 85
% 1.21/0.77 % Disequality decompositions : 0
% 1.21/0.77 % Total rewrite steps : 2181
% 1.21/0.77 % ...of those cached : 2037
% 1.21/0.77 % Propositional unsat checks : 0
% 1.21/0.77 % Propositional check models : 0
% 1.21/0.77 % Propositional check unsatisfiable : 0
% 1.21/0.77 % Propositional clauses : 0
% 1.21/0.77 % Propositional clauses after purity: 0
% 1.21/0.77 % Propositional unsat core size : 0
% 1.21/0.77 % Propositional preprocessing time : 0.000
% 1.21/0.77 % Propositional encoding time : 0.000
% 1.21/0.77 % Propositional solver time : 0.000
% 1.21/0.77 % Success case prop preproc time : 0.000
% 1.21/0.77 % Success case prop encoding time : 0.000
% 1.21/0.77 % Success case prop solver time : 0.000
% 1.21/0.77 % Current number of processed clauses : 390
% 1.21/0.77 % Positive orientable unit clauses : 92
% 1.21/0.77 % Positive unorientable unit clauses: 0
% 1.21/0.77 % Negative unit clauses : 11
% 1.21/0.77 % Non-unit-clauses : 287
% 1.21/0.77 % Current number of unprocessed clauses: 2212
% 1.21/0.77 % ...number of literals in the above : 10434
% 1.21/0.77 % Current number of archived formulas : 0
% 1.21/0.77 % Current number of archived clauses : 340
% 1.21/0.77 % Clause-clause subsumption calls (NU) : 29475
% 1.21/0.77 % Rec. Clause-clause subsumption calls : 9855
% 1.21/0.77 % Non-unit clause-clause subsumptions : 236
% 1.21/0.77 % Unit Clause-clause subsumption calls : 1063
% 1.21/0.77 % Rewrite failures with RHS unbound : 0
% 1.21/0.77 % BW rewrite match attempts : 17
% 1.21/0.77 % BW rewrite match successes : 17
% 1.21/0.77 % Condensation attempts : 0
% 1.21/0.77 % Condensation successes : 0
% 1.21/0.77 % Termbank termtop insertions : 61550
% 1.21/0.77 % Search garbage collected termcells : 545
% 1.21/0.77
% 1.21/0.77 % -------------------------------------------------
% 1.21/0.77 % User time : 0.170 s
% 1.21/0.77 % System time : 0.014 s
% 1.21/0.77 % Total time : 0.184 s
% 1.21/0.77 % Maximum resident set size: 4076 pages
% 1.21/0.77
% 1.21/0.77 % -------------------------------------------------
% 1.21/0.77 % User time : 0.579 s
% 1.21/0.77 % System time : 0.061 s
% 1.21/0.77 % Total time : 0.640 s
% 1.21/0.77 % Maximum resident set size: 5120 pages
% 1.21/0.77 % E exiting
%------------------------------------------------------------------------------