%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO230+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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 12:29:49 PM UTC 2026
% Result : Theorem 0.11s 0.55s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 10
% Syntax : Number of formulae : 56 ( 21 unt; 0 def)
% Number of atoms : 133 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 124 ( 47 ~; 62 |; 8 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 10 sgn 50 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(con,conjecture,
! [X1,X4] :
( distinct_points(X1,X4)
=> ( ~ unequally_directed_lines(line_connecting(X4,X1),line_connecting(X1,X4))
& ~ distinct_lines(line_connecting(X1,X4),line_connecting(X4,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
fof(oaguc1,axiom,
! [X1,X4,X2,X3] :
( ( distinct_lines(X2,X3)
& distinct_points(X1,X4) )
=> ( left_apart_point(X4,reverse_line(X3))
| left_apart_point(X1,reverse_line(X3))
| left_apart_point(X4,reverse_line(X2))
| left_apart_point(X1,reverse_line(X2))
| left_apart_point(X4,X3)
| left_apart_point(X1,X3)
| left_apart_point(X4,X2)
| left_apart_point(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oaguc1) ).
fof(oag10,axiom,
! [X1,X2] :
~ ( left_apart_point(X1,reverse_line(X2))
| left_apart_point(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag10) ).
fof(oag1,axiom,
! [X1] : ~ distinct_points(X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag1) ).
fof(oag2,axiom,
! [X1,X4,X5] :
( distinct_points(X1,X4)
=> ( distinct_points(X4,X5)
| distinct_points(X1,X5) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag2) ).
fof(oagco9,axiom,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oagco9) ).
fof(oag6,axiom,
! [X2,X3,X6] :
( unequally_directed_lines(X2,X3)
=> ( unequally_directed_lines(X3,X6)
| unequally_directed_lines(X2,X6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag6) ).
fof(oag9,axiom,
! [X2,X3] :
( ( unequally_directed_lines(X2,reverse_line(X3))
& unequally_directed_lines(X2,X3) )
=> ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag9) ).
fof(oag11,axiom,
! [X2,X3] :
~ ( left_convergent_lines(X2,reverse_line(X3))
| left_convergent_lines(X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag11) ).
fof(oag5,axiom,
! [X2] : ~ unequally_directed_lines(X2,X2),
file('/export/starexec/sandbox/benchmark/Axioms/GEO007+0.ax',oag5) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X4] :
( distinct_points(X1,X4)
=> ( ~ unequally_directed_lines(line_connecting(X4,X1),line_connecting(X1,X4))
& ~ distinct_lines(line_connecting(X1,X4),line_connecting(X4,X1)) ) ),
inference(assume_negation,[status(cth)],[con]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1,X4] :
( distinct_points(X1,X4)
=> ( ~ unequally_directed_lines(line_connecting(X4,X1),line_connecting(X1,X4))
& ~ distinct_lines(line_connecting(X1,X4),line_connecting(X4,X1)) ) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X28,X29,X30,X31] :
( left_apart_point(X29,reverse_line(X31))
| left_apart_point(X28,reverse_line(X31))
| left_apart_point(X29,reverse_line(X30))
| left_apart_point(X28,reverse_line(X30))
| left_apart_point(X29,X31)
| left_apart_point(X28,X31)
| left_apart_point(X29,X30)
| left_apart_point(X28,X30)
| ~ distinct_lines(X30,X31)
| ~ distinct_points(X28,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oaguc1])])]) ).
fof(c_0_13,plain,
! [X53,X54] :
( ~ left_apart_point(X53,reverse_line(X54))
& ~ left_apart_point(X53,X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag10])])]) ).
fof(c_0_14,plain,
! [X1] : ~ distinct_points(X1,X1),
inference(fof_simplification,[status(thm)],[oag1]) ).
fof(c_0_15,plain,
! [X36,X37,X38] :
( distinct_points(X37,X38)
| distinct_points(X36,X38)
| ~ distinct_points(X36,X37) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag2])])]) ).
fof(c_0_16,negated_conjecture,
( ( unequally_directed_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0))
| distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)) )
& distinct_points(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_17,plain,
( ~ distinct_lines(X3,X4)
| ~ distinct_points(X1,X2)
| left_apart_point(X2,reverse_line(X4))
| left_apart_point(X1,reverse_line(X4))
| left_apart_point(X2,reverse_line(X3))
| left_apart_point(X1,reverse_line(X3))
| left_apart_point(X2,X4)
| left_apart_point(X1,X4)
| left_apart_point(X2,X3)
| left_apart_point(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
~ left_apart_point(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X35] : ~ distinct_points(X35,X35),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_20,plain,
( ~ distinct_points(X1,X2)
| distinct_points(X2,X3)
| distinct_points(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
distinct_points(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( ~ distinct_points(X3,X4)
| ~ distinct_lines(X1,X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0))
| distinct_lines(line_connecting(esk1_0,esk2_0),line_connecting(esk2_0,esk1_0)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
~ distinct_points(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( distinct_points(esk1_0,X1)
| distinct_points(esk2_0,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_26,plain,
! [X1,X4] : ~ unequally_directed_lines(line_connecting(X1,X4),reverse_line(line_connecting(X4,X1))),
inference(fof_simplification,[status(thm)],[oagco9]) ).
fof(c_0_27,plain,
! [X10,X11,X12] :
( unequally_directed_lines(X11,X12)
| unequally_directed_lines(X10,X12)
| ~ unequally_directed_lines(X10,X11) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag6])])]) ).
cnf(c_0_28,negated_conjecture,
( ~ distinct_points(X1,X2)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
distinct_points(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_30,plain,
! [X18,X19] : ~ unequally_directed_lines(line_connecting(X18,X19),reverse_line(line_connecting(X19,X18))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
cnf(c_0_31,plain,
( ~ unequally_directed_lines(X1,X2)
| unequally_directed_lines(X2,X3)
| unequally_directed_lines(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
unequally_directed_lines(line_connecting(esk2_0,esk1_0),line_connecting(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
fof(c_0_33,plain,
! [X46,X47] :
( left_convergent_lines(X46,reverse_line(X47))
| left_convergent_lines(X46,X47)
| ~ unequally_directed_lines(X46,reverse_line(X47))
| ~ unequally_directed_lines(X46,X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag9])])]) ).
fof(c_0_34,plain,
! [X48,X49] :
( ~ left_convergent_lines(X48,reverse_line(X49))
& ~ left_convergent_lines(X48,X49) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[oag11])])]) ).
cnf(c_0_35,plain,
~ unequally_directed_lines(line_connecting(X1,X2),reverse_line(line_connecting(X2,X1))),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1)
| unequally_directed_lines(line_connecting(esk1_0,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( ~ unequally_directed_lines(X1,reverse_line(X2))
| ~ unequally_directed_lines(X1,X2)
| left_convergent_lines(X1,reverse_line(X2))
| left_convergent_lines(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,plain,
~ left_convergent_lines(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_39,negated_conjecture,
unequally_directed_lines(line_connecting(esk2_0,esk1_0),reverse_line(line_connecting(esk2_0,esk1_0))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( ~ unequally_directed_lines(X1,X2)
| ~ unequally_directed_lines(X1,reverse_line(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_37,c_0_38]),c_0_38]) ).
cnf(c_0_41,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1)
| unequally_directed_lines(reverse_line(line_connecting(esk2_0,esk1_0)),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(line_connecting(esk2_0,esk1_0)),X1)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_43,negated_conjecture,
( unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_42,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),X2)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_43]) ).
cnf(c_0_45,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X1)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1) ),
inference(ef,[status(thm)],[c_0_44]) ).
cnf(c_0_46,negated_conjecture,
( ~ unequally_directed_lines(reverse_line(reverse_line(X1)),X1)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_45]) ).
cnf(c_0_47,negated_conjecture,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(reverse_line(X1),X2)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_45]) ).
fof(c_0_48,plain,
! [X2] : ~ unequally_directed_lines(X2,X2),
inference(fof_simplification,[status(thm)],[oag5]) ).
cnf(c_0_49,negated_conjecture,
( unequally_directed_lines(reverse_line(X1),X1)
| unequally_directed_lines(line_connecting(esk2_0,esk1_0),reverse_line(X1)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_50,plain,
! [X9] : ~ unequally_directed_lines(X9,X9),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_48])]) ).
cnf(c_0_51,negated_conjecture,
unequally_directed_lines(reverse_line(X1),X1),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_49]),c_0_45]) ).
cnf(c_0_52,plain,
~ unequally_directed_lines(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_53,negated_conjecture,
( unequally_directed_lines(X1,X2)
| unequally_directed_lines(reverse_line(X1),X2) ),
inference(spm,[status(thm)],[c_0_31,c_0_51]) ).
cnf(c_0_54,negated_conjecture,
unequally_directed_lines(X1,reverse_line(X1)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_35,c_0_54]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GEO230+1 : TPTP v9.3.1. Bugfixed v6.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.46 % Computer : n026.cluster.edu
% 0.11/0.46 % Model : x86_64 x86_64
% 0.11/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.46 % Memory : 8046.5625MB
% 0.11/0.46 % OS : Linux 6.8.0-71-generic
% 0.11/0.46 % CPULimit : 300
% 0.11/0.46 % WCLimit : 300
% 0.11/0.46 % DateTime : Sun Sep 20 14:06:23 UTC 2026
% 0.11/0.46 % CPUTime :
% 0.11/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.49 Running first-order theorem proving
% 0.11/0.49 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.11/0.55 % Version: 3.5.1
% 0.11/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.55 % Starting sh5l with 300s (1) cores
% 0.11/0.55 % new_bool_3 with pid 27086 completed with status 0
% 0.11/0.55 % Result found by new_bool_3
% 0.11/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.55 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.11/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.55 % SubtermCWHack with pid 27089 completed with status 0
% 0.11/0.55 % Result found by SubtermCWHack
% 0.11/0.55 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.55 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.55 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.55 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.55 % Search class: FGHNF-FFMF21-SFFFFFNN
% 0.11/0.55 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.55 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.55 % Preprocessing time : 0.001 s
% 0.11/0.55
% 0.11/0.55 % Proof found!
% 0.11/0.55 % SZS status Theorem
% 0.11/0.55 % SZS output start CNFRefutation
% See solution above
% 0.11/0.55 % Parsed axioms : 32
% 0.11/0.55 % Removed by relevancy pruning/SinE : 9
% 0.11/0.55 % Initial clauses : 32
% 0.11/0.55 % Removed in clause preprocessing : 0
% 0.11/0.55 % Initial clauses in saturation : 32
% 0.11/0.55 % Processed clauses : 1108
% 0.11/0.55 % ...of these trivial : 7
% 0.11/0.55 % ...subsumed : 923
% 0.11/0.55 % ...remaining for further processing : 178
% 0.11/0.55 % Other redundant clauses eliminated : 0
% 0.11/0.55 % Clauses deleted for lack of memory : 0
% 0.11/0.55 % Backward-subsumed : 15
% 0.11/0.55 % Backward-rewritten : 12
% 0.11/0.55 % Generated clauses : 2356
% 0.11/0.55 % ...of the previous two non-redundant : 1923
% 0.11/0.55 % ...aggressively subsumed : 0
% 0.11/0.55 % Contextual simplify-reflections : 1
% 0.11/0.55 % Paramodulations : 1296
% 0.11/0.55 % Factorizations : 1060
% 0.11/0.55 % NegExts : 0
% 0.11/0.55 % Equation resolutions : 0
% 0.11/0.55 % Disequality decompositions : 0
% 0.11/0.55 % Total rewrite steps : 468
% 0.11/0.55 % ...of those cached : 440
% 0.11/0.55 % Propositional unsat checks : 0
% 0.11/0.55 % Propositional check models : 0
% 0.11/0.55 % Propositional check unsatisfiable : 0
% 0.11/0.55 % Propositional clauses : 0
% 0.11/0.55 % Propositional clauses after purity: 0
% 0.11/0.55 % Propositional unsat core size : 0
% 0.11/0.55 % Propositional preprocessing time : 0.000
% 0.11/0.55 % Propositional encoding time : 0.000
% 0.11/0.55 % Propositional solver time : 0.000
% 0.11/0.55 % Success case prop preproc time : 0.000
% 0.11/0.55 % Success case prop encoding time : 0.000
% 0.11/0.55 % Success case prop solver time : 0.000
% 0.11/0.55 % Current number of processed clauses : 151
% 0.11/0.55 % Positive orientable unit clauses : 24
% 0.11/0.55 % Positive unorientable unit clauses: 0
% 0.11/0.55 % Negative unit clauses : 16
% 0.11/0.55 % Non-unit-clauses : 111
% 0.11/0.55 % Current number of unprocessed clauses: 784
% 0.11/0.55 % ...number of literals in the above : 3619
% 0.11/0.55 % Current number of archived formulas : 0
% 0.11/0.55 % Current number of archived clauses : 27
% 0.11/0.55 % Clause-clause subsumption calls (NU) : 19025
% 0.11/0.55 % Rec. Clause-clause subsumption calls : 6844
% 0.11/0.55 % Non-unit clause-clause subsumptions : 899
% 0.11/0.55 % Unit Clause-clause subsumption calls : 256
% 0.11/0.55 % Rewrite failures with RHS unbound : 0
% 0.11/0.55 % BW rewrite match attempts : 64
% 0.11/0.55 % BW rewrite match successes : 9
% 0.11/0.55 % Condensation attempts : 0
% 0.11/0.55 % Condensation successes : 0
% 0.11/0.55 % Termbank termtop insertions : 23181
% 0.11/0.55 % Search garbage collected termcells : 405
% 0.11/0.55
% 0.11/0.55 % -------------------------------------------------
% 0.11/0.55 % User time : 0.031 s
% 0.11/0.55 % System time : 0.003 s
% 0.11/0.55 % Total time : 0.034 s
% 0.11/0.55 % Maximum resident set size: 3676 pages
% 0.11/0.55
% 0.11/0.55 % -------------------------------------------------
% 0.11/0.55 % User time : 0.031 s
% 0.11/0.55 % System time : 0.010 s
% 0.11/0.55 % Total time : 0.041 s
% 0.11/0.55 % Maximum resident set size: 4864 pages
% 0.11/0.55 % E exiting
%------------------------------------------------------------------------------