TSTP Solution File: NUM852+2 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : NUM852+2 : TPTP v7.0.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : n072.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:31 EST 2018
% Result : Theorem 0.07s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 31 ( 18 unt; 0 def)
% Number of atoms : 52 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 39 ( 18 ~; 15 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 2 sgn 30 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2,X3] : equal(vmul(X1,vplus(X2,X3)),vplus(vmul(X1,X2),vmul(X1,X3))),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','ass(cond(281, 0), 0)') ).
fof(2,axiom,
! [X4,X5] :
( greater(X4,X5)
=> equal(X4,vplus(X5,vskolem9(X4,X5))) ),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','ass(cond(302, 0), 3)') ).
fof(5,axiom,
! [X8,X9] : equal(vmul(X8,X9),vmul(X9,X8)),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','ass(cond(270, 0), 0)') ).
fof(8,conjecture,
greater(vmul(vd481,vd469),vmul(vd480,vd469)),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)') ).
fof(11,axiom,
! [X19,X20] :
( greater(X20,X19)
<=> ? [X21] : equal(X20,vplus(X19,X21)) ),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(12,axiom,
greater(vd481,vd480),
file('/export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1','holds(conseq_conjunct1(conseq(304)), 483, 0)') ).
fof(14,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(assume_negation,[status(cth)],[8]) ).
fof(15,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(fof_simplification,[status(thm)],[14,theory(equality)]) ).
fof(17,plain,
! [X4,X5,X6] : equal(vmul(X4,vplus(X5,X6)),vplus(vmul(X4,X5),vmul(X4,X6))),
inference(variable_rename,[status(thm)],[1]) ).
cnf(18,plain,
vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
inference(split_conjunct,[status(thm)],[17]) ).
fof(19,plain,
! [X4,X5] :
( ~ greater(X4,X5)
| equal(X4,vplus(X5,vskolem9(X4,X5))) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(20,plain,
! [X6,X7] :
( ~ greater(X6,X7)
| equal(X6,vplus(X7,vskolem9(X6,X7))) ),
inference(variable_rename,[status(thm)],[19]) ).
cnf(21,plain,
( X1 = vplus(X2,vskolem9(X1,X2))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[20]) ).
fof(26,plain,
! [X10,X11] : equal(vmul(X10,X11),vmul(X11,X10)),
inference(variable_rename,[status(thm)],[5]) ).
cnf(27,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[26]) ).
cnf(32,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(split_conjunct,[status(thm)],[15]) ).
fof(38,plain,
! [X19,X20] :
( ( ~ greater(X20,X19)
| ? [X21] : equal(X20,vplus(X19,X21)) )
& ( ! [X21] : ~ equal(X20,vplus(X19,X21))
| greater(X20,X19) ) ),
inference(fof_nnf,[status(thm)],[11]) ).
fof(39,plain,
! [X22,X23] :
( ( ~ greater(X23,X22)
| ? [X24] : equal(X23,vplus(X22,X24)) )
& ( ! [X25] : ~ equal(X23,vplus(X22,X25))
| greater(X23,X22) ) ),
inference(variable_rename,[status(thm)],[38]) ).
fof(40,plain,
! [X22,X23] :
( ( ~ greater(X23,X22)
| equal(X23,vplus(X22,esk1_2(X22,X23))) )
& ( ! [X25] : ~ equal(X23,vplus(X22,X25))
| greater(X23,X22) ) ),
inference(skolemize,[status(esa)],[39]) ).
fof(41,plain,
! [X22,X23,X25] :
( ( ~ equal(X23,vplus(X22,X25))
| greater(X23,X22) )
& ( ~ greater(X23,X22)
| equal(X23,vplus(X22,esk1_2(X22,X23))) ) ),
inference(shift_quantors,[status(thm)],[40]) ).
cnf(43,plain,
( greater(X1,X2)
| X1 != vplus(X2,X3) ),
inference(split_conjunct,[status(thm)],[41]) ).
cnf(44,plain,
greater(vd481,vd480),
inference(split_conjunct,[status(thm)],[12]) ).
cnf(69,plain,
vplus(vd480,vskolem9(vd481,vd480)) = vd481,
inference(spm,[status(thm)],[21,44,theory(equality)]) ).
cnf(82,plain,
( greater(X1,vmul(X2,X3))
| vmul(X2,vplus(X3,X4)) != X1 ),
inference(spm,[status(thm)],[43,18,theory(equality)]) ).
cnf(180,plain,
( greater(X1,vmul(X2,vd480))
| vmul(X2,vd481) != X1 ),
inference(spm,[status(thm)],[82,69,theory(equality)]) ).
cnf(188,plain,
( greater(X1,vmul(X2,vd480))
| vmul(vd481,X2) != X1 ),
inference(spm,[status(thm)],[180,27,theory(equality)]) ).
cnf(193,plain,
greater(vmul(vd481,X1),vmul(X1,vd480)),
inference(er,[status(thm)],[188,theory(equality)]) ).
cnf(222,plain,
greater(vmul(vd481,X1),vmul(vd480,X1)),
inference(spm,[status(thm)],[193,27,theory(equality)]) ).
cnf(304,negated_conjecture,
$false,
inference(rw,[status(thm)],[32,222,theory(equality)]) ).
cnf(305,negated_conjecture,
$false,
inference(cn,[status(thm)],[304,theory(equality)]) ).
cnf(306,negated_conjecture,
$false,
305,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM852+2 : TPTP v7.0.0. Released v4.1.0.
% 0.00/0.03 % Command : Source/sine.py -e eprover -t %d %s
% 0.02/0.23 % Computer : n072.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 14:53:19 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.27 % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.27 --creating new selector for []
% 0.07/0.34 -running prover on /export/starexec/sandbox2/tmp/tmp2PRfWO/sel_theBenchmark.p_1 with time limit 29
% 0.07/0.34 -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/tmp2PRfWO/sel_theBenchmark.p_1']
% 0.07/0.34 -prover status Theorem
% 0.07/0.34 Problem theBenchmark.p solved in phase 0.
% 0.07/0.34 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.07/0.34 Solved 1 out of 1.
% 0.07/0.34 # Problem is unsatisfiable (or provable), constructing proof object
% 0.07/0.34 # SZS status Theorem
% 0.07/0.34 # SZS output start CNFRefutation.
% See solution above
% 0.07/0.35 # SZS output end CNFRefutation
%------------------------------------------------------------------------------