%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET907^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 : n008.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:19 AM UTC 2026
% Result : Theorem 0.11s 0.26s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 40 ( 28 unt; 0 typ; 0 def)
% Number of atoms : 144 ( 17 equ; 0 cnn)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 435 ( 65 ~; 44 |; 7 &; 309 @)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 30 ( 30 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 5 con; 0-3 aty)
% Number of variables : 89 ( 51 ^; 38 !; 0 ?; 89 :)
% 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_59,type,
subset: mu > mu > $i > $o ).
thf(decl_60,type,
in: mu > mu > $i > $o ).
thf(decl_61,type,
unordered_pair: mu > mu > mu ).
thf(decl_62,type,
set_union2: mu > mu > mu ).
thf(decl_66,type,
esk4_0: $i ).
thf(decl_67,type,
esk5_0: mu ).
thf(decl_68,type,
esk6_0: mu ).
thf(decl_69,type,
esk7_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mimplies) ).
thf(t48_zfmisc_1,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mforall_ind
@ ^ [X30: mu] : ( mimplies @ ( mand @ ( in @ X28 @ X29 ) @ ( in @ X30 @ X29 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X28 @ X30 ) @ X29 ) @ X29 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',t48_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.YKcslMW7Mu/E---3.1_3169940.p',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mvalid) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',mequiv) ).
thf(t12_xboole_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] : ( mimplies @ ( subset @ X28 @ X29 ) @ ( qmltpeq @ ( set_union2 @ X28 @ X29 ) @ X29 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',t12_xboole_1) ).
thf(existence_of_unordered_pair_ax,axiom,
! [X7: $i,X20: mu,X21: mu] : ( exists_in_world @ ( unordered_pair @ X20 @ X21 ) @ X7 ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',existence_of_unordered_pair_ax) ).
thf(t38_zfmisc_1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mforall_ind
@ ^ [X30: mu] : ( mequiv @ ( subset @ ( unordered_pair @ X28 @ X29 ) @ X30 ) @ ( mand @ ( in @ X28 @ X30 ) @ ( in @ X29 @ X30 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.YKcslMW7Mu/E---3.1_3169940.p',t38_zfmisc_1) ).
thf(c_0_11,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X28: mu] :
( mforall_ind
@ ^ [X29: mu] :
( mforall_ind
@ ^ [X30: mu] : ( mimplies @ ( mand @ ( in @ X28 @ X29 ) @ ( in @ X30 @ X29 ) ) @ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X28 @ X30 ) @ X29 ) @ X29 ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t48_zfmisc_1]) ).
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_11,c_0_12]),c_0_13]) ).
thf(c_0_17,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_14,c_0_12]),c_0_13]) ).
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(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_21,negated_conjecture,
~ ! [X129: $i,X128: mu] :
( ( exists_in_world @ X128 @ X129 )
=> ! [X127: mu] :
( ( exists_in_world @ X127 @ X129 )
=> ! [X126: mu] :
( ( exists_in_world @ X126 @ X129 )
=> ( ~ ~ ( ~ ( in @ X128 @ X127 @ X129 )
| ~ ( in @ X126 @ X127 @ X129 ) )
| ( qmltpeq @ ( set_union2 @ ( unordered_pair @ X128 @ X126 ) @ X127 ) @ X127 @ X129 ) ) ) ) ),
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_15]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_22,plain,
! [X121: $i,X120: mu] :
( ( exists_in_world @ X120 @ X121 )
=> ! [X119: mu] :
( ( exists_in_world @ X119 @ X121 )
=> ( ~ ( subset @ X120 @ X119 @ X121 )
| ( qmltpeq @ ( set_union2 @ X120 @ X119 ) @ X119 @ X121 ) ) ) ),
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)],[t12_xboole_1]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_23,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_20,c_0_16]),c_0_17]) ).
thf(c_0_24,negated_conjecture,
( ( exists_in_world @ esk5_0 @ esk4_0 )
& ( exists_in_world @ esk6_0 @ esk4_0 )
& ( exists_in_world @ esk7_0 @ esk4_0 )
& ( in @ esk5_0 @ esk6_0 @ esk4_0 )
& ( in @ esk7_0 @ esk6_0 @ esk4_0 )
& ~ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 ) @ esk6_0 @ esk4_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
thf(c_0_25,plain,
! [X214: $i,X215: mu,X216: mu] :
( ~ ( exists_in_world @ X215 @ X214 )
| ~ ( exists_in_world @ X216 @ X214 )
| ~ ( subset @ X215 @ X216 @ X214 )
| ( qmltpeq @ ( set_union2 @ X215 @ X216 ) @ X216 @ X214 ) ),
inference(fof_nnf,[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,
! [X139: $i,X140: mu,X141: mu] : ( exists_in_world @ ( unordered_pair @ X140 @ X141 ) @ X139 ),
inference(variable_rename,[status(thm)],[existence_of_unordered_pair_ax]) ).
thf(c_0_27,plain,
! [X125: $i,X124: mu] :
( ( exists_in_world @ X124 @ X125 )
=> ! [X123: mu] :
( ( exists_in_world @ X123 @ X125 )
=> ! [X122: mu] :
( ( exists_in_world @ X122 @ X125 )
=> ~ ( ~ ( ~ ( subset @ ( unordered_pair @ X124 @ X123 ) @ X122 @ X125 )
| ~ ( ~ ( in @ X124 @ X122 @ X125 )
| ~ ( in @ X123 @ X122 @ X125 ) ) )
| ~ ( ~ ~ ( ~ ( in @ X124 @ X122 @ X125 )
| ~ ( in @ X123 @ X122 @ X125 ) )
| ( subset @ ( unordered_pair @ X124 @ X123 ) @ X122 @ X125 ) ) ) ) ) ),
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)],[t38_zfmisc_1]),c_0_16]),c_0_23]),c_0_18]),c_0_19])]) ).
thf(c_0_28,negated_conjecture,
~ ( qmltpeq @ ( set_union2 @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 ) @ esk6_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_29,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( qmltpeq @ ( set_union2 @ X10 @ X12 ) @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( subset @ X10 @ X12 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_30,negated_conjecture,
exists_in_world @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_31,plain,
! [X12: mu,X10: mu,X3: $i] : ( exists_in_world @ ( unordered_pair @ X10 @ X12 ) @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,plain,
! [X217: $i,X218: mu,X219: mu,X220: mu] :
( ( ( in @ X218 @ X220 @ X217 )
| ~ ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) )
& ( ( in @ X219 @ X220 @ X217 )
| ~ ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) )
& ( ~ ( in @ X218 @ X220 @ X217 )
| ~ ( in @ X219 @ X220 @ X217 )
| ( subset @ ( unordered_pair @ X218 @ X219 ) @ X220 @ X217 )
| ~ ( exists_in_world @ X220 @ X217 )
| ~ ( exists_in_world @ X219 @ X217 )
| ~ ( exists_in_world @ X218 @ X217 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])])])]) ).
thf(c_0_33,negated_conjecture,
~ ( subset @ ( unordered_pair @ esk5_0 @ esk7_0 ) @ esk6_0 @ esk4_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
thf(c_0_34,plain,
! [X12: mu,X14: mu,X10: mu,X3: $i] :
( ( subset @ ( unordered_pair @ X10 @ X14 ) @ X12 @ X3 )
| ~ ( in @ X10 @ X12 @ X3 )
| ~ ( in @ X14 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X14 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
thf(c_0_35,negated_conjecture,
in @ esk7_0 @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_36,negated_conjecture,
in @ esk5_0 @ esk6_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_37,negated_conjecture,
exists_in_world @ esk7_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_38,negated_conjecture,
exists_in_world @ esk5_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_39,negated_conjecture,
$false,
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_33,c_0_34]),c_0_35]),c_0_36]),c_0_37]),c_0_30]),c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET907^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.11/0.16 % Computer : n008.cluster.edu
% 0.11/0.16 % Model : x86_64 x86_64
% 0.11/0.16 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.16 % Memory : 8046.5625MB
% 0.11/0.16 % OS : Linux 6.8.0-71-generic
% 0.11/0.16 % CPULimit : 300
% 0.11/0.16 % WCLimit : 300
% 0.11/0.16 % DateTime : Tue Sep 29 13:41:39 UTC 2026
% 0.11/0.16 % CPUTime :
% 0.11/0.16 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.20 Running higher-order theorem proving
% 0.11/0.22 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.YKcslMW7Mu/E---3.1_3169940.p
% 0.11/0.26 % Version: 3.5.1-ho
% 0.11/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.11/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.11/0.26 % Starting new_ho_12 with 300s (1) cores
% 0.11/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.11/0.26 % new_ho_10_cnf2 with pid 3169969 completed with status 0
% 0.11/0.26 % Result found by new_ho_10_cnf2
% 0.11/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.11/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HHHNM-FFMS21-SHSSMFNN
% 0.11/0.26 % partial match(2): HHHNM-FFSF21-SHSSMFNN
% 0.11/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.26 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.11/0.26 % Starting sh5l with 136s (1) cores
% 0.11/0.26 % Starting new_bool_1 with 136s (1) cores
% 0.11/0.26 % Starting new_bool_2 with 136s (1) cores
% 0.11/0.26 % SubtermCWHack with pid 3169977 completed with status 0
% 0.11/0.26 % Result found by SubtermCWHack
% 0.11/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.11/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.11/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.11/0.26 % No SInE strategy applied
% 0.11/0.26 % Search class: HHHNM-FFMS21-SHSSMFNN
% 0.11/0.26 % partial match(2): HHHNM-FFSF21-SHSSMFNN
% 0.11/0.26 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.11/0.26 % Starting SubtermCWHack with 136s (1) cores
% 0.11/0.26 % Preprocessing time : 0.001 s
% 0.11/0.26
% 0.11/0.26 % Proof found!
% 0.11/0.26 % SZS status Theorem
% 0.11/0.26 % SZS output start CNFRefutation
% See solution above
% 0.11/0.26 % Parsed axioms : 103
% 0.11/0.26 % Removed by relevancy pruning/SinE : 0
% 0.11/0.26 % Initial clauses : 80
% 0.11/0.26 % Removed in clause preprocessing : 41
% 0.11/0.26 % Initial clauses in saturation : 39
% 0.11/0.26 % Processed clauses : 121
% 0.11/0.26 % ...of these trivial : 0
% 0.11/0.26 % ...subsumed : 36
% 0.11/0.26 % ...remaining for further processing : 85
% 0.11/0.26 % Other redundant clauses eliminated : 0
% 0.11/0.26 % Clauses deleted for lack of memory : 0
% 0.11/0.26 % Backward-subsumed : 4
% 0.11/0.26 % Backward-rewritten : 0
% 0.11/0.26 % Generated clauses : 237
% 0.11/0.26 % ...of the previous two non-redundant : 211
% 0.11/0.26 % ...aggressively subsumed : 0
% 0.11/0.26 % Contextual simplify-reflections : 0
% 0.11/0.26 % Paramodulations : 237
% 0.11/0.26 % Factorizations : 0
% 0.11/0.26 % NegExts : 0
% 0.11/0.26 % Equation resolutions : 0
% 0.11/0.26 % Disequality decompositions : 0
% 0.11/0.26 % Total rewrite steps : 259
% 0.11/0.26 % ...of those cached : 217
% 0.11/0.26 % Propositional unsat checks : 0
% 0.11/0.26 % Propositional check models : 0
% 0.11/0.26 % Propositional check unsatisfiable : 0
% 0.11/0.26 % Propositional clauses : 0
% 0.11/0.26 % Propositional clauses after purity: 0
% 0.11/0.26 % Propositional unsat core size : 0
% 0.11/0.26 % Propositional preprocessing time : 0.000
% 0.11/0.26 % Propositional encoding time : 0.000
% 0.11/0.26 % Propositional solver time : 0.000
% 0.11/0.26 % Success case prop preproc time : 0.000
% 0.11/0.26 % Success case prop encoding time : 0.000
% 0.11/0.26 % Success case prop solver time : 0.000
% 0.11/0.26 % Current number of processed clauses : 81
% 0.11/0.26 % Positive orientable unit clauses : 12
% 0.11/0.26 % Positive unorientable unit clauses: 0
% 0.11/0.26 % Negative unit clauses : 6
% 0.11/0.26 % Non-unit-clauses : 63
% 0.11/0.26 % Current number of unprocessed clauses: 119
% 0.11/0.26 % ...number of literals in the above : 636
% 0.11/0.26 % Current number of archived formulas : 0
% 0.11/0.26 % Current number of archived clauses : 4
% 0.11/0.26 % Clause-clause subsumption calls (NU) : 1028
% 0.11/0.26 % Rec. Clause-clause subsumption calls : 475
% 0.11/0.26 % Non-unit clause-clause subsumptions : 40
% 0.11/0.26 % Unit Clause-clause subsumption calls : 2
% 0.11/0.26 % Rewrite failures with RHS unbound : 0
% 0.11/0.26 % BW rewrite match attempts : 0
% 0.11/0.26 % BW rewrite match successes : 0
% 0.11/0.26 % Condensation attempts : 0
% 0.11/0.26 % Condensation successes : 0
% 0.11/0.26 % Termbank termtop insertions : 15192
% 0.11/0.26 % Search garbage collected termcells : 4746
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.015 s
% 0.11/0.26 % System time : 0.005 s
% 0.11/0.26 % Total time : 0.020 s
% 0.11/0.26 % Maximum resident set size: 4516 pages
% 0.11/0.26
% 0.11/0.26 % -------------------------------------------------
% 0.11/0.26 % User time : 0.033 s
% 0.11/0.26 % System time : 0.012 s
% 0.11/0.26 % Total time : 0.045 s
% 0.11/0.26 % Maximum resident set size: 4864 pages
% 0.11/0.26 % E exiting
%------------------------------------------------------------------------------