%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU220+3 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:28:35 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 245 ( 69 equ)
% Maximal formula atoms : 130 ( 9 avg)
% Number of connectives : 376 ( 158 ~; 163 |; 39 &)
% ( 1 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 31 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t57_funct_1,conjecture,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( ( in(X1,relation_rng(X2))
& one_to_one(X2) )
=> ( X1 = apply(relation_composition(function_inverse(X2),X2),X1)
& X1 = apply(X2,apply(function_inverse(X2),X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t57_funct_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_funct_1) ).
fof(t54_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( X2 = function_inverse(X1)
<=> ( ! [X3,X4] :
( ( ( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) )
=> ( X4 = apply(X2,X3)
& in(X3,relation_rng(X1)) ) )
& ( ( X4 = apply(X2,X3)
& in(X3,relation_rng(X1)) )
=> ( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) )
& relation_dom(X2) = relation_rng(X1) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_funct_1) ).
fof(dt_k2_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( function(function_inverse(X1))
& relation(function_inverse(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_funct_1) ).
fof(t55_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ( one_to_one(X1)
=> ( relation_dom(X1) = relation_rng(function_inverse(X1))
& relation_rng(X1) = relation_dom(function_inverse(X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t55_funct_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( ( in(X1,relation_rng(X2))
& one_to_one(X2) )
=> ( X1 = apply(relation_composition(function_inverse(X2),X2),X1)
& X1 = apply(X2,apply(function_inverse(X2),X1)) ) ) ),
inference(assume_negation,[status(cth)],[t57_funct_1]) ).
fof(c_0_6,negated_conjecture,
( ( esk16_0 != apply(relation_composition(function_inverse(esk17_0),esk17_0),esk16_0)
| esk16_0 != apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) )
& in(esk16_0,relation_rng(esk17_0))
& one_to_one(esk17_0)
& function(esk17_0)
& relation(esk17_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X41,X42,X43] :
( apply(relation_composition(X42,X43),X41) = apply(X43,apply(X42,X41))
| ~ in(X41,relation_dom(X42))
| ~ function(X43)
| ~ relation(X43)
| ~ function(X42)
| ~ relation(X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])])]) ).
fof(c_0_8,plain,
! [X51,X52,X53,X54,X55,X56] :
( ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk12_2(X51,X52) != apply(X51,esk13_2(X51,X52))
| ~ in(esk13_2(X51,X52),relation_dom(X51))
| esk15_2(X51,X52) != apply(X52,esk14_2(X51,X52))
| ~ in(esk14_2(X51,X52),relation_rng(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk12_2(X51,X52) != apply(X51,esk13_2(X51,X52))
| ~ in(esk13_2(X51,X52),relation_dom(X51))
| esk14_2(X51,X52) = apply(X51,esk15_2(X51,X52)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk12_2(X51,X52) != apply(X51,esk13_2(X51,X52))
| ~ in(esk13_2(X51,X52),relation_dom(X51))
| in(esk15_2(X51,X52),relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk13_2(X51,X52) = apply(X52,esk12_2(X51,X52))
| esk15_2(X51,X52) != apply(X52,esk14_2(X51,X52))
| ~ in(esk14_2(X51,X52),relation_rng(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk13_2(X51,X52) = apply(X52,esk12_2(X51,X52))
| esk14_2(X51,X52) = apply(X51,esk15_2(X51,X52)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| esk13_2(X51,X52) = apply(X52,esk12_2(X51,X52))
| in(esk15_2(X51,X52),relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| in(esk12_2(X51,X52),relation_rng(X51))
| esk15_2(X51,X52) != apply(X52,esk14_2(X51,X52))
| ~ in(esk14_2(X51,X52),relation_rng(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| in(esk12_2(X51,X52),relation_rng(X51))
| esk14_2(X51,X52) = apply(X51,esk15_2(X51,X52)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 = function_inverse(X51)
| relation_dom(X52) != relation_rng(X51)
| in(esk12_2(X51,X52),relation_rng(X51))
| in(esk15_2(X51,X52),relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 != function_inverse(X51)
| X55 != apply(X51,X56)
| ~ in(X56,relation_dom(X51))
| X56 = apply(X52,X55) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 != function_inverse(X51)
| X55 != apply(X51,X56)
| ~ in(X56,relation_dom(X51))
| in(X55,relation_rng(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 != function_inverse(X51)
| X54 != apply(X52,X53)
| ~ in(X53,relation_rng(X51))
| X53 = apply(X51,X54) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 != function_inverse(X51)
| X54 != apply(X52,X53)
| ~ in(X53,relation_rng(X51))
| in(X54,relation_dom(X51)) )
& ( ~ function(X51)
| ~ relation(X51)
| ~ one_to_one(X51)
| ~ function(X52)
| ~ relation(X52)
| X52 != function_inverse(X51)
| relation_dom(X52) = relation_rng(X51) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_funct_1])])])])])])]) ).
fof(c_0_9,plain,
! [X10] :
( ( ~ function(X10)
| ~ relation(X10)
| function(function_inverse(X10)) )
& ( ~ function(X10)
| ~ relation(X10)
| relation(function_inverse(X10)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_funct_1])])])]) ).
cnf(c_0_10,negated_conjecture,
( esk16_0 != apply(relation_composition(function_inverse(esk17_0),esk17_0),esk16_0)
| esk16_0 != apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ in(X3,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
relation(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
function(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( ~ function(X2)
| ~ relation(X2)
| ~ one_to_one(X2)
| ~ function(X4)
| ~ relation(X4)
| X4 != function_inverse(X2)
| X3 != apply(X4,X1)
| ~ in(X1,relation_rng(X2))
| X1 = apply(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ function(X1)
| ~ relation(X1)
| function(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ function(X1)
| ~ relation(X1)
| relation(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
( ~ in(esk16_0,relation_dom(function_inverse(esk17_0)))
| ~ function(function_inverse(esk17_0))
| ~ relation(function_inverse(esk17_0))
| apply(esk17_0,apply(function_inverse(esk17_0),esk16_0)) != esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_18,plain,
( ~ in(X2,relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| apply(X1,apply(function_inverse(X1),X2)) = X2 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])]),c_0_15]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
one_to_one(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,negated_conjecture,
in(esk16_0,relation_rng(esk17_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_21,plain,
! [X61] :
( ( ~ function(X61)
| ~ relation(X61)
| ~ one_to_one(X61)
| relation_dom(X61) = relation_rng(function_inverse(X61)) )
& ( ~ function(X61)
| ~ relation(X61)
| ~ one_to_one(X61)
| relation_rng(X61) = relation_dom(function_inverse(X61)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t55_funct_1])])])]) ).
cnf(c_0_22,negated_conjecture,
( ~ in(esk16_0,relation_dom(function_inverse(esk17_0)))
| ~ function(function_inverse(esk17_0))
| ~ relation(function_inverse(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_12]),c_0_13]),c_0_20])]) ).
cnf(c_0_23,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ one_to_one(X1)
| relation_rng(X1) = relation_dom(function_inverse(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( ~ function(function_inverse(esk17_0))
| ~ relation(function_inverse(esk17_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_19]),c_0_12]),c_0_13])]) ).
cnf(c_0_25,negated_conjecture,
~ relation(function_inverse(esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_12]),c_0_13])]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU220+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n018.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 06:01:28 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1125875 completed with status 0
% 0.14/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.47 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.47 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % SAT001_MinMin_p005000_rr_RG with pid 1125883 completed with status 0
% 0.14/0.47 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGHSM-FFMM21-MFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.47 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.002 s
% 0.14/0.47 % Presaturation interreduction done
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 41
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 81
% 0.14/0.47 % Removed in clause preprocessing : 2
% 0.14/0.47 % Initial clauses in saturation : 79
% 0.14/0.47 % Processed clauses : 241
% 0.14/0.47 % ...of these trivial : 3
% 0.14/0.47 % ...subsumed : 44
% 0.14/0.47 % ...remaining for further processing : 194
% 0.14/0.47 % Other redundant clauses eliminated : 9
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 3
% 0.14/0.47 % Backward-rewritten : 10
% 0.14/0.47 % Generated clauses : 183
% 0.14/0.47 % ...of the previous two non-redundant : 142
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 10
% 0.14/0.47 % Paramodulations : 178
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 9
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 68
% 0.14/0.47 % ...of those cached : 50
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 102
% 0.14/0.47 % Positive orientable unit clauses : 26
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 9
% 0.14/0.47 % Non-unit-clauses : 67
% 0.14/0.47 % Current number of unprocessed clauses: 52
% 0.14/0.47 % ...number of literals in the above : 273
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 87
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 1996
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 957
% 0.14/0.47 % Non-unit clause-clause subsumptions : 40
% 0.14/0.47 % Unit Clause-clause subsumption calls : 126
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 4
% 0.14/0.47 % BW rewrite match successes : 4
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 7583
% 0.14/0.47 % Search garbage collected termcells : 972
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.019 s
% 0.14/0.47 % System time : 0.003 s
% 0.14/0.47 % Total time : 0.022 s
% 0.14/0.47 % Maximum resident set size: 3668 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.071 s
% 0.14/0.47 % System time : 0.016 s
% 0.14/0.47 % Total time : 0.087 s
% 0.14/0.47 % Maximum resident set size: 4864 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------