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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : SYO561+1 : TPTP v8.1.0. Released v5.3.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 : 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 19:47:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(f7,plain,
    $false,
    inference(subsumption_resolution,[],[f5,f6]) ).

fof(f6,plain,
    "Apple" = "Microsoft",
    inference(cnf_transformation,[],[f4]) ).

fof(f4,plain,
    "Apple" = "Microsoft",
    inference(flattening,[],[f2]) ).

fof(f2,negated_conjecture,
    ~ ( "Apple" != "Microsoft" ),
    inference(negated_conjecture,[],[f1]) ).

fof(f1,conjecture,
    "Apple" != "Microsoft",
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',apple_not_microsoft) ).

fof(f5,plain,
    "Apple" != "Microsoft",
    inference(cnf_transformation,[],[f3]) ).

fof(f3,plain,
    "Apple" != "Microsoft",
    introduced(distinctness_axiom,[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYO561+1 : TPTP v8.1.0. Released v5.3.0.
% 0.07/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.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 23:08:05 EDT 2022
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  % (27674)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.50  % (27674)First to succeed.
% 0.20/0.50  % (27681)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.50  % (27681)Also succeeded, but the first one will report.
% 0.20/0.51  % (27674)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  % (27674)------------------------------
% 0.20/0.51  % (27674)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.51  % (27674)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.51  % (27674)Termination reason: Refutation
% 0.20/0.51  
% 0.20/0.51  % (27674)Memory used [KB]: 5884
% 0.20/0.51  % (27674)Time elapsed: 0.002 s
% 0.20/0.51  % (27674)Instructions burned: 1 (million)
% 0.20/0.51  % (27674)------------------------------
% 0.20/0.51  % (27674)------------------------------
% 0.20/0.51  % (27658)Success in time 0.151 s
%------------------------------------------------------------------------------