TSTP Solution File: KLE035+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KLE035+1 : TPTP v8.1.0. Released v4.0.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 : n027.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 17:27:48 EDT 2022

% Result   : Theorem 0.16s 0.45s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   45 (  32 unt;   0 def)
%            Number of atoms       :   91 (  26 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   66 (  20   ~;   5   |;  35   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   75 (  59   !;  16   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f305,plain,
    $false,
    inference(subsumption_resolution,[],[f304,f280]) ).

fof(f280,plain,
    leq(zero,zero),
    inference(backward_demodulation,[],[f79,f114]) ).

fof(f114,plain,
    zero = multiplication(sK1,multiplication(sK2,c(sK3))),
    inference(superposition,[],[f88,f64]) ).

fof(f64,plain,
    ! [X0] : addition(X0,zero) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f3,axiom,
    ! [X0] : addition(X0,zero) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity) ).

fof(f88,plain,
    zero = addition(multiplication(sK1,multiplication(sK2,c(sK3))),zero),
    inference(resolution,[],[f79,f60]) ).

fof(f60,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | addition(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f41]) ).

fof(f41,plain,
    ! [X0,X1] :
      ( ( addition(X0,X1) = X1
        | ~ leq(X0,X1) )
      & ( leq(X0,X1)
        | addition(X0,X1) != X1 ) ),
    inference(rectify,[],[f40]) ).

fof(f40,plain,
    ! [X1,X0] :
      ( ( addition(X1,X0) = X0
        | ~ leq(X1,X0) )
      & ( leq(X1,X0)
        | addition(X1,X0) != X0 ) ),
    inference(nnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X1,X0] :
      ( addition(X1,X0) = X0
    <=> leq(X1,X0) ),
    inference(rectify,[],[f12]) ).

fof(f12,axiom,
    ! [X1,X0] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).

fof(f79,plain,
    leq(multiplication(sK1,multiplication(sK2,c(sK3))),zero),
    inference(forward_demodulation,[],[f74,f51]) ).

fof(f51,plain,
    ! [X2,X0,X1] : multiplication(multiplication(X2,X1),X0) = multiplication(X2,multiplication(X1,X0)),
    inference(cnf_transformation,[],[f33]) ).

fof(f33,plain,
    ! [X0,X1,X2] : multiplication(multiplication(X2,X1),X0) = multiplication(X2,multiplication(X1,X0)),
    inference(rectify,[],[f28]) ).

fof(f28,plain,
    ! [X1,X0,X2] : multiplication(X2,multiplication(X0,X1)) = multiplication(multiplication(X2,X0),X1),
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1,X2,X0] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_associativity) ).

fof(f74,plain,
    leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    ( leq(multiplication(multiplication(sK1,sK4),c(sK3)),zero)
    & test(sK1)
    & leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero)
    & ~ leq(multiplication(multiplication(sK1,addition(sK2,sK4)),c(sK3)),zero)
    & test(sK3) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f48,f49]) ).

fof(f49,plain,
    ( ? [X0,X1,X2,X3] :
        ( leq(multiplication(multiplication(X0,X3),c(X2)),zero)
        & test(X0)
        & leq(multiplication(multiplication(X0,X1),c(X2)),zero)
        & ~ leq(multiplication(multiplication(X0,addition(X1,X3)),c(X2)),zero)
        & test(X2) )
   => ( leq(multiplication(multiplication(sK1,sK4),c(sK3)),zero)
      & test(sK1)
      & leq(multiplication(multiplication(sK1,sK2),c(sK3)),zero)
      & ~ leq(multiplication(multiplication(sK1,addition(sK2,sK4)),c(sK3)),zero)
      & test(sK3) ) ),
    introduced(choice_axiom,[]) ).

fof(f48,plain,
    ? [X0,X1,X2,X3] :
      ( leq(multiplication(multiplication(X0,X3),c(X2)),zero)
      & test(X0)
      & leq(multiplication(multiplication(X0,X1),c(X2)),zero)
      & ~ leq(multiplication(multiplication(X0,addition(X1,X3)),c(X2)),zero)
      & test(X2) ),
    inference(rectify,[],[f30]) ).

fof(f30,plain,
    ? [X3,X0,X2,X1] :
      ( leq(multiplication(multiplication(X3,X1),c(X2)),zero)
      & test(X3)
      & leq(multiplication(multiplication(X3,X0),c(X2)),zero)
      & ~ leq(multiplication(multiplication(X3,addition(X0,X1)),c(X2)),zero)
      & test(X2) ),
    inference(flattening,[],[f29]) ).

