TSTP Solution File: ITP232_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP232_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:20:08 EDT 2024
% Result : Theorem 4.92s 2.16s
% Output : CNFRefutation 4.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 28
% Syntax : Number of formulae : 41 ( 13 unt; 24 typ; 0 def)
% Number of atoms : 21 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 11 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 10 ( 9 usr)
% Number of type conns : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 7 !; 4 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_VEBT_VEBT_bool: $tType ).
tff(decl_sort2,type,
fun_nat_nat: $tType ).
tff(decl_sort3,type,
fun_nat_bool: $tType ).
tff(decl_sort4,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort5,type,
nat: $tType ).
tff(decl_sort6,type,
vEBT_VEBT: $tType ).
tff(decl_sort7,type,
fun_VE3763956218935105199t_bool: $tType ).
tff(decl_sort8,type,
bool: $tType ).
tff(decl_sort9,type,
list_VEBT_VEBT: $tType ).
tff(decl_1184,type,
nth_VEBT_VEBT: ( list_VEBT_VEBT * nat ) > vEBT_VEBT ).
tff(decl_1602,type,
vEBT_V8194947554948674370ptions: fun_VE3763956218935105199t_bool ).
tff(decl_1603,type,
vEBT_VEBT_high: fun_nat_fun_nat_nat ).
tff(decl_1619,type,
vEBT_VEBT_minNull: fun_VEBT_VEBT_bool ).
tff(decl_1711,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1713,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1740,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1838,type,
aa_VEBT_VEBT_bool: ( fun_VEBT_VEBT_bool * vEBT_VEBT ) > bool ).
tff(decl_1850,type,
aa_VEB4832260192069861672t_bool: ( fun_VE3763956218935105199t_bool * vEBT_VEBT ) > fun_nat_bool ).
tff(decl_2074,type,
pp: bool > $o ).
tff(decl_2077,type,
m: nat ).
tff(decl_2079,type,
mi: nat ).
tff(decl_2080,type,
na: nat ).
tff(decl_2082,type,
treeList: list_VEBT_VEBT ).
tff(decl_2204,type,
esk116_1: vEBT_VEBT > nat ).
tff(conj_0,conjecture,
? [X252: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na))),X252)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_1_False,axiom,
~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_False) ).
tff(fact_0_not__min__Null__member,axiom,
! [X1: vEBT_VEBT] :
( ~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,X1))
=> ? [X2: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X1),X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_not__min__Null__member) ).
tff(fact_3__C8_C,axiom,
na = m,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3__C8_C) ).
tff(c_0_4,negated_conjecture,
~ ? [X252: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na))),X252)),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_5,plain,
~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)))),
inference(fof_simplification,[status(thm)],[fact_1_False]) ).
tff(c_0_6,negated_conjecture,
! [X18596: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na))),X18596)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
tff(c_0_7,plain,
! [X1: vEBT_VEBT] :
( ~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,X1))
=> ? [X2: nat] : pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X1),X2)) ),
inference(fof_simplification,[status(thm)],[fact_0_not__min__Null__member]) ).
tff(c_0_8,plain,
~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)))),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
tcf(c_0_9,negated_conjecture,
! [X2: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na))),X2)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,plain,
na = m,
inference(split_conjunct,[status(thm)],[fact_3__C8_C]) ).
tff(c_0_11,plain,
! [X19206: vEBT_VEBT] :
( pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,X19206))
| pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X19206),esk116_1(X19206))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
tcf(c_0_12,plain,
~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),na)))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_13,negated_conjecture,
! [X2: nat] : ~ pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),m))),X2)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
tcf(c_0_14,plain,
! [X1: vEBT_VEBT] :
( pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,X1))
| pp(aa_nat_bool(aa_VEB4832260192069861672t_bool(vEBT_V8194947554948674370ptions,X1),esk116_1(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tcf(c_0_15,plain,
~ pp(aa_VEBT_VEBT_bool(vEBT_VEBT_minNull,nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,mi),m)))),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ITP232_1 : TPTP v8.2.0. Released v8.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat May 18 17:21:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/0.47 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
% 4.92/2.16 # Version: 3.1.0
% 4.92/2.16 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.92/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.92/2.16 # Starting new_bool_3 with 900s (3) cores
% 4.92/2.16 # Starting new_bool_1 with 900s (3) cores
% 4.92/2.16 # Starting sh5l with 300s (1) cores
% 4.92/2.16 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 4.92/2.16 # new_bool_1 with pid 26885 completed with status 0
% 4.92/2.16 # Result found by new_bool_1
% 4.92/2.16 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.92/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.92/2.16 # Starting new_bool_3 with 900s (3) cores
% 4.92/2.16 # Starting new_bool_1 with 900s (3) cores
% 4.92/2.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.92/2.16 # Search class: FGHSM-SMLM32-DFFFFFNN
% 4.92/2.16 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 4.92/2.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 4.92/2.16 # Starting new_bool_1 with 91s (1) cores
% 4.92/2.16 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 4.92/2.16 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 26893 completed with status 0
% 4.92/2.16 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 4.92/2.16 # Preprocessing class: FMLLSMLLSSSNFFN.
% 4.92/2.16 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.92/2.16 # Starting new_bool_3 with 900s (3) cores
% 4.92/2.16 # Starting new_bool_1 with 900s (3) cores
% 4.92/2.16 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.92/2.16 # Search class: FGHSM-SMLM32-DFFFFFNN
% 4.92/2.16 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 4.92/2.16 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 4.92/2.16 # Starting new_bool_1 with 91s (1) cores
% 4.92/2.16 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 4.92/2.16 # Preprocessing time : 0.100 s
% 4.92/2.16
% 4.92/2.16 # Proof found!
% 4.92/2.16 # SZS status Theorem
% 4.92/2.16 # SZS output start CNFRefutation
% See solution above
% 4.92/2.16 # Parsed axioms : 12949
% 4.92/2.16 # Removed by relevancy pruning/SinE : 10896
% 4.92/2.16 # Initial clauses : 6758
% 4.92/2.16 # Removed in clause preprocessing : 1847
% 4.92/2.16 # Initial clauses in saturation : 4911
% 4.92/2.16 # Processed clauses : 575
% 4.92/2.16 # ...of these trivial : 48
% 4.92/2.16 # ...subsumed : 115
% 4.92/2.16 # ...remaining for further processing : 412
% 4.92/2.16 # Other redundant clauses eliminated : 156
% 4.92/2.16 # Clauses deleted for lack of memory : 0
% 4.92/2.16 # Backward-subsumed : 7
% 4.92/2.16 # Backward-rewritten : 5
% 4.92/2.16 # Generated clauses : 709
% 4.92/2.16 # ...of the previous two non-redundant : 505
% 4.92/2.16 # ...aggressively subsumed : 0
% 4.92/2.16 # Contextual simplify-reflections : 0
% 4.92/2.16 # Paramodulations : 548
% 4.92/2.16 # Factorizations : 2
% 4.92/2.16 # NegExts : 0
% 4.92/2.16 # Equation resolutions : 163
% 4.92/2.16 # Disequality decompositions : 0
% 4.92/2.16 # Total rewrite steps : 370
% 4.92/2.16 # ...of those cached : 287
% 4.92/2.16 # Propositional unsat checks : 0
% 4.92/2.16 # Propositional check models : 0
% 4.92/2.16 # Propositional check unsatisfiable : 0
% 4.92/2.16 # Propositional clauses : 0
% 4.92/2.16 # Propositional clauses after purity: 0
% 4.92/2.16 # Propositional unsat core size : 0
% 4.92/2.16 # Propositional preprocessing time : 0.000
% 4.92/2.16 # Propositional encoding time : 0.000
% 4.92/2.16 # Propositional solver time : 0.000
% 4.92/2.16 # Success case prop preproc time : 0.000
% 4.92/2.16 # Success case prop encoding time : 0.000
% 4.92/2.16 # Success case prop solver time : 0.000
% 4.92/2.16 # Current number of processed clauses : 254
% 4.92/2.16 # Positive orientable unit clauses : 91
% 4.92/2.16 # Positive unorientable unit clauses: 0
% 4.92/2.16 # Negative unit clauses : 65
% 4.92/2.16 # Non-unit-clauses : 98
% 4.92/2.16 # Current number of unprocessed clauses: 4840
% 4.92/2.16 # ...number of literals in the above : 22270
% 4.92/2.16 # Current number of archived formulas : 0
% 4.92/2.16 # Current number of archived clauses : 12
% 4.92/2.16 # Clause-clause subsumption calls (NU) : 2892
% 4.92/2.16 # Rec. Clause-clause subsumption calls : 2655
% 4.92/2.16 # Non-unit clause-clause subsumptions : 91
% 4.92/2.16 # Unit Clause-clause subsumption calls : 525
% 4.92/2.16 # Rewrite failures with RHS unbound : 0
% 4.92/2.16 # BW rewrite match attempts : 189
% 4.92/2.16 # BW rewrite match successes : 5
% 4.92/2.16 # Condensation attempts : 0
% 4.92/2.16 # Condensation successes : 0
% 4.92/2.16 # Termbank termtop insertions : 824599
% 4.92/2.16 # Search garbage collected termcells : 184405
% 4.92/2.16
% 4.92/2.16 # -------------------------------------------------
% 4.92/2.16 # User time : 0.710 s
% 4.92/2.16 # System time : 0.069 s
% 4.92/2.16 # Total time : 0.779 s
% 4.92/2.16 # Maximum resident set size: 41824 pages
% 4.92/2.16
% 4.92/2.16 # -------------------------------------------------
% 4.92/2.16 # User time : 1.793 s
% 4.92/2.16 # System time : 0.123 s
% 4.92/2.16 # Total time : 1.916 s
% 4.92/2.16 # Maximum resident set size: 28876 pages
% 4.92/2.16 % E---3.1 exiting
%------------------------------------------------------------------------------