TSTP Solution File: GRP001-1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GRP001-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n014.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 : Mon May 20 21:05:04 EDT 2024

% Result   : Unsatisfiable 0.60s 0.79s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   20 (  12 unt;   0 def)
%            Number of atoms       :   38 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   41 (  23   ~;  16   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   5 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   45 (  45   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f95,plain,
    $false,
    inference(subsumption_resolution,[],[f93,f60]) ).

fof(f60,plain,
    sP1(b,identity,a,c),
    inference(unit_resulting_resolution,[],[f1,f46,f14]) ).

fof(f14,plain,
    ! [X2,X3,X1,X4,X5] :
      ( sP1(X3,X4,X5,X1)
      | ~ product(X1,X2,X5)
      | ~ product(X4,X2,X3) ),
    inference(cnf_transformation,[],[f14_D]) ).

fof(f14_D,plain,
    ! [X1,X5,X4,X3] :
      ( ! [X2] :
          ( ~ product(X1,X2,X5)
          | ~ product(X4,X2,X3) )
    <=> ~ sP1(X3,X4,X5,X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP1])]) ).

fof(f46,plain,
    product(c,b,a),
    inference(unit_resulting_resolution,[],[f9,f18,f12]) ).

fof(f12,plain,
    ! [X2,X3,X1,X4,X5] :
      ( sP0(X5,X4,X3,X1)
      | ~ product(X1,X2,X5)
      | product(X4,X2,X3) ),
    inference(cnf_transformation,[],[f12_D]) ).

fof(f12_D,plain,
    ! [X1,X3,X4,X5] :
      ( ! [X2] :
          ( ~ product(X1,X2,X5)
          | product(X4,X2,X3) )
    <=> ~ sP0(X5,X4,X3,X1) ),
    introduced(general_splitting_component_introduction,[new_symbols(naming,[sP0])]) ).

fof(f18,plain,
    ~ sP0(identity,c,a,b),
    inference(unit_resulting_resolution,[],[f2,f10,f13]) ).

fof(f13,plain,
    ! [X3,X0,X1,X4,X5] :
      ( ~ sP0(X5,X4,X3,X1)
      | ~ product(X0,X1,X4)
      | ~ product(X0,X5,X3) ),
    inference(general_splitting,[],[f8,f12_D]) ).

fof(f8,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( product(X4,X2,X3)
      | ~ product(X0,X5,X3)
      | ~ product(X1,X2,X5)
      | ~ product(X0,X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity2) ).

fof(f10,axiom,
    product(a,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_b_is_c) ).

fof(f2,axiom,
    ! [X0] : product(X0,identity,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).

fof(f9,axiom,
    ! [X0] : product(X0,X0,identity),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',square_element) ).

fof(f1,axiom,
    ! [X0] : product(identity,X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',left_identity) ).

fof(f93,plain,
    ~ sP1(b,identity,a,c),
    inference(unit_resulting_resolution,[],[f9,f88,f15]) ).

fof(f15,plain,
    ! [X3,X0,X1,X4,X5] :
      ( ~ sP1(X3,X4,X5,X1)
      | ~ product(X0,X1,X4)
      | product(X0,X5,X3) ),
    inference(general_splitting,[],[f7,f14_D]) ).

fof(f7,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( product(X0,X5,X3)
      | ~ product(X4,X2,X3)
      | ~ product(X1,X2,X5)
      | ~ product(X0,X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity1) ).

fof(f88,plain,
    ~ product(c,a,b),
    inference(unit_resulting_resolution,[],[f2,f26,f13]) ).

fof(f26,plain,
    sP0(identity,b,c,a),
    inference(unit_resulting_resolution,[],[f11,f9,f12]) ).

fof(f11,axiom,
    ~ product(b,a,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_b_times_a_is_c) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem    : GRP001-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34  % Computer : n014.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 05:40:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.13/0.34  This is a CNF_UNS_RFO_SEQ_HRN problem
% 0.13/0.34  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.78  % (15580)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2995ds/45Mi)
% 0.60/0.78  % (15575)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78  % (15576)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2995ds/51Mi)
% 0.60/0.78  % (15579)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2995ds/34Mi)
% 0.60/0.78  % (15581)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2995ds/83Mi)
% 0.60/0.78  % (15582)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2995ds/56Mi)
% 0.60/0.79  % (15577)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2995ds/78Mi)
% 0.60/0.79  % (15581)First to succeed.
% 0.60/0.79  % (15581)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-15574"
% 0.60/0.79  % (15578)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2995ds/33Mi)
% 0.60/0.79  % (15578)Also succeeded, but the first one will report.
% 0.60/0.79  % (15581)Refutation found. Thanks to Tanya!
% 0.60/0.79  % SZS status Unsatisfiable for theBenchmark
% 0.60/0.79  % SZS output start Proof for theBenchmark
% See solution above
% 0.60/0.79  % (15581)------------------------------
% 0.60/0.79  % (15581)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.60/0.79  % (15581)Termination reason: Refutation
% 0.60/0.79  
% 0.60/0.79  % (15581)Memory used [KB]: 994
% 0.60/0.79  % (15581)Time elapsed: 0.004 s
% 0.60/0.79  % (15581)Instructions burned: 5 (million)
% 0.60/0.79  % (15574)Success in time 0.45 s
% 0.60/0.80  % Vampire---4.8 exiting
%------------------------------------------------------------------------------