%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM740^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:16:59 AM UTC 2026
% Result : Theorem 0.41s 0.26s
% Output : CNFRefutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 49 ( 38 unt; 0 typ; 0 def)
% Number of atoms : 183 ( 33 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 587 ( 26 ~; 11 |; 5 &; 513 @)
% ( 0 <=>; 32 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 27 ( 24 usr; 6 con; 0-3 aty)
% Number of variables : 83 ( 72 ^; 11 !; 0 ?; 83 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_23,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_24,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_26,type,
in: $i > $i > $o ).
thf(decl_62,type,
imp: $o > $o > $o ).
thf(decl_63,type,
d_not: $o > $o ).
thf(decl_68,type,
l_or: $o > $o > $o ).
thf(decl_78,type,
e_is: $i > $i > $i > $o ).
thf(decl_124,type,
nat: $i ).
thf(decl_125,type,
n_is: $i > $i > $o ).
thf(decl_128,type,
n_some: ( $i > $o ) > $o ).
thf(decl_148,type,
diffprop: $i > $i > $i > $o ).
thf(decl_149,type,
d_29_ii: $i > $i > $o ).
thf(decl_150,type,
iii: $i > $i > $o ).
thf(decl_163,type,
n_ts: $i > $i > $i ).
thf(decl_190,type,
frac: $i ).
thf(decl_192,type,
num: $i > $i ).
thf(decl_193,type,
den: $i > $i ).
thf(decl_194,type,
n_eq: $i > $i > $o ).
thf(decl_195,type,
moref: $i > $i > $o ).
thf(decl_196,type,
lessf: $i > $i > $o ).
thf(decl_197,type,
moreq: $i > $i > $o ).
thf(decl_198,type,
lesseq: $i > $i > $o ).
thf(decl_199,type,
esk1_0: $i ).
thf(decl_200,type,
esk2_0: $i ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_imp) ).
thf(def_moref,axiom,
( moref
= ( ^ [X1: $i,X449: $i] : ( d_29_ii @ ( n_ts @ ( num @ X1 ) @ ( den @ X449 ) ) @ ( n_ts @ ( num @ X449 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_moref) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_d_29_ii) ).
thf(def_n_eq,axiom,
( n_eq
= ( ^ [X1: $i,X436: $i] : ( n_is @ ( n_ts @ ( num @ X1 ) @ ( den @ X436 ) ) @ ( n_ts @ ( num @ X436 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_n_eq) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_l_or) ).
thf(def_lessf,axiom,
( lessf
= ( ^ [X1: $i,X450: $i] : ( iii @ ( n_ts @ ( num @ X1 ) @ ( den @ X450 ) ) @ ( n_ts @ ( num @ X450 ) @ ( den @ X1 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_lessf) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_iii) ).
thf(def_moreq,axiom,
( moreq
= ( ^ [X1: $i,X465: $i] : ( l_or @ ( moref @ X1 @ X465 ) @ ( n_eq @ X1 @ X465 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_moreq) ).
thf(def_n_is,axiom,
( n_is
= ( e_is @ nat ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_n_is) ).
thf(def_lesseq,axiom,
( lesseq
= ( ^ [X1: $i,X466: $i] : ( l_or @ ( lessf @ X1 @ X466 ) @ ( n_eq @ X1 @ X466 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_lesseq) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',def_is_of) ).
thf(satz48,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X487: $i] : ( in @ X487 @ frac )
@ ^ [X488: $i] :
( ( moreq @ X1 @ X488 )
=> ( lesseq @ X488 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',satz48) ).
thf(satz38,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X437: $i] : ( in @ X437 @ frac )
@ ^ [X438: $i] :
( ( n_eq @ X1 @ X438 )
=> ( n_eq @ X438 @ X1 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.fCZXYpbx8q/E---3.1_57057.p',satz38) ).
thf(c_0_15,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_16,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_17,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moref]) ).
thf(c_0_18,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z0 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_19,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_n_eq]) ).
thf(c_0_20,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_21,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessf]) ).
thf(c_0_23,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ Z1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_24,plain,
( moreq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreq]) ).
thf(c_0_25,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_26,plain,
( n_eq
= ( ^ [Z0: $i,Z1: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,def_n_is]) ).
thf(c_0_27,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_20,c_0_16]),c_0_21]) ).
thf(c_0_28,plain,
( lesseq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lesseq]) ).
thf(c_0_29,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] : ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_30,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_31,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_32,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X487: $i] : ( in @ X487 @ frac )
@ ^ [X488: $i] :
( ( moreq @ X1 @ X488 )
=> ( lesseq @ X488 @ X1 ) ) ) ),
inference(assume_negation,[status(cth)],[satz48]) ).
thf(c_0_33,plain,
( moreq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]) ).
thf(c_0_34,plain,
( lesseq
= ( ^ [Z0: $i,Z1: $i] :
( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_28,c_0_29]),c_0_26]),c_0_27]) ).
thf(c_0_35,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_36,negated_conjecture,
~ ! [X527: $i] :
( ( in @ X527 @ frac )
=> ! [X526: $i] :
( ( in @ X526 @ frac )
=> ( ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ( ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) ) )
=> ~ $true )
=> ( e_is @ nat @ ( n_ts @ ( num @ X526 ) @ ( den @ X527 ) ) @ ( n_ts @ ( num @ X527 ) @ ( den @ X526 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_32]),c_0_33]),c_0_34]),c_0_35]) ).
thf(c_0_37,negated_conjecture,
( ( in @ esk1_0 @ frac )
& ( in @ esk2_0 @ frac )
& ( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
& ( $true
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
& ( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ~ $true )
& ~ ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])])]) ).
thf(c_0_38,plain,
! [X555: $i] :
( ( in @ X555 @ frac )
=> ! [X554: $i] :
( ( in @ X554 @ frac )
=> ( ( e_is @ nat @ ( n_ts @ ( num @ X555 ) @ ( den @ X554 ) ) @ ( n_ts @ ( num @ X554 ) @ ( den @ X555 ) ) )
=> ( e_is @ nat @ ( n_ts @ ( num @ X554 ) @ ( den @ X555 ) ) @ ( n_ts @ ( num @ X555 ) @ ( den @ X554 ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz38]),c_0_26]),c_0_35]) ).
thf(c_0_39,negated_conjecture,
( ~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_40,plain,
! [X889: $i,X890: $i] :
( ~ ( in @ X889 @ frac )
| ~ ( in @ X890 @ frac )
| ~ ( e_is @ nat @ ( n_ts @ ( num @ X889 ) @ ( den @ X890 ) ) @ ( n_ts @ ( num @ X890 ) @ ( den @ X889 ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ X890 ) @ ( den @ X889 ) ) @ ( n_ts @ ( num @ X889 ) @ ( den @ X890 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
thf(c_0_41,negated_conjecture,
( ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) )
| ( e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_42,negated_conjecture,
~ ( n_some @ ( diffprop @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) ) ),
inference(cn,[status(thm)],[c_0_39]) ).
thf(c_0_43,plain,
! [X4: $i,X1: $i] :
( ( e_is @ nat @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) )
| ~ ( in @ X1 @ frac )
| ~ ( in @ X4 @ frac )
| ~ ( e_is @ nat @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
thf(c_0_44,negated_conjecture,
e_is @ nat @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ),
inference(sr,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_45,negated_conjecture,
in @ esk2_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_46,negated_conjecture,
in @ esk1_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_47,negated_conjecture,
~ ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM740^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.00/0.11 % Computer : n012.cluster.edu
% 0.00/0.11 % Model : x86_64 x86_64
% 0.00/0.11 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11 % Memory : 8046.5625MB
% 0.00/0.11 % OS : Linux 6.8.0-71-generic
% 0.00/0.11 % CPULimit : 300
% 0.00/0.11 % WCLimit : 300
% 0.00/0.11 % DateTime : Tue Sep 29 12:46:48 UTC 2026
% 0.00/0.11 % CPUTime :
% 0.00/0.11 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.14 Running higher-order theorem proving
% 0.09/0.16 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.fCZXYpbx8q/E---3.1_57057.p
% 0.41/0.26 % Version: 3.5.1-ho
% 0.41/0.26 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.41/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.26 % Starting pre_casc_4 with 1200s (4) cores
% 0.41/0.26 % Starting full_lambda_6 with 300s (1) cores
% 0.41/0.26 % Starting sh10 with 300s (1) cores
% 0.41/0.26 % Starting post_as_ho9 with 300s (1) cores
% 0.41/0.26 % Starting post_as_ho8 with 300s (1) cores
% 0.41/0.26 % pre_casc_4 with pid 57070 completed with status 0
% 0.41/0.26 % Result found by pre_casc_4
% 0.41/0.26 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.41/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.26 % Starting pre_casc_4 with 1200s (4) cores
% 0.41/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.41/0.26 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.41/0.26 % Search class: HGHSM-FSLM31-DHSMMFBN
% 0.41/0.26 % partial match(2): HGHSM-FSLM31-DHSFFFBN
% 0.41/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.41/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.41/0.26 % Starting pre_casc_4 with 121s (1) cores
% 0.41/0.26 % Starting full_lambda_10 with 211s (1) cores
% 0.41/0.26 % Starting new_bool_8 with 210s (1) cores
% 0.41/0.26 % pre_casc_4 with pid 57077 completed with status 0
% 0.41/0.26 % Result found by pre_casc_4
% 0.41/0.26 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.41/0.26 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.41/0.26 % Starting pre_casc_4 with 1200s (4) cores
% 0.41/0.26 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.41/0.26 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.41/0.26 % Search class: HGHSM-FSLM31-DHSMMFBN
% 0.41/0.26 % partial match(2): HGHSM-FSLM31-DHSFFFBN
% 0.41/0.26 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.41/0.26 % Starting SubtermCWHack with 109s (1) cores
% 0.41/0.26 % Starting pre_casc_4 with 121s (1) cores
% 0.41/0.26 % Preprocessing time : 0.005 s
% 0.41/0.26 % Presaturation interreduction done
% 0.41/0.26
% 0.41/0.26 % Proof found!
% 0.41/0.26 % SZS status Theorem
% 0.41/0.26 % SZS output start CNFRefutation
% See solution above
% 0.41/0.26 % Parsed axioms : 562
% 0.41/0.26 % Removed by relevancy pruning/SinE : 395
% 0.41/0.26 % Initial clauses : 284
% 0.41/0.26 % Removed in clause preprocessing : 81
% 0.41/0.26 % Initial clauses in saturation : 203
% 0.41/0.26 % Processed clauses : 391
% 0.41/0.26 % ...of these trivial : 1
% 0.41/0.26 % ...subsumed : 110
% 0.41/0.26 % ...remaining for further processing : 280
% 0.41/0.26 % Other redundant clauses eliminated : 12
% 0.41/0.26 % Clauses deleted for lack of memory : 0
% 0.41/0.26 % Backward-subsumed : 8
% 0.41/0.26 % Backward-rewritten : 0
% 0.41/0.26 % Generated clauses : 774
% 0.41/0.26 % ...of the previous two non-redundant : 719
% 0.41/0.26 % ...aggressively subsumed : 0
% 0.41/0.26 % Contextual simplify-reflections : 7
% 0.41/0.26 % Paramodulations : 734
% 0.41/0.26 % Factorizations : 0
% 0.41/0.26 % NegExts : 0
% 0.41/0.26 % Equation resolutions : 13
% 0.41/0.26 % Disequality decompositions : 0
% 0.41/0.26 % Total rewrite steps : 129
% 0.41/0.26 % ...of those cached : 115
% 0.41/0.26 % Propositional unsat checks : 0
% 0.41/0.26 % Propositional check models : 0
% 0.41/0.26 % Propositional check unsatisfiable : 0
% 0.41/0.26 % Propositional clauses : 0
% 0.41/0.26 % Propositional clauses after purity: 0
% 0.41/0.26 % Propositional unsat core size : 0
% 0.41/0.26 % Propositional preprocessing time : 0.000
% 0.41/0.26 % Propositional encoding time : 0.000
% 0.41/0.26 % Propositional solver time : 0.000
% 0.41/0.26 % Success case prop preproc time : 0.000
% 0.41/0.26 % Success case prop encoding time : 0.000
% 0.41/0.26 % Success case prop solver time : 0.000
% 0.41/0.26 % Current number of processed clauses : 148
% 0.41/0.26 % Positive orientable unit clauses : 28
% 0.41/0.26 % Positive unorientable unit clauses: 0
% 0.41/0.26 % Negative unit clauses : 7
% 0.41/0.26 % Non-unit-clauses : 113
% 0.41/0.26 % Current number of unprocessed clauses: 652
% 0.41/0.26 % ...number of literals in the above : 3920
% 0.41/0.26 % Current number of archived formulas : 0
% 0.41/0.26 % Current number of archived clauses : 132
% 0.41/0.26 % Clause-clause subsumption calls (NU) : 16144
% 0.41/0.26 % Rec. Clause-clause subsumption calls : 3577
% 0.41/0.26 % Non-unit clause-clause subsumptions : 117
% 0.41/0.26 % Unit Clause-clause subsumption calls : 61
% 0.41/0.26 % Rewrite failures with RHS unbound : 0
% 0.41/0.26 % BW rewrite match attempts : 5
% 0.41/0.26 % BW rewrite match successes : 0
% 0.41/0.26 % Condensation attempts : 0
% 0.41/0.26 % Condensation successes : 0
% 0.41/0.26 % Termbank termtop insertions : 95873
% 0.41/0.26 % Search garbage collected termcells : 26147
% 0.41/0.26
% 0.41/0.26 % -------------------------------------------------
% 0.41/0.26 % User time : 0.059 s
% 0.41/0.26 % System time : 0.011 s
% 0.41/0.26 % Total time : 0.070 s
% 0.41/0.26 % Maximum resident set size: 8236 pages
% 0.41/0.26
% 0.41/0.26 % -------------------------------------------------
% 0.41/0.26 % User time : 0.153 s
% 0.41/0.26 % System time : 0.024 s
% 0.41/0.26 % Total time : 0.177 s
% 0.41/0.26 % Maximum resident set size: 5888 pages
% 0.41/0.26 % E exiting
%------------------------------------------------------------------------------