%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET576^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 : n026.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:21:57 AM UTC 2026
% Result : Theorem 0.21s 0.26s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 42 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 175 ( 20 equ; 0 cnn)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 518 ( 93 ~; 61 |; 7 &; 344 @)
% ( 0 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 6 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 36 ( 36 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 4 con; 0-3 aty)
% Number of variables : 97 ( 57 ^; 40 !; 0 ?; 97 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
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_39,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_51,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_58,type,
intersect: mu > mu > $i > $o ).
thf(decl_59,type,
disjoint: mu > mu > $i > $o ).
thf(decl_60,type,
member: mu > mu > $i > $o ).
thf(decl_62,type,
esk2_3: $i > mu > mu > mu ).
thf(decl_63,type,
esk3_0: $i ).
thf(decl_64,type,
esk4_0: mu ).
thf(decl_65,type,
esk5_0: mu ).
thf(mand,axiom,
( mand
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mnot @ ( mor @ ( mnot @ X4 ) @ ( mnot @ X5 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mand @ ( mimplies @ X4 @ X5 ) @ ( mimplies @ X5 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mequiv) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X13: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X14: mu] : ( mnot @ ( X13 @ X14 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mexists_ind) ).
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.K66JS7beVU/E---3.1_599772.p',mforall_ind) ).
thf(prove_th17,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X20: mu] :
( mforall_ind
@ ^ [X21: mu] :
( mimplies
@ ( mforall_ind
@ ^ [X22: mu] : ( mimplies @ ( member @ X22 @ X20 ) @ ( mnot @ ( member @ X22 @ X21 ) ) ) )
@ ( disjoint @ X20 @ X21 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',prove_th17) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',mvalid) ).
thf(intersect_defn,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X20: mu] :
( mforall_ind
@ ^ [X21: mu] :
( mequiv @ ( intersect @ X20 @ X21 )
@ ( mexists_ind
@ ^ [X22: mu] : ( mand @ ( member @ X22 @ X20 ) @ ( member @ X22 @ X21 ) ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',intersect_defn) ).
thf(disjoint_defn,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X20: mu] :
( mforall_ind
@ ^ [X21: mu] : ( mequiv @ ( disjoint @ X20 @ X21 ) @ ( mnot @ ( intersect @ X20 @ X21 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.K66JS7beVU/E---3.1_599772.p',disjoint_defn) ).
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,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_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,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X29: mu] :
( ( exists_in_world @ X29 @ Z1 )
=> ~ ( Z0 @ X29 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_19,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_20,negated_conjecture,
~ ( mvalid
@ ( mforall_ind
@ ^ [X20: mu] :
( mforall_ind
@ ^ [X21: mu] :
( mimplies
@ ( mforall_ind
@ ^ [X22: mu] : ( mimplies @ ( member @ X22 @ X20 ) @ ( mnot @ ( member @ X22 @ X21 ) ) ) )
@ ( disjoint @ X20 @ X21 ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_th17]) ).
thf(c_0_21,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_22,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_15,c_0_16]),c_0_17]) ).
thf(c_0_23,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X29: mu] :
( ( exists_in_world @ X29 @ Z1 )
=> ~ ( Z0 @ X29 @ Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18,c_0_12]),c_0_19]) ).
thf(c_0_24,negated_conjecture,
~ ! [X49: $i,X48: mu] :
( ( exists_in_world @ X48 @ X49 )
=> ! [X47: mu] :
( ( exists_in_world @ X47 @ X49 )
=> ( ~ ! [X46: mu] :
( ( exists_in_world @ X46 @ X49 )
=> ( ~ ( member @ X46 @ X48 @ X49 )
| ~ ( member @ X46 @ X47 @ X49 ) ) )
| ( disjoint @ X48 @ X47 @ X49 ) ) ) ),
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_20]),c_0_12]),c_0_17]),c_0_19]),c_0_21])]) ).
thf(c_0_25,plain,
! [X39: $i,X38: mu] :
( ( exists_in_world @ X38 @ X39 )
=> ! [X37: mu] :
( ( exists_in_world @ X37 @ X39 )
=> ~ ( ~ ( ~ ( intersect @ X38 @ X37 @ X39 )
| ~ ! [X36: mu] :
( ( exists_in_world @ X36 @ X39 )
=> ~ ~ ( ~ ( member @ X36 @ X38 @ X39 )
| ~ ( member @ X36 @ X37 @ X39 ) ) ) )
| ~ ( ~ ~ ! [X36: mu] :
( ( exists_in_world @ X36 @ X39 )
=> ~ ~ ( ~ ( member @ X36 @ X38 @ X39 )
| ~ ( member @ X36 @ X37 @ X39 ) ) )
| ( intersect @ X38 @ X37 @ X39 ) ) ) ) ),
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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[intersect_defn]),c_0_16]),c_0_22]),c_0_19]),c_0_23]),c_0_21])]) ).
thf(c_0_26,plain,
! [X42: $i,X41: mu] :
( ( exists_in_world @ X41 @ X42 )
=> ! [X40: mu] :
( ( exists_in_world @ X40 @ X42 )
=> ~ ( ~ ( ~ ( disjoint @ X41 @ X40 @ X42 )
| ~ ( intersect @ X41 @ X40 @ X42 ) )
| ~ ( ( intersect @ X41 @ X40 @ X42 )
| ( disjoint @ X41 @ X40 @ X42 ) ) ) ) ),
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)],[disjoint_defn]),c_0_12]),c_0_22]),c_0_19]),c_0_21])]) ).
thf(c_0_27,negated_conjecture,
! [X73: mu] :
( ( exists_in_world @ esk4_0 @ esk3_0 )
& ( exists_in_world @ esk5_0 @ esk3_0 )
& ( ~ ( exists_in_world @ X73 @ esk3_0 )
| ~ ( member @ X73 @ esk4_0 @ esk3_0 )
| ~ ( member @ X73 @ esk5_0 @ esk3_0 ) )
& ~ ( disjoint @ esk4_0 @ esk5_0 @ esk3_0 ) ),
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_24])])])])]) ).
thf(c_0_28,plain,
! [X59: $i,X60: mu,X61: mu,X63: mu] :
( ( ( exists_in_world @ ( esk2_3 @ X59 @ X60 @ X61 ) @ X59 )
| ~ ( intersect @ X60 @ X61 @ X59 )
| ~ ( exists_in_world @ X61 @ X59 )
| ~ ( exists_in_world @ X60 @ X59 ) )
& ( ( member @ ( esk2_3 @ X59 @ X60 @ X61 ) @ X60 @ X59 )
| ~ ( intersect @ X60 @ X61 @ X59 )
| ~ ( exists_in_world @ X61 @ X59 )
| ~ ( exists_in_world @ X60 @ X59 ) )
& ( ( member @ ( esk2_3 @ X59 @ X60 @ X61 ) @ X61 @ X59 )
| ~ ( intersect @ X60 @ X61 @ X59 )
| ~ ( exists_in_world @ X61 @ X59 )
| ~ ( exists_in_world @ X60 @ X59 ) )
& ( ~ ( exists_in_world @ X63 @ X59 )
| ~ ( member @ X63 @ X60 @ X59 )
| ~ ( member @ X63 @ X61 @ X59 )
| ( intersect @ X60 @ X61 @ X59 )
| ~ ( exists_in_world @ X61 @ X59 )
| ~ ( exists_in_world @ X60 @ X59 ) ) ),
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_29,plain,
! [X64: $i,X65: mu,X66: mu] :
( ( ~ ( disjoint @ X65 @ X66 @ X64 )
| ~ ( intersect @ X65 @ X66 @ X64 )
| ~ ( exists_in_world @ X66 @ X64 )
| ~ ( exists_in_world @ X65 @ X64 ) )
& ( ( intersect @ X65 @ X66 @ X64 )
| ( disjoint @ X65 @ X66 @ X64 )
| ~ ( exists_in_world @ X66 @ X64 )
| ~ ( exists_in_world @ X65 @ X64 ) ) ),
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_26])])])])]) ).
thf(c_0_30,negated_conjecture,
! [X10: mu] :
( ~ ( exists_in_world @ X10 @ esk3_0 )
| ~ ( member @ X10 @ esk4_0 @ esk3_0 )
| ~ ( member @ X10 @ esk5_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( member @ ( esk2_3 @ X3 @ X10 @ X12 ) @ X12 @ X3 )
| ~ ( intersect @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
exists_in_world @ esk5_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,negated_conjecture,
~ ( disjoint @ esk4_0 @ esk5_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_34,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( intersect @ X10 @ X12 @ X3 )
| ( disjoint @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,negated_conjecture,
exists_in_world @ esk4_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_36,negated_conjecture,
! [X10: mu] :
( ~ ( member @ ( esk2_3 @ esk3_0 @ X10 @ esk5_0 ) @ esk4_0 @ esk3_0 )
| ~ ( exists_in_world @ ( esk2_3 @ esk3_0 @ X10 @ esk5_0 ) @ esk3_0 )
| ~ ( intersect @ X10 @ esk5_0 @ esk3_0 )
| ~ ( exists_in_world @ X10 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
thf(c_0_37,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( member @ ( esk2_3 @ X3 @ X10 @ X12 ) @ X10 @ X3 )
| ~ ( intersect @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_38,negated_conjecture,
intersect @ esk4_0 @ esk5_0 @ esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]),c_0_35])]) ).
thf(c_0_39,negated_conjecture,
~ ( exists_in_world @ ( esk2_3 @ esk3_0 @ esk4_0 @ esk5_0 ) @ esk3_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_35]),c_0_32])]) ).
thf(c_0_40,plain,
! [X12: mu,X10: mu,X3: $i] :
( ( exists_in_world @ ( esk2_3 @ X3 @ X10 @ X12 ) @ X3 )
| ~ ( intersect @ X10 @ X12 @ X3 )
| ~ ( exists_in_world @ X12 @ X3 )
| ~ ( exists_in_world @ X10 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_41,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_39,c_0_40]),c_0_38]),c_0_32]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET576^7 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17 % Computer : n026.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Tue Sep 29 13:40:27 UTC 2026
% 0.09/0.18 % CPUTime :
% 0.09/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running higher-order theorem proving
% 0.09/0.24 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.K66JS7beVU/E---3.1_599772.p
% 0.21/0.26 % Version: 3.5.1-ho
% 0.21/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.26 % Starting new_ho_12 with 300s (1) cores
% 0.21/0.26 % Starting new_bool_2 with 300s (1) cores
% 0.21/0.26 % post_as_ho3 with pid 599804 completed with status 0
% 0.21/0.26 % Result found by post_as_ho3
% 0.21/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.26 % No SInE strategy applied
% 0.21/0.26 % Search class: HGHNS-FFSF32-SHSSMFNN
% 0.21/0.26 % partial match(2): HGHNF-FFSF22-SHSSMFNN
% 0.21/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.26 % SubtermCWHack with pid 599812 completed with status 0
% 0.21/0.26 % Result found by SubtermCWHack
% 0.21/0.26 % Preprocessing class: HSMSSMSSMLLNHSN.
% 0.21/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.26 % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.26 % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.26 % No SInE strategy applied
% 0.21/0.26 % Search class: HGHNS-FFSF32-SHSSMFNN
% 0.21/0.26 % partial match(2): HGHNF-FFSF22-SHSSMFNN
% 0.21/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.26 % Preprocessing time : 0.002 s
% 0.21/0.26
% 0.21/0.26 % Proof found!
% 0.21/0.26 % SZS status Theorem
% 0.21/0.26 % SZS output start CNFRefutation
% See solution above
% 0.21/0.26 % Parsed axioms : 79
% 0.21/0.26 % Removed by relevancy pruning/SinE : 0
% 0.21/0.26 % Initial clauses : 54
% 0.21/0.26 % Removed in clause preprocessing : 39
% 0.21/0.26 % Initial clauses in saturation : 15
% 0.21/0.26 % Processed clauses : 18
% 0.21/0.26 % ...of these trivial : 0
% 0.21/0.26 % ...subsumed : 0
% 0.21/0.26 % ...remaining for further processing : 18
% 0.21/0.26 % Other redundant clauses eliminated : 0
% 0.21/0.26 % Clauses deleted for lack of memory : 0
% 0.21/0.26 % Backward-subsumed : 0
% 0.21/0.26 % Backward-rewritten : 0
% 0.21/0.26 % Generated clauses : 10
% 0.21/0.26 % ...of the previous two non-redundant : 5
% 0.21/0.26 % ...aggressively subsumed : 0
% 0.21/0.26 % Contextual simplify-reflections : 0
% 0.21/0.26 % Paramodulations : 10
% 0.21/0.26 % Factorizations : 0
% 0.21/0.26 % NegExts : 0
% 0.21/0.26 % Equation resolutions : 0
% 0.21/0.26 % Disequality decompositions : 0
% 0.21/0.26 % Total rewrite steps : 15
% 0.21/0.26 % ...of those cached : 12
% 0.21/0.26 % Propositional unsat checks : 0
% 0.21/0.26 % Propositional check models : 0
% 0.21/0.26 % Propositional check unsatisfiable : 0
% 0.21/0.26 % Propositional clauses : 0
% 0.21/0.26 % Propositional clauses after purity: 0
% 0.21/0.26 % Propositional unsat core size : 0
% 0.21/0.26 % Propositional preprocessing time : 0.000
% 0.21/0.26 % Propositional encoding time : 0.000
% 0.21/0.26 % Propositional solver time : 0.000
% 0.21/0.26 % Success case prop preproc time : 0.000
% 0.21/0.26 % Success case prop encoding time : 0.000
% 0.21/0.26 % Success case prop solver time : 0.000
% 0.21/0.26 % Current number of processed clauses : 18
% 0.21/0.26 % Positive orientable unit clauses : 6
% 0.21/0.26 % Positive unorientable unit clauses: 0
% 0.21/0.26 % Negative unit clauses : 2
% 0.21/0.26 % Non-unit-clauses : 10
% 0.21/0.26 % Current number of unprocessed clauses: 2
% 0.21/0.26 % ...number of literals in the above : 10
% 0.21/0.26 % Current number of archived formulas : 0
% 0.21/0.26 % Current number of archived clauses : 0
% 0.21/0.26 % Clause-clause subsumption calls (NU) : 8
% 0.21/0.26 % Rec. Clause-clause subsumption calls : 4
% 0.21/0.26 % Non-unit clause-clause subsumptions : 0
% 0.21/0.26 % Unit Clause-clause subsumption calls : 2
% 0.21/0.26 % Rewrite failures with RHS unbound : 0
% 0.21/0.26 % BW rewrite match attempts : 0
% 0.21/0.26 % BW rewrite match successes : 0
% 0.21/0.26 % Condensation attempts : 0
% 0.21/0.26 % Condensation successes : 0
% 0.21/0.26 % Termbank termtop insertions : 4719
% 0.21/0.26 % Search garbage collected termcells : 1450
% 0.21/0.26
% 0.21/0.26 % -------------------------------------------------
% 0.21/0.26 % User time : 0.009 s
% 0.21/0.26 % System time : 0.002 s
% 0.21/0.26 % Total time : 0.011 s
% 0.21/0.26 % Maximum resident set size: 3964 pages
% 0.21/0.26
% 0.21/0.26 % -------------------------------------------------
% 0.21/0.26 % User time : 0.013 s
% 0.21/0.26 % System time : 0.005 s
% 0.21/0.26 % Total time : 0.017 s
% 0.21/0.26 % Maximum resident set size: 4864 pages
% 0.21/0.26 % E exiting
%------------------------------------------------------------------------------