TSTP Solution File: NUM925+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM925+3 : TPTP v8.1.2. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:08:53 EDT 2023
% Result : Theorem 0.42s 1.02s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 14
% Syntax : Number of formulae : 49 ( 41 unt; 0 def)
% Number of atoms : 64 ( 37 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 18 ~; 11 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_809_succ__Bit0,axiom,
! [X22] : succ(bit0(X22)) = bit1(X22),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_809_succ__Bit0) ).
fof(fact_103_Bit0__def,axiom,
! [X22] : bit0(X22) = plus_plus_int(X22,X22),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_103_Bit0__def) ).
fof(fact_814_succ__def,axiom,
! [X22] : succ(X22) = plus_plus_int(X22,one_one_int),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_814_succ__def) ).
fof(conj_0,conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',conj_0) ).
fof(fact_767_nat__number__of__def,axiom,
! [X14] : number_number_of_nat(X14) = nat(number_number_of_int(X14)),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_767_nat__number__of__def) ).
fof(fact_16_one__add__one__is__two,axiom,
plus_plus_int(one_one_int,one_one_int) = number_number_of_int(bit0(bit1(pls))),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_16_one__add__one__is__two) ).
fof(fact_97_Bit0__Pls,axiom,
bit0(pls) = pls,
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_97_Bit0__Pls) ).
fof(fact_231_field__power__not__zero,axiom,
! [X65,X66] :
( is_int(X66)
=> ( X66 != zero_zero_int
=> hAPP_nat_int(power_power_int(X66),X65) != zero_zero_int ) ),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_231_field__power__not__zero) ).
fof(fact_98_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_98_Pls__def) ).
fof(gsy_c_Groups_Oplus__class_Oplus_000tc__Int__Oint,hypothesis,
! [X1,X2] :
( ( is_int(X1)
& is_int(X2) )
=> is_int(plus_plus_int(X1,X2)) ),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',gsy_c_Groups_Oplus__class_Oplus_000tc__Int__Oint) ).
fof(gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint,hypothesis,
! [X1,X2] : is_int(hAPP_nat_int(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint) ).
fof(fact_79_bin__less__0__simps_I1_J,axiom,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_79_bin__less__0__simps_I1_J) ).
fof(fact_0_n1pos,axiom,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',fact_0_n1pos) ).
fof(gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint,hypothesis,
is_int(one_one_int),
file('/export/starexec/sandbox/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p',gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint) ).
fof(c_0_14,plain,
! [X2084] : succ(bit0(X2084)) = bit1(X2084),
inference(variable_rename,[status(thm)],[fact_809_succ__Bit0]) ).
fof(c_0_15,plain,
! [X535] : bit0(X535) = plus_plus_int(X535,X535),
inference(variable_rename,[status(thm)],[fact_103_Bit0__def]) ).
fof(c_0_16,plain,
! [X2092] : succ(X2092) = plus_plus_int(X2092,one_one_int),
inference(variable_rename,[status(thm)],[fact_814_succ__def]) ).
cnf(c_0_17,plain,
succ(bit0(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
succ(X1) = plus_plus_int(X1,one_one_int),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_21,plain,
! [X1991] : number_number_of_nat(X1991) = nat(number_number_of_int(X1991)),
inference(variable_rename,[status(thm)],[fact_767_nat__number__of__def]) ).
cnf(c_0_22,plain,
plus_plus_int(one_one_int,one_one_int) = number_number_of_int(bit0(bit1(pls))),
inference(split_conjunct,[status(thm)],[fact_16_one__add__one__is__two]) ).
cnf(c_0_23,plain,
plus_plus_int(plus_plus_int(X1,X1),one_one_int) = bit1(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_24,plain,
bit0(pls) = pls,
inference(split_conjunct,[status(thm)],[fact_97_Bit0__Pls]) ).
fof(c_0_25,plain,
! [X721,X722] :
( ~ is_int(X722)
| X722 = zero_zero_int
| hAPP_nat_int(power_power_int(X722),X721) != zero_zero_int ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_231_field__power__not__zero])]) ).
cnf(c_0_26,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
number_number_of_nat(X1) = nat(number_number_of_int(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
plus_plus_int(one_one_int,one_one_int) = number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_18]),c_0_23]),c_0_23]) ).
cnf(c_0_29,plain,
plus_plus_int(pls,pls) = pls,
inference(rw,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_30,plain,
( X1 = zero_zero_int
| ~ is_int(X1)
| hAPP_nat_int(power_power_int(X1),X2) != zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_98_Pls__def]) ).
cnf(c_0_32,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_18]),c_0_27]),c_0_23]),c_0_23]) ).
cnf(c_0_33,plain,
number_number_of_int(plus_plus_int(plus_plus_int(pls,one_one_int),plus_plus_int(pls,one_one_int))) = plus_plus_int(one_one_int,one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_29]) ).
cnf(c_0_34,plain,
( X1 = pls
| hAPP_nat_int(power_power_int(X1),X2) != pls
| ~ is_int(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(plus_plus_int(one_one_int,one_one_int))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_29]),c_0_29]),c_0_33]),c_0_31]) ).
fof(c_0_36,hypothesis,
! [X406,X407] :
( ~ is_int(X406)
| ~ is_int(X407)
| is_int(plus_plus_int(X406,X407)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[gsy_c_Groups_Oplus__class_Oplus_000tc__Int__Oint])]) ).
fof(c_0_37,hypothesis,
! [X423,X424] : is_int(hAPP_nat_int(X423,X424)),
inference(variable_rename,[status(thm)],[gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint]) ).
fof(c_0_38,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
inference(fof_simplification,[status(thm)],[fact_79_bin__less__0__simps_I1_J]) ).
cnf(c_0_39,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_40,negated_conjecture,
( plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = pls
| ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,hypothesis,
( is_int(plus_plus_int(X1,X2))
| ~ is_int(X1)
| ~ is_int(X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,hypothesis,
is_int(hAPP_nat_int(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,hypothesis,
is_int(one_one_int),
inference(split_conjunct,[status(thm)],[gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint]) ).
cnf(c_0_44,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
inference(rw,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_46,hypothesis,
plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = pls,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).
cnf(c_0_47,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
inference(rw,[status(thm)],[c_0_44,c_0_31]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : NUM925+3 : TPTP v8.1.2. Released v5.3.0.
% 0.06/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 13:39:08 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.55 Running first-order model finding
% 0.17/0.55 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/tmp/tmp.JJ9DlnHJUl/E---3.1_2887.p
% 0.42/1.02 # Version: 3.1pre001
% 0.42/1.02 # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.42/1.02 # Starting new_bool_3 with 600s (2) cores
% 0.42/1.02 # Starting new_bool_1 with 600s (2) cores
% 0.42/1.02 # Starting sh5l with 300s (1) cores
% 0.42/1.02 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 2964 completed with status 0
% 0.42/1.02 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.42/1.02 # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.42/1.02 # No SInE strategy applied
% 0.42/1.02 # Search class: FGHSM-SSLM31-DFFFFFNN
% 0.42/1.02 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.42/1.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 487s (1) cores
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 91s (1) cores
% 0.42/1.02 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 82s (1) cores
% 0.42/1.02 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 2974 completed with status 0
% 0.42/1.02 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.42/1.02 # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.42/1.02 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.42/1.02 # No SInE strategy applied
% 0.42/1.02 # Search class: FGHSM-SSLM31-DFFFFFNN
% 0.42/1.02 # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.42/1.02 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 487s (1) cores
% 0.42/1.02 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 91s (1) cores
% 0.42/1.02 # Preprocessing time : 0.021 s
% 0.42/1.02 # Presaturation interreduction done
% 0.42/1.02
% 0.42/1.02 # Proof found!
% 0.42/1.02 # SZS status Theorem
% 0.42/1.02 # SZS output start CNFRefutation
% See solution above
% 0.42/1.02 # Parsed axioms : 1233
% 0.42/1.02 # Removed by relevancy pruning/SinE : 0
% 0.42/1.02 # Initial clauses : 1809
% 0.42/1.02 # Removed in clause preprocessing : 121
% 0.42/1.02 # Initial clauses in saturation : 1688
% 0.42/1.02 # Processed clauses : 4732
% 0.42/1.02 # ...of these trivial : 240
% 0.42/1.02 # ...subsumed : 2430
% 0.42/1.02 # ...remaining for further processing : 2062
% 0.42/1.02 # Other redundant clauses eliminated : 177
% 0.42/1.02 # Clauses deleted for lack of memory : 0
% 0.42/1.02 # Backward-subsumed : 45
% 0.42/1.02 # Backward-rewritten : 130
% 0.42/1.02 # Generated clauses : 10405
% 0.42/1.02 # ...of the previous two non-redundant : 8865
% 0.42/1.02 # ...aggressively subsumed : 0
% 0.42/1.02 # Contextual simplify-reflections : 3
% 0.42/1.02 # Paramodulations : 10227
% 0.42/1.02 # Factorizations : 1
% 0.42/1.02 # NegExts : 0
% 0.42/1.02 # Equation resolutions : 194
% 0.42/1.02 # Total rewrite steps : 15620
% 0.42/1.02 # Propositional unsat checks : 0
% 0.42/1.02 # Propositional check models : 0
% 0.42/1.02 # Propositional check unsatisfiable : 0
% 0.42/1.02 # Propositional clauses : 0
% 0.42/1.02 # Propositional clauses after purity: 0
% 0.42/1.02 # Propositional unsat core size : 0
% 0.42/1.02 # Propositional preprocessing time : 0.000
% 0.42/1.02 # Propositional encoding time : 0.000
% 0.42/1.02 # Propositional solver time : 0.000
% 0.42/1.02 # Success case prop preproc time : 0.000
% 0.42/1.02 # Success case prop encoding time : 0.000
% 0.42/1.02 # Success case prop solver time : 0.000
% 0.42/1.02 # Current number of processed clauses : 690
% 0.42/1.02 # Positive orientable unit clauses : 338
% 0.42/1.02 # Positive unorientable unit clauses: 19
% 0.42/1.02 # Negative unit clauses : 163
% 0.42/1.02 # Non-unit-clauses : 170
% 0.42/1.02 # Current number of unprocessed clauses: 6805
% 0.42/1.02 # ...number of literals in the above : 10764
% 0.42/1.02 # Current number of archived formulas : 0
% 0.42/1.02 # Current number of archived clauses : 1234
% 0.42/1.02 # Clause-clause subsumption calls (NU) : 115540
% 0.42/1.02 # Rec. Clause-clause subsumption calls : 51793
% 0.42/1.02 # Non-unit clause-clause subsumptions : 373
% 0.42/1.02 # Unit Clause-clause subsumption calls : 4245
% 0.42/1.02 # Rewrite failures with RHS unbound : 0
% 0.42/1.02 # BW rewrite match attempts : 1350
% 0.42/1.02 # BW rewrite match successes : 531
% 0.42/1.02 # Condensation attempts : 0
% 0.42/1.02 # Condensation successes : 0
% 0.42/1.02 # Termbank termtop insertions : 282229
% 0.42/1.02
% 0.42/1.02 # -------------------------------------------------
% 0.42/1.02 # User time : 0.395 s
% 0.42/1.02 # System time : 0.019 s
% 0.42/1.02 # Total time : 0.414 s
% 0.42/1.02 # Maximum resident set size: 8792 pages
% 0.42/1.02
% 0.42/1.02 # -------------------------------------------------
% 0.42/1.02 # User time : 1.062 s
% 0.42/1.02 # System time : 0.055 s
% 0.42/1.02 # Total time : 1.116 s
% 0.42/1.02 # Maximum resident set size: 3560 pages
% 0.42/1.02 % E---3.1 exiting
%------------------------------------------------------------------------------