%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO127+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 : n009.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:10 PM UTC 2026
% Result : Theorem 0.12s 0.51s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 51 ( 19 unt; 0 def)
% Number of atoms : 160 ( 10 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 171 ( 62 ~; 65 |; 31 &)
% ( 9 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 90 ( 7 sgn 51 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(theorem_4_12,conjecture,
! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X5,X3)
| ordered_by(X9,X3,X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',theorem_4_12) ).
fof(o1,axiom,
! [X9,X3,X5] :
( ordered_by(X9,X3,X5)
=> ( incident_o(X5,X9)
& incident_o(X3,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o1) ).
fof(start_point_defn,axiom,
! [X3,X9] :
( start_point(X3,X9)
<=> ( ! [X5] :
( ( incident_o(X5,X9)
& X3 != X5 )
=> ordered_by(X9,X3,X5) )
& incident_o(X3,X9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',start_point_defn) ).
fof(o4,axiom,
! [X9] :
? [X3] : start_point(X3,X9),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o4) ).
fof(inner_point_defn,axiom,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( ~ end_point(X3,X1)
& incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',inner_point_defn) ).
fof(c3,axiom,
! [X1] :
? [X3] : inner_point(X3,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',c3) ).
fof(end_point_defn,axiom,
! [X3,X1] :
( end_point(X3,X1)
<=> ( ! [X2,X4] :
( ( incident_c(X3,X4)
& incident_c(X3,X2)
& part_of(X4,X1)
& part_of(X2,X1) )
=> ( part_of(X4,X2)
| part_of(X2,X4) ) )
& incident_c(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',end_point_defn) ).
fof(open_defn,axiom,
! [X1] :
( open(X1)
<=> ? [X3] : end_point(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+0.ax',open_defn) ).
fof(o2,axiom,
! [X9] :
? [X1] :
( ! [X3] :
( incident_o(X3,X9)
<=> incident_c(X3,X1) )
& open(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO004+2.ax',o2) ).
fof(c_0_9,negated_conjecture,
~ ! [X9,X3] :
( incident_o(X3,X9)
<=> ? [X5] :
( ordered_by(X9,X5,X3)
| ordered_by(X9,X3,X5) ) ),
inference(assume_negation,[status(cth)],[theorem_4_12]) ).
fof(c_0_10,plain,
! [X111,X112,X113] :
( ( ~ ordered_by(X111,X112,X113)
| incident_o(X113,X111) )
& ( ~ ordered_by(X111,X112,X113)
| incident_o(X112,X111) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[o1])])])]) ).
fof(c_0_11,negated_conjecture,
! [X152] :
( ( ordered_by(esk25_0,esk27_0,esk26_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| incident_o(esk26_0,esk25_0) )
& ( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,X152,esk26_0) )
& ( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,esk26_0,X152) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])]) ).
cnf(c_0_12,plain,
( ~ ordered_by(X2,X3,X1)
| incident_o(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ordered_by(esk25_0,esk27_0,esk26_0)
| ordered_by(esk25_0,esk26_0,esk27_0)
| incident_o(esk26_0,esk25_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X3,X9] :
( start_point(X3,X9)
<=> ( ! [X5] :
( ( incident_o(X5,X9)
& X3 != X5 )
=> ordered_by(X9,X3,X5) )
& incident_o(X3,X9) ) ),
inference(fof_simplification,[status(thm)],[start_point_defn]) ).
cnf(c_0_15,plain,
( ~ ordered_by(X2,X1,X3)
| incident_o(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ordered_by(esk25_0,esk26_0,esk27_0)
| incident_o(esk26_0,esk25_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_17,plain,
! [X99,X100,X101,X102,X103] :
( ( start_point(X102,X103)
| ~ incident_o(X102,X103)
| ~ ordered_by(X103,X102,esk15_2(X102,X103)) )
& ( start_point(X102,X103)
| ~ incident_o(X102,X103)
| incident_o(esk15_2(X102,X103),X103) )
& ( start_point(X102,X103)
| ~ incident_o(X102,X103)
| X102 != esk15_2(X102,X103) )
& ( ~ start_point(X99,X100)
| ordered_by(X100,X99,X101)
| ~ incident_o(X101,X100)
| X99 = X101 )
& ( ~ start_point(X99,X100)
| incident_o(X99,X100) ) ),
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)],[c_0_14])])])])])])]) ).
fof(c_0_18,plain,
! [X131] : start_point(esk20_1(X131),X131),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[o4])]) ).
fof(c_0_19,plain,
! [X3,X1] :
( inner_point(X3,X1)
<=> ( ~ end_point(X3,X1)
& incident_c(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[inner_point_defn]) ).
cnf(c_0_20,negated_conjecture,
( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,X1,esk26_0) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
incident_o(esk26_0,esk25_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
( ~ start_point(X1,X3)
| ~ incident_o(X2,X3)
| ordered_by(X3,X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
start_point(esk20_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X35,X36] :
( ( inner_point(X35,X36)
| end_point(X35,X36)
| ~ incident_c(X35,X36) )
& ( ~ inner_point(X35,X36)
| ~ end_point(X35,X36) )
& ( ~ inner_point(X35,X36)
| incident_c(X35,X36) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
fof(c_0_25,plain,
! [X60] : inner_point(esk8_1(X60),X60),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c3])]) ).
fof(c_0_26,plain,
! [X27,X28,X29,X30,X31,X32] :
( ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| ~ part_of(esk4_2(X31,X32),esk3_2(X31,X32)) )
& ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| ~ part_of(esk3_2(X31,X32),esk4_2(X31,X32)) )
& ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| incident_c(X31,esk4_2(X31,X32)) )
& ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| incident_c(X31,esk3_2(X31,X32)) )
& ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| part_of(esk4_2(X31,X32),X32) )
& ( end_point(X31,X32)
| ~ incident_c(X31,X32)
| part_of(esk3_2(X31,X32),X32) )
& ( ~ end_point(X27,X28)
| part_of(X30,X29)
| part_of(X29,X30)
| ~ incident_c(X27,X30)
| ~ incident_c(X27,X29)
| ~ part_of(X30,X28)
| ~ part_of(X29,X28) )
& ( ~ end_point(X27,X28)
| incident_c(X27,X28) ) ),
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)],[end_point_defn])])])])])])]) ).
fof(c_0_27,plain,
! [X49,X51,X52] :
( ( open(X51)
| ~ end_point(X52,X51) )
& ( end_point(esk7_1(X49),X49)
| ~ open(X49) ) ),
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)],[open_defn])])])])])]) ).
cnf(c_0_28,negated_conjecture,
~ ordered_by(esk25_0,X1,esk26_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
cnf(c_0_29,plain,
( ~ incident_o(X2,X1)
| ordered_by(X1,esk20_1(X1),X2)
| esk20_1(X1) = X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( ~ incident_o(esk26_0,esk25_0)
| ~ ordered_by(esk25_0,esk26_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X114,X116,X117] :
( ( incident_o(X117,X114)
| ~ incident_c(X117,esk17_1(X114)) )
& ( incident_c(X116,esk17_1(X114))
| ~ incident_o(X116,X114) )
& open(esk17_1(X114)) ),
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)],[o2])])])])])]) ).
cnf(c_0_32,plain,
( ~ inner_point(X1,X2)
| incident_c(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_33,plain,
inner_point(esk8_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ end_point(X1,X2)
| incident_c(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( ~ open(X1)
| end_point(esk7_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
esk20_1(esk25_0) = esk26_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
~ ordered_by(esk25_0,esk26_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_21])]) ).
cnf(c_0_38,plain,
( ~ incident_c(X1,esk17_1(X2))
| incident_o(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
incident_c(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_40,plain,
( ~ open(X1)
| incident_c(esk7_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
open(esk17_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( ~ inner_point(X1,X2)
| ~ end_point(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_43,negated_conjecture,
( ~ incident_o(X1,esk25_0)
| esk26_0 = X1 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_36]),c_0_37]) ).
cnf(c_0_44,plain,
incident_o(esk8_1(esk17_1(X1)),X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
incident_o(esk7_1(esk17_1(X1)),X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_40]),c_0_41])]) ).
cnf(c_0_46,plain,
~ end_point(esk8_1(X1),X1),
inference(spm,[status(thm)],[c_0_42,c_0_33]) ).
cnf(c_0_47,negated_conjecture,
esk8_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,negated_conjecture,
esk7_1(esk17_1(esk25_0)) = esk26_0,
inference(spm,[status(thm)],[c_0_43,c_0_45]) ).
cnf(c_0_49,negated_conjecture,
~ end_point(esk26_0,esk17_1(esk25_0)),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_48]),c_0_41])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO127+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n009.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 12:08:12 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.42 Running first-order theorem proving
% 0.12/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.12/0.51 % Version: 3.5.1
% 0.12/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.12/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.12/0.51 % Starting sh5l with 300s (1) cores
% 0.12/0.51 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3442046 completed with status 0
% 0.12/0.51 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.51 % No SInE strategy applied
% 0.12/0.51 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.12/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.51 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.12/0.51 % Starting new_bool_3 with 248s (1) cores
% 0.12/0.51 % Starting new_bool_1 with 241s (1) cores
% 0.12/0.51 % G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 3442057 completed with status 0
% 0.12/0.51 % Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 0.12/0.51 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.51 % No SInE strategy applied
% 0.12/0.51 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.12/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.51 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.51 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.12/0.51 % Preprocessing time : 0.004 s
% 0.12/0.51 % Presaturation interreduction done
% 0.12/0.51
% 0.12/0.51 % Proof found!
% 0.12/0.51 % SZS status Theorem
% 0.12/0.51 % SZS output start CNFRefutation
% See solution above
% 0.12/0.51 % Parsed axioms : 28
% 0.12/0.51 % Removed by relevancy pruning/SinE : 0
% 0.12/0.51 % Initial clauses : 88
% 0.12/0.51 % Removed in clause preprocessing : 0
% 0.12/0.51 % Initial clauses in saturation : 88
% 0.12/0.51 % Processed clauses : 346
% 0.12/0.51 % ...of these trivial : 0
% 0.12/0.51 % ...subsumed : 23
% 0.12/0.51 % ...remaining for further processing : 323
% 0.12/0.51 % Other redundant clauses eliminated : 4
% 0.12/0.51 % Clauses deleted for lack of memory : 0
% 0.12/0.51 % Backward-subsumed : 1
% 0.12/0.51 % Backward-rewritten : 4
% 0.12/0.51 % Generated clauses : 492
% 0.12/0.51 % ...of the previous two non-redundant : 438
% 0.12/0.51 % ...aggressively subsumed : 0
% 0.12/0.51 % Contextual simplify-reflections : 2
% 0.12/0.51 % Paramodulations : 451
% 0.12/0.51 % Factorizations : 10
% 0.12/0.51 % NegExts : 0
% 0.12/0.51 % Equation resolutions : 31
% 0.12/0.51 % Disequality decompositions : 0
% 0.12/0.51 % Total rewrite steps : 27
% 0.12/0.51 % ...of those cached : 15
% 0.12/0.51 % Propositional unsat checks : 0
% 0.12/0.51 % Propositional check models : 0
% 0.12/0.51 % Propositional check unsatisfiable : 0
% 0.12/0.51 % Propositional clauses : 0
% 0.12/0.51 % Propositional clauses after purity: 0
% 0.12/0.51 % Propositional unsat core size : 0
% 0.12/0.51 % Propositional preprocessing time : 0.000
% 0.12/0.51 % Propositional encoding time : 0.000
% 0.12/0.51 % Propositional solver time : 0.000
% 0.12/0.51 % Success case prop preproc time : 0.000
% 0.12/0.51 % Success case prop encoding time : 0.000
% 0.12/0.51 % Success case prop solver time : 0.000
% 0.12/0.51 % Current number of processed clauses : 229
% 0.12/0.51 % Positive orientable unit clauses : 20
% 0.12/0.51 % Positive unorientable unit clauses: 0
% 0.12/0.51 % Negative unit clauses : 11
% 0.12/0.51 % Non-unit-clauses : 198
% 0.12/0.51 % Current number of unprocessed clauses: 268
% 0.12/0.51 % ...number of literals in the above : 1076
% 0.12/0.51 % Current number of archived formulas : 0
% 0.12/0.51 % Current number of archived clauses : 93
% 0.12/0.51 % Clause-clause subsumption calls (NU) : 9283
% 0.12/0.51 % Rec. Clause-clause subsumption calls : 4210
% 0.12/0.51 % Non-unit clause-clause subsumptions : 26
% 0.12/0.51 % Unit Clause-clause subsumption calls : 425
% 0.12/0.51 % Rewrite failures with RHS unbound : 0
% 0.12/0.51 % BW rewrite match attempts : 4
% 0.12/0.51 % BW rewrite match successes : 1
% 0.12/0.51 % Condensation attempts : 0
% 0.12/0.51 % Condensation successes : 0
% 0.12/0.51 % Termbank termtop insertions : 13790
% 0.12/0.51 % Search garbage collected termcells : 1975
% 0.12/0.51
% 0.12/0.51 % -------------------------------------------------
% 0.12/0.51 % User time : 0.058 s
% 0.12/0.51 % System time : 0.006 s
% 0.12/0.51 % Total time : 0.064 s
% 0.12/0.51 % Maximum resident set size: 3624 pages
% 0.12/0.51
% 0.12/0.51 % -------------------------------------------------
% 0.12/0.51 % User time : 0.088 s
% 0.12/0.51 % System time : 0.020 s
% 0.12/0.51 % Total time : 0.108 s
% 0.12/0.51 % Maximum resident set size: 4608 pages
% 0.12/0.51 % E exiting
%------------------------------------------------------------------------------