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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : KLE056+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 : n028.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:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f49,plain,
    $false,
    inference(subsumption_resolution,[],[f47,f28]) ).

fof(f28,plain,
    zero != sK0,
    inference(cnf_transformation,[],[f27]) ).

fof(f27,plain,
    ( zero = domain(sK0)
    & zero != sK0 ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).

fof(f26,plain,
    ( ? [X0] :
        ( zero = domain(X0)
        & zero != X0 )
   => ( zero = domain(sK0)
      & zero != sK0 ) ),
    introduced(choice_axiom,[]) ).

fof(f25,plain,
    ? [X0] :
      ( zero = domain(X0)
      & zero != X0 ),
    inference(ennf_transformation,[],[f20]) ).

fof(f20,plain,
    ~ ! [X0] :
        ( zero = domain(X0)
       => zero = X0 ),
    inference(rectify,[],[f19]) ).

fof(f19,negated_conjecture,
    ~ ! [X3] :
        ( zero = domain(X3)
       => zero = X3 ),
    inference(negated_conjecture,[],[f18]) ).

fof(f18,conjecture,
    ! [X3] :
      ( zero = domain(X3)
     => zero = X3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f47,plain,
    zero = sK0,
    inference(superposition,[],[f43,f34]) ).

fof(f34,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(f43,plain,
    zero = addition(sK0,zero),
    inference(forward_demodulation,[],[f40,f32]) ).

fof(f32,plain,
    ! [X0] : zero = multiplication(zero,X0),
    inference(cnf_transformation,[],[f11]) ).

fof(f11,axiom,
    ! [X0] : zero = multiplication(zero,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_annihilation) ).

fof(f40,plain,
    addition(sK0,multiplication(zero,sK0)) = multiplication(zero,sK0),
    inference(superposition,[],[f31,f29]) ).

fof(f29,plain,
    zero = domain(sK0),
    inference(cnf_transformation,[],[f27]) ).

fof(f31,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ! [X0] : multiplication(domain(X0),X0) = addition(X0,multiplication(domain(X0),X0)),
    inference(rectify,[],[f13]) ).

fof(f13,axiom,
    ! [X3] : multiplication(domain(X3),X3) = addition(X3,multiplication(domain(X3),X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : KLE056+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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.33  % Computer : n028.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Tue Aug 30 00:33:18 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.18/0.48  % (11514)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.18/0.49  % (11537)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.18/0.49  % (11511)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.18/0.49  % (11511)First to succeed.
% 0.18/0.50  % (11511)Refutation found. Thanks to Tanya!
% 0.18/0.50  % SZS status Theorem for theBenchmark
% 0.18/0.50  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.50  % (11511)------------------------------
% 0.18/0.50  % (11511)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50  % (11511)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50  % (11511)Termination reason: Refutation
% 0.18/0.50  
% 0.18/0.50  % (11511)Memory used [KB]: 5884
% 0.18/0.50  % (11511)Time elapsed: 0.098 s
% 0.18/0.50  % (11511)Instructions burned: 2 (million)
% 0.18/0.50  % (11511)------------------------------
% 0.18/0.50  % (11511)------------------------------
% 0.18/0.50  % (11506)Success in time 0.153 s
%------------------------------------------------------------------------------