TSTP Solution File: NUM852+1 by SInE---0.4

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SInE---0.4
% Problem  : NUM852+1 : TPTP v7.0.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : Source/sine.py -e eprover -t %d %s

% Computer : n091.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:30 EST 2018

% Result   : Theorem 0.59s
% Output   : CNFRefutation 0.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   27 (  20 unt;   0 def)
%            Number of atoms       :   34 (   3 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   17 (  10   ~;   6   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   41 (   2 sgn  20   !;   0   ?)

% 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/tmpzBgSvI/sel_theBenchmark.p_1','ass(cond(281, 0), 0)') ).

fof(4,axiom,
    ! [X8,X9] : greater(vplus(X8,X9),X8),
    file('/export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1','ass(cond(189, 0), 0)') ).

fof(5,conjecture,
    greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    file('/export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1','holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)') ).

fof(10,axiom,
    ! [X18,X19] : equal(vmul(X18,X19),vmul(X19,X18)),
    file('/export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1','ass(cond(270, 0), 0)') ).

fof(12,axiom,
    greater(vd481,vd480),
    file('/export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1','holds(conseq_conjunct1(conseq(304)), 483, 0)') ).

fof(33,axiom,
    ! [X69,X70] :
      ( greater(X69,X70)
     => equal(X69,vplus(X70,vskolem9(X69,X70))) ),
    file('/export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1','ass(cond(302, 0), 3)') ).

fof(42,negated_conjecture,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(assume_negation,[status(cth)],[5]) ).

fof(43,negated_conjecture,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(fof_simplification,[status(thm)],[42,theory(equality)]) ).

fof(45,plain,
    ! [X4,X5,X6] : equal(vmul(X4,vplus(X5,X6)),vplus(vmul(X4,X5),vmul(X4,X6))),
    inference(variable_rename,[status(thm)],[1]) ).

cnf(46,plain,
    vmul(X1,vplus(X2,X3)) = vplus(vmul(X1,X2),vmul(X1,X3)),
    inference(split_conjunct,[status(thm)],[45]) ).

fof(52,plain,
    ! [X10,X11] : greater(vplus(X10,X11),X10),
    inference(variable_rename,[status(thm)],[4]) ).

cnf(53,plain,
    greater(vplus(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[52]) ).

cnf(54,negated_conjecture,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(split_conjunct,[status(thm)],[43]) ).

fof(65,plain,
    ! [X20,X21] : equal(vmul(X20,X21),vmul(X21,X20)),
    inference(variable_rename,[status(thm)],[10]) ).

cnf(66,plain,
    vmul(X1,X2) = vmul(X2,X1),
    inference(split_conjunct,[status(thm)],[65]) ).

cnf(71,plain,
    greater(vd481,vd480),
    inference(split_conjunct,[status(thm)],[12]) ).

fof(132,plain,
    ! [X69,X70] :
      ( ~ greater(X69,X70)
      | equal(X69,vplus(X70,vskolem9(X69,X70))) ),
    inference(fof_nnf,[status(thm)],[33]) ).

fof(133,plain,
    ! [X71,X72] :
      ( ~ greater(X71,X72)
      | equal(X71,vplus(X72,vskolem9(X71,X72))) ),
    inference(variable_rename,[status(thm)],[132]) ).

cnf(134,plain,
    ( X1 = vplus(X2,vskolem9(X1,X2))
    | ~ greater(X1,X2) ),
    inference(split_conjunct,[status(thm)],[133]) ).

cnf(335,plain,
    greater(vmul(X1,vplus(X2,X3)),vmul(X1,X2)),
    inference(spm,[status(thm)],[53,46,theory(equality)]) ).

cnf(8062,plain,
    ( greater(vmul(X1,X3),vmul(X1,X2))
    | ~ greater(X3,X2) ),
    inference(spm,[status(thm)],[335,134,theory(equality)]) ).

cnf(32476,plain,
    ( greater(vmul(X2,X1),vmul(X1,X3))
    | ~ greater(X2,X3) ),
    inference(spm,[status(thm)],[8062,66,theory(equality)]) ).

cnf(34359,plain,
    ( greater(vmul(X1,X2),vmul(X3,X2))
    | ~ greater(X1,X3) ),
    inference(spm,[status(thm)],[32476,66,theory(equality)]) ).

cnf(39840,negated_conjecture,
    ~ greater(vd481,vd480),
    inference(spm,[status(thm)],[54,34359,theory(equality)]) ).

cnf(39877,negated_conjecture,
    $false,
    inference(rw,[status(thm)],[39840,71,theory(equality)]) ).

cnf(39878,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[39877,theory(equality)]) ).

cnf(39879,negated_conjecture,
    $false,
    39878,
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM852+1 : TPTP v7.0.0. Released v4.1.0.
% 0.00/0.04  % Command  : Source/sine.py -e eprover -t %d %s
% 0.03/0.24  % Computer : n091.star.cs.uiowa.edu
% 0.03/0.24  % Model    : x86_64 x86_64
% 0.03/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.24  % Memory   : 32218.625MB
% 0.03/0.24  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.03/0.24  % CPULimit : 300
% 0.03/0.24  % DateTime : Fri Jan  5 14:53:04 CST 2018
% 0.03/0.24  % CPUTime  : 
% 0.03/0.28  % SZS status Started for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.28  --creating new selector for []
% 0.59/0.97  -running prover on /export/starexec/sandbox2/tmp/tmpzBgSvI/sel_theBenchmark.p_1 with time limit 29
% 0.59/0.97  -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/tmpzBgSvI/sel_theBenchmark.p_1']
% 0.59/0.97  -prover status Theorem
% 0.59/0.97  Problem theBenchmark.p solved in phase 0.
% 0.59/0.97  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.97  % SZS status Ended for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.59/0.97  Solved 1 out of 1.
% 0.59/0.97  # Problem is unsatisfiable (or provable), constructing proof object
% 0.59/0.97  # SZS status Theorem
% 0.59/0.97  # SZS output start CNFRefutation.
% See solution above
% 0.59/0.97  # SZS output end CNFRefutation
%------------------------------------------------------------------------------