↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n017.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 01:30:30 PM UTC 2026

% Result   : Theorem 3.86s 1.36s
% Output   : Refutation 3.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   35 (  17   ~;  11   |;   5   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-4 aty)
%            Number of variables   :   31 (  31   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f108,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X3),X4))
     => hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),hAPP(X1,X0,X2,X3)),hAPP(fun(X1,bool),fun(X0,bool),hAPP(fun(X1,X0),fun(fun(X1,bool),fun(X0,bool)),image(X1,X0),X2),X4))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_78_imageI) ).

fof(f114,axiom,
    ! [X0,X1,X2,X3] :
      ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3))
    <=> ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
        & hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_84_insert__subset) ).

fof(f156,axiom,
    hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

fof(f159,axiom,
    hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_4) ).

fof(f161,conjecture,
    hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_6) ).

fof(f162,negated_conjecture,
    ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    inference(negated_conjecture,[status(cth)],[f161]) ).

fof(f163,plain,
    ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    inference(flattening,[],[f162]) ).

fof(f207,plain,
    ! [X0,X1,X2,X3,X4] :
      ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),hAPP(X1,X0,X2,X3)),hAPP(fun(X1,bool),fun(X0,bool),hAPP(fun(X1,X0),fun(fun(X1,bool),fun(X0,bool)),image(X1,X0),X2),X4)))
      | ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X3),X4)) ),
    inference(ennf_transformation,[],[f108]) ).

fof(f272,plain,
    ! [X0,X1,X2,X3] :
      ( ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3))
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) )
      & ( ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
          & hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) )
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3)) ) ),
    inference(nnf_transformation,[],[f114]) ).

fof(f273,plain,
    ! [X0,X1,X2,X3] :
      ( ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3))
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) )
      & ( ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
          & hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) )
        | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3)) ) ),
    inference(flattening,[],[f272]) ).

fof(f289,plain,
    hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    inference(cnf_transformation,[],[f156]) ).

fof(f292,plain,
    hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
    inference(cnf_transformation,[],[f159]) ).

fof(f294,plain,
    ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),hAPP(fun(x_a,bool),fun(x_a,bool),hAPP(x_a,fun(fun(x_a,bool),fun(x_a,bool)),insert(x_a),hAPP(pname,x_a,mgt_call,pn)),g)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    inference(cnf_transformation,[],[f163]) ).

fof(f367,plain,
    ! [X2,X3,X0,X1,X4] :
      ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),hAPP(X1,X0,X2,X3)),hAPP(fun(X1,bool),fun(X0,bool),hAPP(fun(X1,X0),fun(fun(X1,bool),fun(X0,bool)),image(X1,X0),X2),X4)))
      | ~ hBOOL(hAPP(fun(X1,bool),bool,hAPP(X1,fun(fun(X1,bool),bool),member(X1),X3),X4)) ),
    inference(cnf_transformation,[],[f207]) ).

fof(f401,plain,
    ! [X2,X3,X0,X1] :
      ( hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),hAPP(fun(X0,bool),fun(X0,bool),hAPP(X0,fun(fun(X0,bool),fun(X0,bool)),insert(X0),X1),X2)),X3))
      | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(X0,fun(fun(X0,bool),bool),member(X0),X1),X3))
      | ~ hBOOL(hAPP(fun(X0,bool),bool,hAPP(fun(X0,bool),fun(fun(X0,bool),bool),ord_less_eq(fun(X0,bool)),X2),X3)) ),
    inference(cnf_transformation,[],[f273]) ).

fof(f448,plain,
    ( ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u)))
    | ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(fun(x_a,bool),fun(fun(x_a,bool),bool),ord_less_eq(fun(x_a,bool)),g),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))) ),
    inference(resolution,[],[f294,f401]) ).

fof(f450,plain,
    ~ hBOOL(hAPP(fun(x_a,bool),bool,hAPP(x_a,fun(fun(x_a,bool),bool),member(x_a),hAPP(pname,x_a,mgt_call,pn)),hAPP(fun(pname,bool),fun(x_a,bool),hAPP(fun(pname,x_a),fun(fun(pname,bool),fun(x_a,bool)),image(pname,x_a),mgt_call),u))),
    inference(forward_subsumption_resolution,[],[f448,f289]) ).

fof(f458,plain,
    ~ hBOOL(hAPP(fun(pname,bool),bool,hAPP(pname,fun(fun(pname,bool),bool),member(pname),pn),u)),
    inference(resolution,[],[f450,f367]) ).