fof(f29,plain,
    ? [X1,X0,X2,X3] :
      ( ~ leq(multiplication(multiplication(X3,addition(X0,X1)),c(X2)),zero)
      & test(X2)
      & leq(multiplication(multiplication(X3,X0),c(X2)),zero)
      & test(X3)
      & leq(multiplication(multiplication(X3,X1),c(X2)),zero) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f19,plain,
    ~ ! [X1,X0,X2,X3] :
        ( ( test(X2)
          & leq(multiplication(multiplication(X3,X0),c(X2)),zero)
          & test(X3)
          & leq(multiplication(multiplication(X3,X1),c(X2)),zero) )
       => leq(multiplication(multiplication(X3,addition(X0,X1)),c(X2)),zero) ),
    inference(rectify,[],[f18]) ).

fof(f18,negated_conjecture,
    ~ ! [X3,X4,X6,X5] :
        ( ( test(X6)
          & test(X5)
          & leq(multiplication(multiplication(X5,X3),c(X6)),zero)
          & leq(multiplication(multiplication(X5,X4),c(X6)),zero) )
       => leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
    inference(negated_conjecture,[],[f17]) ).

fof(f17,conjecture,
    ! [X3,X4,X6,X5] :
      ( ( test(X6)
        & test(X5)
        & leq(multiplication(multiplication(X5,X3),c(X6)),zero)
        & leq(multiplication(multiplication(X5,X4),c(X6)),zero) )
     => leq(multiplication(multiplication(X5,addition(X3,X4)),c(X6)),zero) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f304,plain,
    ~ leq(zero,zero),
    inference(forward_demodulation,[],[f295,f77]) ).

fof(f77,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_idempotence) ).

fof(f295,plain,
    ~ leq(addition(zero,zero),zero),
    inference(backward_demodulation,[],[f279,f133]) ).

fof(f133,plain,
    zero = multiplication(sK1,multiplication(sK4,c(sK3))),
    inference(superposition,[],[f89,f64]) ).

fof(f89,plain,
    zero = addition(multiplication(sK1,multiplication(sK4,c(sK3))),zero),
    inference(resolution,[],[f80,f60]) ).

fof(f80,plain,
    leq(multiplication(sK1,multiplication(sK4,c(sK3))),zero),
    inference(forward_demodulation,[],[f76,f51]) ).

fof(f76,plain,
    leq(multiplication(multiplication(sK1,sK4),c(sK3)),zero),
    inference(cnf_transformation,[],[f50]) ).

fof(f279,plain,
    ~ leq(addition(zero,multiplication(sK1,multiplication(sK4,c(sK3)))),zero),
    inference(backward_demodulation,[],[f83,f114]) ).

fof(f83,plain,
    ~ leq(addition(multiplication(sK1,multiplication(sK2,c(sK3))),multiplication(sK1,multiplication(sK4,c(sK3)))),zero),
    inference(forward_demodulation,[],[f82,f69]) ).

fof(f69,plain,
    ! [X2,X0,X1] : multiplication(X1,addition(X0,X2)) = addition(multiplication(X1,X0),multiplication(X1,X2)),
    inference(cnf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X0,X1,X2] : multiplication(X1,addition(X0,X2)) = addition(multiplication(X1,X0),multiplication(X1,X2)),
    inference(rectify,[],[f8]) ).

fof(f8,axiom,
    ! [X1,X0,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_distributivity) ).

fof(f82,plain,
    ~ leq(multiplication(sK1,addition(multiplication(sK2,c(sK3)),multiplication(sK4,c(sK3)))),zero),
    inference(forward_demodulation,[],[f81,f66]) ).

fof(f66,plain,
    ! [X2,X0,X1] : addition(multiplication(X1,X0),multiplication(X2,X0)) = multiplication(addition(X1,X2),X0),
    inference(cnf_transformation,[],[f45]) ).

fof(f45,plain,
    ! [X0,X1,X2] : addition(multiplication(X1,X0),multiplication(X2,X0)) = multiplication(addition(X1,X2),X0),
    inference(rectify,[],[f20]) ).

fof(f20,plain,
    ! [X1,X2,X0] : addition(multiplication(X2,X1),multiplication(X0,X1)) = multiplication(addition(X2,X0),X1),
    inference(rectify,[],[f9]) ).

fof(f9,axiom,
    ! [X1,X2,X0] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_distributivity) ).

fof(f81,plain,
    ~ leq(multiplication(sK1,multiplication(addition(sK2,sK4),c(sK3))),zero),
    inference(forward_demodulation,[],[f73,f51]) ).

fof(f73,plain,
    ~ leq(multiplication(multiplication(sK1,addition(sK2,sK4)),c(sK3)),zero),
    inference(cnf_transformation,[],[f50]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : KLE035+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.10/0.32  % Computer : n027.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Tue Aug 30 00:38:15 EDT 2022
% 0.10/0.32  % CPUTime    : 
% 0.16/0.43  % (9568)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.16/0.43  % (9576)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.16/0.44  % (9576)First to succeed.
% 0.16/0.44  % (9568)Also succeeded, but the first one will report.
% 0.16/0.45  % (9576)Refutation found. Thanks to Tanya!
% 0.16/0.45  % SZS status Theorem for theBenchmark
% 0.16/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.45  % (9576)------------------------------
% 0.16/0.45  % (9576)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.16/0.45  % (9576)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.16/0.45  % (9576)Termination reason: Refutation
% 0.16/0.45  
% 0.16/0.45  % (9576)Memory used [KB]: 1663
% 0.16/0.45  % (9576)Time elapsed: 0.073 s
% 0.16/0.45  % (9576)Instructions burned: 12 (million)
% 0.16/0.45  % (9576)------------------------------
% 0.16/0.45  % (9576)------------------------------
% 0.16/0.45  % (9552)Success in time 0.118 s
%------------------------------------------------------------------------------