TSTP Solution File: SEU685^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SEU685^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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 : Tue May 21 03:29:08 EDT 2024
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 28
% Syntax : Number of formulae : 53 ( 18 unt; 21 typ; 0 def)
% Number of atoms : 162 ( 26 equ; 0 cnn)
% Maximal formula atoms : 22 ( 5 avg)
% Number of connectives : 685 ( 35 ~; 35 |; 24 &; 565 @)
% ( 2 <=>; 24 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 8 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 39 ( 39 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 21 usr; 8 con; 0-4 aty)
% Number of variables : 135 ( 49 ^ 76 !; 10 ?; 135 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
in: $i > $i > $o ).
thf(decl_23,type,
emptyset: $i ).
thf(decl_24,type,
setadjoin: $i > $i > $i ).
thf(decl_25,type,
dsetconstr: $i > ( $i > $o ) > $i ).
thf(decl_26,type,
subset: $i > $i > $o ).
thf(decl_27,type,
kpair: $i > $i > $i ).
thf(decl_28,type,
cartprod: $i > $i > $i ).
thf(decl_29,type,
singleton: $i > $o ).
thf(decl_30,type,
ex1: $i > ( $i > $o ) > $o ).
thf(decl_31,type,
breln: $i > $i > $i > $o ).
thf(decl_32,type,
func: $i > $i > $i > $o ).
thf(decl_33,type,
funcSet: $i > $i > $i ).
thf(decl_34,type,
ap: $i > $i > $i > $i > $i ).
thf(decl_35,type,
infuncsetfunc: $o ).
thf(decl_36,type,
funcGraphProp1: $o ).
thf(decl_37,type,
esk1_4: $i > $i > $i > $i > $i ).
thf(decl_38,type,
esk2_3: $i > $i > $i > $i ).
thf(decl_39,type,
esk3_0: $i ).
thf(decl_40,type,
esk4_0: $i ).
thf(decl_41,type,
esk5_0: $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/benchmark/theBenchmark.p',ex1) ).
thf(singleton,axiom,
( singleton
= ( ^ [X1: $i] :
? [X2: $i] :
( ( in @ X2 @ X1 )
& ( X1
= ( setadjoin @ X2 @ emptyset ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.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/benchmark/theBenchmark.p',func) ).
thf(breln,axiom,
( breln
= ( ^ [X1: $i,X4: $i,X5: $i] : ( subset @ X5 @ ( cartprod @ X1 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',breln) ).
thf(funcGraphProp1,axiom,
( funcGraphProp1
<=> ! [X1: $i,X4: $i,X8: $i] :
( ( func @ X1 @ X4 @ X8 )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( kpair @ X2 @ ( ap @ X1 @ X4 @ X8 @ X2 ) ) @ X8 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcGraphProp1) ).
thf(infuncsetfunc,axiom,
( infuncsetfunc
<=> ! [X1: $i,X4: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X4 ) )
=> ( func @ X1 @ X4 @ X8 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infuncsetfunc) ).
thf(funcGraphProp3,conjecture,
( infuncsetfunc
=> ( funcGraphProp1
=> ! [X1: $i,X4: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X4 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( kpair @ X2 @ ( ap @ X1 @ X4 @ X8 @ X2 ) ) @ X8 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',funcGraphProp3) ).
thf(c_0_7,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X20: $i] :
( ( in @ X20
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X20 @ 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 )
=> ? [X21: $i] :
( ( in @ X21
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X21 @ emptyset ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[func]) ).
thf(c_0_10,plain,
( breln
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[breln]) ).
thf(c_0_11,plain,
( ex1
= ( ^ [Z0: $i,Z1: $i > $o] :
? [X20: $i] :
( ( in @ X20
@ ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) ) )
& ( ( dsetconstr @ Z0
@ ^ [Z2: $i] : ( Z1 @ Z2 ) )
= ( setadjoin @ X20 @ emptyset ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_7,c_0_8]) ).
thf(c_0_12,plain,
( func
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( ( subset @ Z2 @ ( cartprod @ Z0 @ Z1 ) )
& ! [X2: $i] :
( ( in @ X2 @ Z0 )
=> ? [X21: $i] :
( ( in @ X21
@ ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) ) )
& ( ( dsetconstr @ Z1
@ ^ [Z3: $i] : ( in @ ( kpair @ X2 @ Z3 ) @ Z2 ) )
= ( setadjoin @ X21 @ emptyset ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
thf(c_0_13,axiom,
( funcGraphProp1
= ( ! [X1: $i,X4: $i,X8: $i] :
( ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
& ! [X24: $i] :
( ( in @ X24 @ X1 )
=> ? [X25: $i] :
( ( in @ X25
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X8 ) ) )
& ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X24 @ Z0 ) @ X8 ) )
= ( setadjoin @ X25 @ emptyset ) ) ) ) )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( kpair @ X2 @ ( ap @ X1 @ X4 @ X8 @ X2 ) ) @ X8 ) ) ) ) ),
inference(apply_def,[status(thm)],[funcGraphProp1,c_0_12]) ).
thf(c_0_14,axiom,
( infuncsetfunc
= ( ! [X1: $i,X4: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X4 ) )
=> ( ( subset @ X8 @ ( cartprod @ X1 @ X4 ) )
& ! [X22: $i] :
( ( in @ X22 @ X1 )
=> ? [X23: $i] :
( ( in @ X23
@ ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) ) )
& ( ( dsetconstr @ X4
@ ^ [Z0: $i] : ( in @ ( kpair @ X22 @ Z0 ) @ X8 ) )
= ( setadjoin @ X23 @ emptyset ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[infuncsetfunc,c_0_12]) ).
thf(c_0_15,negated_conjecture,
~ ( ! [X26: $i,X27: $i,X28: $i] :
( ( in @ X28 @ ( funcSet @ X26 @ X27 ) )
=> ( ( subset @ X28 @ ( cartprod @ X26 @ X27 ) )
& ! [X29: $i] :
( ( in @ X29 @ X26 )
=> ? [X30: $i] :
( ( in @ X30
@ ( dsetconstr @ X27
@ ^ [Z0: $i] : ( in @ ( kpair @ X29 @ Z0 ) @ X28 ) ) )
& ( ( dsetconstr @ X27
@ ^ [Z0: $i] : ( in @ ( kpair @ X29 @ Z0 ) @ X28 ) )
= ( setadjoin @ X30 @ emptyset ) ) ) ) ) )
=> ( ! [X31: $i,X32: $i,X33: $i] :
( ( ( subset @ X33 @ ( cartprod @ X31 @ X32 ) )
& ! [X34: $i] :
( ( in @ X34 @ X31 )
=> ? [X35: $i] :
( ( in @ X35
@ ( dsetconstr @ X32
@ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X33 ) ) )
& ( ( dsetconstr @ X32
@ ^ [Z0: $i] : ( in @ ( kpair @ X34 @ Z0 ) @ X33 ) )
= ( setadjoin @ X35 @ emptyset ) ) ) ) )
=> ! [X36: $i] :
( ( in @ X36 @ X31 )
=> ( in @ ( kpair @ X36 @ ( ap @ X31 @ X32 @ X33 @ X36 ) ) @ X33 ) ) )
=> ! [X1: $i,X4: $i,X8: $i] :
( ( in @ X8 @ ( funcSet @ X1 @ X4 ) )
=> ! [X2: $i] :
( ( in @ X2 @ X1 )
=> ( in @ ( kpair @ X2 @ ( ap @ X1 @ X4 @ X8 @ X2 ) ) @ X8 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[funcGraphProp3]),c_0_13]),c_0_14]) ).
thf(c_0_16,negated_conjecture,
! [X37: $i,X38: $i,X39: $i,X40: $i,X42: $i,X43: $i,X44: $i,X46: $i,X47: $i] :
( ( ( subset @ X39 @ ( cartprod @ X37 @ X38 ) )
| ~ ( in @ X39 @ ( funcSet @ X37 @ X38 ) ) )
& ( ( in @ ( esk1_4 @ X37 @ X38 @ X39 @ X40 )
@ ( dsetconstr @ X38
@ ^ [Z0: $i] : ( in @ ( kpair @ X40 @ Z0 ) @ X39 ) ) )
| ~ ( in @ X40 @ X37 )
| ~ ( in @ X39 @ ( funcSet @ X37 @ X38 ) ) )
& ( ( ( dsetconstr @ X38
@ ^ [Z0: $i] : ( in @ ( kpair @ X40 @ Z0 ) @ X39 ) )
= ( setadjoin @ ( esk1_4 @ X37 @ X38 @ X39 @ X40 ) @ emptyset ) )
| ~ ( in @ X40 @ X37 )
| ~ ( in @ X39 @ ( funcSet @ X37 @ X38 ) ) )
& ( ( in @ ( esk2_3 @ X42 @ X43 @ X44 ) @ X42 )
| ~ ( subset @ X44 @ ( cartprod @ X42 @ X43 ) )
| ~ ( in @ X47 @ X42 )
| ( in @ ( kpair @ X47 @ ( ap @ X42 @ X43 @ X44 @ X47 ) ) @ X44 ) )
& ( ~ ( in @ X46
@ ( dsetconstr @ X43
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk2_3 @ X42 @ X43 @ X44 ) @ Z0 ) @ X44 ) ) )
| ( ( dsetconstr @ X43
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk2_3 @ X42 @ X43 @ X44 ) @ Z0 ) @ X44 ) )
!= ( setadjoin @ X46 @ emptyset ) )
| ~ ( subset @ X44 @ ( cartprod @ X42 @ X43 ) )
| ~ ( in @ X47 @ X42 )
| ( in @ ( kpair @ X47 @ ( ap @ X42 @ X43 @ X44 @ X47 ) ) @ X44 ) )
& ( in @ esk5_0 @ ( funcSet @ esk3_0 @ esk4_0 ) )
& ( in @ esk6_0 @ esk3_0 )
& ~ ( in @ ( kpair @ esk6_0 @ ( ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk5_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_15])])])])])]) ).
thf(c_0_17,negated_conjecture,
! [X2: $i,X5: $i,X4: $i,X1: $i] :
( ( in @ ( esk2_3 @ X1 @ X2 @ X4 ) @ X1 )
| ( in @ ( kpair @ X5 @ ( ap @ X1 @ X2 @ X4 @ X5 ) ) @ X4 )
| ~ ( subset @ X4 @ ( cartprod @ X1 @ X2 ) )
| ~ ( in @ X5 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1: $i,X2: $i,X4: $i] :
( ( subset @ X1 @ ( cartprod @ X2 @ X4 ) )
| ~ ( in @ X1 @ ( funcSet @ X2 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_19,negated_conjecture,
! [X1: $i,X5: $i,X4: $i,X2: $i] :
( ( in @ ( kpair @ X1 @ ( ap @ X2 @ X4 @ X5 @ X1 ) ) @ X5 )
| ( in @ ( esk2_3 @ X2 @ X4 @ X5 ) @ X2 )
| ~ ( in @ X5 @ ( funcSet @ X2 @ X4 ) )
| ~ ( in @ X1 @ X2 ) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_20,negated_conjecture,
in @ esk5_0 @ ( funcSet @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_21,negated_conjecture,
! [X1: $i,X2: $i,X5: $i,X6: $i,X4: $i] :
( ( in @ ( kpair @ X6 @ ( ap @ X4 @ X2 @ X5 @ X6 ) ) @ X5 )
| ~ ( in @ X1
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk2_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) ) )
| ( ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ ( esk2_3 @ X4 @ X2 @ X5 ) @ Z0 ) @ X5 ) )
!= ( setadjoin @ X1 @ emptyset ) )
| ~ ( subset @ X5 @ ( cartprod @ X4 @ X2 ) )
| ~ ( in @ X6 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_22,negated_conjecture,
! [X1: $i,X5: $i,X4: $i,X2: $i] :
( ( in @ ( esk1_4 @ X1 @ X2 @ X4 @ X5 )
@ ( dsetconstr @ X2
@ ^ [Z0: $i] : ( in @ ( kpair @ X5 @ Z0 ) @ X4 ) ) )
| ~ ( in @ X5 @ X1 )
| ~ ( in @ X4 @ ( funcSet @ X1 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_23,negated_conjecture,
! [X2: $i,X5: $i,X4: $i,X1: $i] :
( ( ( dsetconstr @ X1
@ ^ [Z0: $i] : ( in @ ( kpair @ X2 @ Z0 ) @ X4 ) )
= ( setadjoin @ ( esk1_4 @ X5 @ X1 @ X4 @ X2 ) @ emptyset ) )
| ~ ( in @ X2 @ X5 )
| ~ ( in @ X4 @ ( funcSet @ X5 @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_24,negated_conjecture,
~ ( in @ ( kpair @ esk6_0 @ ( ap @ esk3_0 @ esk4_0 @ esk5_0 @ esk6_0 ) ) @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_25,negated_conjecture,
! [X1: $i] :
( ( in @ ( kpair @ X1 @ ( ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1 ) ) @ esk5_0 )
| ( in @ ( esk2_3 @ esk3_0 @ esk4_0 @ esk5_0 ) @ esk3_0 )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_26,negated_conjecture,
in @ esk6_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
thf(c_0_27,negated_conjecture,
! [X1: $i,X6: $i,X5: $i,X4: $i,X2: $i] :
( ( in @ ( kpair @ X1 @ ( ap @ X2 @ X4 @ X5 @ X1 ) ) @ X5 )
| ~ ( in @ ( esk2_3 @ X2 @ X4 @ X5 ) @ X6 )
| ~ ( subset @ X5 @ ( cartprod @ X2 @ X4 ) )
| ~ ( in @ X5 @ ( funcSet @ X6 @ X4 ) )
| ~ ( 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 @ ( esk2_3 @ esk3_0 @ esk4_0 @ esk5_0 ) @ esk3_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 @ ( kpair @ X1 @ ( ap @ esk3_0 @ esk4_0 @ esk5_0 @ X1 ) ) @ esk5_0 )
| ~ ( subset @ esk5_0 @ ( cartprod @ esk3_0 @ esk4_0 ) )
| ~ ( in @ X1 @ esk3_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_20])]) ).
thf(c_0_30,negated_conjecture,
~ ( subset @ esk5_0 @ ( cartprod @ esk3_0 @ esk4_0 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_26])]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_18]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : SEU685^2 : TPTP v8.2.0. Released v3.7.0.
% 0.09/0.12 % Command : run_E %s %d THM
% 0.11/0.33 % Computer : n029.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Sun May 19 17:02:53 EDT 2024
% 0.11/0.33 % CPUTime :
% 0.17/0.45 Running higher-order theorem proving
% 0.17/0.45 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/benchmark/theBenchmark.p
% 0.17/0.46 # Version: 3.1.0-ho
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLMNHFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.17/0.46 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.46 # Starting pre_casc_5 with 300s (1) cores
% 0.17/0.46 # Starting ehoh_best_sine with 300s (1) cores
% 0.17/0.46 # ehoh_best_sine with pid 31354 completed with status 0
% 0.17/0.46 # Result found by ehoh_best_sine
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLMNHFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.17/0.46 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.46 # Starting pre_casc_5 with 300s (1) cores
% 0.17/0.46 # Starting ehoh_best_sine with 300s (1) cores
% 0.17/0.46 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.46 # Search class: HGUSF-FFSF32-MHFFMFNN
% 0.17/0.46 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.46 # new_ho_10 with pid 31357 completed with status 0
% 0.17/0.46 # Result found by new_ho_10
% 0.17/0.46 # Preprocessing class: HSSSSLSSSLMNHFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting ho_unfolding_6 with 1500s (5) cores
% 0.17/0.47 # Starting ehoh_best_sine_rwall with 300s (1) cores
% 0.17/0.47 # Starting pre_casc_5 with 300s (1) cores
% 0.17/0.47 # Starting ehoh_best_sine with 300s (1) cores
% 0.17/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.17/0.47 # Search class: HGUSF-FFSF32-MHFFMFNN
% 0.17/0.47 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting new_ho_10 with 163s (1) cores
% 0.17/0.47 # Preprocessing time : 0.001 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 22
% 0.17/0.47 # Removed by relevancy pruning/SinE : 15
% 0.17/0.47 # Initial clauses : 8
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 8
% 0.17/0.47 # Processed clauses : 22
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 0
% 0.17/0.47 # ...remaining for further processing : 22
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 1
% 0.17/0.47 # Backward-rewritten : 1
% 0.17/0.47 # Generated clauses : 7
% 0.17/0.47 # ...of the previous two non-redundant : 6
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 1
% 0.17/0.47 # Paramodulations : 7
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Disequality decompositions : 0
% 0.17/0.47 # Total rewrite steps : 5
% 0.17/0.47 # ...of those cached : 2
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 12
% 0.17/0.47 # Positive orientable unit clauses : 3
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 2
% 0.17/0.47 # Non-unit-clauses : 7
% 0.17/0.47 # Current number of unprocessed clauses: 0
% 0.17/0.47 # ...number of literals in the above : 0
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 10
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 30
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 12
% 0.17/0.47 # Non-unit clause-clause subsumptions : 1
% 0.17/0.47 # Unit Clause-clause subsumption calls : 3
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 1
% 0.17/0.47 # BW rewrite match successes : 1
% 0.17/0.47 # Condensation attempts : 22
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 2008
% 0.17/0.47 # Search garbage collected termcells : 520
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.004 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.007 s
% 0.17/0.47 # Maximum resident set size: 1860 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.007 s
% 0.17/0.47 # System time : 0.003 s
% 0.17/0.47 # Total time : 0.010 s
% 0.17/0.47 # Maximum resident set size: 1768 pages
% 0.17/0.47 % E---3.1 exiting
% 0.17/0.47 % E exiting
%------------------------------------------------------------------------------