TSTP Solution File: GRP704+1 by SnakeForV---1.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SnakeForV---1.0
% Problem  : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s

% Computer : n016.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:18:21 EDT 2022

% Result   : Theorem 0.10s 0.37s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   49 (  26 unt;   0 def)
%            Number of atoms       :   83 (  58 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   63 (  29   ~;  24   |;   6   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   47 (  43   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f176,plain,
    $false,
    inference(avatar_sat_refutation,[],[f60,f136,f141,f172]) ).

fof(f172,plain,
    spl2_3,
    inference(avatar_contradiction_clause,[],[f171]) ).

fof(f171,plain,
    ( $false
    | spl2_3 ),
    inference(trivial_inequality_removal,[],[f165]) ).

fof(f165,plain,
    ( mult(sK0,mult(op_c,sK1)) != mult(sK0,mult(op_c,sK1))
    | spl2_3 ),
    inference(superposition,[],[f142,f41]) ).

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

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

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

fof(f142,plain,
    ( mult(mult(sK0,op_c),sK1) != mult(sK0,mult(op_c,sK1))
    | spl2_3 ),
    inference(forward_demodulation,[],[f59,f99]) ).

fof(f99,plain,
    op_c = op_f,
    inference(forward_demodulation,[],[f98,f47]) ).

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

fof(f33,plain,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    inference(rectify,[],[f21]) ).

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

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

fof(f98,plain,
    ! [X6] : op_f = mult(X6,ld(X6,op_c)),
    inference(forward_demodulation,[],[f96,f34]) ).

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

fof(f23,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(f96,plain,
    ! [X6] : op_f = mult(X6,ld(mult(unit,X6),op_c)),
    inference(superposition,[],[f34,f39]) ).

fof(f39,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(f59,plain,
    ( mult(mult(sK0,op_f),sK1) != mult(sK0,mult(op_f,sK1))
    | spl2_3 ),
    inference(avatar_component_clause,[],[f57]) ).

fof(f57,plain,
    ( spl2_3
  <=> mult(mult(sK0,op_f),sK1) = mult(sK0,mult(op_f,sK1)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_3])]) ).

fof(f141,plain,
    spl2_2,
    inference(avatar_contradiction_clause,[],[f140]) ).

fof(f140,plain,
    ( $false
    | spl2_2 ),
    inference(trivial_inequality_removal,[],[f139]) ).

fof(f139,plain,
    ( mult(sK0,mult(sK1,op_c)) != mult(sK0,mult(sK1,op_c))
    | spl2_2 ),
    inference(superposition,[],[f137,f37]) ).

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

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

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

fof(f137,plain,
    ( mult(sK0,mult(sK1,op_c)) != mult(mult(sK0,sK1),op_c)
    | spl2_2 ),
    inference(forward_demodulation,[],[f55,f99]) ).

fof(f55,plain,
    ( mult(mult(sK0,sK1),op_f) != mult(sK0,mult(sK1,op_f))
    | spl2_2 ),
    inference(avatar_component_clause,[],[f53]) ).

fof(f53,plain,
    ( spl2_2
  <=> mult(mult(sK0,sK1),op_f) = mult(sK0,mult(sK1,op_f)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_2])]) ).

fof(f136,plain,
    spl2_1,
    inference(avatar_contradiction_clause,[],[f135]) ).

fof(f135,plain,
    ( $false
    | spl2_1 ),
    inference(trivial_inequality_removal,[],[f134]) ).

fof(f134,plain,
    ( mult(op_c,mult(sK0,sK1)) != mult(op_c,mult(sK0,sK1))
    | spl2_1 ),
    inference(superposition,[],[f133,f40]) ).

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

fof(f31,plain,
    ! [X0,X1] : mult(op_c,mult(X1,X0)) = mult(mult(op_c,X1),X0),
    inference(rectify,[],[f16]) ).

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

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

fof(f133,plain,
    ( mult(mult(op_c,sK0),sK1) != mult(op_c,mult(sK0,sK1))
    | spl2_1 ),
    inference(backward_demodulation,[],[f51,f99]) ).

fof(f51,plain,
    ( mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1)
    | spl2_1 ),
    inference(avatar_component_clause,[],[f49]) ).

fof(f49,plain,
    ( spl2_1
  <=> mult(op_f,mult(sK0,sK1)) = mult(mult(op_f,sK0),sK1) ),
    introduced(avatar_definition,[new_symbols(naming,[spl2_1])]) ).

