TSTP Solution File: KLE113+1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : KLE113+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_sat --cores 0 -t %d %s

% Computer : n019.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:29:10 EDT 2022

% Result   : Theorem 0.20s 0.51s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (  35 unt;   0 def)
%            Number of atoms       :   37 (  36 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (  12   ~;   0   |;   0   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  28   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f138,plain,
    $false,
    inference(subsumption_resolution,[],[f137,f89]) ).

fof(f89,plain,
    zero = antidomain(one),
    inference(superposition,[],[f62,f73]) ).

fof(f73,plain,
    ! [X0] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f6]) ).

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_right_identity) ).

fof(f62,plain,
    ! [X0] : zero = multiplication(antidomain(X0),X0),
    inference(cnf_transformation,[],[f34]) ).

fof(f34,plain,
    ! [X0] : zero = multiplication(antidomain(X0),X0),
    inference(rectify,[],[f13]) ).

fof(f13,axiom,
    ! [X3] : zero = multiplication(antidomain(X3),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain1) ).

fof(f137,plain,
    zero != antidomain(one),
    inference(forward_demodulation,[],[f136,f126]) ).

fof(f126,plain,
    one = antidomain(zero),
    inference(superposition,[],[f121,f61]) ).

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

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

fof(f121,plain,
    one = addition(antidomain(zero),zero),
    inference(superposition,[],[f59,f89]) ).

fof(f59,plain,
    ! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
    inference(cnf_transformation,[],[f46]) ).

fof(f46,plain,
    ! [X0] : one = addition(antidomain(antidomain(X0)),antidomain(X0)),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X3] : one = addition(antidomain(antidomain(X3)),antidomain(X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain3) ).

fof(f136,plain,
    zero != antidomain(antidomain(zero)),
    inference(forward_demodulation,[],[f135,f74]) ).

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

fof(f10,axiom,
    ! [X0] : zero = multiplication(X0,zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_annihilation) ).

fof(f135,plain,
    zero != antidomain(antidomain(multiplication(sK0,zero))),
    inference(forward_demodulation,[],[f134,f89]) ).

fof(f134,plain,
    zero != antidomain(antidomain(multiplication(sK0,antidomain(one)))),
    inference(backward_demodulation,[],[f88,f126]) ).

fof(f88,plain,
    zero != antidomain(antidomain(multiplication(sK0,antidomain(antidomain(zero))))),
    inference(definition_unfolding,[],[f63,f86]) ).

fof(f86,plain,
    ! [X0,X1] : forward_diamond(X0,X1) = antidomain(antidomain(multiplication(X0,antidomain(antidomain(X1))))),
    inference(definition_unfolding,[],[f58,f66,f66]) ).

fof(f66,plain,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)),
    inference(cnf_transformation,[],[f32]) ).

fof(f32,plain,
    ! [X0] : domain(X0) = antidomain(antidomain(X0)),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ! [X3] : antidomain(antidomain(X3)) = domain(X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',domain4) ).

fof(f58,plain,
    ! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f48]) ).

fof(f48,plain,
    ! [X0,X1] : forward_diamond(X0,X1) = domain(multiplication(X0,domain(X1))),
    inference(rectify,[],[f37]) ).

fof(f37,plain,
    ! [X1,X0] : domain(multiplication(X1,domain(X0))) = forward_diamond(X1,X0),
    inference(rectify,[],[f23]) ).

fof(f23,axiom,
    ! [X4,X3] : forward_diamond(X3,X4) = domain(multiplication(X3,domain(X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',forward_diamond) ).

fof(f63,plain,
    zero != forward_diamond(sK0,zero),
    inference(cnf_transformation,[],[f50]) ).

fof(f50,plain,
    zero != forward_diamond(sK0,zero),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f47,f49]) ).

fof(f49,plain,
    ( ? [X0] : zero != forward_diamond(X0,zero)
   => zero != forward_diamond(sK0,zero) ),
    introduced(choice_axiom,[]) ).

fof(f47,plain,
    ? [X0] : zero != forward_diamond(X0,zero),
    inference(ennf_transformation,[],[f42]) ).

fof(f42,plain,
    ~ ! [X0] : zero = forward_diamond(X0,zero),
    inference(rectify,[],[f28]) ).

fof(f28,negated_conjecture,
    ~ ! [X3] : zero = forward_diamond(X3,zero),
    inference(negated_conjecture,[],[f27]) ).

fof(f27,conjecture,
    ! [X3] : zero = forward_diamond(X3,zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : KLE113+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_sat --cores 0 -t %d %s
% 0.14/0.34  % Computer : n019.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 300
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Aug 30 00:30:50 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  % (15628)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.50  % (15620)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.51  % (15628)First to succeed.
% 0.20/0.51  % (15628)Refutation found. Thanks to Tanya!
% 0.20/0.51  % SZS status Theorem for theBenchmark
% 0.20/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.51  % (15628)------------------------------
% 0.20/0.51  % (15628)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (15628)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (15628)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (15628)Memory used [KB]: 5500
% 0.20/0.51  % (15628)Time elapsed: 0.099 s
% 0.20/0.51  % (15628)Instructions burned: 5 (million)
% 0.20/0.51  % (15628)------------------------------
% 0.20/0.51  % (15628)------------------------------
% 0.20/0.51  % (15606)Success in time 0.159 s
%------------------------------------------------------------------------------