%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC315-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 : n008.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:54 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.46s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of clauses : 83 ( 15 unt; 25 nHn; 83 RR)
% Number of literals : 169 ( 96 equ; 64 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_18,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk7,nil),sk8) = sk4 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).
cnf(clause100,axiom,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
cnf(co1_17,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_16,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_4,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
cnf(clause8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(co1_11,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_10,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_8,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_19,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk8,cons(sk7,nil)) = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_19) ).
cnf(clause96,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause96) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
cnf(clause97,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause97) ).
cnf(co1_12,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
cnf(co1_7,negated_conjecture,
( nil != sk4
| nil = sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_14,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_9,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_13,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
cnf(clause98,axiom,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause98) ).
cnf(c_0_21,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk7,nil),sk8) = sk4 ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_22,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
inference(fof_simplification,[status(thm)],[clause100]) ).
cnf(c_0_23,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk7) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_25,negated_conjecture,
( ~ neq(sk4,nil)
| app(cons(sk7,nil),sk8) = sk4 ),
c_0_21 ).
cnf(c_0_26,plain,
( ~ ssList(X2)
| ~ ssList(X1)
| X2 = X1
| neq(X2,X1) ),
c_0_22 ).
cnf(c_0_27,negated_conjecture,
ssList(sk4),
co1_4 ).
cnf(c_0_28,axiom,
ssList(nil),
clause8 ).
cnf(c_0_29,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
inference(fof_simplification,[status(thm)],[clause120]) ).
cnf(c_0_30,negated_conjecture,
( ~ neq(sk4,nil)
| ssList(sk8) ),
c_0_23 ).
cnf(c_0_31,negated_conjecture,
( ~ neq(sk4,nil)
| ssItem(sk7) ),
c_0_24 ).
cnf(c_0_32,negated_conjecture,
( nil = sk2
| app(cons(sk5,nil),sk6) = sk2 ),
co1_11 ).
cnf(c_0_33,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_34,negated_conjecture,
( nil = sk2
| ssList(sk6) ),
co1_10 ).
cnf(c_0_35,negated_conjecture,
( nil = sk2
| ssItem(sk5) ),
co1_8 ).
cnf(c_0_36,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk8,cons(sk7,nil)) = sk3 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_37,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
inference(fof_simplification,[status(thm)],[clause96]) ).
cnf(c_0_38,negated_conjecture,
( sk4 = nil
| app(cons(sk7,nil),sk8) = sk4 ),
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_39,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| app(cons(X1,nil),X2) = cons(X1,X2) ),
c_0_29 ).
cnf(c_0_40,negated_conjecture,
( ssList(sk8)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_41,negated_conjecture,
( ssItem(sk7)
| sk4 = nil ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_42,negated_conjecture,
( sk4 = nil
| app(cons(sk5,nil),sk6) = sk4 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33]),c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( ssList(sk6)
| sk4 = nil ),
inference(rw,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( ssItem(sk5)
| sk4 = nil ),
inference(rw,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_45,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk8,cons(sk7,nil)) = sk3 ),
c_0_36 ).
cnf(c_0_46,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_47,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| tl(cons(X1,X2)) = X2 ),
c_0_37 ).
cnf(c_0_48,negated_conjecture,
( sk4 = nil
| cons(sk7,sk8) = sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40]),c_0_41]) ).
cnf(c_0_49,negated_conjecture,
( sk4 = nil
| cons(sk5,sk6) = sk4 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
inference(fof_simplification,[status(thm)],[clause97]) ).
cnf(c_0_51,negated_conjecture,
( ~ neq(sk4,nil)
| app(sk8,cons(sk7,nil)) = sk1 ),
inference(rw,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_52,negated_conjecture,
( sk4 = nil
| tl(sk4) = sk8 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_40]),c_0_41]) ).
cnf(c_0_53,negated_conjecture,
( sk4 = nil
| tl(sk4) = sk6 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_43]),c_0_44]) ).
cnf(c_0_54,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| hd(cons(X1,X2)) = X1 ),
c_0_50 ).
cnf(c_0_55,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_56,negated_conjecture,
( nil != sk4
| nil = sk3 ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_57,negated_conjecture,
( sk4 = nil
| app(sk8,cons(sk7,nil)) = sk1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_58,negated_conjecture,
( sk8 = sk6
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( sk4 = nil
| hd(sk4) = sk7 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_48]),c_0_40]),c_0_41]) ).
cnf(c_0_60,negated_conjecture,
( sk4 = nil
| hd(sk4) = sk5 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_49]),c_0_43]),c_0_44]) ).
cnf(c_0_61,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| nil = sk2 ),
c_0_55 ).
cnf(c_0_62,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
inference(fof_simplification,[status(thm)],[co1_14]) ).
cnf(c_0_63,negated_conjecture,
( nil != sk4
| nil = sk3 ),
c_0_56 ).
cnf(c_0_64,negated_conjecture,
( sk4 = nil
| app(sk6,cons(sk7,nil)) = sk1 ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,negated_conjecture,
( sk7 = sk5
| sk4 = nil ),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,negated_conjecture,
( app(sk6,cons(sk5,nil)) != sk1
| sk4 = nil ),
inference(rw,[status(thm)],[c_0_61,c_0_33]) ).
cnf(c_0_67,negated_conjecture,
( nil != sk1
| app(cons(sk5,nil),sk6) = sk2 ),
c_0_62 ).
cnf(c_0_68,negated_conjecture,
( sk4 != nil
| sk1 = nil ),
inference(rw,[status(thm)],[c_0_63,c_0_46]) ).
cnf(c_0_69,negated_conjecture,
sk4 = nil,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66]) ).
cnf(c_0_70,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_71,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
inference(fof_simplification,[status(thm)],[co1_13]) ).
cnf(c_0_72,negated_conjecture,
( sk1 != nil
| app(cons(sk5,nil),sk6) = sk4 ),
inference(rw,[status(thm)],[c_0_67,c_0_33]) ).
cnf(c_0_73,negated_conjecture,
sk1 = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_69])]) ).
cnf(c_0_74,negated_conjecture,
( nil != sk1
| ssItem(sk5) ),
c_0_70 ).
cnf(c_0_75,negated_conjecture,
( nil != sk1
| ssList(sk6) ),
c_0_71 ).
cnf(c_0_76,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
inference(fof_simplification,[status(thm)],[clause98]) ).
cnf(c_0_77,negated_conjecture,
app(cons(sk5,nil),sk6) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_72,c_0_69]),c_0_73])]) ).
cnf(c_0_78,negated_conjecture,
ssItem(sk5),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_74,c_0_73])]) ).
cnf(c_0_79,negated_conjecture,
ssList(sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_75,c_0_73])]) ).
cnf(c_0_80,plain,
( ~ ssList(X2)
| ~ ssItem(X1)
| cons(X1,X2) != nil ),
c_0_76 ).
cnf(c_0_81,negated_conjecture,
cons(sk5,sk6) = nil,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_77]),c_0_78]),c_0_79])]) ).
cnf(c_0_82,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_78]),c_0_79])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC315-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.09/0.37 % Computer : n008.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 08:15:39 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.14/0.46 % Version: 3.5.1
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % sh5l with pid 557384 completed with status 0
% 0.14/0.46 % Result found by sh5l
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.46 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.14/0.46 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.46 % SubtermCWHack with pid 557387 completed with status 0
% 0.14/0.46 % Result found by SubtermCWHack
% 0.14/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.46 % Starting sh5l with 300s (1) cores
% 0.14/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.46 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.46 % Search class: FGHSM-FSMM21-MFFFFFNN
% 0.14/0.46 % partial match(1): FGHSM-FSLM21-MFFFFFNN
% 0.14/0.46 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.46 % Preprocessing time : 0.003 s
% 0.14/0.46
% 0.14/0.46 % Proof found!
% 0.14/0.46 % SZS status Unsatisfiable
% 0.14/0.46 % SZS output start CNFRefutation
% See solution above
% 0.14/0.46 % Parsed axioms : 204
% 0.14/0.46 % Removed by relevancy pruning/SinE : 65
% 0.14/0.46 % Initial clauses : 139
% 0.14/0.46 % Removed in clause preprocessing : 0
% 0.14/0.46 % Initial clauses in saturation : 139
% 0.14/0.46 % Processed clauses : 184
% 0.14/0.46 % ...of these trivial : 0
% 0.14/0.46 % ...subsumed : 35
% 0.14/0.46 % ...remaining for further processing : 149
% 0.14/0.46 % Other redundant clauses eliminated : 15
% 0.14/0.46 % Clauses deleted for lack of memory : 0
% 0.14/0.46 % Backward-subsumed : 0
% 0.14/0.46 % Backward-rewritten : 43
% 0.14/0.46 % Generated clauses : 233
% 0.14/0.46 % ...of the previous two non-redundant : 184
% 0.14/0.46 % ...aggressively subsumed : 0
% 0.14/0.46 % Contextual simplify-reflections : 17
% 0.14/0.46 % Paramodulations : 216
% 0.14/0.46 % Factorizations : 0
% 0.14/0.46 % NegExts : 0
% 0.14/0.46 % Equation resolutions : 18
% 0.14/0.46 % Disequality decompositions : 0
% 0.14/0.46 % Total rewrite steps : 165
% 0.14/0.46 % ...of those cached : 150
% 0.14/0.46 % Propositional unsat checks : 0
% 0.14/0.46 % Propositional check models : 0
% 0.14/0.46 % Propositional check unsatisfiable : 0
% 0.14/0.46 % Propositional clauses : 0
% 0.14/0.46 % Propositional clauses after purity: 0
% 0.14/0.46 % Propositional unsat core size : 0
% 0.14/0.46 % Propositional preprocessing time : 0.000
% 0.14/0.46 % Propositional encoding time : 0.000
% 0.14/0.46 % Propositional solver time : 0.000
% 0.14/0.46 % Success case prop preproc time : 0.000
% 0.14/0.46 % Success case prop encoding time : 0.000
% 0.14/0.46 % Success case prop solver time : 0.000
% 0.14/0.46 % Current number of processed clauses : 98
% 0.14/0.46 % Positive orientable unit clauses : 38
% 0.14/0.46 % Positive unorientable unit clauses: 0
% 0.14/0.46 % Negative unit clauses : 1
% 0.14/0.46 % Non-unit-clauses : 59
% 0.14/0.46 % Current number of unprocessed clauses: 136
% 0.14/0.46 % ...number of literals in the above : 695
% 0.14/0.46 % Current number of archived formulas : 0
% 0.14/0.46 % Current number of archived clauses : 43
% 0.14/0.46 % Clause-clause subsumption calls (NU) : 1184
% 0.14/0.46 % Rec. Clause-clause subsumption calls : 700
% 0.14/0.46 % Non-unit clause-clause subsumptions : 52
% 0.14/0.46 % Unit Clause-clause subsumption calls : 83
% 0.14/0.46 % Rewrite failures with RHS unbound : 0
% 0.14/0.46 % BW rewrite match attempts : 4
% 0.14/0.46 % BW rewrite match successes : 4
% 0.14/0.46 % Condensation attempts : 0
% 0.14/0.46 % Condensation successes : 0
% 0.14/0.46 % Termbank termtop insertions : 9212
% 0.14/0.46 % Search garbage collected termcells : 694
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.012 s
% 0.14/0.46 % System time : 0.005 s
% 0.14/0.46 % Total time : 0.017 s
% 0.14/0.46 % Maximum resident set size: 4072 pages
% 0.14/0.46
% 0.14/0.46 % -------------------------------------------------
% 0.14/0.46 % User time : 0.016 s
% 0.14/0.46 % System time : 0.011 s
% 0.14/0.46 % Total time : 0.026 s
% 0.14/0.46 % Maximum resident set size: 5120 pages
% 0.14/0.46 % E exiting
%------------------------------------------------------------------------------