%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET926^7 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n017.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 08:22:20 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of formulae : 35 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 120 ( 17 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 388 ( 53 ~; 37 |; 5 &; 285 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 5 con; 0-3 aty)
% Number of variables : 73 ( 48 ^; 25 !; 0 ?; 73 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_23,type,
qmltpeq: mu > mu > $i > $o ).
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
exists_in_world: mu > $i > $o ).
thf(decl_38,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_51,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_58,type,
in: mu > mu > $i > $o ).
thf(decl_60,type,
empty_set: mu ).
thf(decl_61,type,
singleton: mu > mu ).
thf(decl_62,type,
set_difference: mu > mu > mu ).
thf(decl_63,type,
esk1_0: $i ).
thf(decl_64,type,
esk2_0: mu ).
thf(decl_65,type,
esk3_0: mu ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mor) ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mand) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mequiv) ).
thf(t69_zfmisc_1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mor @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ empty_set ) @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ ( singleton @ X28 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',t69_zfmisc_1) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X11: mu > $i > $o,X3: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ X3 )
=> ( X11 @ X12 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',mvalid) ).
thf(l34_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mequiv @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ ( singleton @ X28 ) ) @ ( mnot @ ( in @ X28 @ X29 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',l34_zfmisc_1) ).
thf(l36_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mequiv @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ empty_set ) @ ( in @ X28 @ X29 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p',l36_zfmisc_1) ).
thf(c_0_10,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_14,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_15,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_11]),c_0_12]) ).
thf(c_0_17,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mor @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ empty_set ) @ ( qmltpeq @ ( set_difference @ ( singleton @ X28 ) @ X29 ) @ ( singleton @ X28 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t69_zfmisc_1]) ).
thf(c_0_18,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X12: mu] :
( ( exists_in_world @ X12 @ Z1 )
=> ( Z0 @ X12 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_19,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_20,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ ! [X45: $i,X44: mu] :
( ( exists_in_world @ X44 @ X45 )
=> ! [X43: mu] :
( ( exists_in_world @ X43 @ X45 )
=> ( ( qmltpeq @ ( set_difference @ ( singleton @ X44 ) @ X43 ) @ empty_set @ X45 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X44 ) @ X43 ) @ ( singleton @ X44 ) @ X45 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_17]),c_0_18]),c_0_12]),c_0_19]) ).
thf(c_0_22,plain,
! [X56: $i,X55: mu] :
( ( exists_in_world @ X55 @ X56 )
=> ! [X54: mu] :
( ( exists_in_world @ X54 @ X56 )
=> ~ ( ~ ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X55 ) @ X54 ) @ ( singleton @ X55 ) @ X56 )
| ~ ( in @ X55 @ X54 @ X56 ) )
| ~ ( ( in @ X55 @ X54 @ X56 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X55 ) @ X54 ) @ ( singleton @ X55 ) @ X56 ) ) ) ) ),
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)],[l34_zfmisc_1]),c_0_18]),c_0_20]),c_0_11]),c_0_19])]) ).
thf(c_0_23,plain,
! [X59: $i,X58: mu] :
( ( exists_in_world @ X58 @ X59 )
=> ! [X57: mu] :
( ( exists_in_world @ X57 @ X59 )
=> ~ ( ~ ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X58 ) @ X57 ) @ empty_set @ X59 )
| ( in @ X58 @ X57 @ X59 ) )
| ~ ( ~ ( in @ X58 @ X57 @ X59 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X58 ) @ X57 ) @ empty_set @ X59 ) ) ) ) ),
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)],[l36_zfmisc_1]),c_0_18]),c_0_20]),c_0_19])]) ).
thf(c_0_24,negated_conjecture,
( ( exists_in_world @ esk2_0 @ esk1_0 )
& ( exists_in_world @ esk3_0 @ esk1_0 )
& ~ ( qmltpeq @ ( set_difference @ ( singleton @ esk2_0 ) @ esk3_0 ) @ empty_set @ esk1_0 )
& ~ ( qmltpeq @ ( set_difference @ ( singleton @ esk2_0 ) @ esk3_0 ) @ ( singleton @ esk2_0 ) @ esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
thf(c_0_25,plain,
! [X104: $i,X105: mu,X106: mu] :
( ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X105 ) @ X106 ) @ ( singleton @ X105 ) @ X104 )
| ~ ( in @ X105 @ X106 @ X104 )
| ~ ( exists_in_world @ X106 @ X104 )
| ~ ( exists_in_world @ X105 @ X104 ) )
& ( ( in @ X105 @ X106 @ X104 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X105 ) @ X106 ) @ ( singleton @ X105 ) @ X104 )
| ~ ( exists_in_world @ X106 @ X104 )
| ~ ( exists_in_world @ X105 @ X104 ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
thf(c_0_26,plain,
! [X107: $i,X108: mu,X109: mu] :
( ( ~ ( qmltpeq @ ( set_difference @ ( singleton @ X108 ) @ X109 ) @ empty_set @ X107 )
| ( in @ X108 @ X109 @ X107 )
| ~ ( exists_in_world @ X109 @ X107 )
| ~ ( exists_in_world @ X108 @ X107 ) )
& ( ~ ( in @ X108 @ X109 @ X107 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X108 ) @ X109 ) @ empty_set @ X107 )
| ~ ( exists_in_world @ X109 @ X107 )
| ~ ( exists_in_world @ X108 @ X107 ) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])]) ).
thf(c_0_27,negated_conjecture,
~ ( qmltpeq @ ( set_difference @ ( singleton @ esk2_0 ) @ esk3_0 ) @ ( singleton @ esk2_0 ) @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( in @ X10 @ X12 @ X3 )
| ( qmltpeq @ ( set_difference @ ( singleton @ X10 ) @ X12 ) @ ( singleton @ X10 ) @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,negated_conjecture,
exists_in_world @ esk3_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,negated_conjecture,
exists_in_world @ esk2_0 @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_31,negated_conjecture,
~ ( qmltpeq @ ( set_difference @ ( singleton @ esk2_0 ) @ esk3_0 ) @ empty_set @ esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_32,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( qmltpeq @ ( set_difference @ ( singleton @ X10 ) @ X12 ) @ empty_set @ X3 )
| ~ ( in @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_33,negated_conjecture,
in @ esk2_0 @ esk3_0 @ esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_30])]) ).
thf(c_0_34,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET926^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n017.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:36:37 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.21 Running higher-order theorem proving
% 0.07/0.23 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.aywoWlpyq3/E---3.1_348642.p
% 0.07/0.26 % Version: 3.5.1-ho
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % Starting new_ho_12 with 300s (1) cores
% 0.07/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.07/0.26 % new_bool_2 with pid 348658 completed with status 0
% 0.07/0.26 % Result found by new_bool_2
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % Starting new_ho_12 with 300s (1) cores
% 0.07/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.26 % Search class: HGHNM-FFMF21-SHSSMFNN
% 0.07/0.26 % partial match(1): HGHNM-FFMF31-SHSSMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % SubtermCWHack with pid 348659 completed with status 0
% 0.07/0.26 % Result found by SubtermCWHack
% 0.07/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.07/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.07/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.07/0.26 % Starting new_ho_12 with 300s (1) cores
% 0.07/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.07/0.26 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.26 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.26 % Search class: HGHNM-FFMF21-SHSSMFNN
% 0.07/0.26 % partial match(1): HGHNM-FFMF31-SHSSMFNN
% 0.07/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.07/0.26 % Preprocessing time : 0.002 s
% 0.07/0.26
% 0.07/0.26 % Proof found!
% 0.07/0.26 % SZS status Theorem
% 0.07/0.26 % SZS output start CNFRefutation
% See solution above
% 0.07/0.26 % Parsed axioms : 96
% 0.07/0.26 % Removed by relevancy pruning/SinE : 67
% 0.07/0.26 % Initial clauses : 28
% 0.07/0.26 % Removed in clause preprocessing : 0
% 0.07/0.26 % Initial clauses in saturation : 28
% 0.07/0.26 % Processed clauses : 26
% 0.07/0.26 % ...of these trivial : 0
% 0.07/0.26 % ...subsumed : 2
% 0.07/0.26 % ...remaining for further processing : 24
% 0.07/0.26 % Other redundant clauses eliminated : 0
% 0.07/0.26 % Clauses deleted for lack of memory : 0
% 0.07/0.26 % Backward-subsumed : 0
% 0.07/0.26 % Backward-rewritten : 0
% 0.07/0.26 % Generated clauses : 13
% 0.07/0.26 % ...of the previous two non-redundant : 10
% 0.07/0.26 % ...aggressively subsumed : 0
% 0.07/0.26 % Contextual simplify-reflections : 0
% 0.07/0.26 % Paramodulations : 13
% 0.07/0.26 % Factorizations : 0
% 0.07/0.26 % NegExts : 0
% 0.07/0.26 % Equation resolutions : 0
% 0.07/0.26 % Disequality decompositions : 0
% 0.07/0.26 % Total rewrite steps : 24
% 0.07/0.26 % ...of those cached : 16
% 0.07/0.26 % Propositional unsat checks : 0
% 0.07/0.26 % Propositional check models : 0
% 0.07/0.26 % Propositional check unsatisfiable : 0
% 0.07/0.26 % Propositional clauses : 0
% 0.07/0.26 % Propositional clauses after purity: 0
% 0.07/0.26 % Propositional unsat core size : 0
% 0.07/0.26 % Propositional preprocessing time : 0.000
% 0.07/0.26 % Propositional encoding time : 0.000
% 0.07/0.26 % Propositional solver time : 0.000
% 0.07/0.26 % Success case prop preproc time : 0.000
% 0.07/0.26 % Success case prop encoding time : 0.000
% 0.07/0.26 % Success case prop solver time : 0.000
% 0.07/0.26 % Current number of processed clauses : 24
% 0.07/0.26 % Positive orientable unit clauses : 11
% 0.07/0.26 % Positive unorientable unit clauses: 0
% 0.07/0.26 % Negative unit clauses : 4
% 0.07/0.26 % Non-unit-clauses : 9
% 0.07/0.26 % Current number of unprocessed clauses: 11
% 0.07/0.26 % ...number of literals in the above : 55
% 0.07/0.26 % Current number of archived formulas : 0
% 0.07/0.26 % Current number of archived clauses : 0
% 0.07/0.26 % Clause-clause subsumption calls (NU) : 42
% 0.07/0.26 % Rec. Clause-clause subsumption calls : 29
% 0.07/0.26 % Non-unit clause-clause subsumptions : 2
% 0.07/0.26 % Unit Clause-clause subsumption calls : 1
% 0.07/0.26 % Rewrite failures with RHS unbound : 0
% 0.07/0.26 % BW rewrite match attempts : 0
% 0.07/0.26 % BW rewrite match successes : 0
% 0.07/0.26 % Condensation attempts : 0
% 0.07/0.26 % Condensation successes : 0
% 0.07/0.26 % Termbank termtop insertions : 5972
% 0.07/0.26 % Search garbage collected termcells : 2807
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.008 s
% 0.07/0.26 % System time : 0.004 s
% 0.07/0.26 % Total time : 0.012 s
% 0.07/0.26 % Maximum resident set size: 4504 pages
% 0.07/0.26
% 0.07/0.26 % -------------------------------------------------
% 0.07/0.26 % User time : 0.012 s
% 0.07/0.26 % System time : 0.007 s
% 0.07/0.26 % Total time : 0.020 s
% 0.07/0.26 % Maximum resident set size: 4608 pages
% 0.07/0.26 % E exiting
%------------------------------------------------------------------------------