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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV-SAT---1.0
% Problem  : GRP519-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 : n004.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:45 EDT 2022

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

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

fof(f141,plain,
    multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3)),
    inference(superposition,[],[f2,f61]) ).

fof(f61,plain,
    ! [X2,X3,X0] : multiply(multiply(X2,X0),X3) = multiply(X2,multiply(X0,X3)),
    inference(forward_demodulation,[],[f49,f18]) ).

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

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

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

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

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

fof(f24,plain,
    ! [X6,X7,X5] : multiply(X7,X5) = multiply(multiply(inverse(X6),X7),multiply(X6,X5)),
    inference(forward_demodulation,[],[f23,f22]) ).

fof(f22,plain,
    ! [X2,X3,X0,X4] : multiply(X2,X0) = multiply(X3,multiply(X2,multiply(multiply(inverse(multiply(X3,X4)),X0),X4))),
    inference(backward_demodulation,[],[f5,f18]) ).

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

fof(f23,plain,
    ! [X10,X6,X9,X7,X5] : multiply(X9,multiply(X7,multiply(multiply(inverse(multiply(X9,X10)),X5),X10))) = multiply(multiply(inverse(X6),X7),multiply(X6,X5)),
    inference(backward_demodulation,[],[f6,f18]) ).

fof(f6,plain,
    ! [X10,X8,X6,X9,X7,X5] : multiply(X9,multiply(X7,multiply(multiply(inverse(multiply(X9,X10)),X5),X10))) = multiply(multiply(inverse(X6),X7),multiply(multiply(inverse(multiply(inverse(X5),X8)),X6),X8)),
    inference(superposition,[],[f3,f3]) ).

fof(f2,axiom,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/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.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Aug 29 22:27:34 EDT 2022
% 0.13/0.35  % CPUTime    : 
% 0.20/0.52  % (30157)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.54  % (30164)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.20/0.54  % (30156)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/37Mi)
% 0.20/0.55  % (30164)First to succeed.
% 0.20/0.56  % (30176)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/498Mi)
% 0.20/0.56  % (30164)Refutation found. Thanks to Tanya!
% 0.20/0.56  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.56  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56  % (30164)------------------------------
% 0.20/0.56  % (30164)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56  % (30164)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56  % (30164)Termination reason: Refutation
% 0.20/0.56  
% 0.20/0.56  % (30164)Memory used [KB]: 5628
% 0.20/0.56  % (30164)Time elapsed: 0.112 s
% 0.20/0.56  % (30164)Instructions burned: 12 (million)
% 0.20/0.56  % (30164)------------------------------
% 0.20/0.56  % (30164)------------------------------
% 0.20/0.56  % (30153)Success in time 0.203 s
%------------------------------------------------------------------------------