%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM757^4 : TPTP v9.3.1. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:17:02 AM UTC 2026
% Result : Theorem 0.39s 0.42s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 36 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 139 ( 22 equ; 0 cnn)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 501 ( 12 ~; 8 |; 4 &; 463 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 8 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 6 con; 0-3 aty)
% Number of variables : 96 ( 81 ^; 15 !; 0 ?; 96 :)
% 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_73,type,
l_some: $i > ( $i > $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_143,type,
n_pl: $i > $i > $i ).
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_195,type,
moref: $i > $i > $o ).
thf(decl_196,type,
lessf: $i > $i > $o ).
thf(decl_199,type,
n_pf: $i > $i > $i ).
thf(decl_201,type,
esk1_0: $i ).
thf(decl_202,type,
esk2_0: $i ).
thf(decl_203,type,
esk3_0: $i ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_diffprop) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_d_29_ii) ).
thf(def_n_is,axiom,
( n_is
= ( e_is @ nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_n_is) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_iii) ).
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/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_moref) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_n_some) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_is_of) ).
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/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',def_lessf) ).
thf(satz63c,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X546: $i] : ( in @ X546 @ frac )
@ ^ [X547: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ frac )
@ ^ [X4: $i] :
( ( lessf @ ( n_pf @ X1 @ X4 ) @ ( n_pf @ X547 @ X4 ) )
=> ( lessf @ X1 @ X547 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',satz63c) ).
thf(satz63a,axiom,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X542: $i] : ( in @ X542 @ frac )
@ ^ [X543: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ frac )
@ ^ [X4: $i] :
( ( moref @ ( n_pf @ X1 @ X4 ) @ ( n_pf @ X543 @ X4 ) )
=> ( moref @ X1 @ X543 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p',satz63a) ).
thf(c_0_11,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( e_is @ nat @ Z0 @ ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_12,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ Z0 @ ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_13,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( e_is @ nat @ Z0 @ ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_11,def_n_is]) ).
thf(c_0_14,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ Z1 @ ( n_pl @ Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_15,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moref]) ).
thf(c_0_16,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ Z0 @ ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),def_n_some]) ).
thf(c_0_17,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_18,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_19,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_pl @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessf]) ).
thf(c_0_20,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ Z1 @ ( n_pl @ Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_13]),def_n_some]) ).
thf(c_0_21,plain,
( moref
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ ( n_pl @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_22,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,negated_conjecture,
~ ( all_of
@ ^ [X1: $i] : ( in @ X1 @ frac )
@ ^ [X1: $i] :
( all_of
@ ^ [X546: $i] : ( in @ X546 @ frac )
@ ^ [X547: $i] :
( all_of
@ ^ [X4: $i] : ( in @ X4 @ frac )
@ ^ [X4: $i] :
( ( lessf @ ( n_pf @ X1 @ X4 ) @ ( n_pf @ X547 @ X4 ) )
=> ( lessf @ X1 @ X547 ) ) ) ) ),
inference(assume_negation,[status(cth)],[satz63c]) ).
thf(c_0_24,plain,
( lessf
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] : ( e_is @ nat @ ( n_ts @ ( num @ Z1 ) @ ( den @ Z0 ) ) @ ( n_pl @ ( n_ts @ ( num @ Z0 ) @ ( den @ Z1 ) ) @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_25,plain,
! [X644: $i] :
( ( in @ X644 @ frac )
=> ! [X643: $i] :
( ( in @ X643 @ frac )
=> ! [X642: $i] :
( ( in @ X642 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ X644 @ X642 ) ) @ ( den @ ( n_pf @ X643 @ X642 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ X643 @ X642 ) ) @ ( den @ ( n_pf @ X644 @ X642 ) ) ) @ Z0 ) ) )
=> ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ X644 ) @ ( den @ X643 ) ) @ ( n_pl @ ( n_ts @ ( num @ X643 ) @ ( den @ X644 ) ) @ Z0 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz63a]),c_0_21]),c_0_22]) ).
thf(c_0_26,negated_conjecture,
~ ! [X587: $i] :
( ( in @ X587 @ frac )
=> ! [X586: $i] :
( ( in @ X586 @ frac )
=> ! [X585: $i] :
( ( in @ X585 @ frac )
=> ( ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ X586 @ X585 ) ) @ ( den @ ( n_pf @ X587 @ X585 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ X587 @ X585 ) ) @ ( den @ ( n_pf @ X586 @ X585 ) ) ) @ Z0 ) ) )
=> ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ X586 ) @ ( den @ X587 ) ) @ ( n_pl @ ( n_ts @ ( num @ X587 ) @ ( den @ X586 ) ) @ Z0 ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_23]),c_0_24]),c_0_22]) ).
thf(c_0_27,plain,
! [X934: $i,X935: $i,X936: $i] :
( ~ ( in @ X934 @ frac )
| ~ ( in @ X935 @ frac )
| ~ ( in @ X936 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ X934 @ X936 ) ) @ ( den @ ( n_pf @ X935 @ X936 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ X935 @ X936 ) ) @ ( den @ ( n_pf @ X934 @ X936 ) ) ) @ Z0 ) ) )
| ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ X934 ) @ ( den @ X935 ) ) @ ( n_pl @ ( n_ts @ ( num @ X935 ) @ ( den @ X934 ) ) @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
thf(c_0_28,negated_conjecture,
( ( in @ esk1_0 @ frac )
& ( in @ esk2_0 @ frac )
& ( in @ esk3_0 @ frac )
& ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ esk2_0 @ esk3_0 ) ) @ ( den @ ( n_pf @ esk1_0 @ esk3_0 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ esk1_0 @ esk3_0 ) ) @ ( den @ ( n_pf @ esk2_0 @ esk3_0 ) ) ) @ Z0 ) ) )
& ~ ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_pl @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])]) ).
thf(c_0_29,plain,
! [X1: $i,X4: $i,X5: $i] :
( ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ X1 ) @ ( den @ X4 ) ) @ ( n_pl @ ( n_ts @ ( num @ X4 ) @ ( den @ X1 ) ) @ Z0 ) ) )
| ~ ( in @ X1 @ frac )
| ~ ( in @ X4 @ frac )
| ~ ( in @ X5 @ frac )
| ~ ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ X1 @ X5 ) ) @ ( den @ ( n_pf @ X4 @ X5 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ X4 @ X5 ) ) @ ( den @ ( n_pf @ X1 @ X5 ) ) ) @ Z0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ ( n_pf @ esk2_0 @ esk3_0 ) ) @ ( den @ ( n_pf @ esk1_0 @ esk3_0 ) ) ) @ ( n_pl @ ( n_ts @ ( num @ ( n_pf @ esk1_0 @ esk3_0 ) ) @ ( den @ ( n_pf @ esk2_0 @ esk3_0 ) ) ) @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_31,negated_conjecture,
in @ esk3_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_32,negated_conjecture,
in @ esk1_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,negated_conjecture,
in @ esk2_0 @ frac,
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_34,negated_conjecture,
~ ( l_some @ nat
@ ^ [Z0: $i] : ( e_is @ nat @ ( n_ts @ ( num @ esk2_0 ) @ ( den @ esk1_0 ) ) @ ( n_pl @ ( n_ts @ ( num @ esk1_0 ) @ ( den @ esk2_0 ) ) @ Z0 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM757^4 : TPTP v9.3.1. Released v7.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n001.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 12:58:14 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.19/0.29 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.YHZzc2fvyK/E---3.1_1194817.p
% 0.39/0.42 % Version: 3.5.1-ho
% 0.39/0.42 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.39/0.42 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.42 % Starting pre_casc_4 with 1200s (4) cores
% 0.39/0.42 % Starting full_lambda_6 with 300s (1) cores
% 0.39/0.42 % Starting sh10 with 300s (1) cores
% 0.39/0.42 % Starting post_as_ho9 with 300s (1) cores
% 0.39/0.42 % Starting post_as_ho8 with 300s (1) cores
% 0.39/0.42 % pre_casc_4 with pid 1194830 completed with status 0
% 0.39/0.42 % Result found by pre_casc_4
% 0.39/0.42 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.39/0.42 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.42 % Starting pre_casc_4 with 1200s (4) cores
% 0.39/0.42 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.39/0.42 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.39/0.42 % Search class: HGUSM-FSLM31-DHSMMFBN
% 0.39/0.42 % partial match(2): HGUSM-FSLM31-DHSFFFBN
% 0.39/0.42 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.39/0.42 % Starting SubtermCWHack with 109s (1) cores
% 0.39/0.42 % Starting pre_casc_4 with 121s (1) cores
% 0.39/0.42 % Starting sh5l with 135s (1) cores
% 0.39/0.42 % Starting ehoh_best8_lambda with 135s (1) cores
% 0.39/0.42 % pre_casc_4 with pid 1194837 completed with status 0
% 0.39/0.42 % Result found by pre_casc_4
% 0.39/0.42 % Preprocessing class: HSLMSMSMLLLCHSA.
% 0.39/0.42 % Scheduled 5 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.42 % Starting pre_casc_4 with 1200s (4) cores
% 0.39/0.42 % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true))
% 0.39/0.42 % SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.39/0.42 % Search class: HGUSM-FSLM31-DHSMMFBN
% 0.39/0.42 % partial match(2): HGUSM-FSLM31-DHSFFFBN
% 0.39/0.42 % Scheduled 7 strats onto 4 cores with 1200 seconds (1200 total)
% 0.39/0.42 % Starting SubtermCWHack with 109s (1) cores
% 0.39/0.42 % Starting pre_casc_4 with 121s (1) cores
% 0.39/0.42 % Preprocessing time : 0.004 s
% 0.39/0.42 % Presaturation interreduction done
% 0.39/0.42
% 0.39/0.42 % Proof found!
% 0.39/0.42 % SZS status Theorem
% 0.39/0.42 % SZS output start CNFRefutation
% See solution above
% 0.39/0.42 % Parsed axioms : 594
% 0.39/0.42 % Removed by relevancy pruning/SinE : 445
% 0.39/0.42 % Initial clauses : 157
% 0.39/0.42 % Removed in clause preprocessing : 4
% 0.39/0.42 % Initial clauses in saturation : 153
% 0.39/0.42 % Processed clauses : 361
% 0.39/0.42 % ...of these trivial : 3
% 0.39/0.42 % ...subsumed : 39
% 0.39/0.42 % ...remaining for further processing : 319
% 0.39/0.42 % Other redundant clauses eliminated : 14
% 0.39/0.42 % Clauses deleted for lack of memory : 0
% 0.39/0.42 % Backward-subsumed : 0
% 0.39/0.42 % Backward-rewritten : 6
% 0.39/0.42 % Generated clauses : 1559
% 0.39/0.42 % ...of the previous two non-redundant : 1504
% 0.39/0.42 % ...aggressively subsumed : 0
% 0.39/0.42 % Contextual simplify-reflections : 0
% 0.39/0.42 % Paramodulations : 427
% 0.39/0.42 % Factorizations : 0
% 0.39/0.42 % NegExts : 5
% 0.39/0.42 % Equation resolutions : 15
% 0.39/0.42 % Disequality decompositions : 0
% 0.39/0.42 % Total rewrite steps : 219
% 0.39/0.42 % ...of those cached : 175
% 0.39/0.42 % Propositional unsat checks : 0
% 0.39/0.42 % Propositional check models : 0
% 0.39/0.42 % Propositional check unsatisfiable : 0
% 0.39/0.42 % Propositional clauses : 0
% 0.39/0.42 % Propositional clauses after purity: 0
% 0.39/0.42 % Propositional unsat core size : 0
% 0.39/0.42 % Propositional preprocessing time : 0.000
% 0.39/0.42 % Propositional encoding time : 0.000
% 0.39/0.42 % Propositional solver time : 0.000
% 0.39/0.42 % Success case prop preproc time : 0.000
% 0.39/0.42 % Success case prop encoding time : 0.000
% 0.39/0.42 % Success case prop solver time : 0.000
% 0.39/0.42 % Current number of processed clauses : 173
% 0.39/0.42 % Positive orientable unit clauses : 50
% 0.39/0.42 % Positive unorientable unit clauses: 0
% 0.39/0.42 % Negative unit clauses : 7
% 0.39/0.42 % Non-unit-clauses : 116
% 0.39/0.42 % Current number of unprocessed clauses: 1361
% 0.39/0.42 % ...number of literals in the above : 11763
% 0.39/0.42 % Current number of archived formulas : 0
% 0.39/0.42 % Current number of archived clauses : 146
% 0.39/0.42 % Clause-clause subsumption calls (NU) : 16303
% 0.39/0.42 % Rec. Clause-clause subsumption calls : 3105
% 0.39/0.42 % Non-unit clause-clause subsumptions : 32
% 0.39/0.42 % Unit Clause-clause subsumption calls : 120
% 0.39/0.42 % Rewrite failures with RHS unbound : 0
% 0.39/0.42 % BW rewrite match attempts : 23
% 0.39/0.42 % BW rewrite match successes : 6
% 0.39/0.42 % Condensation attempts : 0
% 0.39/0.42 % Condensation successes : 0
% 0.39/0.42 % Termbank termtop insertions : 102933
% 0.39/0.42 % Search garbage collected termcells : 19245
% 0.39/0.42
% 0.39/0.42 % -------------------------------------------------
% 0.39/0.42 % User time : 0.073 s
% 0.39/0.42 % System time : 0.017 s
% 0.39/0.42 % Total time : 0.090 s
% 0.39/0.42 % Maximum resident set size: 7260 pages
% 0.39/0.42
% 0.39/0.42 % -------------------------------------------------
% 0.39/0.42 % User time : 0.224 s
% 0.39/0.42 % System time : 0.047 s
% 0.39/0.42 % Total time : 0.271 s
% 0.39/0.42 % Maximum resident set size: 5888 pages
% 0.39/0.42 % E exiting
%------------------------------------------------------------------------------