TSTP Solution File: ARI691_1 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : ARI691_1 : TPTP v8.1.2. Released v6.3.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 : 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 : Wed May  1 02:10:01 EDT 2024

% Result   : Theorem 0.62s 0.79s
% Output   : Refutation 0.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   13 (  10 unt;   3 typ;   0 def)
%            Number of atoms       :   10 (   9 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number arithmetic     :   20 (   0 atm;  18 fun;   0 num;   2 var)
%            Number of types       :    1 (   0 usr;   1 ari)
%            Number of type conns  :    1 (   1   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :    2 (   2   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
tff(func_def_0,type,
    a: $int ).

tff(func_def_1,type,
    b: $int ).

tff(func_def_2,type,
    f: $int > $int ).

tff(f27,plain,
    $false,
    inference(subsumption_resolution,[],[f26,f24]) ).

tff(f24,plain,
    $product(a,b) = f($product(a,b)),
    inference(cnf_transformation,[],[f1]) ).

tff(f1,axiom,
    $product(a,b) = f($product(a,b)),
    file('/export/starexec/sandbox2/tmp/tmp.Qgn611IarW/Vampire---4.8_5819',eq) ).

tff(f26,plain,
    $product(a,b) != f($product(a,b)),
    inference(forward_demodulation,[],[f25,f24]) ).

tff(f25,plain,
    $product(a,b) != f(f($product(a,b))),
    inference(forward_demodulation,[],[f23,f15]) ).

tff(f15,plain,
    ! [X0: $int,X1: $int] : ( $product(X0,X1) = $product(X1,X0) ),
    introduced(theory_axiom_135,[]) ).

tff(f23,plain,
    f(f($product(a,b))) != $product(b,a),
    inference(cnf_transformation,[],[f22]) ).

tff(f22,plain,
    f(f($product(a,b))) != $product(b,a),
    inference(flattening,[],[f3]) ).

tff(f3,negated_conjecture,
    ( ~ f(f($product(a,b))) = $product(b,a) ),
    inference(negated_conjecture,[],[f2]) ).

tff(f2,conjecture,
    f(f($product(a,b))) = $product(b,a),
    file('/export/starexec/sandbox2/tmp/tmp.Qgn611IarW/Vampire---4.8_5819',conj) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.09  % Problem    : ARI691_1 : TPTP v8.1.2. Released v6.3.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 : n027.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   : Tue Apr 30 19:20:17 EDT 2024
% 0.11/0.31  % CPUTime    : 
% 0.11/0.31  This is a TF0_THM_EQU_ARI 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.Qgn611IarW/Vampire---4.8_5819
% 0.62/0.78  % (5931)lrs+1011_1:1_sil=8000:sp=occurrence:nwc=10.0:i=78:ss=axioms:sgt=8_0 on Vampire---4 for (2995ds/78Mi)
% 0.62/0.78  % (5932)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on Vampire---4 for (2995ds/33Mi)
% 0.62/0.78  % (5929)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 (2995ds/34Mi)
% 0.62/0.78  % (5934)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on Vampire---4 for (2995ds/45Mi)
% 0.62/0.78  % (5930)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 (2995ds/51Mi)
% 0.62/0.78  % (5933)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 (2995ds/34Mi)
% 0.62/0.78  % (5935)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 (2995ds/83Mi)
% 0.62/0.78  % (5936)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 (2995ds/56Mi)
% 0.62/0.78  % (5934)First to succeed.
% 0.62/0.78  % (5936)Refutation not found, incomplete strategy% (5936)------------------------------
% 0.62/0.78  % (5936)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.78  % (5936)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.78  
% 0.62/0.78  % (5936)Memory used [KB]: 952
% 0.62/0.78  % (5936)Time elapsed: 0.002 s
% 0.62/0.78  % (5936)Instructions burned: 2 (million)
% 0.62/0.78  % (5936)------------------------------
% 0.62/0.78  % (5936)------------------------------
% 0.62/0.79  % (5929)Refutation not found, incomplete strategy% (5929)------------------------------
% 0.62/0.79  % (5929)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (5929)Termination reason: Refutation not found, incomplete strategy
% 0.62/0.79  
% 0.62/0.79  % (5929)Memory used [KB]: 973
% 0.62/0.79  % (5929)Time elapsed: 0.004 s
% 0.62/0.79  % (5929)Instructions burned: 4 (million)
% 0.62/0.79  % (5929)------------------------------
% 0.62/0.79  % (5929)------------------------------
% 0.62/0.79  % (5935)Also succeeded, but the first one will report.
% 0.62/0.79  % (5934)Refutation found. Thanks to Tanya!
% 0.62/0.79  % SZS status Theorem for Vampire---4
% 0.62/0.79  % SZS output start Proof for Vampire---4
% See solution above
% 0.62/0.79  % (5934)------------------------------
% 0.62/0.79  % (5934)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.62/0.79  % (5934)Termination reason: Refutation
% 0.62/0.79  
% 0.62/0.79  % (5934)Memory used [KB]: 958
% 0.62/0.79  % (5934)Time elapsed: 0.003 s
% 0.62/0.79  % (5934)Instructions burned: 2 (million)
% 0.62/0.79  % (5934)------------------------------
% 0.62/0.79  % (5934)------------------------------
% 0.62/0.79  % (5928)Success in time 0.473 s
% 0.62/0.79  % Vampire---4.8 exiting
%------------------------------------------------------------------------------