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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : KLE086+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 : n013.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:05 EDT 2022

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

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

fof(f132,plain,
    zero != zero,
    inference(superposition,[],[f129,f63]) ).

fof(f63,plain,
    zero = antidomain(one),
    inference(superposition,[],[f55,f56]) ).

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

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

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

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

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

fof(f129,plain,
    zero != antidomain(one),
    inference(backward_demodulation,[],[f62,f122]) ).

fof(f122,plain,
    one = antidomain(zero),
    inference(superposition,[],[f59,f82]) ).

fof(f82,plain,
    one = addition(antidomain(zero),zero),
    inference(superposition,[],[f60,f63]) ).

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

fof(f32,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/sandbox2/benchmark/theBenchmark.p',domain3) ).

fof(f59,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(f62,plain,
    zero != antidomain(antidomain(zero)),
    inference(definition_unfolding,[],[f52,f48]) ).

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

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

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

fof(f52,plain,
    zero != domain(zero),
    inference(cnf_transformation,[],[f29]) ).

fof(f29,plain,
    zero != domain(zero),
    inference(flattening,[],[f22]) ).

fof(f22,negated_conjecture,
    zero != domain(zero),
    inference(negated_conjecture,[],[f21]) ).

fof(f21,conjecture,
    zero = domain(zero),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KLE086+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.13/0.34  % Computer : n013.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Tue Aug 30 00:21:47 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.19/0.50  % (21813)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 0.19/0.51  % (21808)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.19/0.51  % (21811)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.19/0.51  % (21808)First to succeed.
% 0.19/0.52  % (21811)Also succeeded, but the first one will report.
% 0.19/0.52  % (21808)Refutation found. Thanks to Tanya!
% 0.19/0.52  % SZS status Theorem for theBenchmark
% 0.19/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.52  % (21808)------------------------------
% 0.19/0.52  % (21808)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52  % (21808)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52  % (21808)Termination reason: Refutation
% 0.19/0.52  
% 0.19/0.52  % (21808)Memory used [KB]: 1023
% 0.19/0.52  % (21808)Time elapsed: 0.035 s
% 0.19/0.52  % (21808)Instructions burned: 6 (million)
% 0.19/0.52  % (21808)------------------------------
% 0.19/0.52  % (21808)------------------------------
% 0.19/0.52  % (21797)Success in time 0.167 s
%------------------------------------------------------------------------------