↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : ITP209_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 11:36:49 AM UTC 2026

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

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

tff(type_def_6,type,
    fun_a_a: $tType ).

tff(type_def_7,type,
    bool: $tType ).

tff(type_def_8,type,
    a: $tType ).

tff(func_def_0,type,
    aa_a_fun_a_a: ( fun_a_fun_a_a * a ) > fun_a_a ).

tff(func_def_1,type,
    aa_a_a: ( fun_a_a * a ) > a ).

tff(func_def_2,type,
    fFalse: bool ).

tff(func_def_3,type,
    fTrue: bool ).

tff(func_def_4,type,
    a2: a ).

tff(func_def_5,type,
    b: a ).

tff(func_def_6,type,
    c: a ).

tff(func_def_7,type,
    f: fun_a_fun_a_a ).

tff(func_def_8,type,
    sK0: fun_a_fun_a_a > a ).

tff(func_def_9,type,
    sK1: fun_a_fun_a_a > a ).

tff(func_def_10,type,
    sK2: fun_a_fun_a_a > a ).

tff(func_def_11,type,
    sK3: fun_a_fun_a_a > a ).

tff(func_def_12,type,
    sK4: fun_a_fun_a_a > a ).

tff(func_def_13,type,
    sK5: fun_a_fun_a_a > a ).

tff(func_def_14,type,
    sK6: fun_a_fun_a_a > a ).

tff(func_def_15,type,
    sK7: fun_a_fun_a_a > a ).

tff(func_def_16,type,
    sK8: fun_a_fun_a_a > a ).

tff(func_def_17,type,
    sK9: fun_a_fun_a_a > a ).

tff(pred_def_1,type,
    syntax_ac_operator_a: fun_a_fun_a_a > $o ).

tff(pred_def_2,type,
    pp: bool > $o ).

tff(f2,axiom,
    ! [X0: a,X1: a] : ( aa_a_a(aa_a_fun_a_a(f,X0),X1) = aa_a_a(aa_a_fun_a_a(f,X1),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1_commute) ).

tff(f4,axiom,
    ! [X0: a,X1: a,X2: a] : ( aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,X0),X1)),X2) = aa_a_a(aa_a_fun_a_a(f,X0),aa_a_a(aa_a_fun_a_a(f,X1),X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_right__assoc) ).

tff(f13,conjecture,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) = aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(f14,negated_conjecture,
    ( ( ~ aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) ) = aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b) ),
    inference(negated_conjecture,[status(cth)],[f13]) ).

tff(f17,plain,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    inference(flattening,[],[f14]) ).

tff(f25,plain,
    ! [X0: a,X1: a] : ( aa_a_a(aa_a_fun_a_a(f,X0),X1) = aa_a_a(aa_a_fun_a_a(f,X1),X0) ),
    inference(cnf_transformation,[],[f2]) ).

tff(f27,plain,
    ! [X2: a,X0: a,X1: a] : ( aa_a_a(aa_a_fun_a_a(f,X0),aa_a_a(aa_a_fun_a_a(f,X1),X2)) = aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,X0),X1)),X2) ),
    inference(cnf_transformation,[],[f4]) ).

tff(f38,plain,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),c)),b),
    inference(cnf_transformation,[],[f17]) ).

tff(f76,plain,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,c),b)),
    inference(superposition,[],[f38,f27]) ).

tff(f85,plain,
    aa_a_a(aa_a_fun_a_a(f,aa_a_a(aa_a_fun_a_a(f,a2),b)),c) != aa_a_a(aa_a_fun_a_a(f,a2),aa_a_a(aa_a_fun_a_a(f,b),c)),
    inference(forward_demodulation,[],[f76,f25]) ).

tff(f91,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f85,f27]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : ITP209_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.18/0.43  % Computer : n006.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Sun Sep 27 12:22:56 UTC 2026
% 0.18/0.43  % CPUTime  : 
% 0.18/0.43  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.22/0.48  Running first-order model finding
% 0.22/0.48  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.22/0.52  % (2900420)Will run a generic schedule for satisfiability detection.
% 0.22/0.52  % (2900426)% WARNING: option uhcvi not known.
% 0.22/0.52  % (2900426)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1213019310:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.22/0.52  % (2900425)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1891293455_2999 on theBenchmark for (2999ds/0Mi)
% 0.22/0.52  % (2900426) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2900420-2900426"...
% 0.22/0.52  % (2900426)...printing done.
% 0.22/0.52  % (2900426)Refutation found. Thanks to Tanya!
% 0.22/0.52  % SZS status Theorem for theBenchmark
% 0.22/0.52  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.52  % (2900426)------------------------------
% 0.22/0.52  % (2900426)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.52  % (2900426)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.52  % (2900426)CaDiCaL version: 2.1.3
% 0.22/0.52  % (2900426)Termination reason: Refutation
% 0.22/0.52  % (2900426)Time elapsed: 0.003 s
% 0.22/0.52  % (2900426)Peak memory usage: 12 MB
% 0.22/0.52  % (2900426)Instructions burned: 4 (million)
% 0.22/0.52  % (2900420)Success in time 0.027 s
% 0.22/0.52  % Vampire exiting
%------------------------------------------------------------------------------