TSTP Solution File: NUM852+2 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : NUM852+2 : TPTP v8.1.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Wed Aug 31 18:02:36 EDT 2022

% Result   : Theorem 0.21s 0.53s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   34 (  20 unt;   0 def)
%            Number of atoms       :   60 (  30 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   44 (  18   ~;  14   |;   6   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 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   :   70 (  60   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f284,plain,
    $false,
    inference(resolution,[],[f224,f89]) ).

fof(f89,plain,
    ~ greater(vmul(vd481,vd469),vmul(vd469,vd480)),
    inference(forward_demodulation,[],[f66,f82]) ).

fof(f82,plain,
    ! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X11,X10] : vmul(X10,X11) = vmul(X11,X10),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).

fof(f66,plain,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(cnf_transformation,[],[f38]) ).

fof(f38,plain,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(flattening,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    greater(vmul(vd481,vd469),vmul(vd480,vd469)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq_conjunct1(conseq_conjunct2(conseq(304))), 484, 0)') ).

fof(f224,plain,
    ! [X1] : greater(vmul(vd481,X1),vmul(X1,vd480)),
    inference(superposition,[],[f205,f82]) ).

fof(f205,plain,
    ! [X0] : greater(vmul(X0,vd481),vmul(X0,vd480)),
    inference(superposition,[],[f175,f101]) ).

fof(f101,plain,
    vd481 = vplus(vd480,sK0(vd480,vd481)),
    inference(resolution,[],[f64,f69]) ).

fof(f69,plain,
    less(vd480,vd481),
    inference(cnf_transformation,[],[f4]) ).

fof(f4,axiom,
    less(vd480,vd481),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(304), 482, 0)') ).

fof(f64,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | vplus(X0,sK0(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ! [X0,X1] :
      ( ( vplus(X0,sK0(X0,X1)) = X1
        | ~ less(X0,X1) )
      & ( less(X0,X1)
        | ! [X3] : vplus(X0,X3) != X1 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f48,f49]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( ? [X2] : vplus(X0,X2) = X1
     => vplus(X0,sK0(X0,X1)) = X1 ),
    introduced(choice_axiom,[]) ).

fof(f48,plain,
    ! [X0,X1] :
      ( ( ? [X2] : vplus(X0,X2) = X1
        | ~ less(X0,X1) )
      & ( less(X0,X1)
        | ! [X3] : vplus(X0,X3) != X1 ) ),
    inference(rectify,[],[f47]) ).

fof(f47,plain,
    ! [X1,X0] :
      ( ( ? [X2] : vplus(X1,X2) = X0
        | ~ less(X1,X0) )
      & ( less(X1,X0)
        | ! [X2] : vplus(X1,X2) != X0 ) ),
    inference(nnf_transformation,[],[f28]) ).

fof(f28,plain,
    ! [X1,X0] :
      ( ? [X2] : vplus(X1,X2) = X0
    <=> less(X1,X0) ),
    inference(rectify,[],[f20]) ).

fof(f20,axiom,
    ! [X20,X21] :
      ( ? [X22] : vplus(X21,X22) = X20
    <=> less(X21,X20) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).

fof(f175,plain,
    ! [X10,X8,X9] : greater(vmul(X8,vplus(X9,X10)),vmul(X8,X9)),
    inference(superposition,[],[f87,f74]) ).

fof(f74,plain,
    ! [X2,X0,X1] : vmul(X2,vplus(X1,X0)) = vplus(vmul(X2,X1),vmul(X2,X0)),
    inference(cnf_transformation,[],[f53]) ).

fof(f53,plain,
    ! [X0,X1,X2] : vmul(X2,vplus(X1,X0)) = vplus(vmul(X2,X1),vmul(X2,X0)),
    inference(rectify,[],[f29]) ).

fof(f29,plain,
    ! [X2,X0,X1] : vplus(vmul(X1,X0),vmul(X1,X2)) = vmul(X1,vplus(X0,X2)),
    inference(rectify,[],[f11]) ).

fof(f11,axiom,
    ! [X8,X7,X9] : vmul(X7,vplus(X8,X9)) = vplus(vmul(X7,X8),vmul(X7,X9)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(281, 0), 0)') ).

fof(f87,plain,
    ! [X3,X1] : greater(vplus(X1,X3),X1),
    inference(equality_resolution,[],[f75]) ).

fof(f75,plain,
    ! [X3,X0,X1] :
      ( greater(X0,X1)
      | vplus(X1,X3) != X0 ),
    inference(cnf_transformation,[],[f57]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ( vplus(X1,sK1(X0,X1)) = X0
        | ~ greater(X0,X1) )
      & ( greater(X0,X1)
        | ! [X3] : vplus(X1,X3) != X0 ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f55,f56]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ? [X2] : vplus(X1,X2) = X0
     => vplus(X1,sK1(X0,X1)) = X0 ),
    introduced(choice_axiom,[]) ).

fof(f55,plain,
    ! [X0,X1] :
      ( ( ? [X2] : vplus(X1,X2) = X0
        | ~ greater(X0,X1) )
      & ( greater(X0,X1)
        | ! [X3] : vplus(X1,X3) != X0 ) ),
    inference(rectify,[],[f54]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ( ? [X2] : vplus(X1,X2) = X0
        | ~ greater(X0,X1) )
      & ( greater(X0,X1)
        | ! [X2] : vplus(X1,X2) != X0 ) ),
    inference(nnf_transformation,[],[f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ? [X2] : vplus(X1,X2) = X0
    <=> greater(X0,X1) ),
    inference(rectify,[],[f21]) ).

fof(f21,axiom,
    ! [X24,X23] :
      ( greater(X24,X23)
    <=> ? [X25] : vplus(X23,X25) = X24 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : NUM852+2 : TPTP v8.1.0. Released v4.1.0.
% 0.11/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.13/0.35  % Computer : n002.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Tue Aug 30 09:16:59 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.21/0.51  % (6962)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.51  % (6956)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.51  % (6958)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.52  % (6954)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.52  % (6970)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.52  % (6962)Instruction limit reached!
% 0.21/0.52  % (6962)------------------------------
% 0.21/0.52  % (6962)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (6945)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.21/0.52  % (6954)Refutation not found, incomplete strategy% (6954)------------------------------
% 0.21/0.52  % (6954)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52  % (6952)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.53  % (6967)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.21/0.53  % (6970)First to succeed.
% 0.21/0.53  % (6962)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (6962)Termination reason: Unknown
% 0.21/0.53  % (6962)Termination phase: Finite model building preprocessing
% 0.21/0.53  
% 0.21/0.53  % (6962)Memory used [KB]: 1407
% 0.21/0.53  % (6962)Time elapsed: 0.005 s
% 0.21/0.53  % (6962)Instructions burned: 3 (million)
% 0.21/0.53  % (6962)------------------------------
% 0.21/0.53  % (6962)------------------------------
% 0.21/0.53  % (6954)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (6954)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.53  
% 0.21/0.53  % (6954)Memory used [KB]: 5884
% 0.21/0.53  % (6954)Time elapsed: 0.117 s
% 0.21/0.53  % (6954)Instructions burned: 3 (million)
% 0.21/0.53  % (6954)------------------------------
% 0.21/0.53  % (6954)------------------------------
% 0.21/0.53  % (6970)Refutation found. Thanks to Tanya!
% 0.21/0.53  % SZS status Theorem for theBenchmark
% 0.21/0.53  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53  % (6970)------------------------------
% 0.21/0.53  % (6970)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53  % (6970)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53  % (6970)Termination reason: Refutation
% 0.21/0.53  
% 0.21/0.53  % (6970)Memory used [KB]: 6140
% 0.21/0.53  % (6970)Time elapsed: 0.118 s
% 0.21/0.53  % (6970)Instructions burned: 10 (million)
% 0.21/0.53  % (6970)------------------------------
% 0.21/0.53  % (6970)------------------------------
% 0.21/0.53  % (6944)Success in time 0.175 s
%------------------------------------------------------------------------------