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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : KLE075+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 : 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:29:03 EDT 2022

% Result   : Theorem 0.21s 0.54s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  22 unt;   0 def)
%            Number of atoms       :   22 (  21 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    6 (   6   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   14 (  13   !;   1   ?)

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

fof(f383,plain,
    sF1 != sF1,
    inference(superposition,[],[f51,f356]) ).

fof(f356,plain,
    sF3 = sF1,
    inference(superposition,[],[f54,f329]) ).

fof(f329,plain,
    domain(sF1) = sF1,
    inference(superposition,[],[f318,f48]) ).

fof(f48,plain,
    domain(sK0) = sF1,
    introduced(function_definition,[]) ).

fof(f318,plain,
    ! [X0] : domain(X0) = domain(domain(X0)),
    inference(forward_demodulation,[],[f297,f44]) ).

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

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

fof(f297,plain,
    ! [X0] : domain(domain(X0)) = domain(multiplication(one,X0)),
    inference(superposition,[],[f41,f44]) ).

fof(f41,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(cnf_transformation,[],[f26]) ).

fof(f26,plain,
    ! [X0,X1] : domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))),
    inference(rectify,[],[f14]) ).

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

fof(f54,plain,
    domain(sF1) = sF3,
    inference(superposition,[],[f50,f53]) ).

fof(f53,plain,
    sF2 = sF1,
    inference(superposition,[],[f44,f49]) ).

fof(f49,plain,
    sF2 = multiplication(one,sF1),
    introduced(function_definition,[]) ).

fof(f50,plain,
    sF3 = domain(sF2),
    introduced(function_definition,[]) ).

fof(f51,plain,
    sF3 != sF1,
    inference(definition_folding,[],[f34,f48,f50,f49,f48]) ).

fof(f34,plain,
    domain(multiplication(one,domain(sK0))) != domain(sK0),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ? [X0] : domain(multiplication(one,domain(X0))) != domain(X0),
    inference(ennf_transformation,[],[f23]) ).

fof(f23,plain,
    ~ ! [X0] : domain(multiplication(one,domain(X0))) = domain(X0),
    inference(rectify,[],[f19]) ).

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

fof(f18,conjecture,
    ! [X3] : domain(X3) = domain(multiplication(one,domain(X3))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KLE075+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/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.35  % Computer : n029.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Aug 30 00:34:56 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.21/0.51  % (30293)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.21/0.52  % (30285)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.21/0.53  % (30293)First to succeed.
% 0.21/0.54  % (30293)Refutation found. Thanks to Tanya!
% 0.21/0.54  % SZS status Theorem for theBenchmark
% 0.21/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54  % (30293)------------------------------
% 0.21/0.54  % (30293)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.54  % (30293)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.54  % (30293)Termination reason: Refutation
% 0.21/0.54  
% 0.21/0.54  % (30293)Memory used [KB]: 5628
% 0.21/0.54  % (30293)Time elapsed: 0.097 s
% 0.21/0.54  % (30293)Instructions burned: 14 (million)
% 0.21/0.54  % (30293)------------------------------
% 0.21/0.54  % (30293)------------------------------
% 0.21/0.54  % (30281)Success in time 0.187 s
%------------------------------------------------------------------------------