%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : KRS175+1 : TPTP v9.3.1. Released v3.1.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 01:01:06 PM UTC 2026
% Result : Theorem 0.13s 0.51s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 52 ( 9 unt; 0 def)
% Number of atoms : 223 ( 49 equ)
% Maximal formula atoms : 50 ( 4 avg)
% Number of connectives : 282 ( 111 ~; 132 |; 28 &)
% ( 11 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 34 ( 2 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( cowlThing(ib)
& cowlThing(ia)
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ia
| X3 = ib ) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_4,axiom,
! [X3] :
( cB(X3)
<=> X3 = ib ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(axiom_3,axiom,
! [X3] :
( cA_and_B(X3)
<=> ( cB(X3)
| cA(X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(axiom_0,axiom,
! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_2,axiom,
! [X3] :
( cA(X3)
<=> X3 = ia ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(c_0_6,negated_conjecture,
~ ( cowlThing(ib)
& cowlThing(ia)
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ia
| X3 = ib ) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
inference(assume_negation,[status(cth)],[the_axiom]) ).
fof(c_0_7,plain,
! [X9] :
( ( cB(X9)
| X9 != ib )
& ( X9 = ib
| ~ cB(X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_4])])]) ).
fof(c_0_8,plain,
! [X13] :
( ( cA_and_B(X13)
| ~ cB(X13) )
& ( cA_and_B(X13)
| ~ cA(X13) )
& ( cB(X13)
| cA(X13)
| ~ cA_and_B(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])])]) ).
fof(c_0_9,negated_conjecture,
~ ( cowlThing(ib)
& cowlThing(ia)
& ! [X3] :
( cA_and_B(X3)
<=> ( X3 = ia
| X3 = ib ) )
& ! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) )
& ! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ) ),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_11,plain,
! [X3] :
( xsd_string(X3)
<=> ~ xsd_integer(X3) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_12,plain,
! [X10] :
( ( cA(X10)
| X10 != ia )
& ( X10 = ia
| ~ cA(X10) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_13,plain,
( ~ cB(X1)
| X1 = ib ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ cA_and_B(X1)
| cB(X1)
| cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,negated_conjecture,
( ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0) )
& ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia )
& ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib )
& ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0) )
& ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia )
& ( ~ cowlThing(ib)
| ~ cowlThing(ia)
| cowlNothing(esk1_0)
| ~ cowlThing(esk1_0)
| xsd_integer(esk2_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
fof(c_0_16,plain,
! [X21] :
( ~ cowlNothing(X21)
& cowlThing(X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_10])]) ).
fof(c_0_17,plain,
! [X16] :
( ( xsd_string(X16)
| xsd_integer(X16) )
& ( ~ xsd_integer(X16)
| ~ xsd_string(X16) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_18,plain,
( ~ cA(X1)
| X1 = ia ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ cA_and_B(X1)
| cA(X1)
| X1 = ib ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( X1 != ib
| cB(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| xsd_string(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( xsd_string(X1)
| xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ cA_and_B(X1)
| X1 = ia
| X1 = ib ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| cowlNothing(esk1_0)
| xsd_integer(esk2_0)
| esk3_0 = ia
| esk3_0 = ib
| cA_and_B(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ib
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,plain,
( ~ cB(X1)
| cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_30,plain,
cB(ib),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( ~ xsd_integer(X1)
| ~ xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_32,negated_conjecture,
( xsd_string(esk2_0)
| ia = esk3_0
| ib = esk3_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( xsd_integer(esk2_0)
| ia = esk3_0
| ib = esk3_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]),c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia
| cowlNothing(esk1_0)
| xsd_string(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( ~ cowlThing(ib)
| ~ cowlThing(ia)
| ~ cowlThing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cA_and_B(esk3_0)
| esk3_0 != ia
| cowlNothing(esk1_0)
| xsd_integer(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_36,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ib != esk3_0
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_37,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ib != esk3_0
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_38,plain,
cA_and_B(ib),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_39,negated_conjecture,
( ib = esk3_0
| ia = esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_40,plain,
( X1 != ia
| cA(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_41,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ia != esk3_0
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_42,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ia != esk3_0
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_22]),c_0_22]),c_0_22])]),c_0_23]),c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ib != esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_36]),c_0_37]) ).
cnf(c_0_44,negated_conjecture,
( cA_and_B(esk3_0)
| ia = esk3_0 ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
( ~ cA(X1)
| cA_and_B(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_46,plain,
cA(ia),
inference(er,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( ~ cA_and_B(esk3_0)
| ia != esk3_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_41]),c_0_42]) ).
cnf(c_0_48,negated_conjecture,
ia = esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_39]) ).
cnf(c_0_49,plain,
cA_and_B(ia),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
~ cA_and_B(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_51,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_48]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : KRS175+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n017.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 22:50:41 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/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.13/0.51 % Version: 3.5.1
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % Starting sh5l with 300s (1) cores
% 0.13/0.51 % new_bool_1 with pid 812058 completed with status 0
% 0.13/0.51 % Result found by new_bool_1
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.51 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.13/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.51 % SubtermCWHack with pid 812067 completed with status 0
% 0.13/0.51 % Result found by SubtermCWHack
% 0.13/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.51 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.13/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.51 % Preprocessing time : 0.002 s
% 0.13/0.51
% 0.13/0.51 % Proof found!
% 0.13/0.51 % SZS status Theorem
% 0.13/0.51 % SZS output start CNFRefutation
% See solution above
% 0.13/0.51 % Parsed axioms : 15
% 0.13/0.51 % Removed by relevancy pruning/SinE : 0
% 0.13/0.51 % Initial clauses : 26
% 0.13/0.51 % Removed in clause preprocessing : 7
% 0.13/0.51 % Initial clauses in saturation : 19
% 0.13/0.51 % Processed clauses : 36
% 0.13/0.51 % ...of these trivial : 0
% 0.13/0.51 % ...subsumed : 3
% 0.13/0.51 % ...remaining for further processing : 32
% 0.13/0.51 % Other redundant clauses eliminated : 2
% 0.13/0.51 % Clauses deleted for lack of memory : 0
% 0.13/0.51 % Backward-subsumed : 7
% 0.13/0.51 % Backward-rewritten : 10
% 0.13/0.51 % Generated clauses : 19
% 0.13/0.51 % ...of the previous two non-redundant : 20
% 0.13/0.51 % ...aggressively subsumed : 0
% 0.13/0.51 % Contextual simplify-reflections : 12
% 0.13/0.51 % Paramodulations : 17
% 0.13/0.51 % Factorizations : 0
% 0.13/0.51 % NegExts : 0
% 0.13/0.51 % Equation resolutions : 2
% 0.13/0.51 % Disequality decompositions : 0
% 0.13/0.51 % Total rewrite steps : 28
% 0.13/0.51 % ...of those cached : 24
% 0.13/0.51 % Propositional unsat checks : 0
% 0.13/0.51 % Propositional check models : 0
% 0.13/0.51 % Propositional check unsatisfiable : 0
% 0.13/0.51 % Propositional clauses : 0
% 0.13/0.51 % Propositional clauses after purity: 0
% 0.13/0.51 % Propositional unsat core size : 0
% 0.13/0.51 % Propositional preprocessing time : 0.000
% 0.13/0.51 % Propositional encoding time : 0.000
% 0.13/0.51 % Propositional solver time : 0.000
% 0.13/0.51 % Success case prop preproc time : 0.000
% 0.13/0.51 % Success case prop encoding time : 0.000
% 0.13/0.51 % Success case prop solver time : 0.000
% 0.13/0.51 % Current number of processed clauses : 13
% 0.13/0.51 % Positive orientable unit clauses : 4
% 0.13/0.51 % Positive unorientable unit clauses: 0
% 0.13/0.51 % Negative unit clauses : 2
% 0.13/0.51 % Non-unit-clauses : 7
% 0.13/0.51 % Current number of unprocessed clauses: 3
% 0.13/0.51 % ...number of literals in the above : 6
% 0.13/0.51 % Current number of archived formulas : 0
% 0.13/0.51 % Current number of archived clauses : 17
% 0.13/0.51 % Clause-clause subsumption calls (NU) : 175
% 0.13/0.51 % Rec. Clause-clause subsumption calls : 142
% 0.13/0.51 % Non-unit clause-clause subsumptions : 21
% 0.13/0.51 % Unit Clause-clause subsumption calls : 11
% 0.13/0.51 % Rewrite failures with RHS unbound : 0
% 0.13/0.51 % BW rewrite match attempts : 3
% 0.13/0.51 % BW rewrite match successes : 3
% 0.13/0.51 % Condensation attempts : 0
% 0.13/0.51 % Condensation successes : 0
% 0.13/0.51 % Termbank termtop insertions : 1807
% 0.13/0.51 % Search garbage collected termcells : 388
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.013 s
% 0.13/0.51 % System time : 0.002 s
% 0.13/0.51 % Total time : 0.014 s
% 0.13/0.51 % Maximum resident set size: 3640 pages
% 0.13/0.51
% 0.13/0.51 % -------------------------------------------------
% 0.13/0.51 % User time : 0.015 s
% 0.13/0.51 % System time : 0.008 s
% 0.13/0.51 % Total time : 0.024 s
% 0.13/0.51 % Maximum resident set size: 4608 pages
% 0.13/0.51 % E exiting
%------------------------------------------------------------------------------