TSTP Solution File: KRS170+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : KRS170+1 : TPTP v8.2.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:16:40 EDT 2024
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 6 unt; 0 def)
% Number of atoms : 198 ( 0 equ)
% Maximal formula atoms : 48 ( 4 avg)
% Number of connectives : 239 ( 89 ~; 121 |; 20 &)
% ( 5 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 30 ( 2 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1,X2] :
( rhasLeader(X1,X2)
=> rhasHead(X1,X2) )
& ! [X1,X2] :
( rhasHead(X1,X2)
=> rhasLeader(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',the_axiom) ).
fof(axiom_0,axiom,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(axiom_1,axiom,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1) ).
fof(axiom_2,axiom,
! [X1,X2] :
( rhasLeader(X1,X2)
<=> rhasHead(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) )
& ! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) )
& ! [X1,X2] :
( rhasLeader(X1,X2)
=> rhasHead(X1,X2) )
& ! [X1,X2] :
( rhasHead(X1,X2)
=> rhasLeader(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[the_axiom])]) ).
fof(c_0_5,plain,
! [X1] :
( cowlThing(X1)
& ~ cowlNothing(X1) ),
inference(fof_simplification,[status(thm)],[axiom_0]) ).
fof(c_0_6,negated_conjecture,
( ( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ rhasLeader(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rhasHead(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ rhasLeader(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ rhasLeader(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( rhasHead(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) )
& ( ~ rhasLeader(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0)
| cowlNothing(esk1_0) ) ),
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_4])])])])]) ).
fof(c_0_7,plain,
! [X12] :
( cowlThing(X12)
& ~ cowlNothing(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X1] :
( xsd_string(X1)
<=> ~ xsd_integer(X1) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
cnf(c_0_9,negated_conjecture,
( xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
cowlThing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
~ cowlNothing(X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X11] :
( ( ~ xsd_string(X11)
| ~ xsd_integer(X11) )
& ( xsd_integer(X11)
| xsd_string(X11) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,negated_conjecture,
( xsd_integer(esk2_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ xsd_string(esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10])]),c_0_11]) ).
cnf(c_0_14,plain,
( xsd_integer(X1)
| xsd_string(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X9,X10] :
( ( ~ rhasLeader(X9,X10)
| rhasHead(X9,X10) )
& ( ~ rhasHead(X9,X10)
| rhasLeader(X9,X10) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])]) ).
cnf(c_0_16,negated_conjecture,
( rhasLeader(esk3_0,esk4_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
( xsd_integer(esk2_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ rhasLeader(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
( rhasHead(X1,X2)
| ~ rhasLeader(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( rhasLeader(esk3_0,esk4_0)
| xsd_integer(esk2_0)
| ~ rhasLeader(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10])]),c_0_11]),c_0_14]) ).
cnf(c_0_21,plain,
( rhasLeader(X1,X2)
| ~ rhasHead(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| xsd_integer(esk2_0)
| ~ rhasHead(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_10])]),c_0_11]),c_0_14]) ).
cnf(c_0_23,negated_conjecture,
( xsd_integer(esk2_0)
| ~ rhasLeader(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_integer(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_string(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
( xsd_integer(esk2_0)
| ~ rhasHead(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_10])]),c_0_11]),c_0_14]) ).
cnf(c_0_27,negated_conjecture,
( xsd_integer(esk2_0)
| ~ rhasLeader(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| xsd_integer(esk2_0) ),
inference(csr,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
( xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_30,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,plain,
( ~ xsd_string(X1)
| ~ xsd_integer(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
xsd_integer(esk2_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_23]) ).
cnf(c_0_33,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
( rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0)
| cowlNothing(esk1_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ xsd_integer(esk2_0)
| ~ cowlThing(esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( xsd_string(esk2_0)
| ~ rhasHead(esk3_0,esk4_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_10])]),c_0_11]) ).
cnf(c_0_36,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_10])]),c_0_11]),c_0_14]) ).
cnf(c_0_37,negated_conjecture,
~ xsd_string(esk2_0),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| xsd_string(esk2_0)
| ~ rhasHead(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_10])]),c_0_11]),c_0_14]) ).
cnf(c_0_39,negated_conjecture,
( rhasLeader(esk3_0,esk4_0)
| xsd_string(esk2_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ xsd_integer(esk2_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_10])]),c_0_11]) ).
cnf(c_0_40,negated_conjecture,
( xsd_string(esk2_0)
| ~ rhasLeader(esk5_0,esk6_0)
| ~ rhasLeader(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_19]),c_0_14]) ).
cnf(c_0_41,negated_conjecture,
( rhasHead(esk5_0,esk6_0)
| rhasLeader(esk3_0,esk4_0) ),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,negated_conjecture,
( rhasLeader(esk5_0,esk6_0)
| xsd_string(esk2_0)
| ~ rhasHead(esk3_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( xsd_string(esk2_0)
| ~ rhasLeader(esk5_0,esk6_0) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_39,c_0_14]),c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( rhasLeader(esk3_0,esk4_0)
| rhasLeader(esk5_0,esk6_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
( xsd_string(esk2_0)
| ~ rhasLeader(esk3_0,esk4_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_19]),c_0_43]) ).
cnf(c_0_46,negated_conjecture,
rhasLeader(esk3_0,esk4_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS170+1 : TPTP v8.2.0. Released v3.1.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 22:21:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.21/0.50 # Version: 3.1.0
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # new_bool_3 with pid 6326 completed with status 0
% 0.21/0.50 # Result found by new_bool_3
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 6329 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50 # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 4
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 14
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 14
% 0.21/0.50 # Processed clauses : 39
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 39
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 5
% 0.21/0.50 # Backward-rewritten : 7
% 0.21/0.50 # Generated clauses : 14
% 0.21/0.50 # ...of the previous two non-redundant : 12
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 14
% 0.21/0.50 # Paramodulations : 13
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Disequality decompositions : 0
% 0.21/0.50 # Total rewrite steps : 15
% 0.21/0.50 # ...of those cached : 12
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 12
% 0.21/0.50 # Positive orientable unit clauses : 3
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 2
% 0.21/0.50 # Non-unit-clauses : 7
% 0.21/0.50 # Current number of unprocessed clauses: 0
% 0.21/0.50 # ...number of literals in the above : 0
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 27
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 77
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 71
% 0.21/0.50 # Non-unit clause-clause subsumptions : 19
% 0.21/0.50 # Unit Clause-clause subsumption calls : 6
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 2
% 0.21/0.50 # BW rewrite match successes : 2
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 1002
% 0.21/0.50 # Search garbage collected termcells : 184
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.007 s
% 0.21/0.50 # Maximum resident set size: 1748 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.004 s
% 0.21/0.50 # System time : 0.007 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1684 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E exiting
%------------------------------------------------------------------------------