%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL953_8 : TPTP v9.3.1. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:18:08 PM UTC 2026
% Result : Theorem 0.27s 0.57s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of formulae : 26 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 126 ( 0 equ)
% Maximal formula atoms : 17 ( 4 avg)
% Number of connectives : 161 ( 61 ~; 64 |; 9 &)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 8 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-5 aty)
% Number of variables : 69 ( 0 sgn 69 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
'$ki_world': $tType ).
tff(decl_23,type,
'$ki_local_world': '$ki_world' ).
tff(decl_24,type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(decl_25,type,
in: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_26,type,
disjoint: ( $i * ( $i * '$ki_world' ) ) > $o ).
tff(decl_28,type,
singleton: $i > $i ).
tff(decl_29,type,
'$ki_exists_in_world_$i': ( $i * '$ki_world' ) > $o ).
tff(decl_37,type,
esk8_5: ( '$ki_world' * ( $i * ( '$ki_world' * ( $i * '$ki_world' ) ) ) ) > '$ki_world' ).
tff(decl_38,type,
esk9_0: '$ki_world' ).
tff(decl_39,type,
esk10_0: $i ).
tff(decl_40,type,
esk11_0: '$ki_world' ).
tff(decl_41,type,
esk12_0: $i ).
tff(decl_42,type,
esk13_0: '$ki_world' ).
tff(decl_43,type,
esk14_1: '$ki_world' > '$ki_world' ).
tff(decl_44,type,
esk15_0: '$ki_world' ).
tff(verify,conjecture,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(l28_zfmisc_1,axiom,
! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
tff(c_0_2,negated_conjecture,
~ ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ! [X3] :
( '$ki_exists_in_world_$i'(X1,X3)
=> ! [X4: '$ki_world'] :
( '$ki_accessible'(X1,X4)
=> ! [X5] :
( '$ki_exists_in_world_$i'(X4,X5)
=> ! [X6: '$ki_world'] :
( '$ki_accessible'(X4,X6)
=> ( ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> ~ ! [X8: '$ki_world'] :
( '$ki_accessible'(X7,X8)
=> in(X8,X3,X5) ) )
=> ! [X7: '$ki_world'] :
( '$ki_accessible'(X6,X7)
=> disjoint(X7,singleton(X3),X5) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[verify]) ).
tff(c_0_3,plain,
! [X32: '$ki_world',X33,X34: '$ki_world',X35,X36: '$ki_world',X38: '$ki_world',X39: '$ki_world'] :
( ( ~ '$ki_accessible'('$ki_local_world',X32)
| ~ '$ki_exists_in_world_$i'(X32,X33)
| ~ '$ki_accessible'(X32,X34)
| ~ '$ki_exists_in_world_$i'(X34,X35)
| ~ '$ki_accessible'(X34,X36)
| disjoint(X39,singleton(X33),X35)
| ~ '$ki_accessible'(X36,X39)
| in(X38,X33,X35)
| ~ '$ki_accessible'(esk8_5(X32,X33,X34,X35,X36),X38) )
& ( ~ '$ki_accessible'('$ki_local_world',X32)
| ~ '$ki_exists_in_world_$i'(X32,X33)
| ~ '$ki_accessible'(X32,X34)
| ~ '$ki_exists_in_world_$i'(X34,X35)
| ~ '$ki_accessible'(X34,X36)
| disjoint(X39,singleton(X33),X35)
| ~ '$ki_accessible'(X36,X39)
| '$ki_accessible'(X36,esk8_5(X32,X33,X34,X35,X36)) ) ),
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)],[l28_zfmisc_1])])])])])]) ).
tff(c_0_4,negated_conjecture,
! [X45: '$ki_world'] :
( ~ disjoint(esk15_0,singleton(esk10_0),esk12_0)
& '$ki_accessible'(esk13_0,esk15_0)
& ( ~ '$ki_accessible'(esk13_0,X45)
| ~ in(esk14_1(X45),esk10_0,esk12_0) )
& ( ~ '$ki_accessible'(esk13_0,X45)
| '$ki_accessible'(X45,esk14_1(X45)) )
& '$ki_accessible'(esk11_0,esk13_0)
& '$ki_exists_in_world_$i'(esk11_0,esk12_0)
& '$ki_accessible'(esk9_0,esk11_0)
& '$ki_exists_in_world_$i'(esk9_0,esk10_0)
& '$ki_accessible'('$ki_local_world',esk9_0) ),
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_2])])])])])]) ).
tcf(c_0_5,plain,
! [X1: '$ki_world',X2,X3,X7: '$ki_world',X6: '$ki_world',X4: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X4)
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_accessible'(X6,X1)
| ~ '$ki_accessible'(X1,X7)
| disjoint(X7,singleton(X2),X3)
| '$ki_accessible'(X1,esk8_5(X4,X2,X6,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_6,negated_conjecture,
'$ki_accessible'('$ki_local_world',esk9_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_7,negated_conjecture,
! [X2,X6: '$ki_world',X4: '$ki_world',X3,X1: '$ki_world'] :
( ~ '$ki_accessible'(X4,X1)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_accessible'(esk9_0,X6)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| ~ '$ki_exists_in_world_$i'(esk9_0,X2)
| '$ki_accessible'(X4,esk8_5(esk9_0,X2,X6,X3,X4))
| disjoint(X1,singleton(X2),X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
tcf(c_0_8,negated_conjecture,
'$ki_exists_in_world_$i'(esk9_0,esk10_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_9,negated_conjecture,
! [X6: '$ki_world',X4: '$ki_world',X2,X1: '$ki_world'] :
( ~ '$ki_accessible'(X4,X1)
| ~ '$ki_accessible'(X6,X4)
| ~ '$ki_accessible'(esk9_0,X6)
| ~ '$ki_exists_in_world_$i'(X6,X2)
| '$ki_accessible'(X4,esk8_5(esk9_0,esk10_0,X6,X2,X4))
| disjoint(X1,singleton(esk10_0),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
tcf(c_0_10,negated_conjecture,
'$ki_accessible'(esk9_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_11,negated_conjecture,
! [X4: '$ki_world',X2,X1: '$ki_world'] :
( ~ '$ki_accessible'(X4,X1)
| ~ '$ki_accessible'(esk11_0,X4)
| ~ '$ki_exists_in_world_$i'(esk11_0,X2)
| '$ki_accessible'(X4,esk8_5(esk9_0,esk10_0,esk11_0,X2,X4))
| disjoint(X1,singleton(esk10_0),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_12,negated_conjecture,
'$ki_exists_in_world_$i'(esk11_0,esk12_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_13,negated_conjecture,
! [X4: '$ki_world',X1: '$ki_world'] :
( ~ '$ki_accessible'(X4,X1)
| ~ '$ki_accessible'(esk11_0,X4)
| '$ki_accessible'(X4,esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,X4))
| disjoint(X1,singleton(esk10_0),esk12_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
tcf(c_0_14,negated_conjecture,
'$ki_accessible'(esk11_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_15,plain,
! [X3,X8: '$ki_world',X7: '$ki_world',X6: '$ki_world',X4: '$ki_world',X2,X1: '$ki_world'] :
( ~ '$ki_accessible'('$ki_local_world',X1)
| ~ '$ki_exists_in_world_$i'(X1,X2)
| ~ '$ki_accessible'(X1,X4)
| ~ '$ki_exists_in_world_$i'(X4,X3)
| ~ '$ki_accessible'(X4,X6)
| ~ '$ki_accessible'(X6,X8)
| ~ '$ki_accessible'(esk8_5(X1,X2,X4,X3,X6),X7)
| disjoint(X8,singleton(X2),X3)
| in(X7,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
tcf(c_0_16,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk13_0,X1)
| '$ki_accessible'(X1,esk14_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_17,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk13_0,X1)
| '$ki_accessible'(esk13_0,esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0))
| disjoint(X1,singleton(esk10_0),esk12_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
tcf(c_0_18,negated_conjecture,
'$ki_accessible'(esk13_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_19,negated_conjecture,
~ disjoint(esk15_0,singleton(esk10_0),esk12_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_20,negated_conjecture,
! [X2,X1: '$ki_world',X3,X4: '$ki_world',X7: '$ki_world',X6: '$ki_world'] :
( ~ '$ki_accessible'(X4,X6)
| ~ '$ki_accessible'(X6,X7)
| ~ '$ki_accessible'(X7,X1)
| ~ '$ki_accessible'('$ki_local_world',X4)
| ~ '$ki_accessible'(esk13_0,esk8_5(X4,X2,X6,X3,X7))
| ~ '$ki_exists_in_world_$i'(X4,X2)
| ~ '$ki_exists_in_world_$i'(X6,X3)
| in(esk14_1(esk8_5(X4,X2,X6,X3,X7)),X2,X3)
| disjoint(X1,singleton(X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
tcf(c_0_21,negated_conjecture,
'$ki_accessible'(esk13_0,esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
tcf(c_0_22,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk13_0,X1)
| in(esk14_1(esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0)),esk10_0,esk12_0)
| disjoint(X1,singleton(esk10_0),esk12_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_12]),c_0_8]),c_0_6]),c_0_14]),c_0_10])]) ).
tcf(c_0_23,negated_conjecture,
! [X1: '$ki_world'] :
( ~ '$ki_accessible'(esk13_0,X1)
| ~ in(esk14_1(X1),esk10_0,esk12_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
tcf(c_0_24,negated_conjecture,
in(esk14_1(esk8_5(esk9_0,esk10_0,esk11_0,esk12_0,esk13_0)),esk10_0,esk12_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_18]),c_0_19]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL953_8 : TPTP v9.3.1. Released v8.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n005.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Mon Sep 21 01:13:50 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.51 Running first-order theorem proving
% 0.27/0.51 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.27/0.57 % Version: 3.5.1
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.57 % Starting sh5l with 300s (1) cores
% 0.27/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2222554 completed with status 0
% 0.27/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.57 % No SInE strategy applied
% 0.27/0.57 % Search class: FGHNS-FFMM33-SFFFFFNN
% 0.27/0.57 % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.27/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.27/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.27/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.27/0.57 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with pid 2222561 completed with status 0
% 0.27/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I
% 0.27/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.57 % No SInE strategy applied
% 0.27/0.57 % Search class: FGHNS-FFMM33-SFFFFFNN
% 0.27/0.57 % partial match(1): FGHNF-FFMM33-SFFFFFNN
% 0.27/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.27/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.27/0.57 % Preprocessing time : 0.001 s
% 0.27/0.57 % Presaturation interreduction done
% 0.27/0.57
% 0.27/0.57 % Proof found!
% 0.27/0.57 % SZS status Theorem
% 0.27/0.57 % SZS output start CNFRefutation
% See solution above
% 0.27/0.57 % Parsed axioms : 16
% 0.27/0.57 % Removed by relevancy pruning/SinE : 0
% 0.27/0.57 % Initial clauses : 32
% 0.27/0.57 % Removed in clause preprocessing : 8
% 0.27/0.57 % Initial clauses in saturation : 24
% 0.27/0.57 % Processed clauses : 341
% 0.27/0.57 % ...of these trivial : 0
% 0.27/0.57 % ...subsumed : 0
% 0.27/0.57 % ...remaining for further processing : 341
% 0.27/0.57 % Other redundant clauses eliminated : 0
% 0.27/0.57 % Clauses deleted for lack of memory : 0
% 0.27/0.57 % Backward-subsumed : 0
% 0.27/0.57 % Backward-rewritten : 2
% 0.27/0.57 % Generated clauses : 402
% 0.27/0.57 % ...of the previous two non-redundant : 401
% 0.27/0.57 % ...aggressively subsumed : 0
% 0.27/0.57 % Contextual simplify-reflections : 0
% 0.27/0.57 % Paramodulations : 402
% 0.27/0.57 % Factorizations : 0
% 0.27/0.57 % NegExts : 0
% 0.27/0.57 % Equation resolutions : 0
% 0.27/0.57 % Disequality decompositions : 0
% 0.27/0.57 % Total rewrite steps : 72
% 0.27/0.57 % ...of those cached : 63
% 0.27/0.57 % Propositional unsat checks : 0
% 0.27/0.57 % Propositional check models : 0
% 0.27/0.57 % Propositional check unsatisfiable : 0
% 0.27/0.57 % Propositional clauses : 0
% 0.27/0.57 % Propositional clauses after purity: 0
% 0.27/0.57 % Propositional unsat core size : 0
% 0.27/0.57 % Propositional preprocessing time : 0.000
% 0.27/0.57 % Propositional encoding time : 0.000
% 0.27/0.57 % Propositional solver time : 0.000
% 0.27/0.57 % Success case prop preproc time : 0.000
% 0.27/0.57 % Success case prop encoding time : 0.000
% 0.27/0.57 % Success case prop solver time : 0.000
% 0.27/0.57 % Current number of processed clauses : 315
% 0.27/0.57 % Positive orientable unit clauses : 12
% 0.27/0.57 % Positive unorientable unit clauses: 0
% 0.27/0.57 % Negative unit clauses : 1
% 0.27/0.57 % Non-unit-clauses : 302
% 0.27/0.57 % Current number of unprocessed clauses: 108
% 0.27/0.57 % ...number of literals in the above : 410
% 0.27/0.57 % Current number of archived formulas : 0
% 0.27/0.57 % Current number of archived clauses : 26
% 0.27/0.57 % Clause-clause subsumption calls (NU) : 3128
% 0.27/0.57 % Rec. Clause-clause subsumption calls : 1450
% 0.27/0.57 % Non-unit clause-clause subsumptions : 0
% 0.27/0.57 % Unit Clause-clause subsumption calls : 10
% 0.27/0.57 % Rewrite failures with RHS unbound : 0
% 0.27/0.57 % BW rewrite match attempts : 10
% 0.27/0.57 % BW rewrite match successes : 2
% 0.27/0.57 % Condensation attempts : 0
% 0.27/0.57 % Condensation successes : 0
% 0.27/0.57 % Termbank termtop insertions : 13876
% 0.27/0.57 % Search garbage collected termcells : 701
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.029 s
% 0.27/0.57 % System time : 0.007 s
% 0.27/0.57 % Total time : 0.035 s
% 0.27/0.57 % Maximum resident set size: 3392 pages
% 0.27/0.57
% 0.27/0.57 % -------------------------------------------------
% 0.27/0.57 % User time : 0.126 s
% 0.27/0.57 % System time : 0.030 s
% 0.27/0.57 % Total time : 0.156 s
% 0.27/0.57 % Maximum resident set size: 4608 pages
% 0.27/0.57 % E exiting
%------------------------------------------------------------------------------