fof(f460,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f458,f292]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW473+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.23  % Computer : n017.cluster.edu
% 0.12/0.23  % Model    : x86_64 x86_64
% 0.12/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.23  % Memory   : 8046.5625MB
% 0.12/0.23  % OS       : Linux 6.8.0-71-generic
% 0.12/0.23  % CPULimit : 300
% 0.12/0.23  % WCLimit  : 300
% 0.12/0.23  % DateTime : Mon Sep 28 14:01:51 UTC 2026
% 0.12/0.23  % CPUTime  : 
% 0.12/0.23  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.27  Running first-order theorem proving
% 0.12/0.27  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.86/1.36  % (3568280)Detected formulas, will run a generic FOF schedule.
% 3.86/1.36  % (3568291)dis-21_1_sil=8000:lcm=predicate:random_seed=1443751042: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.86/1.36  % (3568291)Instruction limit reached! 
% 3.86/1.36  % (3568291)------------------------------
% 3.86/1.36  % (3568291)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.36  % (3568291)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.36  % (3568291)CaDiCaL version: 2.1.3
% 3.86/1.36  % (3568291)Termination reason: Instruction limit
% 3.86/1.36  % (3568291)Termination phase: Saturation
% 3.86/1.36  % (3568291)Time elapsed: 0.038 s
% 3.86/1.36  % (3568291)Peak memory usage: 89 MB
% 3.86/1.36  % (3568291)Instructions burned: 132 (million)
% 3.86/1.36  % (3568288)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2274604228:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.86/1.36  % (3568286)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=441903913:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.86/1.36  % (3568285)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=2093022410:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.86/1.36  % (3568287)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=2808335131:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.86/1.36  % (3568289)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=766301581:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.86/1.36  % (3568288)First to succeed.
% 3.86/1.36  % (3568288)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3568280"
% 3.86/1.36  % (3568290)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3929157327:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.86/1.36  % (3568289)Instruction limit reached! 
% 3.86/1.36  % (3568289)------------------------------
% 3.86/1.36  % (3568289)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.36  % (3568289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.36  % (3568289)CaDiCaL version: 2.1.3
% 3.86/1.36  % (3568289)Termination reason: Instruction limit
% 3.86/1.36  % (3568289)Termination phase: Saturation
% 3.86/1.36  % (3568289)Time elapsed: 0.067 s
% 3.86/1.36  % (3568289)Peak memory usage: 88 MB
% 3.86/1.36  % (3568289)Instructions burned: 121 (million)
% 3.86/1.36  % (3568290)Instruction limit reached! 
% 3.86/1.36  % (3568290)------------------------------
% 3.86/1.36  % (3568290)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.36  % (3568290)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.36  % (3568290)CaDiCaL version: 2.1.3
% 3.86/1.36  % (3568290)Termination reason: Instruction limit
% 3.86/1.36  % (3568290)Termination phase: Saturation
% 3.86/1.36  % (3568290)Time elapsed: 0.087 s
% 3.86/1.36  % (3568290)Peak memory usage: 89 MB
% 3.86/1.36  % (3568290)Instructions burned: 140 (million)
% 3.86/1.36  % (3568298)lrs+10_1_sil=8000:sp=occurrence:random_seed=1987709520:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 3.86/1.36  % (3568298)Also succeeded, but the first one will report.
% 3.86/1.36  % (3568300)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2131692006:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.86/1.36  % (3568288)Refutation found. Thanks to Tanya!
% 3.86/1.36  % SZS status Theorem for theBenchmark
% 3.86/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 3.86/1.36  % (3568288)------------------------------
% 3.86/1.36  % (3568288)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.86/1.36  % (3568288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.86/1.36  % (3568288)CaDiCaL version: 2.1.3
% 3.86/1.36  % (3568288)Termination reason: Refutation
% 3.86/1.36  % (3568288)Time elapsed: 0.019 s
% 3.86/1.36  % (3568288)Peak memory usage: 88 MB
% 3.86/1.36  % (3568288)Instructions burned: 38 (million)
% 3.86/1.36  % (3568288)------------------------------
% 3.86/1.36  % (3568288)------------------------------
% 3.86/1.36  % (3568280)Success in time 0.463 s
% 3.86/1.36  % Vampire exiting
%------------------------------------------------------------------------------