%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM924+1 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n099.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:39 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 56 ( 40 unt; 0 def)
% Number of atoms : 84 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 52 ( 24 ~; 20 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 39 ( 1 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(27,axiom,
! [X2,X4] : equal(times_times_int(X2,X4),times_times_int(X4,X2)),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_25_zmult__commute) ).
fof(35,axiom,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(36,axiom,
! [X6] :
( ord_less_eq_int(one_one_int,number_number_of_int(X6))
<=> ord_less_eq_int(bit1(pls),X6) ),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_64_le__special_I2_J) ).
fof(43,axiom,
equal(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t)),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_3_t) ).
fof(51,axiom,
! [X4] : ord_less_eq_int(X4,X4),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_23_zle__refl) ).
fof(52,axiom,
! [X5] :
( ord_less_eq_int(number_number_of_int(X5),one_one_int)
<=> ord_less_eq_int(X5,bit1(pls)) ),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_63_le__special_I4_J) ).
fof(59,axiom,
! [X2,X4] :
( ord_less_eq_int(X2,X4)
=> ( ord_less_eq_int(X4,X2)
=> equal(X2,X4) ) ),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_32_zle__antisym) ).
fof(78,axiom,
! [X25] : equal(number_number_of_int(X25),X25),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_24_number__of__is__id) ).
fof(80,conjecture,
ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',conj_0) ).
fof(92,axiom,
! [X2,X4] : equal(plus_plus_int(X2,X4),plus_plus_int(X4,X2)),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_104_zadd__commute) ).
fof(97,axiom,
! [X4] : equal(times_times_int(pls,X4),pls),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_66_mult__Pls) ).
fof(101,axiom,
equal(zero_zero_int,number_number_of_int(pls)),
file('/export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1',fact_105_zero__is__num__zero) ).
fof(108,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(assume_negation,[status(cth)],[80]) ).
fof(113,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(fof_simplification,[status(thm)],[108,theory(equality)]) ).
fof(200,plain,
! [X5,X6] : equal(times_times_int(X5,X6),times_times_int(X6,X5)),
inference(variable_rename,[status(thm)],[27]) ).
cnf(201,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[200]) ).
cnf(225,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),zero_zero_int)),
inference(split_conjunct,[status(thm)],[35]) ).
fof(226,plain,
! [X6] :
( ( ~ ord_less_eq_int(one_one_int,number_number_of_int(X6))
| ord_less_eq_int(bit1(pls),X6) )
& ( ~ ord_less_eq_int(bit1(pls),X6)
| ord_less_eq_int(one_one_int,number_number_of_int(X6)) ) ),
inference(fof_nnf,[status(thm)],[36]) ).
fof(227,plain,
! [X7] :
( ( ~ ord_less_eq_int(one_one_int,number_number_of_int(X7))
| ord_less_eq_int(bit1(pls),X7) )
& ( ~ ord_less_eq_int(bit1(pls),X7)
| ord_less_eq_int(one_one_int,number_number_of_int(X7)) ) ),
inference(variable_rename,[status(thm)],[226]) ).
cnf(228,plain,
( ord_less_eq_int(one_one_int,number_number_of_int(X1))
| ~ ord_less_eq_int(bit1(pls),X1) ),
inference(split_conjunct,[status(thm)],[227]) ).
cnf(246,plain,
plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int) = times_times_int(plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),t),
inference(split_conjunct,[status(thm)],[43]) ).
fof(267,plain,
! [X5] : ord_less_eq_int(X5,X5),
inference(variable_rename,[status(thm)],[51]) ).
cnf(268,plain,
ord_less_eq_int(X1,X1),
inference(split_conjunct,[status(thm)],[267]) ).
fof(269,plain,
! [X5] :
( ( ~ ord_less_eq_int(number_number_of_int(X5),one_one_int)
| ord_less_eq_int(X5,bit1(pls)) )
& ( ~ ord_less_eq_int(X5,bit1(pls))
| ord_less_eq_int(number_number_of_int(X5),one_one_int) ) ),
inference(fof_nnf,[status(thm)],[52]) ).
fof(270,plain,
! [X6] :
( ( ~ ord_less_eq_int(number_number_of_int(X6),one_one_int)
| ord_less_eq_int(X6,bit1(pls)) )
& ( ~ ord_less_eq_int(X6,bit1(pls))
| ord_less_eq_int(number_number_of_int(X6),one_one_int) ) ),
inference(variable_rename,[status(thm)],[269]) ).
cnf(271,plain,
( ord_less_eq_int(number_number_of_int(X1),one_one_int)
| ~ ord_less_eq_int(X1,bit1(pls)) ),
inference(split_conjunct,[status(thm)],[270]) ).
fof(290,plain,
! [X2,X4] :
( ~ ord_less_eq_int(X2,X4)
| ~ ord_less_eq_int(X4,X2)
| equal(X2,X4) ),
inference(fof_nnf,[status(thm)],[59]) ).
fof(291,plain,
! [X5,X6] :
( ~ ord_less_eq_int(X5,X6)
| ~ ord_less_eq_int(X6,X5)
| equal(X5,X6) ),
inference(variable_rename,[status(thm)],[290]) ).
cnf(292,plain,
( X1 = X2
| ~ ord_less_eq_int(X2,X1)
| ~ ord_less_eq_int(X1,X2) ),
inference(split_conjunct,[status(thm)],[291]) ).
fof(344,plain,
! [X26] : equal(number_number_of_int(X26),X26),
inference(variable_rename,[status(thm)],[78]) ).
cnf(345,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[344]) ).
cnf(350,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),zero_zero_int),
inference(split_conjunct,[status(thm)],[113]) ).
fof(376,plain,
! [X5,X6] : equal(plus_plus_int(X5,X6),plus_plus_int(X6,X5)),
inference(variable_rename,[status(thm)],[92]) ).
cnf(377,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[376]) ).
fof(392,plain,
! [X5] : equal(times_times_int(pls,X5),pls),
inference(variable_rename,[status(thm)],[97]) ).
cnf(393,plain,
times_times_int(pls,X1) = pls,
inference(split_conjunct,[status(thm)],[392]) ).
cnf(407,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[101]) ).
cnf(424,plain,
pls = zero_zero_int,
inference(rw,[status(thm)],[407,345,theory(equality)]),
[unfolding] ).
cnf(438,plain,
times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
inference(rw,[status(thm)],[246,345,theory(equality)]),
[unfolding] ).
cnf(440,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[225,345,theory(equality)]),345,theory(equality)]),
[unfolding] ).
cnf(454,plain,
( ord_less_eq_int(one_one_int,X1)
| ~ ord_less_eq_int(bit1(pls),X1) ),
inference(rw,[status(thm)],[228,345,theory(equality)]),
[unfolding] ).
cnf(455,plain,
( ord_less_eq_int(X1,one_one_int)
| ~ ord_less_eq_int(X1,bit1(pls)) ),
inference(rw,[status(thm)],[271,345,theory(equality)]),
[unfolding] ).
cnf(465,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),pls),
inference(rw,[status(thm)],[350,424,theory(equality)]) ).
cnf(520,negated_conjecture,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),pls),
inference(rw,[status(thm)],[465,377,theory(equality)]) ).
cnf(591,plain,
ord_less_eq_int(bit1(pls),one_one_int),
inference(spm,[status(thm)],[455,268,theory(equality)]) ).
cnf(597,plain,
ord_less_eq_int(one_one_int,bit1(pls)),
inference(spm,[status(thm)],[454,268,theory(equality)]) ).
cnf(914,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[438,377,theory(equality)]),201,theory(equality)]),201,theory(equality)]) ).
cnf(915,plain,
times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))) = plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),
inference(rw,[status(thm)],[914,377,theory(equality)]) ).
cnf(1281,plain,
ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(bit1(pls))))),pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[440,377,theory(equality)]),201,theory(equality)]),201,theory(equality)]),915,theory(equality)]),377,theory(equality)]),201,theory(equality)]),424,theory(equality)]),201,theory(equality)]),393,theory(equality)]) ).
cnf(1526,plain,
( bit1(pls) = one_one_int
| ~ ord_less_eq_int(bit1(pls),one_one_int) ),
inference(spm,[status(thm)],[292,597,theory(equality)]) ).
cnf(1529,plain,
( bit1(pls) = one_one_int
| $false ),
inference(rw,[status(thm)],[1526,591,theory(equality)]) ).
cnf(1530,plain,
bit1(pls) = one_one_int,
inference(cn,[status(thm)],[1529,theory(equality)]) ).
cnf(1551,plain,
ord_less_int(plus_plus_int(one_one_int,power_power_int(s,number_number_of_nat(bit0(one_one_int)))),pls),
inference(rw,[status(thm)],[1281,1530,theory(equality)]) ).
cnf(1712,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[520,1530,theory(equality)]),1551,theory(equality)]) ).
cnf(1713,negated_conjecture,
$false,
inference(cn,[status(thm)],[1712,theory(equality)]) ).
cnf(1714,negated_conjecture,
$false,
1713,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+1 : 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 : n099.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:35 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.07/0.38 -running prover on /export/starexec/sandbox2/tmp/tmpfPc_Du/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.38 -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/tmpfPc_Du/sel_theBenchmark.p_1']
% 0.07/0.38 -prover status Theorem
% 0.07/0.38 Problem theBenchmark.p solved in phase 0.
% 0.07/0.38 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.38 Solved 1 out of 1.
% 0.07/0.38 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.38 # SZS status Theorem
% 0.07/0.38 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.39 # SZS output end CNFRefutation
%------------------------------------------------------------------------------