TSTP Solution File: ITP220_1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : ITP220_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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:19:58 EDT 2024
% Result : Theorem 47.69s 7.73s
% Output : CNFRefutation 47.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 33
% Syntax : Number of formulae : 48 ( 16 unt; 28 typ; 0 def)
% Number of atoms : 28 ( 10 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 11 ( 10 usr)
% Number of type conns : 15 ( 9 >; 6 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 9 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn 13 !; 0 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
fun_nat_bool: $tType ).
tff(decl_sort2,type,
fun_nat_fun_nat_bool: $tType ).
tff(decl_sort3,type,
nat: $tType ).
tff(decl_sort4,type,
fun_nat_nat: $tType ).
tff(decl_sort5,type,
fun_nat_fun_nat_nat: $tType ).
tff(decl_sort6,type,
num: $tType ).
tff(decl_sort7,type,
vEBT_VEBT: $tType ).
tff(decl_sort8,type,
bool: $tType ).
tff(decl_sort9,type,
fun_num_nat: $tType ).
tff(decl_sort10,type,
fun_num_num: $tType ).
tff(decl_573,type,
one_one_nat: nat ).
tff(decl_723,type,
suc: fun_nat_nat ).
tff(decl_792,type,
bit0: fun_num_num ).
tff(decl_794,type,
one: num ).
tff(decl_803,type,
numeral_numeral_nat: fun_num_nat ).
tff(decl_954,type,
divide_divide_nat: fun_nat_fun_nat_nat ).
tff(decl_961,type,
dvd_dvd_nat: fun_nat_fun_nat_bool ).
tff(decl_1083,type,
vEBT_VEBT_membermima: vEBT_VEBT > fun_nat_bool ).
tff(decl_1091,type,
vEBT_vebt_buildup: nat > vEBT_VEBT ).
tff(decl_1152,type,
aa_nat_bool: ( fun_nat_bool * nat ) > bool ).
tff(decl_1155,type,
aa_nat_nat: ( fun_nat_nat * nat ) > nat ).
tff(decl_1169,type,
aa_nat_fun_nat_bool: ( fun_nat_fun_nat_bool * nat ) > fun_nat_bool ).
tff(decl_1171,type,
aa_nat_fun_nat_nat: ( fun_nat_fun_nat_nat * nat ) > fun_nat_nat ).
tff(decl_1188,type,
aa_num_nat: ( fun_num_nat * num ) > nat ).
tff(decl_1189,type,
aa_num_num: ( fun_num_num * num ) > num ).
tff(decl_1307,type,
pp: bool > $o ).
tff(decl_1308,type,
va: nat ).
tff(decl_1309,type,
y: nat ).
tff(fact_1__C3_OIH_C_I1_J,axiom,
! [X1: nat,X2: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va))))
=> ( ( X1 = aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) )
=> ~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(X1)),X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__C3_OIH_C_I1_J) ).
tff(fact_4_div2__Suc__Suc,axiom,
! [X3: nat] : ( aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,X3))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,X3),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_div2__Suc__Suc) ).
tff(conj_0,conjecture,
~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))))),y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(fact_525_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/benchmark/theBenchmark.p',fact_525_Suc__1) ).
tff(fact_0_True,axiom,
pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_True) ).
tff(c_0_5,plain,
! [X1: nat,X2: nat] :
( pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va))))
=> ( ( X1 = aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) )
=> ~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(X1)),X2)) ) ),
inference(fof_simplification,[status(thm)],[fact_1__C3_OIH_C_I1_J]) ).
tff(c_0_6,plain,
! [X17026: nat] : ( aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,X17026))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,X17026),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))) ),
inference(variable_rename,[status(thm)],[fact_4_div2__Suc__Suc]) ).
tff(c_0_7,negated_conjecture,
pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))))),y)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
tff(c_0_8,plain,
! [X16714: nat,X16715: nat] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va))))
| ( X16714 != aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) )
| ~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(X16714)),X16715)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
tcf(c_0_9,plain,
! [X1: nat] : aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,X1))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,X1),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
tcf(c_0_10,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_525_Suc__1]) ).
tcf(c_0_11,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va)))),
inference(split_conjunct,[status(thm)],[fact_0_True]) ).
tcf(c_0_12,negated_conjecture,
pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))))),y)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
tcf(c_0_13,plain,
! [X1: nat,X2: nat] :
( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))),aa_nat_nat(suc,aa_nat_nat(suc,va))))
| ( X1 != aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) )
| ~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(X1)),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
tcf(c_0_14,plain,
! [X1: nat] : aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,X1))),aa_nat_nat(suc,one_one_nat)) = aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,X1),aa_nat_nat(suc,one_one_nat))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
tcf(c_0_15,plain,
pp(aa_nat_bool(aa_nat_fun_nat_bool(dvd_dvd_nat,aa_nat_nat(suc,one_one_nat)),aa_nat_nat(suc,aa_nat_nat(suc,va)))),
inference(rw,[status(thm)],[c_0_11,c_0_10]) ).
tcf(c_0_16,negated_conjecture,
pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,aa_nat_nat(suc,aa_nat_nat(suc,va))),aa_nat_nat(suc,one_one_nat)))),y)),
inference(rw,[status(thm)],[c_0_12,c_0_10]) ).
tcf(c_0_17,plain,
! [X1: nat] : ~ pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,va),aa_nat_nat(suc,one_one_nat))))),X1)),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_14]),c_0_10]),c_0_15])])]) ).
tcf(c_0_18,negated_conjecture,
pp(aa_nat_bool(vEBT_VEBT_membermima(vEBT_vebt_buildup(aa_nat_nat(suc,aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,va),aa_nat_nat(suc,one_one_nat))))),y)),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_19,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : ITP220_1 : TPTP v8.2.0. Released v8.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Sat May 18 18:21:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running first-order model finding
% 0.22/0.51 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 47.69/7.73 # Version: 3.1.0
% 47.69/7.73 # Preprocessing class: FMLLSMLLSSSNFFN.
% 47.69/7.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.69/7.73 # Starting new_bool_3 with 900s (3) cores
% 47.69/7.73 # Starting new_bool_1 with 900s (3) cores
% 47.69/7.73 # Starting sh5l with 300s (1) cores
% 47.69/7.73 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 47.69/7.73 # new_bool_3 with pid 1097 completed with status 0
% 47.69/7.73 # Result found by new_bool_3
% 47.69/7.73 # Preprocessing class: FMLLSMLLSSSNFFN.
% 47.69/7.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.69/7.73 # Starting new_bool_3 with 900s (3) cores
% 47.69/7.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 47.69/7.73 # Search class: FGHSM-SMLM32-DFFFFFNN
% 47.69/7.73 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 47.69/7.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 47.69/7.73 # Starting new_bool_3 with 91s (1) cores
% 47.69/7.73 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 47.69/7.73 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 1281 completed with status 0
% 47.69/7.73 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 47.69/7.73 # Preprocessing class: FMLLSMLLSSSNFFN.
% 47.69/7.73 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 47.69/7.73 # Starting new_bool_3 with 900s (3) cores
% 47.69/7.73 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 47.69/7.73 # Search class: FGHSM-SMLM32-DFFFFFNN
% 47.69/7.73 # Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 47.69/7.73 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 47.69/7.73 # Starting new_bool_3 with 91s (1) cores
% 47.69/7.73 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 47.69/7.73 # Preprocessing time : 0.267 s
% 47.69/7.73 # SatCheck found unsatisfiable ground set
% 47.69/7.73
% 47.69/7.73 # Proof found!
% 47.69/7.73 # SZS status Theorem
% 47.69/7.73 # SZS output start CNFRefutation
% See solution above
% 47.69/7.73 # Parsed axioms : 11990
% 47.69/7.73 # Removed by relevancy pruning/SinE : 8404
% 47.69/7.73 # Initial clauses : 8940
% 47.69/7.73 # Removed in clause preprocessing : 1545
% 47.69/7.73 # Initial clauses in saturation : 7395
% 47.69/7.73 # Processed clauses : 6349
% 47.69/7.73 # ...of these trivial : 337
% 47.69/7.73 # ...subsumed : 1012
% 47.69/7.73 # ...remaining for further processing : 5000
% 47.69/7.73 # Other redundant clauses eliminated : 2037
% 47.69/7.73 # Clauses deleted for lack of memory : 0
% 47.69/7.73 # Backward-subsumed : 60
% 47.69/7.73 # Backward-rewritten : 71
% 47.69/7.73 # Generated clauses : 182460
% 47.69/7.73 # ...of the previous two non-redundant : 163170
% 47.69/7.73 # ...aggressively subsumed : 0
% 47.69/7.73 # Contextual simplify-reflections : 26
% 47.69/7.73 # Paramodulations : 180381
% 47.69/7.73 # Factorizations : 25
% 47.69/7.73 # NegExts : 0
% 47.69/7.73 # Equation resolutions : 2113
% 47.69/7.73 # Disequality decompositions : 0
% 47.69/7.73 # Total rewrite steps : 64187
% 47.69/7.73 # ...of those cached : 54941
% 47.69/7.73 # Propositional unsat checks : 1
% 47.69/7.73 # Propositional check models : 0
% 47.69/7.73 # Propositional check unsatisfiable : 1
% 47.69/7.73 # Propositional clauses : 168427
% 47.69/7.73 # Propositional clauses after purity: 77175
% 47.69/7.73 # Propositional unsat core size : 2
% 47.69/7.73 # Propositional preprocessing time : 0.000
% 47.69/7.73 # Propositional encoding time : 0.413
% 47.69/7.73 # Propositional solver time : 0.038
% 47.69/7.73 # Success case prop preproc time : 0.000
% 47.69/7.73 # Success case prop encoding time : 0.413
% 47.69/7.73 # Success case prop solver time : 0.038
% 47.69/7.73 # Current number of processed clauses : 4211
% 47.69/7.73 # Positive orientable unit clauses : 617
% 47.69/7.73 # Positive unorientable unit clauses: 47
% 47.69/7.73 # Negative unit clauses : 137
% 47.69/7.73 # Non-unit-clauses : 3410
% 47.69/7.73 # Current number of unprocessed clauses: 164216
% 47.69/7.73 # ...number of literals in the above : 572241
% 47.69/7.73 # Current number of archived formulas : 0
% 47.69/7.73 # Current number of archived clauses : 131
% 47.69/7.73 # Clause-clause subsumption calls (NU) : 1543120
% 47.69/7.73 # Rec. Clause-clause subsumption calls : 710754
% 47.69/7.73 # Non-unit clause-clause subsumptions : 958
% 47.69/7.73 # Unit Clause-clause subsumption calls : 3264
% 47.69/7.73 # Rewrite failures with RHS unbound : 0
% 47.69/7.73 # BW rewrite match attempts : 8324
% 47.69/7.73 # BW rewrite match successes : 309
% 47.69/7.73 # Condensation attempts : 0
% 47.69/7.73 # Condensation successes : 0
% 47.69/7.73 # Termbank termtop insertions : 8539914
% 47.69/7.73 # Search garbage collected termcells : 169445
% 47.69/7.73
% 47.69/7.73 # -------------------------------------------------
% 47.69/7.73 # User time : 5.982 s
% 47.69/7.73 # System time : 0.202 s
% 47.69/7.73 # Total time : 6.184 s
% 47.69/7.73 # Maximum resident set size: 45424 pages
% 47.69/7.73
% 47.69/7.73 # -------------------------------------------------
% 47.69/7.73 # User time : 17.373 s
% 47.69/7.73 # System time : 0.299 s
% 47.69/7.73 # Total time : 17.671 s
% 47.69/7.73 # Maximum resident set size: 25452 pages
% 47.69/7.73 % E---3.1 exiting
%------------------------------------------------------------------------------