TSTP Solution File: RNG018-6 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : RNG018-6 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n020.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 : Tue Apr 30 14:50:17 EDT 2024

% Result   : Unsatisfiable 11.38s 2.04s
% Output   : Refutation 11.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   24 (  24 unt;   0 def)
%            Number of atoms       :   24 (  23 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   35 (  35   !;   0   ?)

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

fof(f39750,plain,
    multiply(add(x,y),additive_inverse(z)) != multiply(add(x,y),additive_inverse(z)),
    inference(superposition,[],[f1278,f39440]) ).

fof(f39440,plain,
    ! [X0,X1] : additive_inverse(multiply(X0,X1)) = multiply(X0,additive_inverse(X1)),
    inference(superposition,[],[f39329,f2]) ).

fof(f2,axiom,
    ! [X0] : add(X0,additive_identity) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_additive_identity) ).

fof(f39329,plain,
    ! [X0,X1] : add(additive_inverse(multiply(X1,X0)),additive_identity) = multiply(X1,additive_inverse(X0)),
    inference(forward_demodulation,[],[f39101,f4]) ).

fof(f4,axiom,
    ! [X0] : additive_identity = multiply(X0,additive_identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_multiplicative_zero) ).

fof(f39101,plain,
    ! [X0,X1] : multiply(X1,additive_inverse(X0)) = add(additive_inverse(multiply(X1,X0)),multiply(X1,additive_identity)),
    inference(superposition,[],[f670,f6]) ).

fof(f6,axiom,
    ! [X0] : additive_identity = add(X0,additive_inverse(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_additive_inverse) ).

fof(f670,plain,
    ! [X2,X0,X1] : multiply(X0,X2) = add(additive_inverse(multiply(X0,X1)),multiply(X0,add(X1,X2))),
    inference(superposition,[],[f56,f8]) ).

fof(f8,axiom,
    ! [X2,X0,X1] : multiply(X0,add(X1,X2)) = add(multiply(X0,X1),multiply(X0,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribute1) ).

fof(f56,plain,
    ! [X0,X1] : add(additive_inverse(X0),add(X0,X1)) = X1,
    inference(forward_demodulation,[],[f44,f1]) ).

fof(f1,axiom,
    ! [X0] : add(additive_identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_additive_identity) ).

fof(f44,plain,
    ! [X0,X1] : add(additive_identity,X1) = add(additive_inverse(X0),add(X0,X1)),
    inference(superposition,[],[f11,f5]) ).

fof(f5,axiom,
    ! [X0] : additive_identity = add(additive_inverse(X0),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',left_additive_inverse) ).

fof(f11,axiom,
    ! [X2,X0,X1] : add(X0,add(X1,X2)) = add(add(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_for_addition) ).

fof(f1278,plain,
    multiply(add(x,y),additive_inverse(z)) != additive_inverse(multiply(add(x,y),z)),
    inference(forward_demodulation,[],[f1277,f9]) ).

fof(f9,axiom,
    ! [X2,X0,X1] : multiply(add(X0,X1),X2) = add(multiply(X0,X2),multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribute2) ).

fof(f1277,plain,
    multiply(add(x,y),additive_inverse(z)) != additive_inverse(add(multiply(x,z),multiply(y,z))),
    inference(forward_demodulation,[],[f1225,f10]) ).

fof(f10,axiom,
    ! [X0,X1] : add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_for_addition) ).

fof(f1225,plain,
    multiply(add(x,y),additive_inverse(z)) != additive_inverse(add(multiply(y,z),multiply(x,z))),
    inference(superposition,[],[f16,f393]) ).

fof(f393,plain,
    ! [X0,X1] : additive_inverse(add(X0,X1)) = add(additive_inverse(X1),additive_inverse(X0)),
    inference(superposition,[],[f86,f133]) ).

fof(f133,plain,
    ! [X0,X1] : additive_inverse(X0) = add(additive_inverse(add(X0,X1)),X1),
    inference(superposition,[],[f86,f56]) ).

fof(f86,plain,
    ! [X0,X1] : add(additive_inverse(X0),add(X1,X0)) = X1,
    inference(superposition,[],[f56,f10]) ).

fof(f16,axiom,
    multiply(add(x,y),additive_inverse(z)) != add(additive_inverse(multiply(x,z)),additive_inverse(multiply(y,z))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : RNG018-6 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.36  % Computer : n020.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 300
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Apr 30 02:06:47 EDT 2024
% 0.14/0.36  % CPUTime    : 
% 0.14/0.36  % (32506)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.38  % (32509)WARNING: value z3 for option sas not known
% 0.14/0.38  % (32511)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.14/0.38  % (32510)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38  % (32513)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.14/0.38  % (32512)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.14/0.38  % (32509)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.14/0.38  % (32508)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (32507)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38  TRYING [3]
% 0.14/0.39  TRYING [1]
% 0.14/0.39  TRYING [2]
% 0.14/0.39  TRYING [4]
% 0.14/0.40  TRYING [3]
% 0.22/0.43  TRYING [5]
% 0.22/0.44  TRYING [4]
% 1.40/0.56  TRYING [6]
% 1.60/0.60  TRYING [5]
% 4.13/0.95  TRYING [7]
% 5.09/1.08  TRYING [1]
% 5.09/1.08  TRYING [2]
% 5.09/1.08  TRYING [3]
% 5.09/1.10  TRYING [4]
% 5.91/1.23  TRYING [5]
% 8.35/1.57  TRYING [6]
% 9.28/1.75  TRYING [6]
% 11.38/2.04  % (32509)First to succeed.
% 11.38/2.04  % (32509)Refutation found. Thanks to Tanya!
% 11.38/2.04  % SZS status Unsatisfiable for theBenchmark
% 11.38/2.04  % SZS output start Proof for theBenchmark
% See solution above
% 11.38/2.04  % (32509)------------------------------
% 11.38/2.04  % (32509)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 11.38/2.04  % (32509)Termination reason: Refutation
% 11.38/2.04  
% 11.38/2.04  % (32509)Memory used [KB]: 17538
% 11.38/2.04  % (32509)Time elapsed: 1.658 s
% 11.38/2.04  % (32509)Instructions burned: 4094 (million)
% 11.38/2.04  % (32509)------------------------------
% 11.38/2.04  % (32509)------------------------------
% 11.38/2.04  % (32506)Success in time 1.668 s
%------------------------------------------------------------------------------