%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU674^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:24:59 AM UTC 2026
% Result : Theorem 0.24s 0.36s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 31 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 158 ( 26 equ; 0 cnn)
% Maximal formula atoms : 21 ( 5 avg)
% Number of connectives : 593 ( 25 ~; 24 |; 21 &; 498 @)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 20 usr; 7 con; 0-4 aty)
% Number of variables : 135 ( 71 ^; 55 !; 9 ?; 135 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
in: $i > $i > $o ).
thf(decl_24,type,
emptyset: $i ).
thf(decl_25,type,
setadjoin: $i > $i > $i ).
thf(decl_26,type,
setunion: $i > $i ).
thf(decl_27,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_28,type,
subset: $i > $i > $o ).
thf(decl_29,type,
kpair: $i > $i > $i ).
thf(decl_30,type,
cartprod: $i > $i > $i ).
thf(decl_31,type,
singleton: $i > $o ).
thf(decl_32,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_33,type,
breln: $i > $i > $i > $o ).
thf(decl_34,type,
func: $i > $i > $i > $o ).
thf(decl_35,type,
apProp: $o ).
thf(decl_36,type,
ap: $i > $i > $i > $i > $i ).
thf(decl_37,type,
esk1_3: $i > $i > $i > $i ).
thf(decl_38,type,
esk2_0: $i ).
thf(decl_39,type,
esk3_0: $i ).
thf(decl_40,type,
esk4_0: $i ).
thf(decl_41,type,
esk5_1: $i > $i ).
thf(decl_42,type,
esk6_0: $i ).
thf(ex1,axiom,
( ex1
= ( ^ [X1: $i,X3: $i > $o] :
( singleton
@ ( dsetconstr @ X1
@ ^ [X2: $i] : ( X3 @ X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X1
= ( setadjoin @ X2 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',singleton) ).
thf(func,axiom,
( func
= ( ^ [X1: $i,X4: $i,X6: $i] :
( ( breln @ X1 @ X4 @ X6 )
& ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( ex1 @ X4
@ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X6 ) ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',func) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X4: $i,X5: $i] : ( subset @ X5 @ ( cartprod @ X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',breln) ).
thf(apProp,axiom,
( apProp
<=> ! [X1: $i,X4: $i,X8: $i] :
( ( func @ X1 @ X4 @ X8 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X4
@ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X8 ) ) )
@ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',apProp) ).
thf(app,conjecture,
( apProp
=> ! [X1: $i,X4: $i,X8: $i] :
( ( func @ X1 @ X4 @ X8 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( ap @ X1 @ X4 @ X8 @ X2 ) @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',app) ).
thf(ap,axiom,
( ap
= ( ^ [X1: $i,X4: $i,X8: $i,X2: $i] :
( setunion
@ ( dsetconstr @ X4
@ ^ [X7: $i] : ( in @ ( kpair @ X2 @ X7 ) @ X8 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.es8S82rYdL/E---3.1_1108442.p',ap) ).
thf(c_0_7,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X17: $i] :
( ( in @ X17
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X17 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ex1]) ).
thf(c_0_8,plain,
( singleton
= ( ^ [Z0: $i] :
? [X2: $i] :
( ( in @ X2 @ Z0 )
& ( Z0
= ( setadjoin @ X2 @ emptyset ) ) ) ) ),
inference(fof_simplification,[status(thm)],[singleton]) ).
thf(c_0_9,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ? [X18: $i] :
( ( in @ X18
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[func]) ).
thf(c_0_10,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X17: $i] :
( ( in @ X17
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X17 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_11,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_12,plain,
( apProp
<=> ! [X1: $i,X4: $i,X8: $i] :
( ( func @ X1 @ X4 @ X8 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
@ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[apProp]) ).
thf(c_0_13,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ? [X18: $i] :
( ( in @ X18
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X18 @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_14,negated_conjecture,
~ ( apProp
=> ! [X1: $i,X4: $i,X8: $i] :
( ( func @ X1 @ X4 @ X8 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( ap @ X1 @ X4 @ X8 @ X2 ) @ X4 ) ) ) ),
inference(assume_negation,[status(cth)],[app]) ).
thf(c_0_15,plain,
( apProp
= ( ! [X1: $i,X4: $i,X8: $i] :
( ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
& ! [X19: $i] :
( ( in @ X19 @ X1 )
=> ? [X20: $i] :
( ( in @ X20
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X19 @ Z0 ) @ X8 ) ) )
& ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X19 @ Z0 ) @ X8 ) )
= ( setadjoin @ X20 @ emptyset ) ) ) ) )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
@ X4 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_12,c_0_13]) ).
thf(c_0_16,plain,
( ap
= ( ^ [Z0: $i,Z1: $i,Z2: $i,Z3: $i] :
( setunion
@ ( dsetconstr @ Z1
@ ^ [Z4: $i] : ( in @ ( kpair @ Z3 @ Z4 ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[ap]) ).
thf(c_0_17,negated_conjecture,
~ ( ! [X21: $i,X22: $i,X23: $i] :
( ( ( subset @ X23 @ ( cartprod @ X21 @ X22 ) )
& ! [X24: $i] :
( ( in @ X24 @ X21 )
=> ? [X25: $i] :
( ( in @ X25
@ ( dsetconstr @ X22
@ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X23 ) ) )
& ( ( dsetconstr @ X22
@ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X23 ) )
= ( setadjoin @ X25 @ emptyset ) ) ) ) )
=> ! [X26: $i] :
( ( in @ X26 @ X21 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X22
@ ^ [Z0: $i] : ( in @ ( kpair @ X26 @ Z0 ) @ X23 ) ) )
@ X22 ) ) )
=> ! [X1: $i,X4: $i,X8: $i] :
( ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
& ! [X27: $i] :
( ( in @ X27 @ X1 )
=> ? [X28: $i] :
( ( in @ X28
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X27 @ Z0 ) @ X8 ) ) )
& ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X27 @ Z0 ) @ X8 ) )
= ( setadjoin @ X28 @ emptyset ) ) ) ) )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in
@ ( setunion
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X8 ) ) )
@ X4 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_13]),c_0_15]),c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X29: $i,X30: $i,X31: $i,X33: $i,X34: $i,X38: $i] :
( ( ( in @ ( esk1_3 @ X29 @ X30 @ X31 ) @ X29 )
| ~ ( subset @ X31 @ ( cartprod @ X29 @ X30 ) )
| ~ ( in @ X34 @ X29 )
| ( in
@ ( setunion
@ ( dsetconstr @ X30
@ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X31 ) ) )
@ X30 ) )
& ( ~ ( in @ X33
@ ( dsetconstr @ X30
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X29 @ X30 @ X31 ) @ Z0 ) @ X31 ) ) )
| ( ( dsetconstr @ X30
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X29 @ X30 @ X31 ) @ Z0 ) @ X31 ) )
!= ( setadjoin @ X33 @ emptyset ) )
| ~ ( subset @ X31 @ ( cartprod @ X29 @ X30 ) )
| ~ ( in @ X34 @ X29 )
| ( in
@ ( setunion
@ ( dsetconstr @ X30
@ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X31 ) ) )
@ X30 ) )
& ( subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk3_0 ) )
& ( ( in @ ( esk5_1 @ X38 )
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X38 @ Z0 ) @ esk4_0 ) ) )
| ~ ( in @ X38 @ esk2_0 ) )
& ( ( ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X38 @ Z0 ) @ esk4_0 ) )
= ( setadjoin @ ( esk5_1 @ X38 ) @ emptyset ) )
| ~ ( in @ X38 @ esk2_0 ) )
& ( in @ esk6_0 @ esk2_0 )
& ~ ( in
@ ( setunion
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk6_0 @ Z0 ) @ esk4_0 ) ) )
@ esk3_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_17])])])])])]) ).
thf(c_0_19,negated_conjecture,
! [X2: $i,X5: $i,X4: $i,X1: $i] :
( ( in @ ( esk1_3 @ X1 @ X2 @ X4 ) @ X1 )
| ( in
@ ( setunion
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X4 ) ) )
@ X2 )
| ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
| ~ ( in @ X5 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_20,negated_conjecture,
subset @ esk4_0 @ ( cartprod @ esk2_0 @ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X6: $i,X4: $i] :
( ( in
@ ( setunion
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ X6 @ Z0 ) @ X5 ) ) )
@ X2 )
| ~ ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) ) )
| ( ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk1_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) )
!= ( setadjoin @ X1 @ emptyset ) )
| ~ ( subset @ X5 @ ( cartprod @ X4 @ X2 ) )
| ~ ( in @ X6 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i] :
( ( in @ ( esk5_1 @ X1 )
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,negated_conjecture,
! [X1: $i] :
( ( ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) )
= ( setadjoin @ ( esk5_1 @ X1 ) @ emptyset ) )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_24,negated_conjecture,
~ ( in
@ ( setunion
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ esk6_0 @ Z0 ) @ esk4_0 ) ) )
@ esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( in
@ ( setunion
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
@ esk3_0 )
| ( in @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk2_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_26,negated_conjecture,
in @ esk6_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X2: $i] :
( ( in
@ ( setunion
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
@ esk3_0 )
| ~ ( in @ ( esk1_3 @ X2 @ esk3_0 @ esk4_0 ) @ esk2_0 )
| ~ ( subset @ esk4_0 @ ( cartprod @ X2 @ esk3_0 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
thf(c_0_28,negated_conjecture,
in @ ( esk1_3 @ esk2_0 @ esk3_0 @ esk4_0 ) @ esk2_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
thf(c_0_29,negated_conjecture,
! [X1: $i] :
( ( in
@ ( setunion
@ ( dsetconstr @ esk3_0
@ ^ [Z0: $i] : ( in @ ( kpair @ X1 @ Z0 ) @ esk4_0 ) ) )
@ esk3_0 )
| ~ ( in @ X1 @ esk2_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28])]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU674^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.24 % Computer : n020.cluster.edu
% 0.08/0.24 % Model : x86_64 x86_64
% 0.08/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.24 % Memory : 8046.5625MB
% 0.08/0.24 % OS : Linux 6.8.0-71-generic
% 0.08/0.24 % CPULimit : 300
% 0.08/0.24 % WCLimit : 300
% 0.08/0.24 % DateTime : Tue Sep 29 14:08:04 UTC 2026
% 0.08/0.25 % CPUTime :
% 0.08/0.25 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.31 Running higher-order theorem proving
% 0.24/0.33 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.es8S82rYdL/E---3.1_1108442.p
% 0.24/0.36 % Version: 3.5.1-ho
% 0.24/0.36 % partial match(1): HSSSSMSSSLMNHSN
% 0.24/0.36 % Preprocessing class: HSSSSMSSSLMNHFN.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.24/0.36 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.36 % Starting sh2l with 300s (1) cores
% 0.24/0.36 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.24/0.36 % ehoh_best_nonlift_rwall with pid 1108458 completed with status 0
% 0.24/0.36 % Result found by ehoh_best_nonlift_rwall
% 0.24/0.36 % partial match(1): HSSSSMSSSLMNHSN
% 0.24/0.36 % Preprocessing class: HSSSSMSSSLMNHFN.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.24/0.36 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.36 % Starting sh2l with 300s (1) cores
% 0.24/0.36 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.24/0.36 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.24/0.36 % No SInE strategy applied
% 0.24/0.36 % Search class: HGUSF-FFSF31-MHFFMFNN
% 0.24/0.36 % partial match(1): HGUSF-FFSF32-MHFFMFNN
% 0.24/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.36 % SubtermCWHack with pid 1108463 completed with status 0
% 0.24/0.36 % Result found by SubtermCWHack
% 0.24/0.36 % partial match(1): HSSSSMSSSLMNHSN
% 0.24/0.36 % Preprocessing class: HSSSSMSSSLMNHFN.
% 0.24/0.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.36 % Starting ho_unfolding_6 with 1500s (5) cores
% 0.24/0.36 % Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.24/0.36 % Starting sh2l with 300s (1) cores
% 0.24/0.36 % Starting ehoh_best_nonlift_rwall with 300s (1) cores
% 0.24/0.36 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 0, sine = Auto)
% 0.24/0.36 % No SInE strategy applied
% 0.24/0.36 % Search class: HGUSF-FFSF31-MHFFMFNN
% 0.24/0.36 % partial match(1): HGUSF-FFSF32-MHFFMFNN
% 0.24/0.36 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.36 % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.36 % Preprocessing time : 0.001 s
% 0.24/0.36
% 0.24/0.36 % Proof found!
% 0.24/0.36 % SZS status Theorem
% 0.24/0.36 % SZS output start CNFRefutation
% See solution above
% 0.24/0.36 % Parsed axioms : 21
% 0.24/0.36 % Removed by relevancy pruning/SinE : 0
% 0.24/0.36 % Initial clauses : 21
% 0.24/0.36 % Removed in clause preprocessing : 14
% 0.24/0.36 % Initial clauses in saturation : 7
% 0.24/0.36 % Processed clauses : 11
% 0.24/0.36 % ...of these trivial : 0
% 0.24/0.36 % ...subsumed : 0
% 0.24/0.36 % ...remaining for further processing : 11
% 0.24/0.36 % Other redundant clauses eliminated : 0
% 0.24/0.36 % Clauses deleted for lack of memory : 0
% 0.24/0.36 % Backward-subsumed : 0
% 0.24/0.36 % Backward-rewritten : 1
% 0.24/0.36 % Generated clauses : 5
% 0.24/0.36 % ...of the previous two non-redundant : 4
% 0.24/0.36 % ...aggressively subsumed : 0
% 0.24/0.36 % Contextual simplify-reflections : 1
% 0.24/0.36 % Paramodulations : 5
% 0.24/0.36 % Factorizations : 0
% 0.24/0.36 % NegExts : 0
% 0.24/0.36 % Equation resolutions : 0
% 0.24/0.36 % Disequality decompositions : 0
% 0.24/0.36 % Total rewrite steps : 4
% 0.24/0.36 % ...of those cached : 2
% 0.24/0.36 % Propositional unsat checks : 0
% 0.24/0.36 % Propositional check models : 0
% 0.24/0.36 % Propositional check unsatisfiable : 0
% 0.24/0.36 % Propositional clauses : 0
% 0.24/0.36 % Propositional clauses after purity: 0
% 0.24/0.36 % Propositional unsat core size : 0
% 0.24/0.36 % Propositional preprocessing time : 0.000
% 0.24/0.36 % Propositional encoding time : 0.000
% 0.24/0.36 % Propositional solver time : 0.000
% 0.24/0.36 % Success case prop preproc time : 0.000
% 0.24/0.36 % Success case prop encoding time : 0.000
% 0.24/0.36 % Success case prop solver time : 0.000
% 0.24/0.36 % Current number of processed clauses : 10
% 0.24/0.36 % Positive orientable unit clauses : 3
% 0.24/0.36 % Positive unorientable unit clauses: 0
% 0.24/0.36 % Negative unit clauses : 1
% 0.24/0.36 % Non-unit-clauses : 6
% 0.24/0.36 % Current number of unprocessed clauses: 0
% 0.24/0.36 % ...number of literals in the above : 0
% 0.24/0.36 % Current number of archived formulas : 0
% 0.24/0.36 % Current number of archived clauses : 1
% 0.24/0.36 % Clause-clause subsumption calls (NU) : 8
% 0.24/0.36 % Rec. Clause-clause subsumption calls : 2
% 0.24/0.36 % Non-unit clause-clause subsumptions : 1
% 0.24/0.36 % Unit Clause-clause subsumption calls : 0
% 0.24/0.36 % Rewrite failures with RHS unbound : 0
% 0.24/0.36 % BW rewrite match attempts : 1
% 0.24/0.36 % BW rewrite match successes : 1
% 0.24/0.36 % Condensation attempts : 0
% 0.24/0.36 % Condensation successes : 0
% 0.24/0.36 % Termbank termtop insertions : 1971
% 0.24/0.36 % Search garbage collected termcells : 462
% 0.24/0.36
% 0.24/0.36 % -------------------------------------------------
% 0.24/0.36 % User time : 0.006 s
% 0.24/0.36 % System time : 0.003 s
% 0.24/0.36 % Total time : 0.009 s
% 0.24/0.36 % Maximum resident set size: 3648 pages
% 0.24/0.36
% 0.24/0.36 % -------------------------------------------------
% 0.24/0.36 % User time : 0.007 s
% 0.24/0.36 % System time : 0.008 s
% 0.24/0.36 % Total time : 0.015 s
% 0.24/0.36 % Maximum resident set size: 4864 pages
% 0.24/0.36 % E exiting
%------------------------------------------------------------------------------