TSTP Solution File: ITP238_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP238_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : Mon May 20 22:17:20 EDT 2024
% Result : Theorem 12.23s 4.07s
% Output : CNFRefutation 12.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 38
% Syntax : Number of formulae : 56 ( 18 unt; 31 typ; 0 def)
% Number of atoms : 32 ( 24 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 24 ( 17 ~; 4 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 2 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_sort3,type,
fun_nat_nat: $tType ).
tff(decl_sort4,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort5,type,
num: $tType ).
tff(decl_sort6,type,
option_nat: $tType ).
tff(decl_sort7,type,
vEBT_VEBT: $tType ).
tff(decl_sort8,type,
fun_num_nat: $tType ).
tff(decl_sort9,type,
fun_num_num: $tType ).
tff(decl_941,type,
one_one_nat: nat ).
tff(decl_1113,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1142,type,
suc: fun_nat_nat ).
tff(decl_1209,type,
bit0: fun_num_num ).
tff(decl_1211,type,
one: num ).
tff(decl_1219,type,
numeral_numeral_nat: fun_num_nat ).
tff(decl_1225,type,
none_nat: option_nat ).
tff(decl_1228,type,
some_nat: nat > option_nat ).
tff(decl_1451,type,
divide_divide_nat: fun_nat_fun_nat_nat ).
tff(decl_1600,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1637,type,
vEBT_vebt_mint: vEBT_VEBT > option_nat ).
tff(decl_1737,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1761,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1785,type,
aa_num_nat: ( fun_num_nat * num ) > nat ).
tff(decl_1786,type,
aa_num_num: ( fun_num_num * num ) > num ).
tff(decl_2084,type,
deg: nat ).
tff(decl_2085,type,
m: nat ).
tff(decl_2088,type,
na: nat ).
tff(decl_2090,type,
thesis: $o ).
tff(decl_2091,type,
treeList: list_VEBT_VEBT ).
tff(decl_2092,type,
xa: nat ).
tff(decl_2102,type,
esk3_1: option_nat > nat ).
fof(conj_1,conjecture,
thesis,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(fact_0_False,axiom,
vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_False) ).
tff(conj_0,hypothesis,
! [X21335: nat] :
( ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) = some_nat(X21335) )
=> thesis ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = na,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).
tff(fact_1123_Suc__1,axiom,
aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1123_Suc__1) ).
tff(fact_18__C4_Ohyps_C_I5_J,axiom,
m = na,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_18__C4_Ohyps_C_I5_J) ).
tff(fact_85_option_Oexhaust,axiom,
! [X121: option_nat] :
( ( X121 != none_nat )
=> ~ ! [X122: nat] : ( X121 != some_nat(X122) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_option_Oexhaust) ).
fof(c_0_7,negated_conjecture,
~ thesis,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_1])]) ).
tff(c_0_8,plain,
vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
inference(fof_simplification,[status(thm)],[fact_0_False]) ).
tff(c_0_9,hypothesis,
! [X21336: nat] :
( ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != some_nat(X21336) )
| thesis ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).
tcf(c_0_10,plain,
aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = na,
inference(split_conjunct,[status(thm)],[fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).
tcf(c_0_11,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_1123_Suc__1]) ).
tcf(c_0_12,plain,
m = na,
inference(split_conjunct,[status(thm)],[fact_18__C4_Ohyps_C_I5_J]) ).
fof(c_0_13,negated_conjecture,
~ thesis,
inference(fof_nnf,[status(thm)],[c_0_7]) ).
tff(c_0_14,plain,
! [X121: option_nat] :
( ( X121 != none_nat )
=> ~ ! [X122: nat] : ( X121 != some_nat(X122) ) ),
inference(fof_simplification,[status(thm)],[fact_85_option_Oexhaust]) ).
tff(c_0_15,plain,
vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
inference(fof_nnf,[status(thm)],[c_0_8]) ).
tcf(c_0_16,hypothesis,
! [X3: nat] :
( thesis
| ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != some_nat(X3) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
tcf(c_0_17,plain,
aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat)) = m,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ thesis,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_19,plain,
! [X21347: option_nat] :
( ( X21347 = none_nat )
| ( X21347 = some_nat(esk3_1(X21347)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
tcf(c_0_20,plain,
vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_21,hypothesis,
! [X3: nat] : vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),m))) != some_nat(X3),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_17]),c_0_18]) ).
tcf(c_0_22,plain,
! [X21: option_nat] :
( ( X21 = none_nat )
| ( X21 = some_nat(esk3_1(X21)) ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_23,plain,
vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),m))) != none_nat,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_11]),c_0_17]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ITP238_1 : TPTP v8.2.0. Released v8.0.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n027.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sat May 18 17:42:07 EDT 2024
% 0.09/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 12.23/4.07 # Version: 3.1.0
% 12.23/4.07 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.23/4.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.23/4.07 # Starting new_bool_3 with 897s (3) cores
% 12.23/4.07 # Starting new_bool_1 with 897s (3) cores
% 12.23/4.07 # Starting sh5l with 299s (1) cores
% 12.23/4.07 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 12.23/4.07 # new_bool_1 with pid 2231 completed with status 0
% 12.23/4.07 # Result found by new_bool_1
% 12.23/4.07 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.23/4.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.23/4.07 # Starting new_bool_3 with 897s (3) cores
% 12.23/4.07 # Starting new_bool_1 with 897s (3) cores
% 12.23/4.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.23/4.07 # Search class: FGHSM-SMLM32-DFFFFFNN
% 12.23/4.07 # Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 12.23/4.07 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 12.23/4.07 # Starting new_bool_1 with 90s (1) cores
% 12.23/4.07 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 12.23/4.07 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 2241 completed with status 0
% 12.23/4.07 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 12.23/4.07 # Preprocessing class: FMLLSMLLSSSNFFN.
% 12.23/4.07 # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.23/4.07 # Starting new_bool_3 with 897s (3) cores
% 12.23/4.07 # Starting new_bool_1 with 897s (3) cores
% 12.23/4.07 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.23/4.07 # Search class: FGHSM-SMLM32-DFFFFFNN
% 12.23/4.07 # Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 12.23/4.07 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 12.23/4.07 # Starting new_bool_1 with 90s (1) cores
% 12.23/4.07 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 12.23/4.07 # Preprocessing time : 0.274 s
% 12.23/4.07
% 12.23/4.07 # Proof found!
% 12.23/4.07 # SZS status Theorem
% 12.23/4.07 # SZS output start CNFRefutation
% See solution above
% 12.23/4.07 # Parsed axioms : 13554
% 12.23/4.07 # Removed by relevancy pruning/SinE : 9568
% 12.23/4.07 # Initial clauses : 11690
% 12.23/4.07 # Removed in clause preprocessing : 2036
% 12.23/4.07 # Initial clauses in saturation : 9654
% 12.23/4.07 # Processed clauses : 2296
% 12.23/4.07 # ...of these trivial : 177
% 12.23/4.07 # ...subsumed : 446
% 12.23/4.07 # ...remaining for further processing : 1673
% 12.23/4.07 # Other redundant clauses eliminated : 758
% 12.23/4.07 # Clauses deleted for lack of memory : 0
% 12.23/4.07 # Backward-subsumed : 13
% 12.23/4.07 # Backward-rewritten : 46
% 12.23/4.07 # Generated clauses : 7520
% 12.23/4.07 # ...of the previous two non-redundant : 5362
% 12.23/4.07 # ...aggressively subsumed : 0
% 12.23/4.07 # Contextual simplify-reflections : 1
% 12.23/4.07 # Paramodulations : 6740
% 12.23/4.07 # Factorizations : 2
% 12.23/4.07 # NegExts : 0
% 12.23/4.07 # Equation resolutions : 810
% 12.23/4.07 # Disequality decompositions : 0
% 12.23/4.07 # Total rewrite steps : 3489
% 12.23/4.07 # ...of those cached : 2763
% 12.23/4.07 # Propositional unsat checks : 0
% 12.23/4.07 # Propositional check models : 0
% 12.23/4.07 # Propositional check unsatisfiable : 0
% 12.23/4.07 # Propositional clauses : 0
% 12.23/4.07 # Propositional clauses after purity: 0
% 12.23/4.07 # Propositional unsat core size : 0
% 12.23/4.07 # Propositional preprocessing time : 0.000
% 12.23/4.07 # Propositional encoding time : 0.000
% 12.23/4.07 # Propositional solver time : 0.000
% 12.23/4.07 # Success case prop preproc time : 0.000
% 12.23/4.07 # Success case prop encoding time : 0.000
% 12.23/4.07 # Success case prop solver time : 0.000
% 12.23/4.07 # Current number of processed clauses : 1112
% 12.23/4.07 # Positive orientable unit clauses : 326
% 12.23/4.07 # Positive unorientable unit clauses: 10
% 12.23/4.07 # Negative unit clauses : 150
% 12.23/4.07 # Non-unit-clauses : 626
% 12.23/4.07 # Current number of unprocessed clauses: 12720
% 12.23/4.07 # ...number of literals in the above : 49537
% 12.23/4.07 # Current number of archived formulas : 0
% 12.23/4.07 # Current number of archived clauses : 59
% 12.23/4.07 # Clause-clause subsumption calls (NU) : 127917
% 12.23/4.07 # Rec. Clause-clause subsumption calls : 79203
% 12.23/4.07 # Non-unit clause-clause subsumptions : 394
% 12.23/4.07 # Unit Clause-clause subsumption calls : 3571
% 12.23/4.07 # Rewrite failures with RHS unbound : 0
% 12.23/4.07 # BW rewrite match attempts : 1741
% 12.23/4.07 # BW rewrite match successes : 221
% 12.23/4.07 # Condensation attempts : 0
% 12.23/4.07 # Condensation successes : 0
% 12.23/4.07 # Termbank termtop insertions : 1559106
% 12.23/4.07 # Search garbage collected termcells : 217405
% 12.23/4.07
% 12.23/4.07 # -------------------------------------------------
% 12.23/4.07 # User time : 2.004 s
% 12.23/4.07 # System time : 0.098 s
% 12.23/4.07 # Total time : 2.102 s
% 12.23/4.07 # Maximum resident set size: 59468 pages
% 12.23/4.07
% 12.23/4.07 # -------------------------------------------------
% 12.23/4.07 # User time : 4.509 s
% 12.23/4.07 # System time : 0.211 s
% 12.23/4.07 # Total time : 4.720 s
% 12.23/4.07 # Maximum resident set size: 31340 pages
% 12.23/4.07 % E---3.1 exiting
% 12.23/4.07 % E exiting
%------------------------------------------------------------------------------