↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n015.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:30:05 AM UTC 2026

% Result   : Theorem 3.42s 1.44s
% Output   : Refutation 3.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   14 (  14 unt;   0 typ;   1 def)
%            Number of atoms       :   14 (   8 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    :    6 (   2 avg)
%            Number of FOOLs       :    1 (   1 fml;   0 var)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-4 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :   10 (  10   !;   0   ?;  10   :)

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

tff(type_def_6,type,
    fun: ( $tType * $tType ) > $tType ).

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

tff(func_def_0,type,
    aa: 
      !>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).

tff(func_def_1,type,
    fFalse: bool ).

tff(func_def_2,type,
    fTrue: bool ).

tff(func_def_3,type,
    a2: a ).

tff(func_def_4,type,
    b: a ).

tff(func_def_5,type,
    c: a ).

tff(func_def_6,type,
    f: fun(a,fun(a,a)) ).

tff(pred_def_1,type,
    syntax_ac_operator: 
      !>[X0: $tType] : ( fun(X0,fun(X0,X0)) > $o ) ).

tff(pred_def_2,type,
    syntax7388354845996824322omatch: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > $o ) ).

tff(pred_def_3,type,
    syntax2379306206330768139omatch: 
      !>[X0: $tType,X1: $tType] : ( ( X0 * X1 ) > $o ) ).

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

tff(pred_def_5,type,
    sP0: a > $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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',fact_3_right__assoc) ).

tff(f15,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/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(f16,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)],[f15]) ).

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,[],[f16]) ).

tff(f19,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(f20,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(f22,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(f23,definition,
    ~ sP0(aa(a,a,aa(a,fun(a,a),f,aa(a,a,aa(a,fun(a,a),f,a2),b)),c)),
    introduced(definition,[new_symbols(definition,[sP0])],[inequality_splitting_name_introduction]) ).

tff(f24,plain,
    sP0(aa(a,a,aa(a,fun(a,a),f,aa(a,a,aa(a,fun(a,a),f,a2),c)),b)),
    inference(inequality_splitting,[],[f19,f23]) ).

tff(f25,plain,
    ~ sP0(aa(a,a,aa(a,fun(a,a),f,a2),aa(a,a,aa(a,fun(a,a),f,b),c))),
    inference(forward_demodulation,[],[f23,f20]) ).

tff(f26,plain,
    sP0(aa(a,a,aa(a,fun(a,a),f,a2),aa(a,a,aa(a,fun(a,a),f,c),b))),
    inference(forward_demodulation,[],[f24,f20]) ).

tff(f27,plain,
    sP0(aa(a,a,aa(a,fun(a,a),f,a2),aa(a,a,aa(a,fun(a,a),f,b),c))),
    inference(forward_demodulation,[],[f26,f22]) ).

tff(f28,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f27,f25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP209_2 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n015.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 12:26:32 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.42/1.44  % (1592670)Detected formulas, will run a generic FOF schedule.
% 3.42/1.44  % (1592682)dis-21_1_sil=8000:lcm=predicate:random_seed=2823643614:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.42/1.44  % (1592682)Refutation not found, incomplete strategy
% 3.42/1.44  % (1592682)------------------------------
% 3.42/1.44  % (1592682)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.44  % (1592682)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.44  % (1592682)CaDiCaL version: 2.1.3
% 3.42/1.44  % (1592682)Termination reason: Refutation not found, incomplete strategy
% 3.42/1.44  % (1592682)Time elapsed: 0.002 s
% 3.42/1.44  % (1592682)Peak memory usage: 88 MB
% 3.42/1.44  % (1592682)Instructions burned: 3 (million)
% 3.42/1.44  % (1592676)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=667995524:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.42/1.44  % (1592679)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1376832307:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.42/1.44  % (1592679)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.42/1.44  % (1592679)First to succeed.
% 3.42/1.44  % (1592679)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1592670"
% 3.42/1.44  % (1592678)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3805933314:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.42/1.44  % (1592677)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=294957165:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.42/1.44  % (1592678)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.42/1.44  % (1592680)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1641752448:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.42/1.44  % (1592681)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=306077815:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.42/1.44  % (1592680)Also succeeded, but the first one will report.
% 3.42/1.44  % (1592681)Also succeeded, but the first one will report.
% 3.42/1.44  % (1592682)------------------------------
% 3.42/1.44  % (1592682)------------------------------
% 3.42/1.44  % (1592690)lrs+10_1_sil=8000:sp=occurrence:random_seed=3866992644:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.42/1.44  % (1592690)Also succeeded, but the first one will report.
% 3.42/1.44  % (1592679)Refutation found. Thanks to Tanya!
% 3.42/1.44  % SZS status Theorem for theBenchmark
% 3.42/1.44  % SZS output start Proof for theBenchmark
% See solution above
% 3.42/1.44  % (1592679)------------------------------
% 3.42/1.44  % (1592679)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.42/1.44  % (1592679)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.42/1.44  % (1592679)CaDiCaL version: 2.1.3
% 3.42/1.44  % (1592679)Termination reason: Refutation
% 3.42/1.44  % (1592679)Time elapsed: 0.002 s
% 3.42/1.44  % (1592679)Peak memory usage: 88 MB
% 3.42/1.44  % (1592679)Instructions burned: 1 (million)
% 3.42/1.44  % (1592679)------------------------------
% 3.42/1.44  % (1592679)------------------------------
% 3.42/1.44  % (1592670)Success in time 0.404 s
% 3.42/1.44  % Vampire exiting
%------------------------------------------------------------------------------