%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM925+1 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n040.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:41 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 29 unt; 0 def)
% Number of atoms : 57 ( 16 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 41 ( 20 ~; 13 |; 7 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-2 aty)
% Number of variables : 23 ( 3 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(12,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_0_n1pos) ).
fof(30,axiom,
equal(pls,zero_zero_int),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_78_Pls__def) ).
fof(51,conjecture,
~ equal(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',conj_0) ).
fof(52,axiom,
! [X11,X12] :
( equal(power_power_int(X11,number_number_of_nat(X12)),zero_zero_int)
<=> ( equal(X11,zero_zero_int)
& ~ equal(number_number_of_nat(X12),zero_zero_nat) ) ),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_92_power__eq__0__iff__number__of) ).
fof(76,axiom,
~ ord_less_int(pls,pls),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_36_rel__simps_I2_J) ).
fof(82,axiom,
! [X9] : equal(bit0(X9),plus_plus_int(X9,X9)),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_83_Bit0__def) ).
fof(96,axiom,
! [X9] : equal(bit1(X9),plus_plus_int(plus_plus_int(one_one_int,X9),X9)),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_99_Bit1__def) ).
fof(103,axiom,
! [X9] : equal(plus_plus_int(X9,pls),X9),
file('/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1',fact_80_add__Pls__right) ).
fof(108,negated_conjecture,
~ ~ equal(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int),
inference(assume_negation,[status(cth)],[51]) ).
fof(111,negated_conjecture,
equal(power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))),zero_zero_int),
inference(fof_simplification,[status(thm)],[108,theory(equality)]) ).
fof(112,plain,
~ ord_less_int(pls,pls),
inference(fof_simplification,[status(thm)],[76,theory(equality)]) ).
cnf(137,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(183,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[30]) ).
cnf(234,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(split_conjunct,[status(thm)],[111]) ).
fof(235,plain,
! [X11,X12] :
( ( ~ equal(power_power_int(X11,number_number_of_nat(X12)),zero_zero_int)
| ( equal(X11,zero_zero_int)
& ~ equal(number_number_of_nat(X12),zero_zero_nat) ) )
& ( ~ equal(X11,zero_zero_int)
| equal(number_number_of_nat(X12),zero_zero_nat)
| equal(power_power_int(X11,number_number_of_nat(X12)),zero_zero_int) ) ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(236,plain,
! [X13,X14] :
( ( ~ equal(power_power_int(X13,number_number_of_nat(X14)),zero_zero_int)
| ( equal(X13,zero_zero_int)
& ~ equal(number_number_of_nat(X14),zero_zero_nat) ) )
& ( ~ equal(X13,zero_zero_int)
| equal(number_number_of_nat(X14),zero_zero_nat)
| equal(power_power_int(X13,number_number_of_nat(X14)),zero_zero_int) ) ),
inference(variable_rename,[status(thm)],[235]) ).
fof(237,plain,
! [X13,X14] :
( ( equal(X13,zero_zero_int)
| ~ equal(power_power_int(X13,number_number_of_nat(X14)),zero_zero_int) )
& ( ~ equal(number_number_of_nat(X14),zero_zero_nat)
| ~ equal(power_power_int(X13,number_number_of_nat(X14)),zero_zero_int) )
& ( ~ equal(X13,zero_zero_int)
| equal(number_number_of_nat(X14),zero_zero_nat)
| equal(power_power_int(X13,number_number_of_nat(X14)),zero_zero_int) ) ),
inference(distribute,[status(thm)],[236]) ).
cnf(240,plain,
( X1 = zero_zero_int
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
inference(split_conjunct,[status(thm)],[237]) ).
cnf(301,plain,
~ ord_less_int(pls,pls),
inference(split_conjunct,[status(thm)],[112]) ).
fof(316,plain,
! [X10] : equal(bit0(X10),plus_plus_int(X10,X10)),
inference(variable_rename,[status(thm)],[82]) ).
cnf(317,plain,
bit0(X1) = plus_plus_int(X1,X1),
inference(split_conjunct,[status(thm)],[316]) ).
fof(351,plain,
! [X10] : equal(bit1(X10),plus_plus_int(plus_plus_int(one_one_int,X10),X10)),
inference(variable_rename,[status(thm)],[96]) ).
cnf(352,plain,
bit1(X1) = plus_plus_int(plus_plus_int(one_one_int,X1),X1),
inference(split_conjunct,[status(thm)],[351]) ).
fof(372,plain,
! [X10] : equal(plus_plus_int(X10,pls),X10),
inference(variable_rename,[status(thm)],[103]) ).
cnf(373,plain,
plus_plus_int(X1,pls) = X1,
inference(split_conjunct,[status(thm)],[372]) ).
cnf(400,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(bit1(pls),bit1(pls)))) = zero_zero_int,
inference(rw,[status(thm)],[234,317,theory(equality)]),
[unfolding] ).
cnf(451,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[400,352,theory(equality)]),352,theory(equality)]),
[unfolding] ).
cnf(514,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(rw,[status(thm)],[137,183,theory(equality)]) ).
cnf(551,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int))) = zero_zero_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[451,373,theory(equality)]),373,theory(equality)]),373,theory(equality)]),373,theory(equality)]) ).
cnf(552,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int))) = pls,
inference(rw,[status(thm)],[551,183,theory(equality)]) ).
cnf(558,plain,
( pls = X1
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
inference(rw,[status(thm)],[240,183,theory(equality)]) ).
cnf(559,plain,
( pls = X1
| power_power_int(X1,number_number_of_nat(X2)) != pls ),
inference(rw,[status(thm)],[558,183,theory(equality)]) ).
cnf(562,negated_conjecture,
pls = plus_plus_int(one_one_int,semiri1621563631at_int(n)),
inference(spm,[status(thm)],[559,552,theory(equality)]) ).
cnf(1749,plain,
ord_less_int(pls,pls),
inference(rw,[status(thm)],[514,562,theory(equality)]) ).
cnf(1750,plain,
$false,
inference(sr,[status(thm)],[1749,301,theory(equality)]) ).
cnf(1751,plain,
$false,
1750,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+1 : TPTP v7.0.0. Released v5.3.0.
% 0.02/0.04 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n040.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 : Mon Jan 8 08:10:27 CST 2018
% 0.02/0.23 % CPUTime :
% 0.07/0.28 % SZS status Started for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.28 --creating new selector for []
% 0.07/0.37 -running prover on /export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.37 -running prover with command ['/export/starexec/sandbox/solver/bin/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/export/starexec/sandbox/tmp/tmphBnfO1/sel_theBenchmark.p_1']
% 0.07/0.37 -prover status Theorem
% 0.07/0.37 Problem theBenchmark.p solved in phase 0.
% 0.07/0.37 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 % SZS status Ended for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.37 Solved 1 out of 1.
% 0.07/0.37 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.37 # SZS status Theorem
% 0.07/0.37 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.37 # SZS output end CNFRefutation
%------------------------------------------------------------------------------