%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL874^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:13:59 AM UTC 2026
% Result : Theorem 0.21s 0.30s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 53 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 124 ( 17 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 351 ( 48 ~; 51 |; 7 &; 242 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 55 ( 55 >; 0 *; 0 +; 0 <<)
% Number of symbols : 18 ( 16 usr; 3 con; 0-3 aty)
% Number of variables : 117 ( 38 ^; 76 !; 3 ?; 117 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_25,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_28,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_33,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_38,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_42,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_44,type,
meuclidean: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rk: $i > $i > $o ).
thf(decl_55,type,
rb: $i > $i > $o ).
thf(decl_56,type,
esk1_1: $i > $i ).
thf(decl_57,type,
esk2_2: $i > ( $i > $o ) > $i ).
thf(decl_58,type,
esk3_2: $i > ( $i > $o ) > $i ).
thf(decl_59,type,
esk4_0: $i ).
thf(decl_60,type,
epred1_0: $i > $o ).
thf(decl_61,type,
esk5_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mor) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mvalid) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',mserial) ).
thf(meuclidean,axiom,
( meuclidean
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X15 @ X17 ) )
=> ( X13 @ X16 @ X17 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',meuclidean) ).
thf(conj,conjecture,
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ rb @ X18 ) @ ( mbox @ rk @ X18 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',conj) ).
thf(ax7,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ rk @ X18 ) @ ( mbox @ rb @ X18 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',ax7) ).
thf(ax2,axiom,
mserial @ rb,
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',ax2) ).
thf(ax5,axiom,
meuclidean @ rk,
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',ax5) ).
thf(ax8,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ rb @ X18 ) @ ( mbox @ rb @ ( mbox @ rk @ X18 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LArQ6UCd8G/E---3.1_2331863.p',ax8) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_14,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_15,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_16,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_13,c_0_14]),c_0_15]) ).
thf(c_0_17,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_18,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_19,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_20,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_21,plain,
( meuclidean
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X15 @ X17 ) )
=> ( Z0 @ X16 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[meuclidean]) ).
thf(c_0_22,negated_conjecture,
~ ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ rb @ X18 ) @ ( mbox @ rk @ X18 ) ) ) ),
inference(assume_negation,[status(cth)],[conj]) ).
thf(c_0_23,plain,
! [X40: $i,X39: $i > $o] :
( ~ ! [X37: $i] :
( ~ ( rk @ X40 @ X37 )
| ( X39 @ X37 ) )
| ! [X38: $i] :
( ~ ( rb @ X40 @ X38 )
| ( X39 @ X38 ) ) ),
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)],[ax7]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_24,plain,
! [X23: $i] :
? [X24: $i] : ( rb @ X23 @ X24 ),
inference(apply_def,[status(thm)],[ax2,c_0_20]) ).
thf(c_0_25,plain,
! [X31: $i,X32: $i,X33: $i] :
( ( ( rk @ X31 @ X32 )
& ( rk @ X31 @ X33 ) )
=> ( rk @ X32 @ X33 ) ),
inference(apply_def,[status(thm)],[ax5,c_0_21]) ).
thf(c_0_26,negated_conjecture,
~ ! [X49: $i,X48: $i > $o] :
( ~ ! [X46: $i] :
( ~ ( rb @ X49 @ X46 )
| ( X48 @ X46 ) )
| ! [X47: $i] :
( ~ ( rk @ X49 @ X47 )
| ( X48 @ X47 ) ) ),
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_22]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_27,plain,
! [X65: $i,X66: $i > $o,X68: $i] :
( ( ( rk @ X65 @ ( esk2_2 @ X65 @ X66 ) )
| ~ ( rb @ X65 @ X68 )
| ( X66 @ X68 ) )
& ( ~ ( X66 @ ( esk2_2 @ X65 @ X66 ) )
| ~ ( rb @ X65 @ X68 )
| ( X66 @ X68 ) ) ),
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_23])])])])])]) ).
thf(c_0_28,plain,
! [X51: $i] : ( rb @ X51 @ ( esk1_1 @ X51 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
thf(c_0_29,plain,
! [X45: $i,X44: $i > $o] :
( ~ ! [X41: $i] :
( ~ ( rb @ X45 @ X41 )
| ( X44 @ X41 ) )
| ! [X43: $i] :
( ~ ( rb @ X45 @ X43 )
| ! [X42: $i] :
( ~ ( rk @ X43 @ X42 )
| ( X44 @ 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)],[ax8]),c_0_16]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_30,plain,
! [X59: $i,X60: $i,X61: $i] :
( ~ ( rk @ X59 @ X60 )
| ~ ( rk @ X59 @ X61 )
| ( rk @ X60 @ X61 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).
thf(c_0_31,negated_conjecture,
! [X76: $i] :
( ( ~ ( rb @ esk4_0 @ X76 )
| ( epred1_0 @ X76 ) )
& ( rk @ esk4_0 @ esk5_0 )
& ~ ( epred1_0 @ esk5_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_26])])])])]) ).
thf(c_0_32,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk2_2 @ X3 @ X4 ) )
| ~ ( rb @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_33,plain,
! [X3: $i] : ( rb @ X3 @ ( esk1_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( rk @ X3 @ ( esk2_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( rb @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_35,plain,
! [X69: $i,X70: $i > $o,X72: $i,X73: $i] :
( ( ( rb @ X69 @ ( esk3_2 @ X69 @ X70 ) )
| ~ ( rb @ X69 @ X72 )
| ~ ( rk @ X72 @ X73 )
| ( X70 @ X73 ) )
& ( ~ ( X70 @ ( esk3_2 @ X69 @ X70 ) )
| ~ ( rb @ X69 @ X72 )
| ~ ( rk @ X72 @ X73 )
| ( X70 @ X73 ) ) ),
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_29])])])])])]) ).
thf(c_0_36,plain,
! [X3: $i,X14: $i,X15: $i] :
( ( rk @ X14 @ X15 )
| ~ ( rk @ X3 @ X14 )
| ~ ( rk @ X3 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_37,negated_conjecture,
rk @ esk4_0 @ esk5_0,
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_38,plain,
! [X3: $i,X4: $i > $o] :
( ( X4 @ ( esk1_1 @ X3 ) )
| ~ ( X4 @ ( esk2_2 @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_39,plain,
! [X4: $i > $o,X3: $i] :
( ( rk @ X3 @ ( esk2_2 @ X3 @ X4 ) )
| ( X4 @ ( esk1_1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
thf(c_0_40,plain,
! [X4: $i > $o,X3: $i,X14: $i,X15: $i] :
( ( X4 @ X15 )
| ~ ( X4 @ ( esk3_2 @ X3 @ X4 ) )
| ~ ( rb @ X3 @ X14 )
| ~ ( rk @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_41,negated_conjecture,
! [X3: $i] :
( ( rk @ X3 @ esk5_0 )
| ~ ( rk @ esk4_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
thf(c_0_42,plain,
! [X3: $i] : ( rk @ X3 @ ( esk1_1 @ X3 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_43,plain,
! [X4: $i > $o,X3: $i,X14: $i,X15: $i] :
( ( rb @ X3 @ ( esk3_2 @ X3 @ X4 ) )
| ( X4 @ X15 )
| ~ ( rb @ X3 @ X14 )
| ~ ( rk @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_44,plain,
! [X14: $i,X3: $i,X4: $i > $o] :
( ( X4 @ X3 )
| ~ ( rk @ ( esk1_1 @ X14 ) @ X3 )
| ~ ( X4 @ ( esk3_2 @ X14 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_40,c_0_33]) ).
thf(c_0_45,negated_conjecture,
rk @ ( esk1_1 @ esk4_0 ) @ esk5_0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_46,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( rb @ X3 @ ( esk3_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( rk @ ( esk1_1 @ X3 ) @ X14 ) ),
inference(spm,[status(thm)],[c_0_43,c_0_33]) ).
thf(c_0_47,negated_conjecture,
! [X4: $i > $o] :
( ( X4 @ esk5_0 )
| ~ ( X4 @ ( esk3_2 @ esk4_0 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
thf(c_0_48,negated_conjecture,
! [X4: $i > $o] :
( ( rb @ esk4_0 @ ( esk3_2 @ esk4_0 @ X4 ) )
| ( X4 @ esk5_0 ) ),
inference(spm,[status(thm)],[c_0_46,c_0_45]) ).
thf(c_0_49,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ X3 )
| ~ ( rb @ esk4_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_50,negated_conjecture,
rb @ esk4_0 @ esk5_0,
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
thf(c_0_51,negated_conjecture,
~ ( epred1_0 @ esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL874^1 : TPTP v9.3.1. Bugfixed v5.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n003.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Tue Sep 29 10:22:13 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/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.LArQ6UCd8G/E---3.1_2331863.p
% 0.21/0.30 % Version: 3.5.1-ho
% 0.21/0.30 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.21/0.30 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.30 % Starting sh5l with 300s (1) cores
% 0.21/0.30 % Starting ho_unfolding_6 with 300s (1) cores
% 0.21/0.30 % ehoh_best2_full_lfho with pid 2331895 completed with status 0
% 0.21/0.30 % Result found by ehoh_best2_full_lfho
% 0.21/0.30 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.21/0.30 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.30 % No SInE strategy applied
% 0.21/0.30 % Search class: HGUNS-FFSF21-SHHSMSBN
% 0.21/0.30 % partial match(3): HGUNF-FFSF22-SHHSMMBN
% 0.21/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.30 % Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.21/0.30 % Starting sh5l with 136s (1) cores
% 0.21/0.30 % Starting new_bool_1 with 136s (1) cores
% 0.21/0.30 % Starting new_bool_2 with 136s (1) cores
% 0.21/0.30 % ehoh_best2_full_lfho with pid 2331902 completed with status 0
% 0.21/0.30 % Result found by ehoh_best2_full_lfho
% 0.21/0.30 % Preprocessing class: HSMSSMSSMLMNHHN.
% 0.21/0.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.30 % Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.21/0.30 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.30 % No SInE strategy applied
% 0.21/0.30 % Search class: HGUNS-FFSF21-SHHSMSBN
% 0.21/0.30 % partial match(3): HGUNF-FFSF22-SHHSMMBN
% 0.21/0.30 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.30 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.30 % Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.21/0.30 % Preprocessing time : 0.002 s
% 0.21/0.30
% 0.21/0.30 % Proof found!
% 0.21/0.30 % SZS status Theorem
% 0.21/0.30 % SZS output start CNFRefutation
% See solution above
% 0.21/0.30 % Parsed axioms : 74
% 0.21/0.30 % Removed by relevancy pruning/SinE : 0
% 0.21/0.30 % Initial clauses : 47
% 0.21/0.30 % Removed in clause preprocessing : 34
% 0.21/0.30 % Initial clauses in saturation : 13
% 0.21/0.30 % Processed clauses : 283
% 0.21/0.30 % ...of these trivial : 58
% 0.21/0.30 % ...subsumed : 31
% 0.21/0.30 % ...remaining for further processing : 194
% 0.21/0.30 % Other redundant clauses eliminated : 14
% 0.21/0.30 % Clauses deleted for lack of memory : 0
% 0.21/0.30 % Backward-subsumed : 4
% 0.21/0.30 % Backward-rewritten : 7
% 0.21/0.30 % Generated clauses : 1450
% 0.21/0.30 % ...of the previous two non-redundant : 984
% 0.21/0.30 % ...aggressively subsumed : 0
% 0.21/0.30 % Contextual simplify-reflections : 0
% 0.21/0.30 % Paramodulations : 1330
% 0.21/0.30 % Factorizations : 0
% 0.21/0.30 % NegExts : 0
% 0.21/0.30 % Equation resolutions : 14
% 0.21/0.30 % Disequality decompositions : 0
% 0.21/0.30 % Total rewrite steps : 496
% 0.21/0.30 % ...of those cached : 392
% 0.21/0.30 % Propositional unsat checks : 0
% 0.21/0.30 % Propositional check models : 0
% 0.21/0.30 % Propositional check unsatisfiable : 0
% 0.21/0.30 % Propositional clauses : 0
% 0.21/0.30 % Propositional clauses after purity: 0
% 0.21/0.30 % Propositional unsat core size : 0
% 0.21/0.30 % Propositional preprocessing time : 0.000
% 0.21/0.30 % Propositional encoding time : 0.000
% 0.21/0.30 % Propositional solver time : 0.000
% 0.21/0.30 % Success case prop preproc time : 0.000
% 0.21/0.30 % Success case prop encoding time : 0.000
% 0.21/0.30 % Success case prop solver time : 0.000
% 0.21/0.30 % Current number of processed clauses : 175
% 0.21/0.30 % Positive orientable unit clauses : 48
% 0.21/0.30 % Positive unorientable unit clauses: 0
% 0.21/0.30 % Negative unit clauses : 1
% 0.21/0.30 % Non-unit-clauses : 126
% 0.21/0.30 % Current number of unprocessed clauses: 666
% 0.21/0.30 % ...number of literals in the above : 1132
% 0.21/0.30 % Current number of archived formulas : 0
% 0.21/0.30 % Current number of archived clauses : 19
% 0.21/0.30 % Clause-clause subsumption calls (NU) : 1454
% 0.21/0.30 % Rec. Clause-clause subsumption calls : 1146
% 0.21/0.30 % Non-unit clause-clause subsumptions : 35
% 0.21/0.30 % Unit Clause-clause subsumption calls : 19
% 0.21/0.30 % Rewrite failures with RHS unbound : 0
% 0.21/0.30 % BW rewrite match attempts : 51
% 0.21/0.30 % BW rewrite match successes : 7
% 0.21/0.30 % Condensation attempts : 0
% 0.21/0.30 % Condensation successes : 0
% 0.21/0.30 % Termbank termtop insertions : 23448
% 0.21/0.30 % Search garbage collected termcells : 958
% 0.21/0.30
% 0.21/0.30 % -------------------------------------------------
% 0.21/0.30 % User time : 0.040 s
% 0.21/0.30 % System time : 0.004 s
% 0.21/0.30 % Total time : 0.044 s
% 0.21/0.30 % Maximum resident set size: 3648 pages
% 0.21/0.30
% 0.21/0.30 % -------------------------------------------------
% 0.21/0.30 % User time : 0.138 s
% 0.21/0.30 % System time : 0.027 s
% 0.21/0.30 % Total time : 0.166 s
% 0.21/0.30 % Maximum resident set size: 4864 pages
% 0.21/0.30 % E exiting
%------------------------------------------------------------------------------