fof(f60,plain,
    ( ~ spl2_1
    | ~ spl2_2
    | ~ spl2_3 ),
    inference(avatar_split_clause,[],[f35,f57,f53,f49]) ).

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

fof(f28,plain,
    ( mult(mult(sK0,sK1),op_f) != mult(sK0,mult(sK1,op_f))
    | mult(mult(sK0,op_f),sK1) != mult(sK0,mult(op_f,sK1))
    | mult(op_f,mult(sK0,sK1)) != mult(mult(op_f,sK0),sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f27]) ).

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

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

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

fof(f15,negated_conjecture,
    ~ ! [X3,X4] :
        ( mult(op_f,mult(X3,X4)) = mult(mult(op_f,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) ),
    inference(negated_conjecture,[],[f14]) ).

fof(f14,conjecture,
    ! [X3,X4] :
      ( mult(op_f,mult(X3,X4)) = mult(mult(op_f,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) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07  % Problem    : GRP704+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.07  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.06/0.26  % Computer : n016.cluster.edu
% 0.06/0.26  % Model    : x86_64 x86_64
% 0.06/0.26  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26  % Memory   : 8042.1875MB
% 0.06/0.26  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26  % CPULimit   : 300
% 0.06/0.26  % WCLimit    : 300
% 0.06/0.26  % DateTime   : Mon Aug 29 23:09:15 EDT 2022
% 0.06/0.26  % CPUTime    : 
% 0.10/0.35  % (17037)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.10/0.36  % (17050)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.10/0.36  % (17057)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.10/0.36  % (17042)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.10/0.36  % (17039)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.10/0.36  % (17040)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.10/0.36  % (17040)Refutation not found, incomplete strategy% (17040)------------------------------
% 0.10/0.36  % (17040)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.36  % (17040)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.36  % (17040)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.36  
% 0.10/0.36  % (17040)Memory used [KB]: 1407
% 0.10/0.36  % (17040)Time elapsed: 0.076 s
% 0.10/0.36  % (17040)Instructions burned: 2 (million)
% 0.10/0.36  % (17040)------------------------------
% 0.10/0.36  % (17040)------------------------------
% 0.10/0.36  % (17038)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.10/0.37  % (17050)First to succeed.
% 0.10/0.37  % (17042)Instruction limit reached!
% 0.10/0.37  % (17042)------------------------------
% 0.10/0.37  % (17042)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.37  % (17036)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.10/0.37  % (17042)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.37  % (17042)Termination reason: Unknown
% 0.10/0.37  % (17042)Termination phase: Saturation
% 0.10/0.37  
% 0.10/0.37  % (17042)Memory used [KB]: 5884
% 0.10/0.37  % (17042)Time elapsed: 0.046 s
% 0.10/0.37  % (17042)Instructions burned: 4 (million)
% 0.10/0.37  % (17042)------------------------------
% 0.10/0.37  % (17042)------------------------------
% 0.10/0.37  % (17036)Refutation not found, incomplete strategy% (17036)------------------------------
% 0.10/0.37  % (17036)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.37  % (17036)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.37  % (17036)Termination reason: Refutation not found, incomplete strategy
% 0.10/0.37  
% 0.10/0.37  % (17036)Memory used [KB]: 5884
% 0.10/0.37  % (17036)Time elapsed: 0.072 s
% 0.10/0.37  % (17036)Instructions burned: 2 (million)
% 0.10/0.37  % (17036)------------------------------
% 0.10/0.37  % (17036)------------------------------
% 0.10/0.37  % (17037)Refutation not found, incomplete strategy% (17037)------------------------------
% 0.10/0.37  % (17037)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.37  % (17034)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.10/0.37  % (17050)Refutation found. Thanks to Tanya!
% 0.10/0.37  % SZS status Theorem for theBenchmark
% 0.10/0.37  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.38  % (17050)------------------------------
% 0.10/0.38  % (17050)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.10/0.38  % (17050)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.10/0.38  % (17050)Termination reason: Refutation
% 0.10/0.38  
% 0.10/0.38  % (17050)Memory used [KB]: 6012
% 0.10/0.38  % (17050)Time elapsed: 0.045 s
% 0.10/0.38  % (17050)Instructions burned: 7 (million)
% 0.10/0.38  % (17050)------------------------------
% 0.10/0.38  % (17050)------------------------------
% 0.10/0.38  % (17025)Success in time 0.111 s
%------------------------------------------------------------------------------