%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : ITP004^2 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:03:57 AM UTC 2026
% Result : Theorem 0.20s 0.29s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 7
% Syntax : Number of formulae : 33 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 117 ( 7 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 765 ( 58 ~; 58 |; 8 &; 623 @)
% ( 3 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 11 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 77 ( 0 ^; 77 !; 0 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
del: $tType ).
thf(decl_23,type,
bool: del ).
thf(decl_25,type,
arr: del > del > del ).
thf(decl_26,type,
mem: $i > del > $o ).
thf(decl_27,type,
ap: $i > $i > $i ).
thf(decl_29,type,
p: $i > $o ).
thf(decl_32,type,
c_2Epred__set_2ESUBSET: del > $i ).
thf(decl_35,type,
c_2Ebool_2EIN: del > $i ).
thf(decl_36,type,
c_2Epred__set_2ECHOICE: del > $i ).
thf(decl_37,type,
c_2Epred__set_2EDELETE: del > $i ).
thf(decl_38,type,
c_2Epred__set_2EREST: del > $i ).
thf(decl_41,type,
esk1_0: del ).
thf(decl_42,type,
esk2_0: $i ).
thf(decl_44,type,
esk4_3: del > $i > $i > $i ).
thf(ap_tp,axiom,
! [X3: del,X4: del,X5: $i] :
( ( mem @ X5 @ ( arr @ X3 @ X4 ) )
=> ! [X6: $i] :
( ( mem @ X6 @ X3 )
=> ( mem @ ( ap @ X5 @ X6 ) @ X4 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',ap_tp) ).
thf(mem_c_2Epred__set_2EDELETE,axiom,
! [X15: del] : ( mem @ ( c_2Epred__set_2EDELETE @ X15 ) @ ( arr @ ( arr @ X15 @ bool ) @ ( arr @ X15 @ ( arr @ X15 @ bool ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',mem_c_2Epred__set_2EDELETE) ).
thf(conj_thm_2Epred__set_2EIN__DELETE,axiom,
! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ! [X22: $i] :
( ( mem @ X22 @ X15 )
=> ! [X23: $i] :
( ( mem @ X23 @ X15 )
=> ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X22 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X15 ) @ X19 ) @ X23 ) ) )
<=> ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X22 ) @ X19 ) )
& ( X22 != X23 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',conj_thm_2Epred__set_2EIN__DELETE) ).
thf(ax_thm_2Epred__set_2ESUBSET__DEF,axiom,
! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ! [X20: $i] :
( ( mem @ X20 @ ( arr @ X15 @ bool ) )
=> ( ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X15 ) @ X19 ) @ X20 ) )
<=> ! [X21: $i] :
( ( mem @ X21 @ X15 )
=> ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X21 ) @ X19 ) )
=> ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X21 ) @ X20 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',ax_thm_2Epred__set_2ESUBSET__DEF) ).
thf(mem_c_2Epred__set_2ECHOICE,axiom,
! [X15: del] : ( mem @ ( c_2Epred__set_2ECHOICE @ X15 ) @ ( arr @ ( arr @ X15 @ bool ) @ X15 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',mem_c_2Epred__set_2ECHOICE) ).
thf(conj_thm_2Epred__set_2EREST__SUBSET,conjecture,
! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X15 ) @ ( ap @ ( c_2Epred__set_2EREST @ X15 ) @ X19 ) ) @ X19 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',conj_thm_2Epred__set_2EREST__SUBSET) ).
thf(ax_thm_2Epred__set_2EREST__DEF,axiom,
! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ( ( ap @ ( c_2Epred__set_2EREST @ X15 ) @ X19 )
= ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X15 ) @ X19 ) @ ( ap @ ( c_2Epred__set_2ECHOICE @ X15 ) @ X19 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vJ1fUonV8G/E---3.1_1715885.p',ax_thm_2Epred__set_2EREST__DEF) ).
thf(c_0_7,plain,
! [X52: del,X53: del,X54: $i,X55: $i] :
( ~ ( mem @ X54 @ ( arr @ X52 @ X53 ) )
| ~ ( mem @ X55 @ X52 )
| ( mem @ ( ap @ X54 @ X55 ) @ X53 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
thf(c_0_8,plain,
! [X71: del] : ( mem @ ( c_2Epred__set_2EDELETE @ X71 ) @ ( arr @ ( arr @ X71 @ bool ) @ ( arr @ X71 @ ( arr @ X71 @ bool ) ) ) ),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2EDELETE]) ).
thf(c_0_9,plain,
! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ! [X22: $i] :
( ( mem @ X22 @ X15 )
=> ! [X23: $i] :
( ( mem @ X23 @ X15 )
=> ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X22 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X15 ) @ X19 ) @ X23 ) ) )
<=> ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X15 ) @ X22 ) @ X19 ) )
& ( X22 != X23 ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[conj_thm_2Epred__set_2EIN__DELETE]) ).
thf(c_0_10,plain,
! [X2: $i,X5: $i,X4: del,X3: del] :
( ( mem @ ( ap @ X2 @ X5 ) @ X4 )
| ~ ( mem @ X2 @ ( arr @ X3 @ X4 ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
! [X3: del] : ( mem @ ( c_2Epred__set_2EDELETE @ X3 ) @ ( arr @ ( arr @ X3 @ bool ) @ ( arr @ X3 @ ( arr @ X3 @ bool ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
! [X72: del,X73: $i,X74: $i,X75: $i] :
( ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X72 ) @ X74 ) @ X73 ) )
| ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X72 ) @ X74 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X72 ) @ X73 ) @ X75 ) ) )
| ~ ( mem @ X75 @ X72 )
| ~ ( mem @ X74 @ X72 )
| ~ ( mem @ X73 @ ( arr @ X72 @ bool ) ) )
& ( ( X74 != X75 )
| ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X72 ) @ X74 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X72 ) @ X73 ) @ X75 ) ) )
| ~ ( mem @ X75 @ X72 )
| ~ ( mem @ X74 @ X72 )
| ~ ( mem @ X73 @ ( arr @ X72 @ bool ) ) )
& ( ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X72 ) @ X74 ) @ X73 ) )
| ( X74 = X75 )
| ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X72 ) @ X74 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X72 ) @ X73 ) @ X75 ) ) )
| ~ ( mem @ X75 @ X72 )
| ~ ( mem @ X74 @ X72 )
| ~ ( mem @ X73 @ ( arr @ X72 @ bool ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
thf(c_0_13,plain,
! [X65: del,X66: $i,X67: $i,X68: $i] :
( ( ~ ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X65 ) @ X66 ) @ X67 ) )
| ~ ( mem @ X68 @ X65 )
| ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X65 ) @ X68 ) @ X66 ) )
| ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X65 ) @ X68 ) @ X67 ) )
| ~ ( mem @ X67 @ ( arr @ X65 @ bool ) )
| ~ ( mem @ X66 @ ( arr @ X65 @ bool ) ) )
& ( ( mem @ ( esk4_3 @ X65 @ X66 @ X67 ) @ X65 )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X65 ) @ X66 ) @ X67 ) )
| ~ ( mem @ X67 @ ( arr @ X65 @ bool ) )
| ~ ( mem @ X66 @ ( arr @ X65 @ bool ) ) )
& ( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X65 ) @ ( esk4_3 @ X65 @ X66 @ X67 ) ) @ X66 ) )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X65 ) @ X66 ) @ X67 ) )
| ~ ( mem @ X67 @ ( arr @ X65 @ bool ) )
| ~ ( mem @ X66 @ ( arr @ X65 @ bool ) ) )
& ( ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X65 ) @ ( esk4_3 @ X65 @ X66 @ X67 ) ) @ X67 ) )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X65 ) @ X66 ) @ X67 ) )
| ~ ( mem @ X67 @ ( arr @ X65 @ bool ) )
| ~ ( mem @ X66 @ ( arr @ X65 @ bool ) ) ) ),
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)],[ax_thm_2Epred__set_2ESUBSET__DEF])])])])])]) ).
thf(c_0_14,plain,
! [X2: $i,X3: del] :
( ( mem @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ ( arr @ X3 @ ( arr @ X3 @ bool ) ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
! [X2: $i,X6: $i,X5: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X3 ) @ X2 ) @ X5 ) )
| ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X3 ) @ X2 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X5 ) @ X6 ) ) )
| ~ ( mem @ X6 @ X3 )
| ~ ( mem @ X2 @ X3 )
| ~ ( mem @ X5 @ ( arr @ X3 @ bool ) ) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(c_0_16,plain,
! [X2: $i,X5: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X3 ) @ ( esk4_3 @ X3 @ X2 @ X5 ) ) @ X2 ) )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ X2 ) @ X5 ) )
| ~ ( mem @ X5 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
! [X2: $i,X5: $i,X3: del] :
( ( mem @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ X5 ) @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
thf(c_0_18,plain,
! [X70: del] : ( mem @ ( c_2Epred__set_2ECHOICE @ X70 ) @ ( arr @ ( arr @ X70 @ bool ) @ X70 ) ),
inference(variable_rename,[status(thm)],[mem_c_2Epred__set_2ECHOICE]) ).
thf(c_0_19,negated_conjecture,
~ ! [X15: del,X19: $i] :
( ( mem @ X19 @ ( arr @ X15 @ bool ) )
=> ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X15 ) @ ( ap @ ( c_2Epred__set_2EREST @ X15 ) @ X19 ) ) @ X19 ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Epred__set_2EREST__SUBSET]) ).
thf(c_0_20,plain,
! [X2: $i,X5: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ X2 ) @ X5 ) )
| ~ ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X3 ) @ ( esk4_3 @ X3 @ X2 @ X5 ) ) @ X5 ) )
| ~ ( mem @ X5 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_21,plain,
! [X2: $i,X6: $i,X5: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Ebool_2EIN @ X3 ) @ ( esk4_3 @ X3 @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ X5 ) @ X6 ) ) @ X2 ) )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ X5 ) ) @ X6 ) )
| ~ ( mem @ ( esk4_3 @ X3 @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ X5 ) @ X6 ) @ X3 )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X6 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_22,plain,
! [X2: $i,X5: $i,X3: del] :
( ( mem @ ( esk4_3 @ X3 @ X2 @ X5 ) @ X3 )
| ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ X2 ) @ X5 ) )
| ~ ( mem @ X5 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_23,plain,
! [X62: del,X63: $i] :
( ~ ( mem @ X63 @ ( arr @ X62 @ bool ) )
| ( ( ap @ ( c_2Epred__set_2EREST @ X62 ) @ X63 )
= ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X62 ) @ X63 ) @ ( ap @ ( c_2Epred__set_2ECHOICE @ X62 ) @ X63 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Epred__set_2EREST__DEF])])]) ).
thf(c_0_24,plain,
! [X3: del] : ( mem @ ( c_2Epred__set_2ECHOICE @ X3 ) @ ( arr @ ( arr @ X3 @ bool ) @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_25,negated_conjecture,
( ( mem @ esk2_0 @ ( arr @ esk1_0 @ bool ) )
& ~ ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ esk1_0 ) @ ( ap @ ( c_2Epred__set_2EREST @ esk1_0 ) @ esk2_0 ) ) @ esk2_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
thf(c_0_26,plain,
! [X2: $i,X5: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ X5 ) ) @ X2 ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) )
| ~ ( mem @ X5 @ X3 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_17]) ).
thf(c_0_27,plain,
! [X2: $i,X3: del] :
( ( ( ap @ ( c_2Epred__set_2EREST @ X3 ) @ X2 )
= ( ap @ ( ap @ ( c_2Epred__set_2EDELETE @ X3 ) @ X2 ) @ ( ap @ ( c_2Epred__set_2ECHOICE @ X3 ) @ X2 ) ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_28,plain,
! [X2: $i,X3: del] :
( ( mem @ ( ap @ ( c_2Epred__set_2ECHOICE @ X3 ) @ X2 ) @ X3 )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(spm,[status(thm)],[c_0_10,c_0_24]) ).
thf(c_0_29,negated_conjecture,
~ ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ esk1_0 ) @ ( ap @ ( c_2Epred__set_2EREST @ esk1_0 ) @ esk2_0 ) ) @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_30,plain,
! [X2: $i,X3: del] :
( ( p @ ( ap @ ( ap @ ( c_2Epred__set_2ESUBSET @ X3 ) @ ( ap @ ( c_2Epred__set_2EREST @ X3 ) @ X2 ) ) @ X2 ) )
| ~ ( mem @ X2 @ ( arr @ X3 @ bool ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_31,negated_conjecture,
mem @ esk2_0 @ ( arr @ esk1_0 @ bool ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP004^2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.17 % Computer : n004.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 19:20:22 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.21 Running higher-order theorem proving
% 0.08/0.23 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.vJ1fUonV8G/E---3.1_1715885.p
% 0.20/0.29 % Version: 3.5.1-ho
% 0.20/0.29 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_14 with 1200s (4) cores
% 0.20/0.29 % Starting new_ho_13 with 600s (2) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.29 % new_bool_3 with pid 1715901 completed with status 0
% 0.20/0.29 % Result found by new_bool_3
% 0.20/0.29 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_14 with 1200s (4) cores
% 0.20/0.29 % Starting new_ho_13 with 600s (2) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.29 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.29 % Search class: HGHSM-FFMF31-MSFFFFNN
% 0.20/0.29 % partial match(2): FGHSM-FFMF31-MFFFFFNN
% 0.20/0.29 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.29 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.29 % SubtermCWHack with pid 1715902 completed with status 0
% 0.20/0.29 % Result found by SubtermCWHack
% 0.20/0.29 % Preprocessing class: HSMSSMSSSSSNSFA.
% 0.20/0.29 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.29 % Starting new_ho_14 with 1200s (4) cores
% 0.20/0.29 % Starting new_ho_13 with 600s (2) cores
% 0.20/0.29 % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.20/0.29 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.29 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.20/0.29 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.29 % Search class: HGHSM-FFMF31-MSFFFFNN
% 0.20/0.29 % partial match(2): FGHSM-FFMF31-MFFFFFNN
% 0.20/0.29 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.29 % Starting SubtermCWHack with 31s (1) cores
% 0.20/0.29 % Preprocessing time : 0.001 s
% 0.20/0.29
% 0.20/0.29 % Proof found!
% 0.20/0.29 % SZS status Theorem
% 0.20/0.29 % SZS output start CNFRefutation
% See solution above
% 0.20/0.29 % Parsed axioms : 45
% 0.20/0.29 % Removed by relevancy pruning/SinE : 34
% 0.20/0.29 % Initial clauses : 18
% 0.20/0.29 % Removed in clause preprocessing : 0
% 0.20/0.29 % Initial clauses in saturation : 18
% 0.20/0.29 % Processed clauses : 145
% 0.20/0.29 % ...of these trivial : 0
% 0.20/0.29 % ...subsumed : 13
% 0.20/0.29 % ...remaining for further processing : 132
% 0.20/0.29 % Other redundant clauses eliminated : 1
% 0.20/0.29 % Clauses deleted for lack of memory : 0
% 0.20/0.29 % Backward-subsumed : 0
% 0.20/0.29 % Backward-rewritten : 0
% 0.20/0.29 % Generated clauses : 835
% 0.20/0.29 % ...of the previous two non-redundant : 826
% 0.20/0.29 % ...aggressively subsumed : 0
% 0.20/0.29 % Contextual simplify-reflections : 12
% 0.20/0.29 % Paramodulations : 833
% 0.20/0.29 % Factorizations : 0
% 0.20/0.29 % NegExts : 0
% 0.20/0.29 % Equation resolutions : 2
% 0.20/0.29 % Disequality decompositions : 0
% 0.20/0.29 % Total rewrite steps : 18
% 0.20/0.29 % ...of those cached : 17
% 0.20/0.29 % Propositional unsat checks : 0
% 0.20/0.29 % Propositional check models : 0
% 0.20/0.29 % Propositional check unsatisfiable : 0
% 0.20/0.29 % Propositional clauses : 0
% 0.20/0.29 % Propositional clauses after purity: 0
% 0.20/0.29 % Propositional unsat core size : 0
% 0.20/0.29 % Propositional preprocessing time : 0.000
% 0.20/0.29 % Propositional encoding time : 0.000
% 0.20/0.29 % Propositional solver time : 0.000
% 0.20/0.29 % Success case prop preproc time : 0.000
% 0.20/0.29 % Success case prop encoding time : 0.000
% 0.20/0.29 % Success case prop solver time : 0.000
% 0.20/0.29 % Current number of processed clauses : 131
% 0.20/0.29 % Positive orientable unit clauses : 6
% 0.20/0.29 % Positive unorientable unit clauses: 0
% 0.20/0.29 % Negative unit clauses : 1
% 0.20/0.29 % Non-unit-clauses : 124
% 0.20/0.29 % Current number of unprocessed clauses: 699
% 0.20/0.29 % ...number of literals in the above : 4435
% 0.20/0.29 % Current number of archived formulas : 0
% 0.20/0.29 % Current number of archived clauses : 0
% 0.20/0.29 % Clause-clause subsumption calls (NU) : 3676
% 0.20/0.29 % Rec. Clause-clause subsumption calls : 1008
% 0.20/0.29 % Non-unit clause-clause subsumptions : 25
% 0.20/0.29 % Unit Clause-clause subsumption calls : 0
% 0.20/0.29 % Rewrite failures with RHS unbound : 0
% 0.20/0.29 % BW rewrite match attempts : 0
% 0.20/0.29 % BW rewrite match successes : 0
% 0.20/0.29 % Condensation attempts : 0
% 0.20/0.29 % Condensation successes : 0
% 0.20/0.29 % Termbank termtop insertions : 50719
% 0.20/0.29 % Search garbage collected termcells : 653
% 0.20/0.29
% 0.20/0.29 % -------------------------------------------------
% 0.20/0.29 % User time : 0.034 s
% 0.20/0.29 % System time : 0.001 s
% 0.20/0.29 % Total time : 0.034 s
% 0.20/0.29 % Maximum resident set size: 3688 pages
% 0.20/0.29
% 0.20/0.29 % -------------------------------------------------
% 0.20/0.29 % User time : 0.037 s
% 0.20/0.29 % System time : 0.002 s
% 0.20/0.29 % Total time : 0.039 s
% 0.20/0.29 % Maximum resident set size: 4864 pages
% 0.20/0.29 % E exiting
%------------------------------------------------------------------------------