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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KLE002+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 : n029.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:31 EDT 2022

% Result   : Theorem 0.19s 0.50s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  10 unt;   0 def)
%            Number of atoms       :   36 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   30 (  15   ~;   4   |;   6   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (  26   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f80,plain,
    $false,
    inference(trivial_inequality_removal,[],[f79]) ).

fof(f79,plain,
    multiplication(sK2,sK1) != multiplication(sK2,sK1),
    inference(forward_demodulation,[],[f65,f43]) ).

fof(f43,plain,
    addition(sK0,sK2) = sK2,
    inference(resolution,[],[f33,f37]) ).

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

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

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

fof(f33,plain,
    leq(sK0,sK2),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ( ~ leq(multiplication(sK0,sK1),multiplication(sK2,sK1))
    & leq(sK0,sK2) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f21,f22]) ).

fof(f22,plain,
    ( ? [X0,X1,X2] :
        ( ~ leq(multiplication(X0,X1),multiplication(X2,X1))
        & leq(X0,X2) )
   => ( ~ leq(multiplication(sK0,sK1),multiplication(sK2,sK1))
      & leq(sK0,sK2) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ? [X0,X1,X2] :
      ( ~ leq(multiplication(X0,X1),multiplication(X2,X1))
      & leq(X0,X2) ),
    inference(rectify,[],[f18]) ).

fof(f18,plain,
    ? [X1,X2,X0] :
      ( ~ leq(multiplication(X1,X2),multiplication(X0,X2))
      & leq(X1,X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f15,plain,
    ~ ! [X2,X0,X1] :
        ( leq(X1,X0)
       => leq(multiplication(X1,X2),multiplication(X0,X2)) ),
    inference(rectify,[],[f14]) ).

fof(f14,negated_conjecture,
    ~ ! [X4,X3,X5] :
        ( leq(X3,X4)
       => leq(multiplication(X3,X5),multiplication(X4,X5)) ),
    inference(negated_conjecture,[],[f13]) ).

fof(f13,conjecture,
    ! [X4,X3,X5] :
      ( leq(X3,X4)
     => leq(multiplication(X3,X5),multiplication(X4,X5)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f65,plain,
    multiplication(addition(sK0,sK2),sK1) != multiplication(sK2,sK1),
    inference(superposition,[],[f47,f35]) ).

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

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

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

fof(f47,plain,
    addition(multiplication(sK0,sK1),multiplication(sK2,sK1)) != multiplication(sK2,sK1),
    inference(resolution,[],[f34,f36]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( leq(X0,X1)
      | addition(X0,X1) != X1 ),
    inference(cnf_transformation,[],[f25]) ).

fof(f34,plain,
    ~ leq(multiplication(sK0,sK1),multiplication(sK2,sK1)),
    inference(cnf_transformation,[],[f23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : KLE002+1 : TPTP v8.1.0. Released v4.0.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.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit   : 300
% 0.12/0.34  % WCLimit    : 300
% 0.12/0.34  % DateTime   : Tue Aug 30 00:31:11 EDT 2022
% 0.12/0.34  % CPUTime    : 
% 0.19/0.49  % (19850)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.19/0.49  % (19835)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.19/0.50  % (19835)Refutation not found, incomplete strategy% (19835)------------------------------
% 0.19/0.50  % (19835)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (19835)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (19835)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.50  
% 0.19/0.50  % (19835)Memory used [KB]: 5884
% 0.19/0.50  % (19835)Time elapsed: 0.094 s
% 0.19/0.50  % (19835)Instructions burned: 2 (million)
% 0.19/0.50  % (19835)------------------------------
% 0.19/0.50  % (19835)------------------------------
% 0.19/0.50  % (19842)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.19/0.50  % (19834)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.19/0.50  % (19850)First to succeed.
% 0.19/0.50  % (19845)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.19/0.50  % (19850)Refutation found. Thanks to Tanya!
% 0.19/0.50  % SZS status Theorem for theBenchmark
% 0.19/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.50  % (19850)------------------------------
% 0.19/0.50  % (19850)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.50  % (19850)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.50  % (19850)Termination reason: Refutation
% 0.19/0.50  
% 0.19/0.50  % (19850)Memory used [KB]: 6012
% 0.19/0.50  % (19850)Time elapsed: 0.108 s
% 0.19/0.50  % (19850)Instructions burned: 2 (million)
% 0.19/0.50  % (19850)------------------------------
% 0.19/0.50  % (19850)------------------------------
% 0.19/0.50  % (19833)Success in time 0.159 s
%------------------------------------------------------------------------------