TSTP Solution File: GRP704+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -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 : Sun May  5 06:10:27 EDT 2024

% Result   : Theorem 0.21s 0.40s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   32 (  22 unt;   0 def)
%            Number of atoms       :   53 (  52 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   47 (  26   ~;  14   |;   6   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   38 (  34   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f865,plain,
    $false,
    inference(subsumption_resolution,[],[f864,f36]) ).

fof(f36,plain,
    ! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
    inference(cnf_transformation,[],[f8]) ).

fof(f8,axiom,
    ! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).

fof(f864,plain,
    mult(op_c,mult(sK0,sK1)) != mult(mult(op_c,sK0),sK1),
    inference(forward_demodulation,[],[f863,f207]) ).

fof(f207,plain,
    op_c = op_f,
    inference(forward_demodulation,[],[f206,f30]) ).

fof(f30,plain,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f1,axiom,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

fof(f206,plain,
    ! [X0] : op_f = mult(X0,ld(X0,op_c)),
    inference(forward_demodulation,[],[f189,f26]) ).

fof(f26,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f18]) ).

fof(f18,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(rectify,[],[f6]) ).

fof(f6,axiom,
    ! [X1] : mult(unit,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).

fof(f189,plain,
    ! [X0] : op_f = mult(X0,mult(unit,ld(X0,op_c))),
    inference(superposition,[],[f33,f25]) ).

fof(f25,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f17]) ).

fof(f17,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(rectify,[],[f5]) ).

fof(f5,axiom,
    ! [X1] : mult(X1,unit) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

fof(f33,plain,
    ! [X0,X1] : op_f = mult(X1,mult(X0,ld(mult(X1,X0),op_c))),
    inference(cnf_transformation,[],[f13]) ).

fof(f13,axiom,
    ! [X0,X1] : op_f = mult(X1,mult(X0,ld(mult(X1,X0),op_c))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f13) ).

fof(f863,plain,
    mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1),
    inference(subsumption_resolution,[],[f862,f34]) ).

fof(f34,plain,
    ! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
    inference(cnf_transformation,[],[f9]) ).

fof(f9,axiom,
    ! [X0,X1] : mult(X1,mult(X0,op_c)) = mult(mult(X1,X0),op_c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).

fof(f862,plain,
    ( mult(sK0,mult(sK1,op_c)) != mult(mult(sK0,sK1),op_c)
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(forward_demodulation,[],[f861,f207]) ).

fof(f861,plain,
    ( mult(sK0,mult(sK1,op_f)) != mult(mult(sK0,sK1),op_f)
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(subsumption_resolution,[],[f860,f35]) ).

fof(f35,plain,
    ! [X0,X1] : mult(X1,mult(op_c,X0)) = mult(mult(X1,op_c),X0),
    inference(cnf_transformation,[],[f10]) ).

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

fof(f860,plain,
    ( mult(sK0,mult(op_c,sK1)) != mult(mult(sK0,op_c),sK1)
    | mult(sK0,mult(sK1,op_f)) != mult(mult(sK0,sK1),op_f)
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(forward_demodulation,[],[f24,f207]) ).

fof(f24,plain,
    ( mult(sK0,mult(op_f,sK1)) != mult(mult(sK0,op_f),sK1)
    | mult(sK0,mult(sK1,op_f)) != mult(mult(sK0,sK1),op_f)
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f23,plain,
    ( mult(sK0,mult(op_f,sK1)) != mult(mult(sK0,op_f),sK1)
    | mult(sK0,mult(sK1,op_f)) != mult(mult(sK0,sK1),op_f)
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f21,f22]) ).

fof(f22,plain,
    ( ? [X0,X1] :
        ( mult(X0,mult(op_f,X1)) != mult(mult(X0,op_f),X1)
        | mult(X0,mult(X1,op_f)) != mult(mult(X0,X1),op_f)
        | mult(op_f,mult(X0,X1)) != mult(mult(op_f,X0),X1) )
   => ( mult(sK0,mult(op_f,sK1)) != mult(mult(sK0,op_f),sK1)
      | mult(sK0,mult(sK1,op_f)) != mult(mult(sK0,sK1),op_f)
      | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f21,plain,
    ? [X0,X1] :
      ( mult(X0,mult(op_f,X1)) != mult(mult(X0,op_f),X1)
      | mult(X0,mult(X1,op_f)) != mult(mult(X0,X1),op_f)
      | mult(op_f,mult(X0,X1)) != mult(mult(op_f,X0),X1) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,plain,
    ~ ! [X0,X1] :
        ( mult(X0,mult(op_f,X1)) = mult(mult(X0,op_f),X1)
        & mult(X0,mult(X1,op_f)) = mult(mult(X0,X1),op_f)
        & mult(op_f,mult(X0,X1)) = mult(mult(op_f,X0),X1) ),
    inference(rectify,[],[f15]) ).

fof(f15,negated_conjecture,
    ~ ! [X3,X4] :
        ( mult(X3,mult(op_f,X4)) = mult(mult(X3,op_f),X4)
        & mult(X3,mult(X4,op_f)) = mult(mult(X3,X4),op_f)
        & mult(op_f,mult(X3,X4)) = mult(mult(op_f,X3),X4) ),
    inference(negated_conjecture,[],[f14]) ).

fof(f14,conjecture,
    ! [X3,X4] :
      ( mult(X3,mult(op_f,X4)) = mult(mult(X3,op_f),X4)
      & mult(X3,mult(X4,op_f)) = mult(mult(X3,X4),op_f)
      & mult(op_f,mult(X3,X4)) = mult(mult(op_f,X3),X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP704+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n013.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.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 20:53:53 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.35  % (13585)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (13592)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.37  % (13588)WARNING: value z3 for option sas not known
% 0.15/0.37  % (13589)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37  % (13587)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37  % (13586)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37  % (13588)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.37  % (13590)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.37  % (13593)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.37  TRYING [1]
% 0.15/0.37  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  TRYING [4]
% 0.15/0.39  TRYING [3]
% 0.15/0.39  TRYING [4]
% 0.21/0.39  % (13588)First to succeed.
% 0.21/0.39  % (13588)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13585"
% 0.21/0.40  % (13588)Refutation found. Thanks to Tanya!
% 0.21/0.40  % SZS status Theorem for theBenchmark
% 0.21/0.40  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.40  % (13588)------------------------------
% 0.21/0.40  % (13588)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.40  % (13588)Termination reason: Refutation
% 0.21/0.40  
% 0.21/0.40  % (13588)Memory used [KB]: 1084
% 0.21/0.40  % (13588)Time elapsed: 0.025 s
% 0.21/0.40  % (13588)Instructions burned: 40 (million)
% 0.21/0.40  % (13585)Success in time 0.03 s
%------------------------------------------------------------------------------