TSTP Solution File: ITP239_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP239_1 : TPTP v8.1.2. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:42 EDT 2024
% Result : Theorem 19.26s 14.89s
% Output : CNFRefutation 19.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 34
% Syntax : Number of formulae : 43 ( 13 unt; 30 typ; 0 def)
% Number of atoms : 13 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 11 ( 10 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 12 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_bool: $tType ).
tff(decl_sort2,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort3,type,
fun_nat_nat: $tType ).
tff(decl_sort4,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort5,type,
nat: $tType ).
tff(decl_sort6,type,
num: $tType ).
tff(decl_sort7,type,
bool: $tType ).
tff(decl_sort8,type,
vEBT_VEBT: $tType ).
tff(decl_sort9,type,
fun_num_nat: $tType ).
tff(decl_sort10,type,
fun_num_num: $tType ).
tff(decl_815,type,
one_one_nat: nat ).
tff(decl_980,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1006,type,
suc: fun_nat_nat ).
tff(decl_1077,type,
bit0: fun_num_num ).
tff(decl_1079,type,
one: num ).
tff(decl_1087,type,
numeral_numeral_nat: fun_num_nat ).
tff(decl_1298,type,
divide_divide_nat: fun_nat_fun_nat_nat ).
tff(decl_1443,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1445,type,
vEBT_VEBT_low: fun_nat_fun_nat_nat ).
tff(decl_1462,type,
vEBT_vebt_member: vEBT_VEBT > fun_nat_bool ).
tff(decl_1571,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1573,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1598,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1627,type,
aa_num_nat: ( fun_num_nat * num ) > nat ).
tff(decl_1628,type,
aa_num_num: ( fun_num_num * num ) > num ).
tff(decl_1891,type,
pp: bool > $o ).
tff(decl_1892,type,
deg: nat ).
tff(decl_1898,type,
pr: nat ).
tff(decl_1901,type,
treeList: list_VEBT_VEBT ).
tff(decl_1903,type,
za: nat ).
tff(conj_0,conjecture,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
file('/export/starexec/sandbox/tmp/tmp.CMTGbZNMkC/E---3.1_4108.p',conj_0) ).
tff(fact_0_True,axiom,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) = pr,
file('/export/starexec/sandbox/tmp/tmp.CMTGbZNMkC/E---3.1_4108.p',fact_0_True) ).
tff(fact_1019_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.CMTGbZNMkC/E---3.1_4108.p',fact_1019_Suc__1) ).
tff(fact_2_abe,axiom,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
file('/export/starexec/sandbox/tmp/tmp.CMTGbZNMkC/E---3.1_4108.p',fact_2_abe) ).
tff(c_0_4,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
tff(c_0_5,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
tcf(c_0_6,plain,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) = pr,
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
tcf(c_0_7,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_1019_Suc__1]) ).
tcf(c_0_8,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_9,plain,
aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat))) = pr,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
tcf(c_0_10,plain,
pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
inference(split_conjunct,[status(thm)],[fact_2_abe]) ).
tcf(c_0_11,negated_conjecture,
~ pp(aa_nat_bool(vEBT_vebt_member(nth_VEBT_VEBT(treeList,pr)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_9]),c_0_7]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_7]),c_0_9]),c_0_7]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 6.18/6.19 % Problem : ITP239_1 : TPTP v8.1.2. Released v8.0.0.
% 6.18/6.20 % Command : run_E %s %d THM
% 6.20/6.41 % Computer : n023.cluster.edu
% 6.20/6.41 % Model : x86_64 x86_64
% 6.20/6.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 6.20/6.41 % Memory : 8042.1875MB
% 6.20/6.41 % OS : Linux 3.10.0-693.el7.x86_64
% 6.20/6.41 % CPULimit : 300
% 6.20/6.41 % WCLimit : 300
% 6.20/6.41 % DateTime : Fri May 3 13:04:00 EDT 2024
% 6.20/6.41 % CPUTime :
% 12.35/12.58 Running first-order theorem proving
% 12.35/12.58 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.CMTGbZNMkC/E---3.1_4108.p
% 19.26/14.89 # Version: 3.1.0
% 19.26/14.89 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.26/14.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.26/14.89 # Starting new_bool_3 with 900s (3) cores
% 19.26/14.89 # Starting new_bool_1 with 900s (3) cores
% 19.26/14.89 # Starting sh5l with 300s (1) cores
% 19.26/14.89 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 19.26/14.89 # new_bool_1 with pid 4187 completed with status 0
% 19.26/14.89 # Result found by new_bool_1
% 19.26/14.89 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.26/14.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.26/14.89 # Starting new_bool_3 with 900s (3) cores
% 19.26/14.89 # Starting new_bool_1 with 900s (3) cores
% 19.26/14.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.26/14.89 # Search class: FGHSM-SMLM32-DFFFFFNN
% 19.26/14.89 # Scheduled 13 strats onto 3 cores with 899 seconds (899 total)
% 19.26/14.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 19.26/14.89 # Starting new_bool_1 with 90s (1) cores
% 19.26/14.89 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 19.26/14.89 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 4317 completed with status 0
% 19.26/14.89 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 19.26/14.89 # Preprocessing class: FMLLSMLLSSSNFFN.
% 19.26/14.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.26/14.89 # Starting new_bool_3 with 900s (3) cores
% 19.26/14.89 # Starting new_bool_1 with 900s (3) cores
% 19.26/14.89 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.26/14.89 # Search class: FGHSM-SMLM32-DFFFFFNN
% 19.26/14.89 # Scheduled 13 strats onto 3 cores with 899 seconds (899 total)
% 19.26/14.89 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 19.26/14.89 # Starting new_bool_1 with 90s (1) cores
% 19.26/14.89 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 19.26/14.89 # Preprocessing time : 0.249 s
% 19.26/14.89
% 19.26/14.89 # Proof found!
% 19.26/14.89 # SZS status Theorem
% 19.26/14.89 # SZS output start CNFRefutation
% See solution above
% 19.26/14.89 # Parsed axioms : 13208
% 19.26/14.89 # Removed by relevancy pruning/SinE : 9228
% 19.26/14.89 # Initial clauses : 11615
% 19.26/14.89 # Removed in clause preprocessing : 1974
% 19.26/14.89 # Initial clauses in saturation : 9641
% 19.26/14.89 # Processed clauses : 189
% 19.26/14.89 # ...of these trivial : 13
% 19.26/14.89 # ...subsumed : 33
% 19.26/14.89 # ...remaining for further processing : 142
% 19.26/14.89 # Other redundant clauses eliminated : 19
% 19.26/14.89 # Clauses deleted for lack of memory : 0
% 19.26/14.89 # Backward-subsumed : 7
% 19.26/14.89 # Backward-rewritten : 1
% 19.26/14.89 # Generated clauses : 55
% 19.26/14.89 # ...of the previous two non-redundant : 40
% 19.26/14.89 # ...aggressively subsumed : 0
% 19.26/14.89 # Contextual simplify-reflections : 0
% 19.26/14.89 # Paramodulations : 34
% 19.26/14.89 # Factorizations : 0
% 19.26/14.89 # NegExts : 0
% 19.26/14.89 # Equation resolutions : 21
% 19.26/14.89 # Disequality decompositions : 0
% 19.26/14.89 # Total rewrite steps : 48
% 19.26/14.89 # ...of those cached : 29
% 19.26/14.89 # Propositional unsat checks : 0
% 19.26/14.89 # Propositional check models : 0
% 19.26/14.89 # Propositional check unsatisfiable : 0
% 19.26/14.89 # Propositional clauses : 0
% 19.26/14.89 # Propositional clauses after purity: 0
% 19.26/14.89 # Propositional unsat core size : 0
% 19.26/14.89 # Propositional preprocessing time : 0.000
% 19.26/14.89 # Propositional encoding time : 0.000
% 19.26/14.89 # Propositional solver time : 0.000
% 19.26/14.89 # Success case prop preproc time : 0.000
% 19.26/14.89 # Success case prop encoding time : 0.000
% 19.26/14.89 # Success case prop solver time : 0.000
% 19.26/14.89 # Current number of processed clauses : 115
% 19.26/14.89 # Positive orientable unit clauses : 39
% 19.26/14.89 # Positive unorientable unit clauses: 0
% 19.26/14.89 # Negative unit clauses : 65
% 19.26/14.89 # Non-unit-clauses : 11
% 19.26/14.89 # Current number of unprocessed clauses: 9492
% 19.26/14.89 # ...number of literals in the above : 42921
% 19.26/14.89 # Current number of archived formulas : 0
% 19.26/14.89 # Current number of archived clauses : 8
% 19.26/14.89 # Clause-clause subsumption calls (NU) : 142
% 19.26/14.89 # Rec. Clause-clause subsumption calls : 40
% 19.26/14.89 # Non-unit clause-clause subsumptions : 5
% 19.26/14.89 # Unit Clause-clause subsumption calls : 731
% 19.26/14.89 # Rewrite failures with RHS unbound : 0
% 19.26/14.89 # BW rewrite match attempts : 3
% 19.26/14.89 # BW rewrite match successes : 1
% 19.26/14.89 # Condensation attempts : 0
% 19.26/14.89 # Condensation successes : 0
% 19.26/14.89 # Termbank termtop insertions : 1459002
% 19.26/14.89 # Search garbage collected termcells : 211358
% 19.26/14.89
% 19.26/14.89 # -------------------------------------------------
% 19.26/14.89 # User time : 1.337 s
% 19.26/14.89 # System time : 0.101 s
% 19.26/14.89 # Total time : 1.438 s
% 19.26/14.89 # Maximum resident set size: 56960 pages
% 19.26/14.89
% 19.26/14.89 # -------------------------------------------------
% 19.26/14.89 # User time : 2.629 s
% 19.26/14.89 # System time : 0.175 s
% 19.26/14.89 # Total time : 2.804 s
% 19.26/14.89 # Maximum resident set size: 30644 pages
% 19.26/14.89 % E---3.1 exiting
% 19.26/14.89 % E exiting
%------------------------------------------------------------------------------