↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n019.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 02:01:00 PM UTC 2026

% Result   : Unsatisfiable 3.49s 1.25s
% Output   : Refutation 3.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   43 (  13 unt;   3 def)
%            Number of atoms       :  109 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  143 (  77   ~;  63   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   4 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-1 aty)
%            Number of variables   :   39 (   0 sgn  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,negated_conjecture,
    ! [X0] : p7(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_2) ).

fof(f3,negated_conjecture,
    ! [X0] : p4(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p4_3) ).

fof(f4,negated_conjecture,
    ! [X0] : p2(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

fof(f5,negated_conjecture,
    p11(c15,c16),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_5) ).

fof(f6,negated_conjecture,
    p9(c12,c13),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_6) ).

fof(f7,negated_conjecture,
    p2(c14,f3(c15)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_7) ).

fof(f8,negated_conjecture,
    ~ p8(c12,c13,c14),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p8_8) ).

fof(f15,negated_conjecture,
    ! [X2,X0,X1] :
      ( p2(X0,X1)
      | ~ p2(X2,X0)
      | ~ p2(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_15) ).

fof(f16,negated_conjecture,
    ! [X0,X1] :
      ( p8(c12,X0,X1)
      | ~ p11(X1,c16)
      | ~ p9(c12,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_16) ).

fof(f18,negated_conjecture,
    ! [X0,X1] :
      ( p8(c12,X1,f3(X0))
      | p9(c12,f6(X0))
      | ~ p9(c12,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_18) ).

fof(f22,negated_conjecture,
    ! [X0,X1] :
      ( p8(c12,X0,f3(X1))
      | ~ p9(c12,X0)
      | ~ p8(c12,f6(X1),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_22) ).

fof(f23,negated_conjecture,
    ! [X2,X3,X0,X1,X4,X5] :
      ( p8(X0,X1,X2)
      | ~ p2(X3,X2)
      | ~ p4(X4,X1)
      | ~ p7(X5,X0)
      | ~ p8(X5,X4,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p8_23) ).

fof(f43,plain,
    ! [X2,X0,X1] :
      ( ~ p8(X2,X1,X0)
      | ~ p4(X1,c13)
      | ~ p7(X2,c12)
      | ~ p2(X0,c14) ),
    inference(resolution,[],[f23,f8]) ).

fof(f74,plain,
    ! [X0,X1] :
      ( ~ p4(X0,c13)
      | ~ p7(c12,c12)
      | ~ p2(f3(X1),c14)
      | ~ p9(c12,X0)
      | ~ p8(c12,f6(X1),X1) ),
    inference(resolution,[],[f43,f22]) ).

fof(f75,plain,
    ! [X0,X1] :
      ( ~ p4(X0,c13)
      | ~ p7(c12,c12)
      | ~ p2(f3(X1),c14)
      | p9(c12,f6(X1))
      | ~ p9(c12,X0) ),
    inference(resolution,[],[f43,f18]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ p4(X0,c13)
      | ~ p2(f3(X1),c14)
      | p9(c12,f6(X1))
      | ~ p9(c12,X0) ),
    inference(forward_subsumption_resolution,[],[f75,f2]) ).

fof(f78,plain,
    ! [X0,X1] :
      ( ~ p4(X0,c13)
      | ~ p2(f3(X1),c14)
      | ~ p9(c12,X0)
      | ~ p8(c12,f6(X1),X1) ),
    inference(forward_subsumption_resolution,[],[f74,f2]) ).

fof(f84,definition,
    ( spl0_1
  <=> ! [X1] :
        ( ~ p2(f3(X1),c14)
        | p9(c12,f6(X1)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f85,plain,
    ( ! [X1] :
        ( p9(c12,f6(X1))
        | ~ p2(f3(X1),c14) )
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f84]) ).

fof(f87,definition,
    ( spl0_2
  <=> ! [X0] :
        ( ~ p4(X0,c13)
        | ~ p9(c12,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f88,plain,
    ( ! [X0] :
        ( ~ p9(c12,X0)
        | ~ p4(X0,c13) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f87]) ).

fof(f89,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f77,f87,f84]) ).

fof(f91,definition,
    ( spl0_3
  <=> ! [X1] :
        ( ~ p2(f3(X1),c14)
        | ~ p8(c12,f6(X1),X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f92,plain,
    ( ! [X1] :
        ( ~ p8(c12,f6(X1),X1)
        | ~ p2(f3(X1),c14) )
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f91]) ).

fof(f93,plain,
    ( spl0_3
    | spl0_2 ),
    inference(avatar_split_clause,[],[f78,f87,f91]) ).

fof(f122,plain,
    ( ~ p4(c13,c13)
    | ~ spl0_2 ),
    inference(resolution,[],[f88,f6]) ).

fof(f127,plain,
    ( $false
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f122,f3]) ).

fof(f128,plain,
    ~ spl0_2,
    inference(avatar_contradiction_clause,[],[f127]) ).

fof(f140,plain,
    ( ! [X0] :
        ( ~ p2(f3(X0),c14)
        | ~ p11(X0,c16)
        | ~ p9(c12,f6(X0)) )
    | ~ spl0_3 ),
    inference(resolution,[],[f92,f16]) ).

fof(f146,plain,
    ( ! [X0] :
        ( ~ p2(f3(X0),c14)
        | ~ p11(X0,c16) )
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f140,f85]) ).

fof(f149,plain,
    ( ! [X0,X1] :
        ( ~ p2(X1,f3(X0))
        | ~ p11(X0,c16)
        | ~ p2(X1,c14) )
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(resolution,[],[f146,f15]) ).

fof(f360,plain,
    ( ~ p11(c15,c16)
    | ~ p2(c14,c14)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(resolution,[],[f149,f7]) ).

fof(f362,plain,
    ( ~ p2(c14,c14)
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f360,f5]) ).

fof(f363,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f362,f4]) ).

fof(f364,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f363]) ).

cnf(s1,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f89]) ).

cnf(s2,plain,
    ( spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f93]) ).

cnf(s8,plain,
    ~ spl0_2,
    inference(sat_conversion,[],[f128]) ).

cnf(s29,plain,
    ( ~ spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f364]) ).

cnf(s52,plain,
    spl0_3,
    inference(rat,[],[s2,s8]) ).

cnf(s53,plain,
    ~ spl0_1,
    inference(rat,[],[s29,s52]) ).

cnf(s54,plain,
    $false,
    inference(rat,[],[s1,s8,s53]) ).

fof(f365,plain,
    $false,
    inference(avatar_sat_refutation,[],[s54]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN580-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n019.cluster.edu
% 0.09/0.19  % Model    : x86_64 x86_64
% 0.09/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19  % Memory   : 8046.5625MB
% 0.09/0.19  % OS       : Linux 6.8.0-71-generic
% 0.09/0.19  % CPULimit : 300
% 0.09/0.19  % WCLimit  : 300
% 0.09/0.19  % DateTime : Mon Sep 28 16:30:19 UTC 2026
% 0.09/0.19  % CPUTime  : 
% 0.09/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.22  Running first-order theorem proving
% 0.09/0.22  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.49/1.25  % (4141193)Input is clausal, will run a generic CNF schedule.
% 3.49/1.25  % (4141200)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1328871134:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.49/1.25  % (4141198)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=2678482716:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.49/1.25  % (4141203)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1641316898:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.49/1.25  % (4141204)dis-21_1_sil=8000:lcm=predicate:random_seed=3062649666:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 3.49/1.25  % (4141201)lrs+10_1_sil=8000:sp=occurrence:random_seed=128945855:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.49/1.25  % (4141199)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=26505582:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.49/1.25  % (4141202)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=407440166:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.49/1.25  % (4141202)First to succeed.
% 3.49/1.25  % (4141202)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4141193"
% 3.49/1.25  % (4141204)Also succeeded, but the first one will report.
% 3.49/1.25  % (4141203)Also succeeded, but the first one will report.
% 3.49/1.25  % (4141201)Also succeeded, but the first one will report.
% 3.49/1.25  % (4141202)Refutation found. Thanks to Tanya!
% 3.49/1.25  % SZS status Unsatisfiable for theBenchmark
% 3.49/1.25  % SZS output start Proof for theBenchmark
% See solution above
% 3.49/1.25  % (4141202)------------------------------
% 3.49/1.25  % (4141202)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.49/1.25  % (4141202)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.49/1.25  % (4141202)CaDiCaL version: 2.1.3
% 3.49/1.25  % (4141202)Termination reason: Refutation
% 3.49/1.25  % (4141202)Time elapsed: 0.008 s
% 3.49/1.25  % (4141202)Peak memory usage: 89 MB
% 3.49/1.25  % (4141202)Instructions burned: 10 (million)
% 3.49/1.25  % (4141202)------------------------------
% 3.49/1.25  % (4141202)------------------------------
% 3.49/1.25  % (4141193)Success in time 0.408 s
% 3.49/1.25  % Vampire exiting
%------------------------------------------------------------------------------