TSTP Solution File: GRP487-1 by SnakeForV-SAT---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GRP487-1 : TPTP v8.1.0. Released v2.6.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 16:22:39 EDT 2022

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

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

fof(f230,plain,
    identity != identity,
    inference(superposition,[],[f11,f214]) ).

fof(f214,plain,
    identity = sF2,
    inference(superposition,[],[f110,f209]) ).

fof(f209,plain,
    identity = double_divide(sF2,identity),
    inference(forward_demodulation,[],[f202,f110]) ).

fof(f202,plain,
    identity = double_divide(double_divide(sF2,identity),identity),
    inference(superposition,[],[f104,f198]) ).

fof(f198,plain,
    identity = double_divide(double_divide(double_divide(identity,double_divide(sF0,identity)),a1),identity),
    inference(forward_demodulation,[],[f196,f57]) ).

fof(f57,plain,
    identity = double_divide(a1,double_divide(double_divide(double_divide(identity,double_divide(sF0,sF0)),a1),identity)),
    inference(superposition,[],[f20,f8]) ).

fof(f8,plain,
    double_divide(a1,identity) = sF0,
    introduced(function_definition,[]) ).

fof(f20,plain,
    ! [X2,X3] : double_divide(a1,double_divide(double_divide(double_divide(identity,double_divide(sF0,double_divide(X2,X3))),X2),identity)) = X3,
    inference(superposition,[],[f1,f8]) ).

fof(f1,axiom,
    ! [X2,X0,X1] : double_divide(X0,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X0,identity),double_divide(X1,X2))),X1),identity)) = X2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

fof(f196,plain,
    double_divide(a1,double_divide(double_divide(double_divide(identity,double_divide(sF0,sF0)),a1),identity)) = double_divide(double_divide(double_divide(identity,double_divide(sF0,identity)),a1),identity),
    inference(superposition,[],[f20,f58]) ).

fof(f58,plain,
    double_divide(a1,double_divide(double_divide(double_divide(identity,double_divide(sF0,identity)),a1),identity)) = sF0,
    inference(superposition,[],[f20,f12]) ).

fof(f12,plain,
    identity = double_divide(a1,sF0),
    inference(superposition,[],[f7,f8]) ).

fof(f7,plain,
    ! [X0] : identity = double_divide(X0,double_divide(X0,identity)),
    inference(definition_unfolding,[],[f4,f3]) ).

fof(f3,axiom,
    ! [X0] : double_divide(X0,identity) = inverse(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).

fof(f4,axiom,
    ! [X0] : identity = double_divide(X0,inverse(X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

fof(f104,plain,
    ! [X5] : identity = double_divide(double_divide(sF2,double_divide(X5,identity)),double_divide(X5,identity)),
    inference(superposition,[],[f7,f48]) ).

fof(f48,plain,
    ! [X0] : double_divide(X0,identity) = double_divide(double_divide(sF2,double_divide(X0,identity)),identity),
    inference(forward_demodulation,[],[f44,f22]) ).

fof(f22,plain,
    ! [X0,X1] : double_divide(X0,identity) = double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),identity)),X0),identity)),
    inference(superposition,[],[f1,f7]) ).

fof(f44,plain,
    ! [X0,X1] : double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),identity)),X0),identity)) = double_divide(double_divide(sF2,double_divide(X0,identity)),identity),
    inference(superposition,[],[f1,f35]) ).

fof(f35,plain,
    ! [X0] : identity = double_divide(X0,double_divide(double_divide(sF2,double_divide(X0,identity)),identity)),
    inference(forward_demodulation,[],[f31,f16]) ).

fof(f16,plain,
    double_divide(identity,identity) = sF2,
    inference(superposition,[],[f10,f15]) ).

fof(f15,plain,
    identity = sF1,
    inference(superposition,[],[f9,f12]) ).

fof(f9,plain,
    sF1 = double_divide(a1,sF0),
    introduced(function_definition,[]) ).

fof(f10,plain,
    double_divide(sF1,identity) = sF2,
    introduced(function_definition,[]) ).

fof(f31,plain,
    ! [X0] : identity = double_divide(X0,double_divide(double_divide(double_divide(identity,identity),double_divide(X0,identity)),identity)),
    inference(superposition,[],[f1,f7]) ).

fof(f110,plain,
    double_divide(sF2,identity) = sF2,
    inference(forward_demodulation,[],[f98,f16]) ).

fof(f98,plain,
    double_divide(sF2,identity) = double_divide(identity,identity),
    inference(superposition,[],[f48,f7]) ).

fof(f11,plain,
    identity != sF2,
    inference(definition_folding,[],[f6,f10,f9,f8]) ).

fof(f6,plain,
    identity != double_divide(double_divide(a1,double_divide(a1,identity)),identity),
    inference(definition_unfolding,[],[f5,f2,f3]) ).

fof(f2,axiom,
    ! [X0,X1] : multiply(X0,X1) = double_divide(double_divide(X1,X0),identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

fof(f5,axiom,
    identity != multiply(inverse(a1),a1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : GRP487-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/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   : Mon Aug 29 22:28:02 EDT 2022
% 0.13/0.34  % CPUTime    : 
% 0.20/0.48  % (20173)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/100Mi)
% 0.20/0.49  % (20173)First to succeed.
% 0.20/0.50  % (20165)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.20/0.52  % (20173)Refutation found. Thanks to Tanya!
% 0.20/0.52  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.52  % (20173)------------------------------
% 0.20/0.52  % (20173)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52  % (20173)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52  % (20173)Termination reason: Refutation
% 0.20/0.52  
% 0.20/0.52  % (20173)Memory used [KB]: 5628
% 0.20/0.52  % (20173)Time elapsed: 0.100 s
% 0.20/0.52  % (20173)Instructions burned: 11 (million)
% 0.20/0.52  % (20173)------------------------------
% 0.20/0.52  % (20173)------------------------------
% 0.20/0.52  % (20161)Success in time 0.169 s
%------------------------------------------------------------------------------