TSTP Solution File: NUM925+3 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM925+3 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n118.star.cs.uiowa.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory : 32218.625MB
% OS : Linux 3.10.0-693.2.2.el7.x86_64
% CPULimit : 300s
% DateTime : Mon Jan 8 15:22:42 EST 2018
% Result : Theorem 0.52s
% Output : CNFRefutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 51 unt; 0 def)
% Number of atoms : 67 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 21 ( 13 ~; 7 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-2 aty)
% Number of variables : 43 ( 3 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(34,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/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_0_n1pos) ).
fof(129,axiom,
! [X121,X122,X123] : equal(plus_plus_int(X121,plus_plus_int(X122,X123)),plus_plus_int(X122,plus_plus_int(X121,X123))),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_346_comm__semiring__1__class_Onormalizing__semiring__rules_I22_J) ).
fof(131,axiom,
! [X40,X41,X124] : equal(plus_plus_int(plus_plus_int(X40,X41),X124),plus_plus_int(X40,plus_plus_int(X41,X124))),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_65_zadd__assoc) ).
fof(184,axiom,
! [X159] : equal(number_number_of_nat(X159),nat(number_number_of_int(X159))),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_767_nat__number__of__def) ).
fof(351,axiom,
equal(pls,zero_zero_int),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_98_Pls__def) ).
fof(483,axiom,
! [X5] : equal(bit0(X5),plus_plus_int(X5,X5)),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_103_Bit0__def) ).
fof(493,axiom,
equal(bit0(pls),pls),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_97_Bit0__Pls) ).
fof(570,axiom,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_79_bin__less__0__simps_I1_J) ).
fof(635,axiom,
! [X348,X349] :
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X349))
=> hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X349),X348))) ),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_266_zero__less__power) ).
fof(684,axiom,
! [X5] : equal(succ(X5),plus_plus_int(X5,one_one_int)),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_814_succ__def) ).
fof(775,axiom,
equal(plus_plus_nat(one_one_nat,one_one_nat),number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_45_nat__1__add__1) ).
fof(996,axiom,
! [X5] : equal(succ(bit0(X5)),bit1(X5)),
file('/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',fact_809_succ__Bit0) ).
fof(1152,conjecture,
~ equal(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/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1',conj_0) ).
fof(1234,negated_conjecture,
~ ~ equal(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(assume_negation,[status(cth)],[1152]) ).
fof(1273,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
inference(fof_simplification,[status(thm)],[570,theory(equality)]) ).
fof(1314,negated_conjecture,
equal(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)],[1234,theory(equality)]) ).
cnf(1421,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)],[34]) ).
fof(1728,plain,
! [X124,X125,X126] : equal(plus_plus_int(X124,plus_plus_int(X125,X126)),plus_plus_int(X125,plus_plus_int(X124,X126))),
inference(variable_rename,[status(thm)],[129]) ).
cnf(1729,plain,
plus_plus_int(X1,plus_plus_int(X2,X3)) = plus_plus_int(X2,plus_plus_int(X1,X3)),
inference(split_conjunct,[status(thm)],[1728]) ).
fof(1735,plain,
! [X125,X126,X127] : equal(plus_plus_int(plus_plus_int(X125,X126),X127),plus_plus_int(X125,plus_plus_int(X126,X127))),
inference(variable_rename,[status(thm)],[131]) ).
cnf(1736,plain,
plus_plus_int(plus_plus_int(X1,X2),X3) = plus_plus_int(X1,plus_plus_int(X2,X3)),
inference(split_conjunct,[status(thm)],[1735]) ).
fof(1902,plain,
! [X160] : equal(number_number_of_nat(X160),nat(number_number_of_int(X160))),
inference(variable_rename,[status(thm)],[184]) ).
cnf(1903,plain,
number_number_of_nat(X1) = nat(number_number_of_int(X1)),
inference(split_conjunct,[status(thm)],[1902]) ).
cnf(2435,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[351]) ).
fof(2849,plain,
! [X6] : equal(bit0(X6),plus_plus_int(X6,X6)),
inference(variable_rename,[status(thm)],[483]) ).
cnf(2850,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[2849]) ).
cnf(2877,plain,
bit0(pls) = pls,
inference(split_conjunct,[status(thm)],[493]) ).
cnf(3109,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
inference(split_conjunct,[status(thm)],[1273]) ).
fof(3291,plain,
! [X348,X349] :
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X349))
| hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X349),X348))) ),
inference(fof_nnf,[status(thm)],[635]) ).
fof(3292,plain,
! [X350,X351] :
( ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X351))
| hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X351),X350))) ),
inference(variable_rename,[status(thm)],[3291]) ).
cnf(3293,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),hAPP_nat_int(power_power_int(X1),X2)))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X1)) ),
inference(split_conjunct,[status(thm)],[3292]) ).
fof(3439,plain,
! [X6] : equal(succ(X6),plus_plus_int(X6,one_one_int)),
inference(variable_rename,[status(thm)],[684]) ).
cnf(3440,plain,
succ(X1) = plus_plus_int(X1,one_one_int),
inference(split_conjunct,[status(thm)],[3439]) ).
cnf(3739,plain,
plus_plus_nat(one_one_nat,one_one_nat) = number_number_of_nat(bit0(bit1(pls))),
inference(split_conjunct,[status(thm)],[775]) ).
fof(4437,plain,
! [X6] : equal(succ(bit0(X6)),bit1(X6)),
inference(variable_rename,[status(thm)],[996]) ).
cnf(4438,plain,
succ(bit0(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[4437]) ).
cnf(4980,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)],[1314]) ).
cnf(5247,plain,
plus_plus_int(pls,pls) = pls,
inference(rw,[status(thm)],[2877,2850,theory(equality)]),
[unfolding] ).
cnf(5248,plain,
succ(plus_plus_int(X1,X1)) = bit1(X1),
inference(rw,[status(thm)],[4438,2850,theory(equality)]),
[unfolding] ).
cnf(5256,plain,
number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(rw,[status(thm)],[3739,2850,theory(equality)]),
[unfolding] ).
cnf(5283,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls)))) = zero_zero_int,
inference(rw,[status(thm)],[4980,2850,theory(equality)]),
[unfolding] ).
cnf(5437,plain,
nat(number_number_of_int(plus_plus_int(bit1(pls),bit1(pls)))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(rw,[status(thm)],[5256,1903,theory(equality)]),
[unfolding] ).
cnf(5452,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(bit1(pls),bit1(pls))))) = zero_zero_int,
inference(rw,[status(thm)],[5283,1903,theory(equality)]),
[unfolding] ).
cnf(5575,plain,
nat(number_number_of_int(plus_plus_int(succ(plus_plus_int(pls,pls)),succ(plus_plus_int(pls,pls))))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[5437,5248,theory(equality)]),5248,theory(equality)]),
[unfolding] ).
cnf(5607,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(succ(plus_plus_int(pls,pls)),succ(plus_plus_int(pls,pls)))))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[5452,5248,theory(equality)]),5248,theory(equality)]),
[unfolding] ).
cnf(5791,plain,
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)))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[5575,3440,theory(equality)]),3440,theory(equality)]),
[unfolding] ).
cnf(5823,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)],[5607,3440,theory(equality)]),3440,theory(equality)]),
[unfolding] ).
cnf(7309,plain,
nat(number_number_of_int(plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,one_one_int))))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[5791,5247,theory(equality)]),5247,theory(equality)]),1736,theory(equality)]),1729,theory(equality)]) ).
cnf(7320,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),plus_plus_nat(one_one_nat,one_one_nat)) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[5823,5247,theory(equality)]),5247,theory(equality)]),1736,theory(equality)]),1729,theory(equality)]),7309,theory(equality)]) ).
cnf(7321,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),plus_plus_nat(one_one_nat,one_one_nat)) = pls,
inference(rw,[status(thm)],[7320,2435,theory(equality)]) ).
cnf(7387,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
inference(rw,[status(thm)],[3109,2435,theory(equality)]) ).
cnf(8266,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)],[1421,2435,theory(equality)]) ).
cnf(16493,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_nat_int(power_power_int(X1),X2)))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),X1)) ),
inference(rw,[status(thm)],[3293,2435,theory(equality)]) ).
cnf(16494,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),hAPP_nat_int(power_power_int(X1),X2)))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),X1)) ),
inference(rw,[status(thm)],[16493,2435,theory(equality)]) ).
cnf(16497,negated_conjecture,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))
| ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))) ),
inference(spm,[status(thm)],[16494,7321,theory(equality)]) ).
cnf(16511,negated_conjecture,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls))
| $false ),
inference(rw,[status(thm)],[16497,8266,theory(equality)]) ).
cnf(16512,negated_conjecture,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
inference(cn,[status(thm)],[16511,theory(equality)]) ).
cnf(16513,negated_conjecture,
$false,
inference(sr,[status(thm)],[16512,7387,theory(equality)]) ).
cnf(16514,negated_conjecture,
$false,
16513,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+3 : TPTP v7.0.0. Released v5.3.0.
% 0.00/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n118.star.cs.uiowa.edu
% 0.02/0.23 % Model : x86_64 x86_64
% 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23 % Memory : 32218.625MB
% 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23 % CPULimit : 300
% 0.02/0.23 % DateTime : Fri Jan 5 16:35:34 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.28 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.28 --creating new selector for []
% 0.52/0.91 -running prover on /export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1 with time limit 29
% 0.52/0.91 -running prover with command ['/export/starexec/sandbox2/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox2/tmp/tmpDDBGTI/sel_theBenchmark.p_1']
% 0.52/0.91 -prover status Theorem
% 0.52/0.91 Problem theBenchmark.p solved in phase 0.
% 0.52/0.91 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.91 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.52/0.91 Solved 1 out of 1.
% 0.52/0.91 # Problem is unsatisfiable (or provable), constructing proof object
% 0.52/0.91 # SZS status Theorem
% 0.52/0.91 # SZS output start CNFRefutation.
% See solution above
% 0.73/0.92 # SZS output end CNFRefutation
%------------------------------------------------------------------------------