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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : GRP028-1 : TPTP v8.1.2. 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 : n021.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 May  1 02:25:59 EDT 2024

% Result   : Unsatisfiable 0.58s 0.75s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of formulae    :    9 (   5 unt;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   19 (  10   ~;   8   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-4 aty)
%            Number of functors    :    3 (   3 usr;   0 con; 1-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f20,plain,
    $false,
    inference(unit_resulting_resolution,[],[f3,f2,f7,f6]) ).

fof(f6,plain,
    ! [X3,X0,X1,X4,X5] :
      ( ~ sP0(X3,X0,X5,X1)
      | ~ product(X1,X3,X4)
      | ~ product(X0,X4,X5) ),
    inference(general_splitting,[],[f1,f5_D]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1,X5] :
      ( ~ product(X0,X1,X2)
      | product(X2,X3,X5)
      | sP0(X3,X0,X5,X1) ),
    inference(cnf_transformation,[],[f5_D]) ).

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

fof(f1,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( product(X2,X3,X5)
      | ~ product(X0,X4,X5)
      | ~ product(X1,X3,X4)
      | ~ product(X0,X1,X2) ),
    file('/export/starexec/sandbox/tmp/tmp.tG8bWPejdu/Vampire---4.8_17199',associativity) ).

fof(f7,plain,
    ! [X0,X1] : sP0(X0,left_solution(X1,not_identity(X0)),not_identity(X0),X1),
    inference(unit_resulting_resolution,[],[f4,f2,f5]) ).

fof(f4,axiom,
    ! [X0] : ~ product(not_identity(X0),X0,not_identity(X0)),
    file('/export/starexec/sandbox/tmp/tmp.tG8bWPejdu/Vampire---4.8_17199',prove_there_is_a_right_identity) ).

fof(f2,axiom,
    ! [X0,X1] : product(left_solution(X0,X1),X0,X1),
    file('/export/starexec/sandbox/tmp/tmp.tG8bWPejdu/Vampire---4.8_17199',left_soln) ).

fof(f3,axiom,
    ! [X0,X1] : product(X0,right_solution(X0,X1),X1),
    file('/export/starexec/sandbox/tmp/tmp.tG8bWPejdu/Vampire---4.8_17199',right_soln) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem    : GRP028-1 : TPTP v8.1.2. Released v1.0.0.
% 0.08/0.15  % 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.16/0.36  % Computer : n021.cluster.edu
% 0.16/0.36  % Model    : x86_64 x86_64
% 0.16/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36  % Memory   : 8042.1875MB
% 0.16/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 300
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Tue Apr 30 18:32:11 EDT 2024
% 0.16/0.37  % CPUTime    : 
% 0.16/0.37  This is a CNF_UNS_RFO_NEQ_HRN problem
% 0.16/0.37  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/tmp/tmp.tG8bWPejdu/Vampire---4.8_17199
% 0.58/0.75  % (17465)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 Vampire---4 for (2996ds/83Mi)
% 0.58/0.75  % (17459)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75  % (17461)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2996ds/78Mi)
% 0.58/0.75  % (17462)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2996ds/33Mi)
% 0.58/0.75  % (17463)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 Vampire---4 for (2996ds/34Mi)
% 0.58/0.75  % (17460)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 Vampire---4 for (2996ds/51Mi)
% 0.58/0.75  % (17464)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2996ds/45Mi)
% 0.58/0.75  % (17465)First to succeed.
% 0.58/0.75  % (17462)Also succeeded, but the first one will report.
% 0.58/0.75  vampire: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.
% 0.58/0.75  vampire: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.
% 0.58/0.75  % (17465)Refutation found. Thanks to Tanya!
% 0.58/0.75  % SZS status Unsatisfiable for Vampire---4
% 0.58/0.75  % SZS output start Proof for Vampire---4
% See solution above
% 0.58/0.75  % (17465)------------------------------
% 0.58/0.75  % (17465)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.58/0.75  % (17465)Termination reason: Refutation
% 0.58/0.75  
% 0.58/0.75  % (17465)Memory used [KB]: 974
% 0.58/0.75  % (17465)Time elapsed: 0.002 s
% 0.58/0.75  % (17465)Instructions burned: 3 (million)
% 0.58/0.75  % (17465)------------------------------
% 0.58/0.75  % (17465)------------------------------
% 0.58/0.75  % (17455)Success in time 0.372 s
% 0.58/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------