TSTP Solution File: ITP262_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP262_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Sat May 4 08:07:58 EDT 2024
% Result : Theorem 127.65s 26.93s
% Output : CNFRefutation 127.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 49
% Syntax : Number of formulae : 72 ( 20 unt; 41 typ; 0 def)
% Number of atoms : 49 ( 20 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 10 |; 4 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 13 ( 12 usr)
% Number of type conns : 24 ( 13 >; 11 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 28 ( 28 usr; 16 con; 0-3 aty)
% Number of variables : 28 ( 0 sgn 25 !; 3 ?; 28 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
vEBT_VEBT: $tType ).
tff(decl_sort2,type,
fun_nat_fun_nat_bool: $tType ).
tff(decl_sort3,type,
fun_nat_bool: $tType ).
tff(decl_sort4,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort5,type,
fun_nat_nat: $tType ).
tff(decl_sort6,type,
nat: $tType ).
tff(decl_sort7,type,
num: $tType ).
tff(decl_sort8,type,
fun_VE3763956218935105199t_bool: $tType ).
tff(decl_sort9,type,
bool: $tType ).
tff(decl_sort10,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort11,type,
fun_num_nat: $tType ).
tff(decl_sort12,type,
fun_num_num: $tType ).
tff(decl_671,type,
one_one_nat: nat ).
tff(decl_803,type,
list_u1324408373059187874T_VEBT: ( list_VEBT_VEBT * nat * vEBT_VEBT ) > list_VEBT_VEBT ).
tff(decl_820,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_843,type,
suc: fun_nat_nat ).
tff(decl_872,type,
size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).
tff(decl_907,type,
bit0: fun_num_num ).
tff(decl_909,type,
one: num ).
tff(decl_917,type,
numeral_numeral_nat: fun_num_nat ).
tff(decl_954,type,
ord_less_nat: fun_nat_fun_nat_bool ).
tff(decl_1014,type,
power_power_nat: fun_nat_fun_nat_nat ).
tff(decl_1229,type,
vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).
tff(decl_1230,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1232,type,
vEBT_VEBT_low: fun_nat_fun_nat_nat ).
tff(decl_1243,type,
vEBT_vebt_delete: ( vEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1348,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1350,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1369,type,
aa_nat_fun_nat_bool: ( fun_nat_fun_nat_bool * nat ) > fun_nat_bool ).
tff(decl_1371,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1392,type,
aa_num_nat: ( fun_num_nat * num ) > nat ).
tff(decl_1393,type,
aa_num_num: ( fun_num_num * num ) > num ).
tff(decl_1483,type,
aa_VEB4832260192069861672t_bool: ( fun_VE3763956218935105199t_bool * vEBT_VEBT ) > fun_nat_bool ).
tff(decl_1613,type,
pp: bool > $o ).
tff(decl_1615,type,
m: nat ).
tff(decl_1617,type,
maxs: nat ).
tff(decl_1619,type,
na: nat ).
tff(decl_1620,type,
summary: vEBT_VEBT ).
tff(decl_1621,type,
treeList: list_VEBT_VEBT ).
tff(decl_1622,type,
xa: nat ).
tff(decl_1907,type,
esk278_1: nat > nat ).
tff(conj_0,conjecture,
? [X25: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_delete(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),maxs)),X25)),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',conj_0) ).
tff(fact_10_bb,axiom,
( ( maxs != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na) )
& pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,maxs),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) ),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_10_bb) ).
tff(fact_22_nth__list__update__neq,axiom,
! [X6: nat,X15: nat,X18: list_VEBT_VEBT,X19: vEBT_VEBT] :
( ( X6 != X15 )
=> ( nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(X18,X6,X19),X15) = nth_VEBT_VEBT(X18,X15) ) ),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_22_nth__list__update__neq) ).
tff(fact_2__C8_C,axiom,
na = m,
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_2__C8_C) ).
tff(fact_13__C4_C,axiom,
! [X7: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X7),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m)))
=> ( ? [X8: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,X7)),X8))
<=> pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),X7)) ) ),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_13__C4_C) ).
tff(fact_36__C2_C,axiom,
size_s6755466524823107622T_VEBT(treeList) = aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_36__C2_C) ).
tff(fact_2830_Suc__1,axiom,
aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_2830_Suc__1) ).
tff(fact_1__092_060open_062both__member__options_Asummary_Amaxs_092_060close_062,axiom,
pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),maxs)),
file('/export/starexec/sandbox/tmp/tmp.uw8FuwPYHD/E---3.1_8648.p',fact_1__092_060open_062both__member__options_Asummary_Amaxs_092_060close_062) ).
tff(c_0_8,negated_conjecture,
~ ? [X25: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_delete(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),maxs)),X25)),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_9,plain,
( ( maxs != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na) )
& pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,maxs),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) ),
inference(fof_simplification,[status(thm)],[fact_10_bb]) ).
tff(c_0_10,negated_conjecture,
! [X18571: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_delete(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),maxs)),X18571)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
tff(c_0_11,plain,
! [X6: nat,X15: nat,X18: list_VEBT_VEBT,X19: vEBT_VEBT] :
( ( X6 != X15 )
=> ( nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(X18,X6,X19),X15) = nth_VEBT_VEBT(X18,X15) ) ),
inference(fof_simplification,[status(thm)],[fact_22_nth__list__update__neq]) ).
tff(c_0_12,plain,
( ( maxs != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na) )
& pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,maxs),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
tcf(c_0_13,negated_conjecture,
! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_delete(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),maxs)),X1)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_14,plain,
na = m,
inference(split_conjunct,[status(thm)],[fact_2__C8_C]) ).
tff(c_0_15,plain,
! [X18695: nat,X18696: nat,X18697: list_VEBT_VEBT,X18698: vEBT_VEBT] :
( ( X18695 = X18696 )
| ( nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(X18697,X18695,X18698),X18696) = nth_VEBT_VEBT(X18697,X18696) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
tcf(c_0_16,plain,
maxs != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tff(c_0_17,plain,
! [X20835: nat,X20836: nat] :
( ( ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,X20835)),X20836))
| pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),X20835))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X20835),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) )
& ( ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),X20835))
| pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,X20835)),esk278_1(X20835)))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X20835),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) ) ),
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)],[fact_13__C4_C])])])])])]) ).
tcf(c_0_18,plain,
size_s6755466524823107622T_VEBT(treeList) = aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m),
inference(split_conjunct,[status(thm)],[fact_36__C2_C]) ).
tcf(c_0_19,plain,
aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
inference(split_conjunct,[status(thm)],[fact_2830_Suc__1]) ).
tcf(c_0_20,negated_conjecture,
! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),m),vEBT_vebt_delete(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),m)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),m))),maxs)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_14]) ).
tcf(c_0_21,plain,
! [X1: nat,X9: list_VEBT_VEBT,X3: vEBT_VEBT,X2: nat] :
( ( X1 = X2 )
| ( nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(X9,X1,X3),X2) = nth_VEBT_VEBT(X9,X2) ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_22,plain,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),m) != maxs,
inference(rw,[status(thm)],[c_0_16,c_0_14]) ).
tcf(c_0_23,plain,
! [X1: nat] :
( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,X1)),esk278_1(X1)))
| ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),X1))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X1),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_24,plain,
aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_nat_nat(suc,one_one_nat)),m) = size_s6755466524823107622T_VEBT(treeList),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
tcf(c_0_25,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,maxs),aa_nat_nat(aa_nat_fun_nat_nat(power_power_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),m))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_26,negated_conjecture,
! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,maxs)),X1)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
tcf(c_0_27,plain,
! [X1: nat] :
( pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,X1)),esk278_1(X1)))
| ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,X1),size_s6755466524823107622T_VEBT(treeList)))
| ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),X1)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_19]),c_0_24]) ).
tcf(c_0_28,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_nat,maxs),size_s6755466524823107622T_VEBT(treeList))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_19]),c_0_24]) ).
tcf(c_0_29,plain,
pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,summary),maxs)),
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062both__member__options_Asummary_Amaxs_092_060close_062]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 5.40/5.45 % Problem : ITP262_1 : TPTP v8.1.2. Released v8.0.0.
% 5.45/5.46 % Command : run_E %s %d THM
% 5.46/5.67 % Computer : n021.cluster.edu
% 5.46/5.67 % Model : x86_64 x86_64
% 5.46/5.67 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 5.46/5.67 % Memory : 8042.1875MB
% 5.46/5.67 % OS : Linux 3.10.0-693.el7.x86_64
% 5.46/5.67 % CPULimit : 300
% 5.46/5.67 % WCLimit : 300
% 5.46/5.67 % DateTime : Fri May 3 12:49:18 EDT 2024
% 5.46/5.67 % CPUTime :
% 10.86/11.07 Running first-order theorem proving
% 10.86/11.07 Running: /export/starexec/sandbox/solver/bin/eprover --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.uw8FuwPYHD/E---3.1_8648.p
% 127.65/26.93 # Version: 3.1.0
% 127.65/26.93 # Preprocessing class: FMLLSMLLSSSNFFN.
% 127.65/26.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.65/26.93 # Starting new_bool_3 with 900s (3) cores
% 127.65/26.93 # Starting new_bool_1 with 900s (3) cores
% 127.65/26.93 # Starting sh5l with 300s (1) cores
% 127.65/26.93 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 127.65/26.93 # new_bool_1 with pid 8727 completed with status 0
% 127.65/26.93 # Result found by new_bool_1
% 127.65/26.93 # Preprocessing class: FMLLSMLLSSSNFFN.
% 127.65/26.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.65/26.93 # Starting new_bool_3 with 900s (3) cores
% 127.65/26.93 # Starting new_bool_1 with 900s (3) cores
% 127.65/26.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 127.65/26.93 # Search class: FGHSM-SMLM32-DFFFFFNN
% 127.65/26.93 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 127.65/26.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 127.65/26.93 # Starting new_bool_1 with 91s (1) cores
% 127.65/26.93 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 127.65/26.93 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 8732 completed with status 0
% 127.65/26.93 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 127.65/26.93 # Preprocessing class: FMLLSMLLSSSNFFN.
% 127.65/26.93 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 127.65/26.93 # Starting new_bool_3 with 900s (3) cores
% 127.65/26.93 # Starting new_bool_1 with 900s (3) cores
% 127.65/26.93 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 127.65/26.93 # Search class: FGHSM-SMLM32-DFFFFFNN
% 127.65/26.93 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 127.65/26.93 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 127.65/26.93 # Starting new_bool_1 with 91s (1) cores
% 127.65/26.93 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 127.65/26.93 # Preprocessing time : 0.173 s
% 127.65/26.93
% 127.65/26.93 # Proof found!
% 127.65/26.93 # SZS status Theorem
% 127.65/26.93 # SZS output start CNFRefutation
% See solution above
% 127.65/26.93 # Parsed axioms : 12739
% 127.65/26.93 # Removed by relevancy pruning/SinE : 9336
% 127.65/26.93 # Initial clauses : 9080
% 127.65/26.93 # Removed in clause preprocessing : 1951
% 127.65/26.93 # Initial clauses in saturation : 7129
% 127.65/26.93 # Processed clauses : 7218
% 127.65/26.93 # ...of these trivial : 301
% 127.65/26.93 # ...subsumed : 1419
% 127.65/26.93 # ...remaining for further processing : 5498
% 127.65/26.93 # Other redundant clauses eliminated : 3170
% 127.65/26.93 # Clauses deleted for lack of memory : 0
% 127.65/26.93 # Backward-subsumed : 31
% 127.65/26.93 # Backward-rewritten : 48
% 127.65/26.93 # Generated clauses : 193353
% 127.65/26.93 # ...of the previous two non-redundant : 178611
% 127.65/26.93 # ...aggressively subsumed : 0
% 127.65/26.93 # Contextual simplify-reflections : 68
% 127.65/26.93 # Paramodulations : 190779
% 127.65/26.93 # Factorizations : 38
% 127.65/26.93 # NegExts : 0
% 127.65/26.93 # Equation resolutions : 3237
% 127.65/26.93 # Disequality decompositions : 0
% 127.65/26.93 # Total rewrite steps : 57924
% 127.65/26.93 # ...of those cached : 49165
% 127.65/26.93 # Propositional unsat checks : 1
% 127.65/26.93 # Propositional check models : 0
% 127.65/26.93 # Propositional check unsatisfiable : 0
% 127.65/26.93 # Propositional clauses : 0
% 127.65/26.93 # Propositional clauses after purity: 0
% 127.65/26.93 # Propositional unsat core size : 0
% 127.65/26.93 # Propositional preprocessing time : 0.000
% 127.65/26.93 # Propositional encoding time : 0.464
% 127.65/26.93 # Propositional solver time : 0.152
% 127.65/26.93 # Success case prop preproc time : 0.000
% 127.65/26.93 # Success case prop encoding time : 0.000
% 127.65/26.93 # Success case prop solver time : 0.000
% 127.65/26.93 # Current number of processed clauses : 4144
% 127.65/26.93 # Positive orientable unit clauses : 567
% 127.65/26.93 # Positive unorientable unit clauses: 40
% 127.65/26.93 # Negative unit clauses : 122
% 127.65/26.93 # Non-unit-clauses : 3415
% 127.65/26.93 # Current number of unprocessed clauses: 178485
% 127.65/26.93 # ...number of literals in the above : 731585
% 127.65/26.93 # Current number of archived formulas : 0
% 127.65/26.93 # Current number of archived clauses : 79
% 127.65/26.93 # Clause-clause subsumption calls (NU) : 11761569
% 127.65/26.93 # Rec. Clause-clause subsumption calls : 634272
% 127.65/26.93 # Non-unit clause-clause subsumptions : 1348
% 127.65/26.93 # Unit Clause-clause subsumption calls : 19672
% 127.65/26.93 # Rewrite failures with RHS unbound : 0
% 127.65/26.93 # BW rewrite match attempts : 5224
% 127.65/26.93 # BW rewrite match successes : 202
% 127.65/26.93 # Condensation attempts : 0
% 127.65/26.93 # Condensation successes : 0
% 127.65/26.93 # Termbank termtop insertions : 10265124
% 127.65/26.93 # Search garbage collected termcells : 191488
% 127.65/26.93
% 127.65/26.93 # -------------------------------------------------
% 127.65/26.93 # User time : 14.666 s
% 127.65/26.93 # System time : 0.291 s
% 127.65/26.93 # Total time : 14.957 s
% 127.65/26.93 # Maximum resident set size: 50392 pages
% 127.65/26.93
% 127.65/26.93 # -------------------------------------------------
% 127.65/26.93 # User time : 43.365 s
% 127.65/26.93 # System time : 0.429 s
% 127.65/26.93 # Total time : 43.794 s
% 127.65/26.93 # Maximum resident set size: 28824 pages
% 127.65/26.93 % E---3.1 exiting
% 127.65/26.93 % E exiting
%------------------------------------------------------------------------------