TSTP Solution File: COL063-3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : COL063-3 : TPTP v8.1.2. Bugfixed v1.2.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/sandbox2/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 : Sun May  5 04:44:56 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(f11,plain,
    $false,
    inference(subsumption_resolution,[],[f10,f2]) ).

fof(f2,axiom,
    ! [X0,X1] : apply(apply(t,X0),X1) = apply(X1,X0),
    file('/export/starexec/sandbox2/tmp/tmp.Ch7FXPYArz/Vampire---4.8_1751',t_definition) ).

fof(f10,plain,
    apply(apply(z,y),x) != apply(apply(t,x),apply(z,y)),
    inference(forward_demodulation,[],[f9,f2]) ).

fof(f9,plain,
    apply(apply(z,y),x) != apply(apply(t,x),apply(apply(t,y),z)),
    inference(superposition,[],[f8,f1]) ).

fof(f1,axiom,
    ! [X2,X0,X1] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
    file('/export/starexec/sandbox2/tmp/tmp.Ch7FXPYArz/Vampire---4.8_1751',b_definition) ).

fof(f8,plain,
    apply(apply(z,y),x) != apply(apply(apply(b,apply(t,x)),apply(t,y)),z),
    inference(forward_demodulation,[],[f7,f1]) ).

fof(f7,plain,
    apply(apply(z,y),x) != apply(apply(apply(apply(apply(b,b),t),x),apply(t,y)),z),
    inference(forward_demodulation,[],[f6,f1]) ).

fof(f6,plain,
    apply(apply(z,y),x) != apply(apply(apply(apply(b,apply(apply(apply(b,b),t),x)),t),y),z),
    inference(forward_demodulation,[],[f5,f2]) ).

fof(f5,plain,
    apply(apply(z,y),x) != apply(apply(apply(apply(t,t),apply(b,apply(apply(apply(b,b),t),x))),y),z),
    inference(forward_demodulation,[],[f4,f1]) ).

fof(f4,plain,
    apply(apply(z,y),x) != apply(apply(apply(apply(apply(b,apply(t,t)),b),apply(apply(apply(b,b),t),x)),y),z),
    inference(forward_demodulation,[],[f3,f1]) ).

fof(f3,axiom,
    apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,t)),b)),apply(apply(b,b),t)),x),y),z) != apply(apply(z,y),x),
    file('/export/starexec/sandbox2/tmp/tmp.Ch7FXPYArz/Vampire---4.8_1751',prove_f_combinator) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10  % Problem    : COL063-3 : TPTP v8.1.2. Bugfixed v1.2.0.
% 0.09/0.11  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.31  % Computer : n014.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Fri May  3 18:36:53 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.11/0.31  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.11/0.31  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.Ch7FXPYArz/Vampire---4.8_1751
% 0.46/0.63  % (1959)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.46/0.63  % (1960)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on Vampire---4 for (2996ds/56Mi)
% 0.46/0.63  % (1959)First to succeed.
% 0.46/0.63  % (1953)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.46/0.63  % (1959)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1952"
% 0.46/0.63  % (1955)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.46/0.63  % (1956)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.46/0.63  % (1954)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.46/0.63  % (1957)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.46/0.63  % (1958)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.46/0.63  % (1960)Refutation not found, incomplete strategy% (1960)------------------------------
% 0.46/0.63  % (1960)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.63  % (1960)Termination reason: Refutation not found, incomplete strategy
% 0.46/0.63  
% 0.46/0.63  % (1960)Memory used [KB]: 949
% 0.46/0.63  % (1960)Time elapsed: 0.003 s
% 0.46/0.63  % (1960)Instructions burned: 2 (million)
% 0.46/0.63  % (1959)Refutation found. Thanks to Tanya!
% 0.46/0.63  % SZS status Unsatisfiable for Vampire---4
% 0.46/0.63  % SZS output start Proof for Vampire---4
% See solution above
% 0.46/0.63  % (1959)------------------------------
% 0.46/0.63  % (1959)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.46/0.63  % (1959)Termination reason: Refutation
% 0.46/0.63  
% 0.46/0.63  % (1959)Memory used [KB]: 961
% 0.46/0.63  % (1959)Time elapsed: 0.002 s
% 0.46/0.63  % (1959)Instructions burned: 3 (million)
% 0.46/0.63  % (1952)Success in time 0.316 s
% 0.46/0.63  % Vampire---4.8 exiting
%------------------------------------------------------------------------------