%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SYO062^4.003 : TPTP v9.3.1. Released v4.0.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:43:43 AM UTC 2026
% Result : Theorem 0.36s 0.27s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 54 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 194 ( 21 equ; 0 cnn)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 487 ( 73 ~; 61 |; 13 &; 323 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 31 ( 31 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 2 con; 0-3 aty)
% Number of variables : 112 ( 45 ^; 67 !; 0 ?; 112 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
irel: $i > $i > $o ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_29,type,
iatom: ( $i > $o ) > $i > $o ).
thf(decl_30,type,
inot: ( $i > $o ) > $i > $o ).
thf(decl_33,type,
iand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_34,type,
ior: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
ivalid: ( $i > $o ) > $o ).
thf(decl_43,type,
a: $i > $o ).
thf(decl_44,type,
b: $i > $o ).
thf(decl_45,type,
esk1_0: $i ).
thf(decl_46,type,
esk2_1: $i > $i ).
thf(decl_47,type,
esk3_1: $i > $i ).
thf(decl_48,type,
esk4_1: $i > $i ).
thf(decl_49,type,
esk5_1: $i > $i ).
thf(decl_50,type,
esk6_1: $i > $i ).
thf(inot,axiom,
( inot
= ( ^ [X12: $i > $o] : ( mnot @ ( mbox_s4 @ X12 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',inot) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X5: $i] :
~ ( X4 @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',mnot) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X12: $i > $o,X1: $i] :
! [X2: $i] :
( ( irel @ X1 @ X2 )
=> ( X12 @ X2 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',mbox_s4) ).
thf(iand,axiom,
( iand
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mand @ X12 @ X14 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',iand) ).
thf(mand,axiom,
( mand
= ( ^ [X8: $i > $o,X9: $i > $o,X5: $i] :
( ( X8 @ X5 )
& ( X9 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',mand) ).
thf(ior,axiom,
( ior
= ( ^ [X12: $i > $o,X14: $i > $o] : ( mor @ ( mbox_s4 @ X12 ) @ ( mbox_s4 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',ior) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X5: $i] :
( ( X6 @ X5 )
| ( X7 @ X5 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',mor) ).
thf(con,conjecture,
ivalid @ ( inot @ ( inot @ ( ior @ ( iand @ ( iatom @ a ) @ ( iatom @ b ) ) @ ( ior @ ( inot @ ( iatom @ a ) ) @ ( inot @ ( iatom @ b ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',con) ).
thf(iatom,axiom,
( iatom
= ( ^ [X12: $i > $o] : X12 ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',iatom) ).
thf(ivalid,axiom,
( ivalid
= ( ^ [X15: $i > $o] :
! [X13: $i] : ( X15 @ X13 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',ivalid) ).
thf(trans_axiom,axiom,
! [X1: $i,X2: $i,X3: $i] :
( ( ( irel @ X1 @ X2 )
& ( irel @ X2 @ X3 ) )
=> ( irel @ X1 @ X3 ) ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',trans_axiom) ).
thf(refl_axiom,axiom,
! [X1: $i] : ( irel @ X1 @ X1 ),
file('/export/starexec/sandbox/tmp/tmp.leWIB2QmHu/E---3.1_545429.p',refl_axiom) ).
thf(c_0_12,plain,
( inot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X20: $i] :
( ( irel @ Z1 @ X20 )
=> ( Z0 @ X20 ) ) ) ),
inference(fof_simplification,[status(thm)],[inot]) ).
thf(c_0_13,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_14,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X2: $i] :
( ( irel @ Z1 @ X2 )
=> ( Z0 @ X2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_15,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[iand]) ).
thf(c_0_16,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_17,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ior]) ).
thf(c_0_18,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_19,negated_conjecture,
~ ( ivalid @ ( inot @ ( inot @ ( ior @ ( iand @ ( iatom @ a ) @ ( iatom @ b ) ) @ ( ior @ ( inot @ ( iatom @ a ) ) @ ( inot @ ( iatom @ b ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[con]) ).
thf(c_0_20,plain,
( iatom
= ( ^ [Z0: $i > $o] : Z0 ) ),
inference(fof_simplification,[status(thm)],[iatom]) ).
thf(c_0_21,plain,
( inot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X20: $i] :
( ( irel @ Z1 @ X20 )
=> ( Z0 @ X20 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_22,plain,
( iand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
& ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_23,plain,
( ior
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ! [X22: $i] :
( ( irel @ Z2 @ X22 )
=> ( Z0 @ X22 ) )
| ! [X23: $i] :
( ( irel @ Z2 @ X23 )
=> ( Z1 @ X23 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
thf(c_0_24,plain,
( ivalid
= ( ^ [Z0: $i > $o] :
! [X13: $i] : ( Z0 @ X13 ) ) ),
inference(fof_simplification,[status(thm)],[ivalid]) ).
thf(c_0_25,negated_conjecture,
~ ! [X45: $i] :
~ ! [X44: $i] :
( ( irel @ X45 @ X44 )
=> ~ ! [X43: $i] :
( ( irel @ X44 @ X43 )
=> ( ! [X41: $i] :
( ( irel @ X43 @ X41 )
=> ( ( a @ X41 )
& ( b @ X41 ) ) )
| ! [X42: $i] :
( ( irel @ X43 @ X42 )
=> ( ! [X39: $i] :
( ( irel @ X42 @ X39 )
=> ~ ! [X37: $i] :
( ( irel @ X39 @ X37 )
=> ( a @ X37 ) ) )
| ! [X40: $i] :
( ( irel @ X42 @ X40 )
=> ~ ! [X38: $i] :
( ( irel @ X40 @ X38 )
=> ( b @ X38 ) ) ) ) ) ) ) ),
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)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24]) ).
thf(c_0_26,negated_conjecture,
! [X51: $i,X56: $i,X58: $i] :
( ( ( irel @ X51 @ ( esk2_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ( irel @ ( esk2_1 @ X51 ) @ ( esk3_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ~ ( a @ ( esk3_1 @ X51 ) )
| ~ ( b @ ( esk3_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ( irel @ ( esk2_1 @ X51 ) @ ( esk4_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ( irel @ ( esk4_1 @ X51 ) @ ( esk5_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ~ ( irel @ ( esk5_1 @ X51 ) @ X56 )
| ( a @ X56 )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ( irel @ ( esk4_1 @ X51 ) @ ( esk6_1 @ X51 ) )
| ~ ( irel @ esk1_0 @ X51 ) )
& ( ~ ( irel @ ( esk6_1 @ X51 ) @ X58 )
| ( b @ X58 )
| ~ ( irel @ esk1_0 @ X51 ) ) ),
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_25])])])])])]) ).
thf(c_0_27,plain,
! [X47: $i,X48: $i,X49: $i] :
( ~ ( irel @ X47 @ X48 )
| ~ ( irel @ X48 @ X49 )
| ( irel @ X47 @ X49 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[trans_axiom])])]) ).
thf(c_0_28,negated_conjecture,
! [X2: $i,X1: $i] :
( ( b @ X2 )
| ~ ( irel @ ( esk6_1 @ X1 ) @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_29,plain,
! [X1: $i,X2: $i,X3: $i] :
( ( irel @ X1 @ X3 )
| ~ ( irel @ X1 @ X2 )
| ~ ( irel @ X2 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk2_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_31,negated_conjecture,
! [X1: $i] :
( ~ ( a @ ( esk3_1 @ X1 ) )
| ~ ( b @ ( esk3_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ( b @ X1 )
| ~ ( irel @ ( esk6_1 @ X2 ) @ X3 )
| ~ ( irel @ esk1_0 @ X2 )
| ~ ( irel @ X3 @ X1 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_33,negated_conjecture,
! [X2: $i,X1: $i] :
( ( irel @ X1 @ X2 )
| ~ ( irel @ ( esk2_1 @ X1 ) @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X1: $i] :
( ( irel @ ( esk2_1 @ X1 ) @ ( esk3_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_35,negated_conjecture,
! [X1: $i] :
( ( irel @ ( esk2_1 @ X1 ) @ ( esk4_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_36,negated_conjecture,
! [X3: $i,X2: $i,X1: $i] :
( ~ ( irel @ ( esk6_1 @ X1 ) @ X2 )
| ~ ( irel @ X2 @ ( esk3_1 @ X3 ) )
| ~ ( a @ ( esk3_1 @ X3 ) )
| ~ ( irel @ esk1_0 @ X3 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_37,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk3_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_38,negated_conjecture,
! [X2: $i,X1: $i] :
( ( a @ X2 )
| ~ ( irel @ ( esk5_1 @ X1 ) @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_39,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk4_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
thf(c_0_40,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( irel @ ( esk6_1 @ X1 ) @ X2 )
| ~ ( a @ ( esk3_1 @ X2 ) )
| ~ ( irel @ esk1_0 @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_41,negated_conjecture,
! [X1: $i] :
( ( a @ ( esk3_1 @ ( esk5_1 @ X1 ) ) )
| ~ ( irel @ esk1_0 @ ( esk5_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_37]) ).
thf(c_0_42,negated_conjecture,
! [X2: $i,X1: $i] :
( ( irel @ X1 @ X2 )
| ~ ( irel @ ( esk4_1 @ X1 ) @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_39]) ).
thf(c_0_43,negated_conjecture,
! [X1: $i] :
( ( irel @ ( esk4_1 @ X1 ) @ ( esk5_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_44,negated_conjecture,
! [X1: $i,X2: $i] :
( ~ ( irel @ ( esk6_1 @ X1 ) @ ( esk5_1 @ X2 ) )
| ~ ( irel @ esk1_0 @ ( esk5_1 @ X2 ) )
| ~ ( irel @ esk1_0 @ X1 )
| ~ ( irel @ esk1_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_45,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk5_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_46,negated_conjecture,
! [X1: $i] :
( ~ ( irel @ esk1_0 @ ( esk5_1 @ ( esk6_1 @ X1 ) ) )
| ~ ( irel @ esk1_0 @ ( esk6_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
thf(c_0_47,negated_conjecture,
! [X2: $i,X1: $i] :
( ~ ( irel @ X1 @ ( esk5_1 @ ( esk6_1 @ X2 ) ) )
| ~ ( irel @ esk1_0 @ ( esk6_1 @ X2 ) )
| ~ ( irel @ esk1_0 @ X2 )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_46,c_0_29]) ).
thf(c_0_48,negated_conjecture,
! [X1: $i] :
( ( irel @ ( esk4_1 @ X1 ) @ ( esk6_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_49,plain,
! [X46: $i] : ( irel @ X46 @ X46 ),
inference(variable_rename,[status(thm)],[refl_axiom]) ).
thf(c_0_50,negated_conjecture,
! [X1: $i] :
( ~ ( irel @ esk1_0 @ ( esk6_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_47,c_0_45]) ).
thf(c_0_51,negated_conjecture,
! [X1: $i] :
( ( irel @ X1 @ ( esk6_1 @ X1 ) )
| ~ ( irel @ esk1_0 @ X1 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_48]) ).
thf(c_0_52,plain,
! [X1: $i] : ( irel @ X1 @ X1 ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
thf(c_0_53,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO062^4.003 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n017.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 16:21:37 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23 Running higher-order theorem proving
% 0.08/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.leWIB2QmHu/E---3.1_545429.p
% 0.36/0.27 % Version: 3.5.1-ho
% 0.36/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.36/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.27 % Starting post_as_ho3 with 300s (1) cores
% 0.36/0.27 % Starting post_as_ho11 with 300s (1) cores
% 0.36/0.27 % Starting full_lambda_8 with 300s (1) cores
% 0.36/0.27 % new_ho_10_cnf2 with pid 545456 completed with status 0
% 0.36/0.27 % Result found by new_ho_10_cnf2
% 0.36/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.36/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/0.27 % No SInE strategy applied
% 0.36/0.27 % Search class: HHHNF-FFSF11-SHSSMFNN
% 0.36/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.27 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.36/0.27 % Starting lpo1_def_fix with 136s (1) cores
% 0.36/0.27 % Starting lpo1_lambda_fix with 136s (1) cores
% 0.36/0.27 % Starting new_ho_7 with 136s (1) cores
% 0.36/0.27 % new_ho_7 with pid 545467 completed with status 0
% 0.36/0.27 % Result found by new_ho_7
% 0.36/0.27 % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.36/0.27 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.27 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.36/0.27 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.36/0.27 % No SInE strategy applied
% 0.36/0.27 % Search class: HHHNF-FFSF11-SHSSMFNN
% 0.36/0.27 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.36/0.27 % Starting SubtermCWHack with 136s (1) cores
% 0.36/0.27 % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.36/0.27 % Starting lpo1_def_fix with 136s (1) cores
% 0.36/0.27 % Starting lpo1_lambda_fix with 136s (1) cores
% 0.36/0.27 % Starting new_ho_7 with 136s (1) cores
% 0.36/0.27 % Preprocessing time : 0.002 s
% 0.36/0.27
% 0.36/0.27 % Proof found!
% 0.36/0.27 % SZS status Theorem
% 0.36/0.27 % SZS output start CNFRefutation
% See solution above
% 0.36/0.27 % Parsed axioms : 44
% 0.36/0.27 % Removed by relevancy pruning/SinE : 0
% 0.36/0.27 % Initial clauses : 32
% 0.36/0.27 % Removed in clause preprocessing : 22
% 0.36/0.27 % Initial clauses in saturation : 10
% 0.36/0.27 % Processed clauses : 65
% 0.36/0.27 % ...of these trivial : 0
% 0.36/0.27 % ...subsumed : 20
% 0.36/0.27 % ...remaining for further processing : 45
% 0.36/0.27 % Other redundant clauses eliminated : 0
% 0.36/0.27 % Clauses deleted for lack of memory : 0
% 0.36/0.27 % Backward-subsumed : 12
% 0.36/0.27 % Backward-rewritten : 0
% 0.36/0.27 % Generated clauses : 227
% 0.36/0.27 % ...of the previous two non-redundant : 224
% 0.36/0.27 % ...aggressively subsumed : 0
% 0.36/0.27 % Contextual simplify-reflections : 0
% 0.36/0.27 % Paramodulations : 227
% 0.36/0.27 % Factorizations : 0
% 0.36/0.27 % NegExts : 0
% 0.36/0.27 % Equation resolutions : 0
% 0.36/0.27 % Disequality decompositions : 0
% 0.36/0.27 % Total rewrite steps : 1
% 0.36/0.27 % ...of those cached : 0
% 0.36/0.27 % Propositional unsat checks : 0
% 0.36/0.27 % Propositional check models : 0
% 0.36/0.27 % Propositional check unsatisfiable : 0
% 0.36/0.27 % Propositional clauses : 0
% 0.36/0.27 % Propositional clauses after purity: 0
% 0.36/0.27 % Propositional unsat core size : 0
% 0.36/0.27 % Propositional preprocessing time : 0.000
% 0.36/0.27 % Propositional encoding time : 0.000
% 0.36/0.27 % Propositional solver time : 0.000
% 0.36/0.27 % Success case prop preproc time : 0.000
% 0.36/0.27 % Success case prop encoding time : 0.000
% 0.36/0.27 % Success case prop solver time : 0.000
% 0.36/0.27 % Current number of processed clauses : 33
% 0.36/0.27 % Positive orientable unit clauses : 1
% 0.36/0.27 % Positive unorientable unit clauses: 0
% 0.36/0.27 % Negative unit clauses : 0
% 0.36/0.27 % Non-unit-clauses : 32
% 0.36/0.27 % Current number of unprocessed clauses: 167
% 0.36/0.27 % ...number of literals in the above : 740
% 0.36/0.27 % Current number of archived formulas : 0
% 0.36/0.27 % Current number of archived clauses : 12
% 0.36/0.27 % Clause-clause subsumption calls (NU) : 502
% 0.36/0.27 % Rec. Clause-clause subsumption calls : 221
% 0.36/0.27 % Non-unit clause-clause subsumptions : 32
% 0.36/0.27 % Unit Clause-clause subsumption calls : 0
% 0.36/0.27 % Rewrite failures with RHS unbound : 0
% 0.36/0.27 % BW rewrite match attempts : 0
% 0.36/0.27 % BW rewrite match successes : 0
% 0.36/0.27 % Condensation attempts : 65
% 0.36/0.27 % Condensation successes : 0
% 0.36/0.27 % Termbank termtop insertions : 15743
% 0.36/0.27 % Search garbage collected termcells : 749
% 0.36/0.27
% 0.36/0.27 % -------------------------------------------------
% 0.36/0.27 % User time : 0.014 s
% 0.36/0.27 % System time : 0.004 s
% 0.36/0.27 % Total time : 0.018 s
% 0.36/0.27 % Maximum resident set size: 3664 pages
% 0.36/0.27
% 0.36/0.27 % -------------------------------------------------
% 0.36/0.27 % User time : 0.055 s
% 0.36/0.27 % System time : 0.017 s
% 0.36/0.27 % Total time : 0.072 s
% 0.36/0.27 % Maximum resident set size: 4608 pages
% 0.36/0.27 % E exiting
%------------------------------------------------------------------------------