TSTP Solution File: NUM925+4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM925+4 : TPTP v8.1.2. Released v5.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:58:00 EDT 2023
% Result : Theorem 2.78s 2.54s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 38 ( 27 unt; 0 def)
% Number of atoms : 58 ( 25 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 41 ( 21 ~; 13 |; 1 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 13 con; 0-2 aty)
% Number of variables : 44 ( 4 sgn; 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) != zero_zero_int,
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',conj_0) ).
fof(fact_1907_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X563] : hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X563),X563) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X563),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_1907_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
fof(fact_1984_leD,axiom,
! [X585,X586] :
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X585),X586))
=> ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X586),X585)) ),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_1984_leD) ).
fof(fact_151_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_151_Pls__def) ).
fof(fact_420_less__add__one,axiom,
! [X82] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X82),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X82),one_one_int))),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_420_less__add__one) ).
fof(fact_1130_no__zero__divisors,axiom,
! [X292,X293] :
( ( is_int(X292)
& is_int(X293) )
=> ( X293 != zero_zero_int
=> ( X292 != zero_zero_int
=> hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X293),X292) != zero_zero_int ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_1130_no__zero__divisors) ).
fof(fact_102_zadd__commute,axiom,
! [X18,X15] : hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X18),X15) = hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X15),X18),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_102_zadd__commute) ).
fof(gsy_c_hAPP_000tc__Int__Oint_000tc__Int__Oint,hypothesis,
! [X1,X2] :
( is_int(X2)
=> is_int(hAPP_int_int(X1,X2)) ),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',gsy_c_hAPP_000tc__Int__Oint_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/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint) ).
fof(fact_718_of__nat__0__le__iff,axiom,
! [X164] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,zero_zero_int),hAPP_nat_int(semiri1621563631at_int,X164))),
file('/export/starexec/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p',fact_718_of__nat__0__le__iff) ).
fof(c_0_10,negated_conjecture,
hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) = zero_zero_int,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_11,plain,
! [X1205] : hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1205),X1205) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1205),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
inference(variable_rename,[status(thm)],[fact_1907_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
fof(c_0_12,plain,
! [X585,X586] :
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X585),X586))
=> ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X586),X585)) ),
inference(fof_simplification,[status(thm)],[fact_1984_leD]) ).
cnf(c_0_13,negated_conjecture,
hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_151_Pls__def]) ).
cnf(c_0_15,plain,
hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1),X1) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,pls)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X1683,X1684] :
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X1683),X1684))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1684),X1683)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_17,plain,
! [X1029] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1029),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1029),one_one_int))),
inference(variable_rename,[status(thm)],[fact_420_less__add__one]) ).
fof(c_0_18,plain,
! [X946,X947] :
( ~ is_int(X946)
| ~ is_int(X947)
| X947 = zero_zero_int
| X946 = zero_zero_int
| hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X947),X946) != zero_zero_int ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1130_no__zero__divisors])]) ).
cnf(c_0_19,negated_conjecture,
hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,zero_zero_int)))) = zero_zero_int,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X1),X1) = hAPP_nat_int(hAPP_int_fun_nat_int(power_power_int,X1),hAPP_int_nat(number_number_of_nat,hAPP_int_int(bit0,hAPP_int_int(bit1,zero_zero_int)))),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_21,plain,
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,X1),X2))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X2),X1)) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X1),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1),one_one_int))),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_23,plain,
! [X1346,X1347] : hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1346),X1347) = hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1347),X1346),
inference(variable_rename,[status(thm)],[fact_102_zadd__commute]) ).
cnf(c_0_24,plain,
( X2 = zero_zero_int
| X1 = zero_zero_int
| ~ is_int(X1)
| ~ is_int(X2)
| hAPP_int_int(hAPP_int_fun_int_int(times_times_int,X2),X1) != zero_zero_int ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,negated_conjecture,
hAPP_int_int(hAPP_int_fun_int_int(times_times_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))),hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))) = zero_zero_int,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_26,hypothesis,
! [X875,X876] :
( ~ is_int(X876)
| is_int(hAPP_int_int(X875,X876)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[gsy_c_hAPP_000tc__Int__Oint_000tc__Int__Oint])]) ).
fof(c_0_27,hypothesis,
! [X877,X878] : is_int(hAPP_nat_int(X877,X878)),
inference(variable_rename,[status(thm)],[gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint]) ).
cnf(c_0_28,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1),one_one_int)),X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X1),X2) = hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int
| ~ is_int(hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,hypothesis,
( is_int(hAPP_int_int(X2,X1))
| ~ is_int(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_32,hypothesis,
is_int(hAPP_nat_int(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_33,plain,
! [X1278] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,zero_zero_int),hAPP_nat_int(semiri1621563631at_int,X1278))),
inference(variable_rename,[status(thm)],[fact_718_of__nat__0__le__iff]) ).
cnf(c_0_34,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),X1)),X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,hypothesis,
hAPP_int_int(hAPP_int_fun_int_int(plus_plus_int,one_one_int),hAPP_nat_int(semiri1621563631at_int,n)) = zero_zero_int,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_36,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_eq_int,zero_zero_int),hAPP_nat_int(semiri1621563631at_int,X1))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_37,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.93/0.95 % Problem : NUM925+4 : TPTP v8.1.2. Released v5.3.0.
% 0.93/0.96 % Command : run_E %s %d THM
% 0.97/1.17 % Computer : n023.cluster.edu
% 0.97/1.17 % Model : x86_64 x86_64
% 0.97/1.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.97/1.17 % Memory : 8042.1875MB
% 0.97/1.17 % OS : Linux 3.10.0-693.el7.x86_64
% 0.97/1.17 % CPULimit : 2400
% 0.97/1.17 % WCLimit : 300
% 0.97/1.17 % DateTime : Mon Oct 2 14:59:38 EDT 2023
% 0.97/1.17 % CPUTime :
% 1.96/2.16 Running first-order theorem proving
% 1.96/2.16 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.iQsUMNHE9f/E---3.1_11833.p
% 2.78/2.54 # Version: 3.1pre001
% 2.78/2.54 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.78/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.78/2.54 # Starting new_bool_3 with 900s (3) cores
% 2.78/2.54 # Starting new_bool_1 with 900s (3) cores
% 2.78/2.54 # Starting sh5l with 300s (1) cores
% 2.78/2.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.78/2.54 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 11914 completed with status 0
% 2.78/2.54 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 2.78/2.54 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.78/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.78/2.54 # Starting new_bool_3 with 900s (3) cores
% 2.78/2.54 # Starting new_bool_1 with 900s (3) cores
% 2.78/2.54 # Starting sh5l with 300s (1) cores
% 2.78/2.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.78/2.54 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 2.78/2.54 # Search class: FGHSM-FSLM31-DFFFFFNN
% 2.78/2.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.78/2.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.78/2.54 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 11915 completed with status 0
% 2.78/2.54 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 2.78/2.54 # Preprocessing class: FMLLSMLLSSSNFFN.
% 2.78/2.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.78/2.54 # Starting new_bool_3 with 900s (3) cores
% 2.78/2.54 # Starting new_bool_1 with 900s (3) cores
% 2.78/2.54 # Starting sh5l with 300s (1) cores
% 2.78/2.54 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 2.78/2.54 # SinE strategy is gf120_h_gu_RUU_F100_L00500
% 2.78/2.54 # Search class: FGHSM-FSLM31-DFFFFFNN
% 2.78/2.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.78/2.54 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.78/2.54 # Preprocessing time : 0.019 s
% 2.78/2.54 # Presaturation interreduction done
% 2.78/2.54
% 2.78/2.54 # Proof found!
% 2.78/2.54 # SZS status Theorem
% 2.78/2.54 # SZS output start CNFRefutation
% See solution above
% 2.78/2.54 # Parsed axioms : 5487
% 2.78/2.54 # Removed by relevancy pruning/SinE : 4986
% 2.78/2.54 # Initial clauses : 706
% 2.78/2.54 # Removed in clause preprocessing : 42
% 2.78/2.54 # Initial clauses in saturation : 664
% 2.78/2.54 # Processed clauses : 1624
% 2.78/2.54 # ...of these trivial : 77
% 2.78/2.54 # ...subsumed : 694
% 2.78/2.54 # ...remaining for further processing : 853
% 2.78/2.54 # Other redundant clauses eliminated : 89
% 2.78/2.54 # Clauses deleted for lack of memory : 0
% 2.78/2.54 # Backward-subsumed : 46
% 2.78/2.54 # Backward-rewritten : 76
% 2.78/2.54 # Generated clauses : 3810
% 2.78/2.54 # ...of the previous two non-redundant : 3151
% 2.78/2.54 # ...aggressively subsumed : 0
% 2.78/2.54 # Contextual simplify-reflections : 4
% 2.78/2.54 # Paramodulations : 3727
% 2.78/2.54 # Factorizations : 0
% 2.78/2.54 # NegExts : 0
% 2.78/2.54 # Equation resolutions : 91
% 2.78/2.54 # Total rewrite steps : 3288
% 2.78/2.54 # Propositional unsat checks : 0
% 2.78/2.54 # Propositional check models : 0
% 2.78/2.54 # Propositional check unsatisfiable : 0
% 2.78/2.54 # Propositional clauses : 0
% 2.78/2.54 # Propositional clauses after purity: 0
% 2.78/2.54 # Propositional unsat core size : 0
% 2.78/2.54 # Propositional preprocessing time : 0.000
% 2.78/2.54 # Propositional encoding time : 0.000
% 2.78/2.54 # Propositional solver time : 0.000
% 2.78/2.54 # Success case prop preproc time : 0.000
% 2.78/2.54 # Success case prop encoding time : 0.000
% 2.78/2.54 # Success case prop solver time : 0.000
% 2.78/2.54 # Current number of processed clauses : 317
% 2.78/2.54 # Positive orientable unit clauses : 160
% 2.78/2.54 # Positive unorientable unit clauses: 9
% 2.78/2.54 # Negative unit clauses : 79
% 2.78/2.54 # Non-unit-clauses : 69
% 2.78/2.54 # Current number of unprocessed clauses: 2521
% 2.78/2.54 # ...number of literals in the above : 4226
% 2.78/2.54 # Current number of archived formulas : 0
% 2.78/2.54 # Current number of archived clauses : 492
% 2.78/2.54 # Clause-clause subsumption calls (NU) : 19542
% 2.78/2.54 # Rec. Clause-clause subsumption calls : 9368
% 2.78/2.54 # Non-unit clause-clause subsumptions : 260
% 2.78/2.54 # Unit Clause-clause subsumption calls : 1191
% 2.78/2.54 # Rewrite failures with RHS unbound : 0
% 2.78/2.54 # BW rewrite match attempts : 792
% 2.78/2.54 # BW rewrite match successes : 132
% 2.78/2.54 # Condensation attempts : 0
% 2.78/2.54 # Condensation successes : 0
% 2.78/2.54 # Termbank termtop insertions : 259529
% 2.78/2.54
% 2.78/2.54 # -------------------------------------------------
% 2.78/2.54 # User time : 0.207 s
% 2.78/2.54 # System time : 0.027 s
% 2.78/2.54 # Total time : 0.234 s
% 2.78/2.54 # Maximum resident set size: 12576 pages
% 2.78/2.54
% 2.78/2.54 # -------------------------------------------------
% 2.78/2.54 # User time : 0.317 s
% 2.78/2.54 # System time : 0.035 s
% 2.78/2.54 # Total time : 0.352 s
% 2.78/2.54 # Maximum resident set size: 10164 pages
% 2.78/2.54 % E---3.1 exiting
% 2.78/2.54 % E---3.1 exiting
%------------------------------------------------------------------------------