TSTP Solution File: GRP529-1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : GRP529-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Sun May  5 06:09:22 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f466,plain,
    $false,
    inference(subsumption_resolution,[],[f439,f392]) ).

fof(f392,plain,
    ! [X0,X1] : multiply(inverse(X0),X0) = multiply(X1,inverse(X1)),
    inference(superposition,[],[f366,f8]) ).

fof(f8,plain,
    ! [X0,X1] : inverse(X1) = divide(multiply(inverse(X0),X0),X1),
    inference(superposition,[],[f3,f5]) ).

fof(f5,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    inference(forward_demodulation,[],[f2,f3]) ).

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

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

fof(f366,plain,
    ! [X0,X1] : multiply(X1,divide(X0,X1)) = X0,
    inference(superposition,[],[f330,f155]) ).

fof(f155,plain,
    ! [X0,X1] : divide(X0,divide(X0,X1)) = X1,
    inference(superposition,[],[f144,f1]) ).

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

fof(f144,plain,
    ! [X0,X1] : divide(X1,divide(X0,X0)) = X1,
    inference(forward_demodulation,[],[f132,f96]) ).

fof(f96,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f69,f3]) ).

fof(f69,plain,
    ! [X0,X1] : inverse(divide(divide(X0,X1),X0)) = X1,
    inference(superposition,[],[f1,f3]) ).

fof(f132,plain,
    ! [X0,X1] : divide(inverse(inverse(X1)),divide(X0,X0)) = X1,
    inference(superposition,[],[f128,f7]) ).

fof(f7,plain,
    ! [X0,X1] : inverse(inverse(X1)) = multiply(divide(X0,X0),X1),
    inference(superposition,[],[f5,f3]) ).

fof(f128,plain,
    ! [X0,X1] : divide(multiply(X0,X1),X0) = X1,
    inference(forward_demodulation,[],[f113,f96]) ).

fof(f113,plain,
    ! [X0,X1] : inverse(inverse(X1)) = divide(multiply(X0,X1),X0),
    inference(superposition,[],[f106,f5]) ).

fof(f106,plain,
    ! [X0,X1] : inverse(X1) = divide(divide(X0,X1),X0),
    inference(superposition,[],[f96,f69]) ).

fof(f330,plain,
    ! [X0,X1] : multiply(divide(X0,X1),X1) = X0,
    inference(forward_demodulation,[],[f317,f111]) ).

fof(f111,plain,
    ! [X0,X1] : divide(X1,X0) = multiply(X1,inverse(X0)),
    inference(superposition,[],[f5,f96]) ).

fof(f317,plain,
    ! [X0,X1] : multiply(multiply(X0,inverse(X1)),X1) = X0,
    inference(superposition,[],[f194,f5]) ).

fof(f194,plain,
    ! [X0,X1] : divide(multiply(X0,X1),X1) = X0,
    inference(superposition,[],[f155,f128]) ).

fof(f439,plain,
    multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
    inference(superposition,[],[f4,f373]) ).

fof(f373,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[],[f330,f128]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP529-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n019.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 20:42:08 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.36  % (4009)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (4012)WARNING: value z3 for option sas not known
% 0.15/0.38  % (4010)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.38  % (4013)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.38  % (4012)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.38  % (4016)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38  % (4014)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.38  % (4015)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.38  % (4011)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [4]
% 0.15/0.38  TRYING [3]
% 0.15/0.39  TRYING [1]
% 0.15/0.39  % (4016)First to succeed.
% 0.15/0.39  TRYING [2]
% 0.15/0.39  % (4016)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-4009"
% 0.15/0.39  TRYING [3]
% 0.15/0.39  % (4016)Refutation found. Thanks to Tanya!
% 0.15/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.39  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39  % (4016)------------------------------
% 0.15/0.39  % (4016)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39  % (4016)Termination reason: Refutation
% 0.15/0.39  
% 0.15/0.39  % (4016)Memory used [KB]: 852
% 0.15/0.39  % (4016)Time elapsed: 0.013 s
% 0.15/0.39  % (4016)Instructions burned: 20 (million)
% 0.15/0.39  % (4009)Success in time 0.029 s
%------------------------------------------------------------------------------