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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : BOO034-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n012.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 04:42:53 EDT 2024

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

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

fof(f5,axiom,
    ! [X2,X3] : multiply(X2,X3,inverse(X3)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).

fof(f4705,plain,
    b != multiply(b,multiply(c,d,multiply(e,f,g)),inverse(multiply(c,d,multiply(e,f,g)))),
    inference(forward_demodulation,[],[f4704,f4391]) ).

fof(f4391,plain,
    ! [X2,X0,X1] : multiply(X0,X1,X2) = multiply(X0,X2,X1),
    inference(forward_demodulation,[],[f4390,f102]) ).

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

fof(f32,plain,
    ! [X2,X0,X1] : multiply(X2,X0,X1) = multiply(X0,X1,multiply(X2,X0,X1)),
    inference(superposition,[],[f7,f2]) ).

fof(f2,axiom,
    ! [X2,X3] : multiply(X3,X2,X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ternary_multiply_1) ).

fof(f7,plain,
    ! [X2,X3,X0,X1] : multiply(X0,X1,multiply(X1,X2,X3)) = multiply(X1,X2,multiply(X0,X1,X3)),
    inference(superposition,[],[f1,f2]) ).

fof(f1,axiom,
    ! [X2,X3,X0,X1,X4] : multiply(multiply(X0,X1,X2),X3,multiply(X0,X1,X4)) = multiply(X0,X1,multiply(X2,X3,X4)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity) ).

fof(f4390,plain,
    ! [X2,X0,X1] : multiply(X0,X2,X1) = multiply(X0,X1,multiply(X1,inverse(X1),X2)),
    inference(forward_demodulation,[],[f4125,f1536]) ).

fof(f1536,plain,
    ! [X2,X0,X1] : multiply(X0,X1,X2) = multiply(X2,X0,X1),
    inference(forward_demodulation,[],[f1500,f5]) ).

fof(f1500,plain,
    ! [X2,X0,X1] : multiply(X2,X0,X1) = multiply(X0,X1,multiply(X2,X0,inverse(X0))),
    inference(superposition,[],[f7,f1409]) ).

fof(f1409,plain,
    ! [X0,X1] : multiply(X0,X1,inverse(X0)) = X1,
    inference(superposition,[],[f1366,f116]) ).

fof(f116,plain,
    ! [X0] : inverse(inverse(X0)) = X0,
    inference(superposition,[],[f102,f5]) ).

fof(f1366,plain,
    ! [X0,X1] : multiply(inverse(X1),X0,X1) = X0,
    inference(superposition,[],[f1255,f32]) ).

fof(f1255,plain,
    ! [X2,X0,X1] : multiply(X0,X1,multiply(inverse(X1),X0,X2)) = X0,
    inference(superposition,[],[f18,f5]) ).

fof(f18,plain,
    ! [X2,X3,X0,X1] : multiply(X0,X1,X2) = multiply(X0,X1,multiply(X2,multiply(X0,X1,X2),X3)),
    inference(superposition,[],[f1,f3]) ).

fof(f3,axiom,
    ! [X2,X3] : multiply(X2,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ternary_multiply_2) ).

fof(f4125,plain,
    ! [X2,X0,X1] : multiply(X0,X2,X1) = multiply(X0,X1,multiply(inverse(X1),X2,X1)),
    inference(superposition,[],[f10,f2]) ).

fof(f10,plain,
    ! [X2,X3,X0,X1] : multiply(X0,X1,multiply(inverse(X1),X2,X3)) = multiply(X0,X2,multiply(X0,X1,X3)),
    inference(superposition,[],[f1,f5]) ).

fof(f4704,plain,
    b != multiply(b,multiply(c,d,multiply(e,g,f)),inverse(multiply(c,d,multiply(e,f,g)))),
    inference(forward_demodulation,[],[f4703,f1536]) ).

fof(f4703,plain,
    b != multiply(b,multiply(c,d,multiply(g,f,e)),inverse(multiply(c,d,multiply(e,f,g)))),
    inference(forward_demodulation,[],[f4598,f1536]) ).

fof(f4598,plain,
    b != multiply(b,multiply(d,multiply(g,f,e),c),inverse(multiply(c,d,multiply(e,f,g)))),
    inference(superposition,[],[f134,f4391]) ).

fof(f134,plain,
    b != multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)),
    inference(forward_demodulation,[],[f133,f102]) ).

fof(f133,plain,
    b != multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)),
    inference(forward_demodulation,[],[f6,f1]) ).

fof(f6,axiom,
    b != multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_single_axiom) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : BOO034-1 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n012.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Fri May  3 18:46:53 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  % (3114)Running in auto input_syntax mode. Trying TPTP
% 0.21/0.37  % (3117)WARNING: value z3 for option sas not known
% 0.21/0.37  % (3120)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.21/0.37  % (3117)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.21/0.37  % (3116)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.21/0.37  % (3118)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.21/0.37  % (3121)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.21/0.37  % (3115)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.21/0.37  % (3119)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.21/0.37  TRYING [1]
% 0.21/0.37  TRYING [2]
% 0.21/0.38  TRYING [1]
% 0.21/0.38  TRYING [2]
% 0.21/0.38  TRYING [3]
% 0.21/0.39  TRYING [3]
% 0.21/0.40  TRYING [4]
% 0.21/0.41  TRYING [1]
% 0.21/0.41  TRYING [2]
% 0.21/0.41  TRYING [3]
% 0.21/0.44  TRYING [4]
% 0.21/0.50  TRYING [4]
% 0.21/0.51  % (3117)First to succeed.
% 0.21/0.51  % (3117)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3114"
% 0.21/0.51  % (3117)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (3117)------------------------------
% 0.21/0.51  % (3117)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.51  % (3117)Termination reason: Refutation
% 0.21/0.51  
% 0.21/0.51  % (3117)Memory used [KB]: 2756
% 0.21/0.51  % (3117)Time elapsed: 0.139 s
% 0.21/0.51  % (3117)Instructions burned: 272 (million)
% 0.21/0.51  % (3114)Success in time 0.156 s
%------------------------------------------------------------------------------