%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GEG016^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 : Wed Sep 30 07:49:20 AM UTC 2026
% Result : Theorem 0.26s 0.36s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 7
% Syntax : Number of formulae : 40 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 142 ( 12 equ; 0 cnn)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 379 ( 41 ~; 34 |; 22 &; 263 @)
% ( 0 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 8 con; 0-3 aty)
% Number of variables : 93 ( 27 ^; 59 !; 7 ?; 93 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
reg: $tType ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
c: reg > reg > $o ).
thf(decl_56,type,
p: reg > reg > $o ).
thf(decl_58,type,
o: reg > reg > $o ).
thf(decl_60,type,
ec: reg > reg > $o ).
thf(decl_65,type,
france: reg ).
thf(decl_66,type,
spain: reg ).
thf(decl_69,type,
fool: $i > $i > $o ).
thf(decl_70,type,
esk1_0: $i ).
thf(decl_71,type,
esk2_0: $i ).
thf(decl_72,type,
esk3_0: reg ).
thf(decl_73,type,
esk4_0: reg ).
thf(decl_74,type,
esk5_0: reg ).
thf(decl_75,type,
esk6_1: reg > reg ).
thf(decl_76,type,
esk7_1: reg > reg ).
thf(o,axiom,
( o
= ( ^ [X28: reg,X29: reg] :
? [X25: reg] :
( ( p @ X25 @ X28 )
& ( p @ X25 @ X29 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',o) ).
thf(p,axiom,
( p
= ( ^ [X23: reg,X24: reg] :
! [X25: reg] :
( ( c @ X25 @ X23 )
=> ( c @ X25 @ X24 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',p) ).
thf(ec,axiom,
( ec
= ( ^ [X32: reg,X33: reg] :
( ( c @ X32 @ X33 )
& ~ ( o @ X32 @ X33 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',ec) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',mvalid) ).
thf(con,conjecture,
( mvalid
@ ( mbox @ fool
@ ^ [X44: $i] :
! [X25: reg,X45: reg] :
( ( ( p @ X25 @ spain )
& ( p @ X45 @ france ) )
=> ~ ( o @ X25 @ X45 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',con) ).
thf(ax2,axiom,
( mvalid
@ ( mbox @ fool
@ ^ [X42: $i] : ( ec @ spain @ france ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p',ax2) ).
thf(c_0_7,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X49: reg] :
( ( c @ X49 @ X25 )
=> ( c @ X49 @ Z0 ) )
& ! [X50: reg] :
( ( c @ X50 @ X25 )
=> ( c @ X50 @ Z1 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[o]) ).
thf(c_0_8,plain,
( p
= ( ^ [Z0: reg,Z1: reg] :
! [X25: reg] :
( ( c @ X25 @ Z0 )
=> ( c @ X25 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[p]) ).
thf(c_0_9,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X51: reg] :
( ! [X52: reg] :
( ( c @ X52 @ X51 )
=> ( c @ X52 @ Z0 ) )
& ! [X53: reg] :
( ( c @ X53 @ X51 )
=> ( c @ X53 @ Z1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ec]) ).
thf(c_0_10,plain,
( o
= ( ^ [Z0: reg,Z1: reg] :
? [X25: reg] :
( ! [X49: reg] :
( ( c @ X49 @ X25 )
=> ( c @ X49 @ Z0 ) )
& ! [X50: reg] :
( ( c @ X50 @ X25 )
=> ( c @ X50 @ Z1 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( ec
= ( ^ [Z0: reg,Z1: reg] :
( ( c @ Z0 @ Z1 )
& ~ ? [X51: reg] :
( ! [X52: reg] :
( ( c @ X52 @ X51 )
=> ( c @ X52 @ Z0 ) )
& ! [X53: reg] :
( ( c @ X53 @ X51 )
=> ( c @ X53 @ Z1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_12,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_13,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_14,negated_conjecture,
~ ( mvalid
@ ( mbox @ fool
@ ^ [X44: $i] :
! [X25: reg,X45: reg] :
( ( ( p @ X25 @ spain )
& ( p @ X45 @ france ) )
=> ~ ( o @ X25 @ X45 ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_15,plain,
! [X65: $i,X64: $i] :
( ~ ( fool @ X65 @ X64 )
| ( ( c @ spain @ france )
& ~ ? [X61: reg] :
( ! [X62: reg] :
( ( c @ X62 @ X61 )
=> ( c @ X62 @ spain ) )
& ! [X63: reg] :
( ( c @ X63 @ X61 )
=> ( c @ X63 @ france ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[ax2]),c_0_11]),c_0_12]),c_0_13])]) ).
thf(c_0_16,negated_conjecture,
~ ! [X60: $i,X59: $i] :
( ~ ( fool @ X60 @ X59 )
| ! [X25: reg,X45: reg] :
( ( ! [X54: reg] :
( ( c @ X54 @ X25 )
=> ( c @ X54 @ spain ) )
& ! [X55: reg] :
( ( c @ X55 @ X45 )
=> ( c @ X55 @ france ) ) )
=> ~ ? [X56: reg] :
( ! [X57: reg] :
( ( c @ X57 @ X56 )
=> ( c @ X57 @ X25 ) )
& ! [X58: reg] :
( ( c @ X58 @ X56 )
=> ( c @ X58 @ X45 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_14]),c_0_8]),c_0_10]),c_0_12]),c_0_13])]) ).
thf(c_0_17,plain,
! [X83: $i,X84: $i,X85: reg] :
( ( ( c @ spain @ france )
| ~ ( fool @ X83 @ X84 ) )
& ( ( c @ ( esk7_1 @ X85 ) @ X85 )
| ( c @ ( esk6_1 @ X85 ) @ X85 )
| ~ ( fool @ X83 @ X84 ) )
& ( ~ ( c @ ( esk7_1 @ X85 ) @ france )
| ( c @ ( esk6_1 @ X85 ) @ X85 )
| ~ ( fool @ X83 @ X84 ) )
& ( ( c @ ( esk7_1 @ X85 ) @ X85 )
| ~ ( c @ ( esk6_1 @ X85 ) @ spain )
| ~ ( fool @ X83 @ X84 ) )
& ( ~ ( c @ ( esk7_1 @ X85 ) @ france )
| ~ ( c @ ( esk6_1 @ X85 ) @ spain )
| ~ ( fool @ X83 @ X84 ) ) ),
inference(distribute,[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_15])])])])])]) ).
thf(c_0_18,negated_conjecture,
! [X78: reg,X79: reg,X81: reg,X82: reg] :
( ( fool @ esk1_0 @ esk2_0 )
& ( ~ ( c @ X78 @ esk3_0 )
| ( c @ X78 @ spain ) )
& ( ~ ( c @ X79 @ esk4_0 )
| ( c @ X79 @ france ) )
& ( ~ ( c @ X81 @ esk5_0 )
| ( c @ X81 @ esk3_0 ) )
& ( ~ ( c @ X82 @ esk5_0 )
| ( c @ X82 @ esk4_0 ) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
thf(c_0_19,plain,
! [X18: reg,X3: $i,X14: $i] :
( ( c @ ( esk7_1 @ X18 ) @ X18 )
| ( c @ ( esk6_1 @ X18 ) @ X18 )
| ~ ( fool @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
fool @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X18: reg] :
( ( c @ X18 @ esk4_0 )
| ~ ( c @ X18 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X18: reg] :
( ( c @ ( esk6_1 @ X18 ) @ X18 )
| ( c @ ( esk7_1 @ X18 ) @ X18 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
! [X18: reg] :
( ( c @ X18 @ france )
| ~ ( c @ X18 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,negated_conjecture,
( ( c @ ( esk6_1 @ esk5_0 ) @ esk5_0 )
| ( c @ ( esk7_1 @ esk5_0 ) @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_25,plain,
! [X18: reg,X3: $i,X14: $i] :
( ( c @ ( esk6_1 @ X18 ) @ X18 )
| ~ ( c @ ( esk7_1 @ X18 ) @ france )
| ~ ( fool @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_26,negated_conjecture,
( ( c @ ( esk6_1 @ esk5_0 ) @ esk5_0 )
| ( c @ ( esk7_1 @ esk5_0 ) @ france ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i,X14: $i] :
( ( c @ ( esk6_1 @ esk5_0 ) @ esk5_0 )
| ~ ( fool @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_28,negated_conjecture,
! [X18: reg] :
( ( c @ X18 @ esk3_0 )
| ~ ( c @ X18 @ esk5_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_29,negated_conjecture,
c @ ( esk6_1 @ esk5_0 ) @ esk5_0,
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
thf(c_0_30,plain,
! [X18: reg,X3: $i,X14: $i] :
( ( c @ ( esk7_1 @ X18 ) @ X18 )
| ~ ( c @ ( esk6_1 @ X18 ) @ spain )
| ~ ( fool @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_31,negated_conjecture,
! [X18: reg] :
( ( c @ X18 @ spain )
| ~ ( c @ X18 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_32,negated_conjecture,
c @ ( esk6_1 @ esk5_0 ) @ esk3_0,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_33,negated_conjecture,
! [X18: reg] :
( ( c @ ( esk7_1 @ X18 ) @ X18 )
| ~ ( c @ ( esk6_1 @ X18 ) @ spain ) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
thf(c_0_34,negated_conjecture,
c @ ( esk6_1 @ esk5_0 ) @ spain,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,negated_conjecture,
c @ ( esk7_1 @ esk5_0 ) @ esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_33]),c_0_34])]) ).
thf(c_0_36,plain,
! [X18: reg,X3: $i,X14: $i] :
( ~ ( c @ ( esk7_1 @ X18 ) @ france )
| ~ ( c @ ( esk6_1 @ X18 ) @ spain )
| ~ ( fool @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_37,negated_conjecture,
c @ ( esk7_1 @ esk5_0 ) @ france,
inference(spm,[status(thm)],[c_0_23,c_0_35]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i,X14: $i] :
~ ( fool @ X3 @ X14 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_34])]) ).
thf(c_0_39,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_20,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEG016^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.20 % Computer : n003.cluster.edu
% 0.12/0.20 % Model : x86_64 x86_64
% 0.12/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.20 % Memory : 8046.5625MB
% 0.12/0.20 % OS : Linux 6.8.0-71-generic
% 0.12/0.20 % CPULimit : 300
% 0.12/0.20 % WCLimit : 300
% 0.12/0.20 % DateTime : Tue Sep 29 18:36:14 UTC 2026
% 0.12/0.20 % CPUTime :
% 0.12/0.20 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.27 Running higher-order theorem proving
% 0.26/0.30 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.WuQLIUfTNk/E---3.1_2893146.p
% 0.26/0.35 % Version: 3.5.1-ho
% 0.26/0.35 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.26/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.35 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.26/0.35 % Starting post_as_ho3 with 300s (1) cores
% 0.26/0.35 % Starting new_ho_12 with 300s (1) cores
% 0.26/0.35 % Starting new_bool_2 with 300s (1) cores
% 0.26/0.35 % new_bool_2 with pid 2893162 completed with status 0
% 0.26/0.35 % Result found by new_bool_2
% 0.26/0.35 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.26/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.35 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.26/0.35 % Starting post_as_ho3 with 300s (1) cores
% 0.26/0.35 % Starting new_ho_12 with 300s (1) cores
% 0.26/0.35 % Starting new_bool_2 with 300s (1) cores
% 0.26/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.35 % Search class: HGHNF-FFSF21-SHSSMSBN
% 0.26/0.35 % partial match(1): HGHNF-FFMF21-SHSSMSBN
% 0.26/0.35 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.35 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.36 % SubtermCWHack with pid 2893163 completed with status 0
% 0.26/0.36 % Result found by SubtermCWHack
% 0.26/0.36 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.26/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.36 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.26/0.36 % Starting post_as_ho3 with 300s (1) cores
% 0.26/0.36 % Starting new_ho_12 with 300s (1) cores
% 0.26/0.36 % Starting new_bool_2 with 300s (1) cores
% 0.26/0.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.36 % Search class: HGHNF-FFSF21-SHSSMSBN
% 0.26/0.36 % partial match(1): HGHNF-FFMF21-SHSSMSBN
% 0.26/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.26/0.36 % Preprocessing time : 0.002 s
% 0.26/0.36
% 0.26/0.36 % Proof found!
% 0.26/0.36 % SZS status Theorem
% 0.26/0.36 % SZS output start CNFRefutation
% See solution above
% 0.26/0.36 % Parsed axioms : 98
% 0.26/0.36 % Removed by relevancy pruning/SinE : 83
% 0.26/0.36 % Initial clauses : 16
% 0.26/0.36 % Removed in clause preprocessing : 0
% 0.26/0.36 % Initial clauses in saturation : 16
% 0.26/0.36 % Processed clauses : 84
% 0.26/0.36 % ...of these trivial : 8
% 0.26/0.36 % ...subsumed : 0
% 0.26/0.36 % ...remaining for further processing : 76
% 0.26/0.36 % Other redundant clauses eliminated : 0
% 0.26/0.36 % Clauses deleted for lack of memory : 0
% 0.26/0.36 % Backward-subsumed : 7
% 0.26/0.36 % Backward-rewritten : 9
% 0.26/0.36 % Generated clauses : 134
% 0.26/0.36 % ...of the previous two non-redundant : 102
% 0.26/0.36 % ...aggressively subsumed : 0
% 0.26/0.36 % Contextual simplify-reflections : 0
% 0.26/0.36 % Paramodulations : 131
% 0.26/0.36 % Factorizations : 0
% 0.26/0.36 % NegExts : 0
% 0.26/0.36 % Equation resolutions : 0
% 0.26/0.36 % Disequality decompositions : 0
% 0.26/0.36 % Total rewrite steps : 50
% 0.26/0.36 % ...of those cached : 19
% 0.26/0.36 % Propositional unsat checks : 0
% 0.26/0.36 % Propositional check models : 0
% 0.26/0.36 % Propositional check unsatisfiable : 0
% 0.26/0.36 % Propositional clauses : 0
% 0.26/0.36 % Propositional clauses after purity: 0
% 0.26/0.36 % Propositional unsat core size : 0
% 0.26/0.36 % Propositional preprocessing time : 0.000
% 0.26/0.36 % Propositional encoding time : 0.000
% 0.26/0.36 % Propositional solver time : 0.000
% 0.26/0.36 % Success case prop preproc time : 0.000
% 0.26/0.36 % Success case prop encoding time : 0.000
% 0.26/0.36 % Success case prop solver time : 0.000
% 0.26/0.36 % Current number of processed clauses : 57
% 0.26/0.36 % Positive orientable unit clauses : 43
% 0.26/0.36 % Positive unorientable unit clauses: 0
% 0.26/0.36 % Negative unit clauses : 1
% 0.26/0.36 % Non-unit-clauses : 13
% 0.26/0.36 % Current number of unprocessed clauses: 21
% 0.26/0.36 % ...number of literals in the above : 48
% 0.26/0.36 % Current number of archived formulas : 0
% 0.26/0.36 % Current number of archived clauses : 19
% 0.26/0.36 % Clause-clause subsumption calls (NU) : 195
% 0.26/0.36 % Rec. Clause-clause subsumption calls : 184
% 0.26/0.36 % Non-unit clause-clause subsumptions : 2
% 0.26/0.36 % Unit Clause-clause subsumption calls : 84
% 0.26/0.36 % Rewrite failures with RHS unbound : 0
% 0.26/0.36 % BW rewrite match attempts : 7
% 0.26/0.36 % BW rewrite match successes : 4
% 0.26/0.36 % Condensation attempts : 0
% 0.26/0.36 % Condensation successes : 0
% 0.26/0.36 % Termbank termtop insertions : 3515
% 0.26/0.36 % Search garbage collected termcells : 1052
% 0.26/0.36
% 0.26/0.36 % -------------------------------------------------
% 0.26/0.36 % User time : 0.013 s
% 0.26/0.36 % System time : 0.004 s
% 0.26/0.36 % Total time : 0.017 s
% 0.26/0.36 % Maximum resident set size: 3992 pages
% 0.26/0.36
% 0.26/0.36 % -------------------------------------------------
% 0.26/0.36 % User time : 0.019 s
% 0.26/0.36 % System time : 0.009 s
% 0.26/0.36 % Total time : 0.029 s
% 0.26/0.36 % Maximum resident set size: 4864 pages
% 0.26/0.36 % E exiting
%------------------------------------------------------------------------------