TSTP Solution File: ITP233_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP233_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:20:09 EDT 2024
% Result : Theorem 63.82s 9.61s
% Output : CNFRefutation 63.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 38 ( 15 unt; 23 typ; 0 def)
% Number of atoms : 15 ( 5 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 16 ( 8 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-3 aty)
% Number of variables : 6 ( 0 sgn 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_nat: $tType ).
tff(decl_sort2,type,
fun_nat_bool: $tType ).
tff(decl_sort3,type,
fun_VE3763956218935105199t_bool: $tType ).
tff(decl_sort4,type,
nat: $tType ).
tff(decl_sort5,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort6,type,
bool: $tType ).
tff(decl_sort7,type,
list_VEBT_VEBT: $tType ).
tff(decl_sort8,type,
vEBT_VEBT: $tType ).
tff(decl_1171,type,
list_u1324408373059187874T_VEBT: ( list_VEBT_VEBT * nat * vEBT_VEBT ) > list_VEBT_VEBT ).
tff(decl_1204,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1723,type,
vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).
tff(decl_1726,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1728,type,
vEBT_VEBT_low: fun_nat_fun_nat_nat ).
tff(decl_1739,type,
vEBT_vebt_insert: ( vEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1846,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1849,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1881,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1976,type,
aa_VEB4832260192069861672t_bool: ( fun_VE3763956218935105199t_bool * vEBT_VEBT ) > fun_nat_bool ).
tff(decl_2161,type,
pp: bool > $o ).
tff(decl_2163,type,
i: nat ).
tff(decl_2167,type,
na: nat ).
tff(decl_2169,type,
treeList: list_VEBT_VEBT ).
tff(decl_2170,type,
xa: nat ).
tff(conj_0,conjecture,
? [X223: 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_insert(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))),i)),X223)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_0_True,axiom,
i = aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_True) ).
tff(fact_3__C164_C,axiom,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_insert(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))),i) = vEBT_vebt_insert(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)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__C164_C) ).
tff(fact_1__C166_C,axiom,
pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_insert(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))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__C166_C) ).
tff(c_0_4,negated_conjecture,
~ ? [X223: 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_insert(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))),i)),X223)),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_5,negated_conjecture,
! [X17933: 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_insert(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))),i)),X17933)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tcf(c_0_6,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_insert(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))),i)),X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
tcf(c_0_7,plain,
i = aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
tcf(c_0_8,plain,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),vEBT_vebt_insert(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))),i) = vEBT_vebt_insert(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)),
inference(split_conjunct,[status(thm)],[fact_3__C164_C]) ).
tcf(c_0_9,plain,
pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_insert(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))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),
inference(split_conjunct,[status(thm)],[fact_1__C166_C]) ).
tcf(c_0_10,negated_conjecture,
! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,i,vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),i)),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
tcf(c_0_11,plain,
nth_VEBT_VEBT(list_u1324408373059187874T_VEBT(treeList,i,vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),i) = vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_7]),c_0_7]),c_0_7]) ).
tcf(c_0_12,plain,
pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
tcf(c_0_13,negated_conjecture,
! [X1: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,vEBT_vebt_insert(nth_VEBT_VEBT(treeList,i),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_low,xa),na))),X1)),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
$false,
inference(sr,[status(thm)],[c_0_12,c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP233_1 : TPTP v8.2.0. Released v8.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat May 18 18:29:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 63.82/9.61 # Version: 3.1.0
% 63.82/9.61 # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.82/9.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.82/9.61 # Starting new_bool_3 with 900s (3) cores
% 63.82/9.61 # Starting new_bool_1 with 900s (3) cores
% 63.82/9.61 # Starting sh5l with 300s (1) cores
% 63.82/9.61 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 63.82/9.61 # new_bool_1 with pid 539 completed with status 0
% 63.82/9.61 # Result found by new_bool_1
% 63.82/9.61 # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.82/9.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.82/9.61 # Starting new_bool_3 with 900s (3) cores
% 63.82/9.61 # Starting new_bool_1 with 900s (3) cores
% 63.82/9.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 63.82/9.61 # Search class: FGHSM-SMLM32-DFFFFFNN
% 63.82/9.61 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 63.82/9.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 63.82/9.61 # Starting new_bool_1 with 91s (1) cores
% 63.82/9.61 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 63.82/9.61 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 566 completed with status 0
% 63.82/9.61 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 63.82/9.61 # Preprocessing class: FMLLSMLLSSSNFFN.
% 63.82/9.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.82/9.61 # Starting new_bool_3 with 900s (3) cores
% 63.82/9.61 # Starting new_bool_1 with 900s (3) cores
% 63.82/9.61 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 63.82/9.61 # Search class: FGHSM-SMLM32-DFFFFFNN
% 63.82/9.61 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 63.82/9.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 63.82/9.61 # Starting new_bool_1 with 91s (1) cores
% 63.82/9.61 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 63.82/9.61 # Preprocessing time : 0.112 s
% 63.82/9.61
% 63.82/9.61 # Proof found!
% 63.82/9.61 # SZS status Theorem
% 63.82/9.61 # SZS output start CNFRefutation
% See solution above
% 63.82/9.61 # Parsed axioms : 12454
% 63.82/9.61 # Removed by relevancy pruning/SinE : 10329
% 63.82/9.61 # Initial clauses : 6947
% 63.82/9.61 # Removed in clause preprocessing : 1825
% 63.82/9.61 # Initial clauses in saturation : 5122
% 63.82/9.61 # Processed clauses : 5194
% 63.82/9.61 # ...of these trivial : 128
% 63.82/9.61 # ...subsumed : 1146
% 63.82/9.61 # ...remaining for further processing : 3920
% 63.82/9.61 # Other redundant clauses eliminated : 2689
% 63.82/9.61 # Clauses deleted for lack of memory : 0
% 63.82/9.61 # Backward-subsumed : 28
% 63.82/9.61 # Backward-rewritten : 11
% 63.82/9.61 # Generated clauses : 88016
% 63.82/9.61 # ...of the previous two non-redundant : 80545
% 63.82/9.61 # ...aggressively subsumed : 0
% 63.82/9.61 # Contextual simplify-reflections : 80
% 63.82/9.61 # Paramodulations : 85949
% 63.82/9.61 # Factorizations : 32
% 63.82/9.61 # NegExts : 0
% 63.82/9.61 # Equation resolutions : 2715
% 63.82/9.61 # Disequality decompositions : 0
% 63.82/9.61 # Total rewrite steps : 24929
% 63.82/9.61 # ...of those cached : 21601
% 63.82/9.61 # Propositional unsat checks : 0
% 63.82/9.61 # Propositional check models : 0
% 63.82/9.61 # Propositional check unsatisfiable : 0
% 63.82/9.61 # Propositional clauses : 0
% 63.82/9.61 # Propositional clauses after purity: 0
% 63.82/9.61 # Propositional unsat core size : 0
% 63.82/9.61 # Propositional preprocessing time : 0.000
% 63.82/9.61 # Propositional encoding time : 0.000
% 63.82/9.61 # Propositional solver time : 0.000
% 63.82/9.61 # Success case prop preproc time : 0.000
% 63.82/9.61 # Success case prop encoding time : 0.000
% 63.82/9.61 # Success case prop solver time : 0.000
% 63.82/9.61 # Current number of processed clauses : 2794
% 63.82/9.61 # Positive orientable unit clauses : 304
% 63.82/9.61 # Positive unorientable unit clauses: 20
% 63.82/9.61 # Negative unit clauses : 90
% 63.82/9.61 # Non-unit-clauses : 2380
% 63.82/9.61 # Current number of unprocessed clauses: 80473
% 63.82/9.61 # ...number of literals in the above : 338751
% 63.82/9.61 # Current number of archived formulas : 0
% 63.82/9.61 # Current number of archived clauses : 40
% 63.82/9.61 # Clause-clause subsumption calls (NU) : 6965307
% 63.82/9.61 # Rec. Clause-clause subsumption calls : 325326
% 63.82/9.61 # Non-unit clause-clause subsumptions : 1118
% 63.82/9.61 # Unit Clause-clause subsumption calls : 22218
% 63.82/9.61 # Rewrite failures with RHS unbound : 0
% 63.82/9.61 # BW rewrite match attempts : 2418
% 63.82/9.61 # BW rewrite match successes : 82
% 63.82/9.61 # Condensation attempts : 0
% 63.82/9.61 # Condensation successes : 0
% 63.82/9.61 # Termbank termtop insertions : 3459285
% 63.82/9.61 # Search garbage collected termcells : 181306
% 63.82/9.61
% 63.82/9.61 # -------------------------------------------------
% 63.82/9.61 # User time : 8.041 s
% 63.82/9.61 # System time : 0.146 s
% 63.82/9.61 # Total time : 8.187 s
% 63.82/9.61 # Maximum resident set size: 43284 pages
% 63.82/9.61
% 63.82/9.61 # -------------------------------------------------
% 63.82/9.61 # User time : 23.736 s
% 63.82/9.61 # System time : 0.257 s
% 63.82/9.61 # Total time : 23.993 s
% 63.82/9.61 # Maximum resident set size: 28160 pages
% 63.82/9.61 % E---3.1 exiting
%------------------------------------------------------------------------------