TSTP Solution File: NUM761_8 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : NUM761_8 : TPTP v8.2.0. Released v8.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 : n027.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 : Tue May 21 01:45:43 EDT 2024

% Result   : Theorem 0.54s 0.75s
% Output   : Refutation 0.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   33 (  10 unt;   8 typ;   0 def)
%            Number of atoms       :   50 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   47 (  22   ~;  16   |;   0   &)
%                                         (   0 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   3   >;   3   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   40 (  40   !;   0   ?;  40   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    frac: $tType ).

tff(func_def_0,type,
    x: frac ).

tff(func_def_1,type,
    y: frac ).

tff(func_def_2,type,
    z: frac ).

tff(func_def_3,type,
    u: frac ).

tff(func_def_4,type,
    pf: ( frac * frac ) > frac ).

tff(pred_def_1,type,
    moref: ( frac * frac ) > $o ).

tff(pred_def_2,type,
    eq: ( frac * frac ) > $o ).

tff(f30,plain,
    $false,
    inference(subsumption_resolution,[],[f29,f28]) ).

tff(f28,plain,
    ~ moref(x,y),
    inference(subsumption_resolution,[],[f26,f22]) ).

tff(f22,plain,
    moref(z,u),
    inference(cnf_transformation,[],[f2]) ).

tff(f2,axiom,
    moref(z,u),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n) ).

tff(f26,plain,
    ( ~ moref(z,u)
    | ~ moref(x,y) ),
    inference(resolution,[],[f20,f23]) ).

tff(f23,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ moref(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f17,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ moref(X0,X1) ),
    inference(flattening,[],[f16]) ).

tff(f16,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ moref(X0,X1) ),
    inference(ennf_transformation,[],[f13]) ).

tff(f13,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(X0,X1)
     => ( moref(X2,X3)
       => moref(pf(X0,X2),pf(X1,X3)) ) ),
    inference(rectify,[],[f5]) ).

tff(f5,axiom,
    ! [X1: frac,X2: frac,X3: frac,X4: frac] :
      ( moref(X1,X2)
     => ( moref(X3,X4)
       => moref(pf(X1,X3),pf(X2,X4)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz64) ).

tff(f20,plain,
    ~ moref(pf(x,z),pf(y,u)),
    inference(cnf_transformation,[],[f12]) ).

tff(f12,plain,
    ~ moref(pf(x,z),pf(y,u)),
    inference(flattening,[],[f7]) ).

tff(f7,negated_conjecture,
    ~ moref(pf(x,z),pf(y,u)),
    inference(negated_conjecture,[],[f6]) ).

tff(f6,conjecture,
    moref(pf(x,z),pf(y,u)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz65a) ).

tff(f29,plain,
    moref(x,y),
    inference(resolution,[],[f27,f21]) ).

tff(f21,plain,
    ( eq(x,y)
    | moref(x,y) ),
    inference(cnf_transformation,[],[f15]) ).

tff(f15,plain,
    ( eq(x,y)
    | moref(x,y) ),
    inference(ennf_transformation,[],[f1]) ).

tff(f1,axiom,
    ( ~ moref(x,y)
   => eq(x,y) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).

tff(f27,plain,
    ~ eq(x,y),
    inference(subsumption_resolution,[],[f25,f22]) ).

tff(f25,plain,
    ( ~ moref(z,u)
    | ~ eq(x,y) ),
    inference(resolution,[],[f20,f24]) ).

tff(f24,plain,
    ! [X2: frac,X3: frac,X0: frac,X1: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ eq(X0,X1) ),
    inference(cnf_transformation,[],[f19]) ).

tff(f19,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ eq(X0,X1) ),
    inference(flattening,[],[f18]) ).

tff(f18,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( moref(pf(X0,X2),pf(X1,X3))
      | ~ moref(X2,X3)
      | ~ eq(X0,X1) ),
    inference(ennf_transformation,[],[f14]) ).

tff(f14,plain,
    ! [X0: frac,X1: frac,X2: frac,X3: frac] :
      ( eq(X0,X1)
     => ( moref(X2,X3)
       => moref(pf(X0,X2),pf(X1,X3)) ) ),
    inference(rectify,[],[f4]) ).

tff(f4,axiom,
    ! [X1: frac,X2: frac,X3: frac,X4: frac] :
      ( eq(X1,X2)
     => ( moref(X3,X4)
       => moref(pf(X1,X3),pf(X2,X4)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz62g) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : NUM761_8 : TPTP v8.2.0. Released v8.0.0.
% 0.12/0.14  % 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.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 06:20:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.35  This is a TX0_THM_NEQ_NAR problem
% 0.14/0.35  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.54/0.75  % (1527)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 (2996ds/56Mi)
% 0.54/0.75  % (1527)Refutation not found, incomplete strategy% (1527)------------------------------
% 0.54/0.75  % (1527)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (1527)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (1527)Memory used [KB]: 963
% 0.54/0.75  % (1527)Time elapsed: 0.002 s
% 0.54/0.75  % (1527)Instructions burned: 2 (million)
% 0.54/0.75  % (1527)------------------------------
% 0.54/0.75  % (1527)------------------------------
% 0.54/0.75  % (1520)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 (2996ds/34Mi)
% 0.54/0.75  % (1522)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on theBenchmark for (2996ds/78Mi)
% 0.54/0.75  % (1523)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.54/0.75  % (1521)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 (2996ds/51Mi)
% 0.54/0.75  % (1525)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.54/0.75  % (1526)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 (2996ds/83Mi)
% 0.54/0.75  % (1524)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 (2996ds/34Mi)
% 0.54/0.75  % (1525)First to succeed.
% 0.54/0.75  % (1520)Also succeeded, but the first one will report.
% 0.54/0.75  % (1522)Also succeeded, but the first one will report.
% 0.54/0.75  % (1526)Also succeeded, but the first one will report.
% 0.54/0.75  % (1524)Refutation not found, incomplete strategy% (1524)------------------------------
% 0.54/0.75  % (1524)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (1524)Termination reason: Refutation not found, incomplete strategy
% 0.54/0.75  
% 0.54/0.75  % (1524)Memory used [KB]: 966
% 0.54/0.75  % (1524)Time elapsed: 0.003 s
% 0.54/0.75  % (1524)Instructions burned: 2 (million)
% 0.54/0.75  % (1525)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-1519"
% 0.54/0.75  % (1524)------------------------------
% 0.54/0.75  % (1524)------------------------------
% 0.54/0.75  % (1521)Also succeeded, but the first one will report.
% 0.54/0.75  % (1528)lrs+21_1:16_sil=2000:sp=occurrence:urr=on:flr=on:i=55:sd=1:nm=0:ins=3:ss=included:rawr=on:br=off_0 on theBenchmark for (2996ds/55Mi)
% 0.54/0.75  % (1525)Refutation found. Thanks to Tanya!
% 0.54/0.75  % SZS status Theorem for theBenchmark
% 0.54/0.75  % SZS output start Proof for theBenchmark
% See solution above
% 0.54/0.75  % (1525)------------------------------
% 0.54/0.75  % (1525)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.54/0.75  % (1525)Termination reason: Refutation
% 0.54/0.75  
% 0.54/0.75  % (1525)Memory used [KB]: 971
% 0.54/0.75  % (1525)Time elapsed: 0.003 s
% 0.54/0.75  % (1525)Instructions burned: 3 (million)
% 0.54/0.75  % (1519)Success in time 0.391 s
% 0.54/0.75  % Vampire---4.8 exiting
%------------------------------------------------------------------------------