TSTP Solution File: SEU788^2 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : SEU788^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon Jun 24 15:11:16 EDT 2024
% Result : Theorem 1.25s 0.68s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 53 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 313 ( 11 equ; 0 cnn)
% Maximal formula atoms : 44 ( 5 avg)
% Number of connectives : 1658 ( 157 ~; 177 |; 11 &;1241 @)
% ( 6 <=>; 66 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 12 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 10 con; 0-3 aty)
% Number of variables : 171 ( 0 ^ 171 !; 0 ?; 171 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
subset: $i > $i > $o ).
thf(decl_24,type,
setextsub: $o ).
thf(decl_25,type,
binunion: $i > $i > $i ).
thf(decl_26,type,
kpair: $i > $i > $i ).
thf(decl_27,type,
breln1: $i > $i > $o ).
thf(decl_28,type,
subbreln1: $o ).
thf(decl_29,type,
breln1unionprop: $o ).
thf(decl_30,type,
breln1unionIL: $o ).
thf(decl_31,type,
breln1unionIR: $o ).
thf(decl_32,type,
breln1unionE: $o ).
thf(decl_33,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_34,type,
esk2_3: $i > $i > $i > $i ).
thf(decl_35,type,
esk3_0: $i ).
thf(decl_36,type,
esk4_0: $i ).
thf(decl_37,type,
esk5_0: $i ).
thf(breln1unionCommutes,conjecture,
( setextsub
=> ( subbreln1
=> ( breln1unionprop
=> ( breln1unionIL
=> ( breln1unionIR
=> ( breln1unionE
=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( binunion @ X3 @ X4 )
= ( binunion @ X4 @ X3 ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',breln1unionCommutes) ).
thf(setextsub,axiom,
( setextsub
<=> ! [X1: $i,X2: $i] :
( ( subset @ X1 @ X2 )
=> ( ( subset @ X2 @ X1 )
=> ( X1 = X2 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',setextsub) ).
thf(subbreln1,axiom,
( subbreln1
<=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X5 @ X6 ) @ X3 )
=> ( in @ ( kpair @ X5 @ X6 ) @ X4 ) ) ) )
=> ( subset @ X3 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',subbreln1) ).
thf(breln1unionprop,axiom,
( breln1unionprop
<=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( breln1 @ X1 @ ( binunion @ X3 @ X4 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',breln1unionprop) ).
thf(breln1unionIL,axiom,
( breln1unionIL
<=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X5 @ X6 ) @ X3 )
=> ( in @ ( kpair @ X5 @ X6 ) @ ( binunion @ X3 @ X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',breln1unionIL) ).
thf(breln1unionIR,axiom,
( breln1unionIR
<=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X5 @ X6 ) @ X4 )
=> ( in @ ( kpair @ X5 @ X6 ) @ ( binunion @ X3 @ X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',breln1unionIR) ).
thf(breln1unionE,axiom,
( breln1unionE
<=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ! [X5: $i] :
( ( in @ X5 @ X1 )
=> ! [X6: $i] :
( ( in @ X6 @ X1 )
=> ( ( in @ ( kpair @ X5 @ X6 ) @ ( binunion @ X3 @ X4 ) )
=> ( ( in @ ( kpair @ X5 @ X6 ) @ X3 )
| ( in @ ( kpair @ X5 @ X6 ) @ X4 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vChp3jP4bo/E---3.1_23874.p',breln1unionE) ).
thf(c_0_7,negated_conjecture,
~ ( ! [X35: $i,X36: $i] :
( ( subset @ X35 @ X36 )
=> ( ( subset @ X36 @ X35 )
=> ( X35 = X36 ) ) )
=> ( ! [X37: $i,X38: $i] :
( ( breln1 @ X37 @ X38 )
=> ! [X39: $i] :
( ( breln1 @ X37 @ X39 )
=> ( ! [X40: $i] :
( ( in @ X40 @ X37 )
=> ! [X41: $i] :
( ( in @ X41 @ X37 )
=> ( ( in @ ( kpair @ X40 @ X41 ) @ X38 )
=> ( in @ ( kpair @ X40 @ X41 ) @ X39 ) ) ) )
=> ( subset @ X38 @ X39 ) ) ) )
=> ( ! [X42: $i,X43: $i] :
( ( breln1 @ X42 @ X43 )
=> ! [X44: $i] :
( ( breln1 @ X42 @ X44 )
=> ( breln1 @ X42 @ ( binunion @ X43 @ X44 ) ) ) )
=> ( ! [X45: $i,X46: $i] :
( ( breln1 @ X45 @ X46 )
=> ! [X47: $i] :
( ( breln1 @ X45 @ X47 )
=> ! [X48: $i] :
( ( in @ X48 @ X45 )
=> ! [X49: $i] :
( ( in @ X49 @ X45 )
=> ( ( in @ ( kpair @ X48 @ X49 ) @ X46 )
=> ( in @ ( kpair @ X48 @ X49 ) @ ( binunion @ X46 @ X47 ) ) ) ) ) ) )
=> ( ! [X50: $i,X51: $i] :
( ( breln1 @ X50 @ X51 )
=> ! [X52: $i] :
( ( breln1 @ X50 @ X52 )
=> ! [X53: $i] :
( ( in @ X53 @ X50 )
=> ! [X54: $i] :
( ( in @ X54 @ X50 )
=> ( ( in @ ( kpair @ X53 @ X54 ) @ X52 )
=> ( in @ ( kpair @ X53 @ X54 ) @ ( binunion @ X51 @ X52 ) ) ) ) ) ) )
=> ( ! [X55: $i,X56: $i] :
( ( breln1 @ X55 @ X56 )
=> ! [X57: $i] :
( ( breln1 @ X55 @ X57 )
=> ! [X58: $i] :
( ( in @ X58 @ X55 )
=> ! [X59: $i] :
( ( in @ X59 @ X55 )
=> ( ( in @ ( kpair @ X58 @ X59 ) @ ( binunion @ X56 @ X57 ) )
=> ( ( in @ ( kpair @ X58 @ X59 ) @ X56 )
| ( in @ ( kpair @ X58 @ X59 ) @ X57 ) ) ) ) ) ) )
=> ! [X1: $i,X3: $i] :
( ( breln1 @ X1 @ X3 )
=> ! [X4: $i] :
( ( breln1 @ X1 @ X4 )
=> ( ( binunion @ X3 @ X4 )
= ( binunion @ X4 @ X3 ) ) ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[breln1unionCommutes]),setextsub]),subbreln1]),breln1unionprop]),breln1unionIL]),breln1unionIR]),breln1unionE]) ).
thf(c_0_8,negated_conjecture,
! [X60: $i,X61: $i,X62: $i,X63: $i,X64: $i,X67: $i,X68: $i,X69: $i,X70: $i,X71: $i,X72: $i,X73: $i,X74: $i,X75: $i,X76: $i,X77: $i,X78: $i,X79: $i,X80: $i,X81: $i,X82: $i,X83: $i,X84: $i] :
( ( ~ ( subset @ X60 @ X61 )
| ~ ( subset @ X61 @ X60 )
| ( X60 = X61 ) )
& ( ( in @ ( esk1_3 @ X62 @ X63 @ X64 ) @ X62 )
| ( subset @ X63 @ X64 )
| ~ ( breln1 @ X62 @ X64 )
| ~ ( breln1 @ X62 @ X63 ) )
& ( ( in @ ( esk2_3 @ X62 @ X63 @ X64 ) @ X62 )
| ( subset @ X63 @ X64 )
| ~ ( breln1 @ X62 @ X64 )
| ~ ( breln1 @ X62 @ X63 ) )
& ( ( in @ ( kpair @ ( esk1_3 @ X62 @ X63 @ X64 ) @ ( esk2_3 @ X62 @ X63 @ X64 ) ) @ X63 )
| ( subset @ X63 @ X64 )
| ~ ( breln1 @ X62 @ X64 )
| ~ ( breln1 @ X62 @ X63 ) )
& ( ~ ( in @ ( kpair @ ( esk1_3 @ X62 @ X63 @ X64 ) @ ( esk2_3 @ X62 @ X63 @ X64 ) ) @ X64 )
| ( subset @ X63 @ X64 )
| ~ ( breln1 @ X62 @ X64 )
| ~ ( breln1 @ X62 @ X63 ) )
& ( ~ ( breln1 @ X67 @ X68 )
| ~ ( breln1 @ X67 @ X69 )
| ( breln1 @ X67 @ ( binunion @ X68 @ X69 ) ) )
& ( ~ ( breln1 @ X70 @ X71 )
| ~ ( breln1 @ X70 @ X72 )
| ~ ( in @ X73 @ X70 )
| ~ ( in @ X74 @ X70 )
| ~ ( in @ ( kpair @ X73 @ X74 ) @ X71 )
| ( in @ ( kpair @ X73 @ X74 ) @ ( binunion @ X71 @ X72 ) ) )
& ( ~ ( breln1 @ X75 @ X76 )
| ~ ( breln1 @ X75 @ X77 )
| ~ ( in @ X78 @ X75 )
| ~ ( in @ X79 @ X75 )
| ~ ( in @ ( kpair @ X78 @ X79 ) @ X77 )
| ( in @ ( kpair @ X78 @ X79 ) @ ( binunion @ X76 @ X77 ) ) )
& ( ~ ( breln1 @ X80 @ X81 )
| ~ ( breln1 @ X80 @ X82 )
| ~ ( in @ X83 @ X80 )
| ~ ( in @ X84 @ X80 )
| ~ ( in @ ( kpair @ X83 @ X84 ) @ ( binunion @ X81 @ X82 ) )
| ( in @ ( kpair @ X83 @ X84 ) @ X81 )
| ( in @ ( kpair @ X83 @ X84 ) @ X82 ) )
& ( breln1 @ esk3_0 @ esk4_0 )
& ( breln1 @ esk3_0 @ esk5_0 )
& ( ( binunion @ esk4_0 @ esk5_0 )
!= ( binunion @ esk5_0 @ esk4_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_7])])])])])]) ).
thf(c_0_9,negated_conjecture,
! [X1: $i,X3: $i,X5: $i,X4: $i,X2: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_10,negated_conjecture,
breln1 @ esk3_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_11,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ X2 )
| ( in @ ( kpair @ X4 @ X5 ) @ X3 )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( kpair @ ( esk1_3 @ X1 @ X2 @ X3 ) @ ( esk2_3 @ X1 @ X2 @ X3 ) ) @ X2 )
| ( subset @ X2 @ X3 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( subset @ X2 @ X3 )
| ~ ( in @ ( kpair @ ( esk1_3 @ X1 @ X2 @ X3 ) @ ( esk2_3 @ X1 @ X2 @ X3 ) ) @ X3 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_14,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ esk5_0 ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ X3 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( breln1 @ esk3_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
thf(c_0_15,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X5: $i,X4: $i] :
( ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X2 )
| ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X3 )
| ( subset @ ( binunion @ X2 @ X3 ) @ X4 )
| ~ ( in @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ X5 )
| ~ ( in @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ X5 )
| ~ ( breln1 @ X1 @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X5 @ X3 )
| ~ ( breln1 @ X5 @ X2 )
| ~ ( breln1 @ X1 @ X4 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk2_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( subset @ X2 @ X3 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_17,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( breln1 @ X1 @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_18,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ X2 @ esk5_0 ) )
| ~ ( in @ ( kpair @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk5_0 ) ) @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk5_0 ) ) ) @ X2 )
| ~ ( in @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk5_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk5_0 ) ) @ esk3_0 )
| ~ ( breln1 @ X3 @ ( binunion @ X2 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ X2 )
| ~ ( breln1 @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X3 )
| ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X2 )
| ( subset @ ( binunion @ X2 @ X3 ) @ X4 )
| ~ ( in @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ X1 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X1: $i,X3: $i,X2: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X3 ) @ X1 )
| ( subset @ X2 @ X3 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_21,negated_conjecture,
! [X2: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ X1 @ esk5_0 ) )
| ~ ( in @ ( esk2_3 @ X2 @ X1 @ ( binunion @ X1 @ esk5_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X2 @ X1 @ ( binunion @ X1 @ esk5_0 ) ) @ esk3_0 )
| ~ ( breln1 @ X2 @ ( binunion @ X1 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ X1 )
| ~ ( breln1 @ X2 @ X1 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X3: $i,X2: $i,X4: $i] :
( ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X2 )
| ( in @ ( kpair @ ( esk1_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) @ ( esk2_3 @ X1 @ ( binunion @ X2 @ X3 ) @ X4 ) ) @ X3 )
| ( subset @ ( binunion @ X2 @ X3 ) @ X4 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X4 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]) ).
thf(c_0_23,negated_conjecture,
breln1 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_24,negated_conjecture,
! [X2: $i,X1: $i,X5: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X4 @ X5 ) @ ( binunion @ X2 @ X3 ) )
| ~ ( breln1 @ X1 @ X2 )
| ~ ( breln1 @ X1 @ X3 )
| ~ ( in @ X4 @ X1 )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ ( kpair @ X4 @ X5 ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ ( binunion @ X1 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ X1 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_20]) ).
thf(c_0_26,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ X1 @ esk5_0 ) @ X2 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ X1 @ esk5_0 ) @ X2 ) ) @ esk5_0 )
| ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ X1 @ esk5_0 ) @ X2 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ X1 @ esk5_0 ) @ X2 ) ) @ X1 )
| ( subset @ ( binunion @ X1 @ esk5_0 ) @ X2 )
| ~ ( breln1 @ esk3_0 @ X1 )
| ~ ( breln1 @ esk3_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ esk4_0 ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ X3 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( breln1 @ esk3_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_9,c_0_23]) ).
thf(c_0_28,negated_conjecture,
! [X1: $i,X2: $i,X3: $i,X6: $i,X5: $i,X4: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ ( binunion @ X4 @ X5 ) ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X4 @ X5 ) )
| ~ ( in @ X2 @ X6 )
| ~ ( in @ X1 @ X6 )
| ~ ( breln1 @ X6 @ X3 )
| ~ ( breln1 @ X6 @ X5 )
| ~ ( breln1 @ X6 @ X4 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
thf(c_0_29,negated_conjecture,
! [X2: $i,X1: $i] :
( ( X1 = X2 )
| ~ ( subset @ X1 @ X2 )
| ~ ( subset @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( subset @ X1 @ ( binunion @ X1 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_10])]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk5_0 ) @ X1 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk5_0 ) @ X1 ) ) @ esk5_0 )
| ( subset @ ( binunion @ esk5_0 @ esk5_0 ) @ X1 )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_10]) ).
thf(c_0_32,negated_conjecture,
! [X1: $i,X2: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ esk4_0 ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ esk4_0 )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( breln1 @ esk3_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
thf(c_0_33,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ X2 @ esk4_0 ) )
| ~ ( in @ ( kpair @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) ) @ X2 )
| ~ ( in @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ esk3_0 )
| ~ ( breln1 @ X3 @ ( binunion @ X2 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ X2 )
| ~ ( breln1 @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i] :
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ X1 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ X1 ) ) @ esk4_0 )
| ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ X1 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ X1 ) ) @ esk5_0 )
| ( subset @ ( binunion @ esk4_0 @ esk5_0 ) @ X1 )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i,X2: $i,X4: $i,X3: $i] :
( ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ esk4_0 @ ( binunion @ X3 @ X4 ) ) )
| ~ ( in @ ( kpair @ X1 @ X2 ) @ ( binunion @ X3 @ X4 ) )
| ~ ( in @ X2 @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 )
| ~ ( breln1 @ esk3_0 @ X4 )
| ~ ( breln1 @ esk3_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_23]) ).
thf(c_0_36,negated_conjecture,
! [X1: $i] :
( ( ( binunion @ X1 @ esk5_0 )
= X1 )
| ~ ( subset @ ( binunion @ X1 @ esk5_0 ) @ X1 )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_37,negated_conjecture,
( ( subset @ ( binunion @ esk5_0 @ esk5_0 ) @ esk5_0 )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk5_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_31]),c_0_10])]) ).
thf(c_0_38,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ X2 @ esk4_0 ) )
| ~ ( in @ ( kpair @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) ) @ esk4_0 )
| ~ ( in @ ( esk2_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X3 @ X1 @ ( binunion @ X2 @ esk4_0 ) ) @ esk3_0 )
| ~ ( breln1 @ X3 @ ( binunion @ X2 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ X2 )
| ~ ( breln1 @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_32]) ).
thf(c_0_39,negated_conjecture,
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ ( binunion @ esk5_0 @ esk4_0 ) ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) @ ( binunion @ esk5_0 @ esk4_0 ) ) ) @ esk4_0 )
| ( subset @ ( binunion @ esk4_0 @ esk5_0 ) @ ( binunion @ esk5_0 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_10])]),c_0_20]),c_0_16]) ).
thf(c_0_40,negated_conjecture,
! [X2: $i,X4: $i,X3: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) )
| ~ ( in @ ( kpair @ ( esk1_3 @ X4 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) ) @ ( esk2_3 @ X4 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) ) ) @ ( binunion @ X2 @ X3 ) )
| ~ ( in @ ( esk2_3 @ X4 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X4 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) ) @ esk3_0 )
| ~ ( breln1 @ X4 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ X3 ) ) )
| ~ ( breln1 @ esk3_0 @ X3 )
| ~ ( breln1 @ esk3_0 @ X2 )
| ~ ( breln1 @ X4 @ X1 ) ),
inference(spm,[status(thm)],[c_0_13,c_0_35]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ X1 @ esk4_0 ) @ X2 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ X1 @ esk4_0 ) @ X2 ) ) @ esk4_0 )
| ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ X1 @ esk4_0 ) @ X2 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ X1 @ esk4_0 ) @ X2 ) ) @ X1 )
| ( subset @ ( binunion @ X1 @ esk4_0 ) @ X2 )
| ~ ( breln1 @ esk3_0 @ X1 )
| ~ ( breln1 @ esk3_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_42,negated_conjecture,
( ( ( binunion @ esk5_0 @ esk5_0 )
= esk5_0 )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk5_0 ) ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_10])]) ).
thf(c_0_43,negated_conjecture,
( ( subset @ ( binunion @ esk4_0 @ esk5_0 ) @ ( binunion @ esk5_0 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_10])]),c_0_20]),c_0_16]) ).
thf(c_0_44,negated_conjecture,
( ( binunion @ esk4_0 @ esk5_0 )
!= ( binunion @ esk5_0 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_45,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( subset @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) )
| ~ ( in @ ( kpair @ ( esk1_3 @ X3 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) ) @ ( esk2_3 @ X3 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) ) ) @ X2 )
| ~ ( in @ ( esk2_3 @ X3 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) ) @ esk3_0 )
| ~ ( in @ ( esk1_3 @ X3 @ X1 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) ) @ esk3_0 )
| ~ ( breln1 @ X3 @ ( binunion @ esk4_0 @ ( binunion @ X2 @ esk5_0 ) ) )
| ~ ( breln1 @ esk3_0 @ X2 )
| ~ ( breln1 @ X3 @ X1 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_14]),c_0_10])]) ).
thf(c_0_46,negated_conjecture,
! [X1: $i] :
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ X1 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ X1 ) ) @ esk5_0 )
| ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ X1 ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ X1 ) ) @ esk4_0 )
| ( subset @ ( binunion @ esk5_0 @ esk4_0 ) @ X1 )
| ~ ( breln1 @ esk3_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_41,c_0_10]) ).
thf(c_0_47,negated_conjecture,
( ( binunion @ esk5_0 @ esk5_0 )
= esk5_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_17]),c_0_10])]) ).
thf(c_0_48,negated_conjecture,
( ~ ( subset @ ( binunion @ esk5_0 @ esk4_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_43]),c_0_44]) ).
thf(c_0_49,negated_conjecture,
( ( in @ ( kpair @ ( esk1_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) @ ( esk2_3 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) @ ( binunion @ esk4_0 @ esk5_0 ) ) ) @ esk4_0 )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_47]),c_0_10])]),c_0_20]),c_0_16]),c_0_48]) ).
thf(c_0_50,negated_conjecture,
( ~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) )
| ~ ( breln1 @ esk3_0 @ ( binunion @ esk5_0 @ esk4_0 ) ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_49]),c_0_23])]),c_0_20]),c_0_16]),c_0_48]) ).
thf(c_0_51,negated_conjecture,
~ ( breln1 @ esk3_0 @ ( binunion @ esk4_0 @ esk5_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_17]),c_0_23]),c_0_10])]) ).
thf(c_0_52,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_17]),c_0_10]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU788^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Jun 21 17:25:39 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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.vChp3jP4bo/E---3.1_23874.p
% 1.25/0.68 # Version: 3.2.0-ho
% 1.25/0.68 # Preprocessing class: HSSSSLSSSLSNFFN.
% 1.25/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.68 # Starting lpo6_lambda_fix with 1500s (5) cores
% 1.25/0.68 # Starting post_as_ho8 with 300s (1) cores
% 1.25/0.68 # Starting post_as_ho3 with 300s (1) cores
% 1.25/0.68 # Starting post_as_ho2 with 300s (1) cores
% 1.25/0.68 # lpo6_lambda_fix with pid 24026 completed with status 0
% 1.25/0.68 # Result found by lpo6_lambda_fix
% 1.25/0.68 # Preprocessing class: HSSSSLSSSLSNFFN.
% 1.25/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.68 # Starting lpo6_lambda_fix with 1500s (5) cores
% 1.25/0.68 # No SInE strategy applied
% 1.25/0.68 # Search class: HGUSF-FFSF32-SFFFMFNN
% 1.25/0.68 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.68 # Starting new_ho_10 with 901s (1) cores
% 1.25/0.68 # Starting sh5l with 151s (1) cores
% 1.25/0.68 # Starting sh3l with 151s (1) cores
% 1.25/0.68 # Starting ehoh_best3_rw with 151s (1) cores
% 1.25/0.68 # Starting lpo6_lambda_fix with 146s (1) cores
% 1.25/0.68 # sh3l with pid 24036 completed with status 0
% 1.25/0.68 # Result found by sh3l
% 1.25/0.68 # Preprocessing class: HSSSSLSSSLSNFFN.
% 1.25/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.25/0.68 # Starting lpo6_lambda_fix with 1500s (5) cores
% 1.25/0.68 # No SInE strategy applied
% 1.25/0.68 # Search class: HGUSF-FFSF32-SFFFMFNN
% 1.25/0.68 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.25/0.68 # Starting new_ho_10 with 901s (1) cores
% 1.25/0.68 # Starting sh5l with 151s (1) cores
% 1.25/0.68 # Starting sh3l with 151s (1) cores
% 1.25/0.68 # Preprocessing time : 0.001 s
% 1.25/0.68 # Presaturation interreduction done
% 1.25/0.68
% 1.25/0.68 # Proof found!
% 1.25/0.68 # SZS status Theorem
% 1.25/0.68 # SZS output start CNFRefutation
% See solution above
% 1.25/0.68 # Parsed axioms : 18
% 1.25/0.68 # Removed by relevancy pruning/SinE : 0
% 1.25/0.68 # Initial clauses : 23
% 1.25/0.68 # Removed in clause preprocessing : 11
% 1.25/0.68 # Initial clauses in saturation : 12
% 1.25/0.68 # Processed clauses : 492
% 1.25/0.68 # ...of these trivial : 19
% 1.25/0.68 # ...subsumed : 115
% 1.25/0.68 # ...remaining for further processing : 358
% 1.25/0.68 # Other redundant clauses eliminated : 0
% 1.25/0.68 # Clauses deleted for lack of memory : 0
% 1.25/0.68 # Backward-subsumed : 57
% 1.25/0.68 # Backward-rewritten : 7
% 1.25/0.68 # Generated clauses : 2405
% 1.25/0.68 # ...of the previous two non-redundant : 2221
% 1.25/0.68 # ...aggressively subsumed : 0
% 1.25/0.68 # Contextual simplify-reflections : 44
% 1.25/0.68 # Paramodulations : 2405
% 1.25/0.68 # Factorizations : 0
% 1.25/0.68 # NegExts : 0
% 1.25/0.68 # Equation resolutions : 0
% 1.25/0.68 # Disequality decompositions : 0
% 1.25/0.68 # Total rewrite steps : 2243
% 1.25/0.68 # ...of those cached : 2228
% 1.25/0.68 # Propositional unsat checks : 0
% 1.25/0.68 # Propositional check models : 0
% 1.25/0.68 # Propositional check unsatisfiable : 0
% 1.25/0.68 # Propositional clauses : 0
% 1.25/0.68 # Propositional clauses after purity: 0
% 1.25/0.68 # Propositional unsat core size : 0
% 1.25/0.68 # Propositional preprocessing time : 0.000
% 1.25/0.68 # Propositional encoding time : 0.000
% 1.25/0.68 # Propositional solver time : 0.000
% 1.25/0.68 # Success case prop preproc time : 0.000
% 1.25/0.68 # Success case prop encoding time : 0.000
% 1.25/0.68 # Success case prop solver time : 0.000
% 1.25/0.68 # Current number of processed clauses : 282
% 1.25/0.68 # Positive orientable unit clauses : 15
% 1.25/0.68 # Positive unorientable unit clauses: 0
% 1.25/0.68 # Negative unit clauses : 2
% 1.25/0.68 # Non-unit-clauses : 265
% 1.25/0.68 # Current number of unprocessed clauses: 1723
% 1.25/0.68 # ...number of literals in the above : 16803
% 1.25/0.68 # Current number of archived formulas : 0
% 1.25/0.68 # Current number of archived clauses : 76
% 1.25/0.68 # Clause-clause subsumption calls (NU) : 32789
% 1.25/0.68 # Rec. Clause-clause subsumption calls : 4738
% 1.25/0.68 # Non-unit clause-clause subsumptions : 207
% 1.25/0.68 # Unit Clause-clause subsumption calls : 1158
% 1.25/0.68 # Rewrite failures with RHS unbound : 0
% 1.25/0.68 # BW rewrite match attempts : 18
% 1.25/0.68 # BW rewrite match successes : 3
% 1.25/0.68 # Condensation attempts : 0
% 1.25/0.68 # Condensation successes : 0
% 1.25/0.68 # Termbank termtop insertions : 416424
% 1.25/0.68 # Search garbage collected termcells : 892
% 1.25/0.68
% 1.25/0.68 # -------------------------------------------------
% 1.25/0.68 # User time : 0.161 s
% 1.25/0.68 # System time : 0.008 s
% 1.25/0.68 # Total time : 0.169 s
% 1.25/0.68 # Maximum resident set size: 1968 pages
% 1.25/0.68
% 1.25/0.68 # -------------------------------------------------
% 1.25/0.68 # User time : 0.762 s
% 1.25/0.68 # System time : 0.032 s
% 1.25/0.68 # Total time : 0.794 s
% 1.25/0.68 # Maximum resident set size: 1712 pages
% 1.25/0.68 % E---3.1 exiting
% 1.25/0.68 % E exiting
%------------------------------------------------------------------------------