TSTP Solution File: NUM924+5 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM924+5 : TPTP v7.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n069.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:40 EST 2018
% Result : Theorem 0.06s
% Output : CNFRefutation 0.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 31 unt; 0 def)
% Number of atoms : 31 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(7,axiom,
! [X7] : equal(times_times(int,pls,X7),pls),
file('/export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1',fact_62_mult__Pls) ).
fof(41,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/tmp64cGj9/sel_theBenchmark.p_1',conj_0) ).
fof(55,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/tmp64cGj9/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(62,axiom,
! [X13,X7] : equal(plus_plus(int,X13,X7),plus_plus(int,X7,X13)),
file('/export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1',fact_96_zadd__commute) ).
fof(67,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/tmp64cGj9/sel_theBenchmark.p_1',fact_3_t) ).
fof(70,axiom,
! [X24] : equal(number_number_of(int,X24),X24),
file('/export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1',fact_22_number__of__is__id) ).
fof(78,axiom,
equal(zero_zero(int),number_number_of(int,pls)),
file('/export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1',fact_97_zero__is__num__zero) ).
fof(100,axiom,
! [X13,X7] : equal(times_times(int,X13,X7),times_times(int,X7,X13)),
file('/export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1',fact_23_zmult__commute) ).
fof(156,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)],[41]) ).
fof(159,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)],[156,theory(equality)]) ).
fof(181,plain,
! [X8] : equal(times_times(int,pls,X8),pls),
inference(variable_rename,[status(thm)],[7]) ).
cnf(182,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[181]) ).
cnf(297,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)],[159]) ).
cnf(337,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)],[55]) ).
fof(355,plain,
! [X14,X15] : equal(plus_plus(int,X14,X15),plus_plus(int,X15,X14)),
inference(variable_rename,[status(thm)],[62]) ).
cnf(356,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[355]) ).
cnf(368,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)],[67]) ).
fof(380,plain,
! [X25] : equal(number_number_of(int,X25),X25),
inference(variable_rename,[status(thm)],[70]) ).
cnf(381,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[380]) ).
cnf(404,plain,
zero_zero(int) = number_number_of(int,pls),
inference(split_conjunct,[status(thm)],[78]) ).
fof(473,plain,
! [X14,X15] : equal(times_times(int,X14,X15),times_times(int,X15,X14)),
inference(variable_rename,[status(thm)],[100]) ).
cnf(474,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[473]) ).
cnf(642,plain,
zero_zero(int) = pls,
inference(rw,[status(thm)],[404,381,theory(equality)]) ).
cnf(1270,negated_conjecture,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),zero_zero(int)),
inference(rw,[status(thm)],[297,356,theory(equality)]) ).
cnf(2481,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)],[inference(rw,[status(thm)],[368,381,theory(equality)]),474,theory(equality)]),356,theory(equality)]),474,theory(equality)]) ).
cnf(2482,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)],[2481,356,theory(equality)]) ).
cnf(3159,plain,
ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),times_times(int,zero_zero(int),plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(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)],[337,381,theory(equality)]),474,theory(equality)]),356,theory(equality)]),474,theory(equality)]),2482,theory(equality)]),381,theory(equality)]),474,theory(equality)]),356,theory(equality)]),474,theory(equality)]) ).
cnf(3612,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)],[3159,642,theory(equality)]),182,theory(equality)]) ).
cnf(4065,negated_conjecture,
$false,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[1270,642,theory(equality)]),3612,theory(equality)]) ).
cnf(4066,negated_conjecture,
$false,
inference(cn,[status(thm)],[4065,theory(equality)]) ).
cnf(4067,negated_conjecture,
$false,
4066,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+5 : TPTP v7.0.0. Released v5.3.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.22 % Computer : n069.star.cs.uiowa.edu
% 0.02/0.22 % Model : x86_64 x86_64
% 0.02/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.22 % Memory : 32218.625MB
% 0.02/0.22 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.22 % CPULimit : 300
% 0.02/0.22 % DateTime : Fri Jan 5 15:56:34 CST 2018
% 0.02/0.22 % CPUTime :
% 0.06/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.27 --creating new selector for []
% 0.06/0.40 -running prover on /export/starexec/sandbox2/tmp/tmp64cGj9/sel_theBenchmark.p_1 with time limit 29
% 0.06/0.40 -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/tmp64cGj9/sel_theBenchmark.p_1']
% 0.06/0.40 -prover status Theorem
% 0.06/0.40 Problem theBenchmark.p solved in phase 0.
% 0.06/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.06/0.40 Solved 1 out of 1.
% 0.06/0.40 # Problem is unsatisfiable (or provable), constructing proof object
% 0.06/0.40 # SZS status Theorem
% 0.06/0.40 # SZS output start CNFRefutation.
% See solution above
% 0.06/0.40 # SZS output end CNFRefutation
%------------------------------------------------------------------------------