↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n016.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:49:37 PM UTC 2026

% Result   : Unsatisfiable 0.66s 1.03s
% Output   : Refutation 0.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   36 (   5 unt;   5 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   94 (  44   ~;  45   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] :
      ( big_f(a,f(a))
      | ~ big_f(X0,b)
      | big_f(X0,f(a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,negated_conjecture,
    ( big_f(a,f(a))
    | big_f(a,b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f5,negated_conjecture,
    ! [X0] :
      ( big_f(g(X0),X0)
      | ~ big_f(a,X0)
      | ~ big_f(a,f(a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f8,negated_conjecture,
    ! [X0] :
      ( ~ big_f(g(X0),X0)
      | ~ big_f(a,X0)
      | ~ big_f(a,f(a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_8) ).

fof(f10,definition,
    ( spl0_1
  <=> big_f(a,f(a)) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f11,plain,
    ( ~ big_f(a,f(a))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f13,definition,
    ( spl0_2
  <=> ! [X0] :
        ( ~ big_f(g(X0),X0)
        | ~ big_f(a,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f14,plain,
    ( ! [X0] :
        ( ~ big_f(g(X0),X0)
        | ~ big_f(a,X0) )
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f13]) ).

fof(f15,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f8,f13,f10]) ).

fof(f17,definition,
    ( spl0_3
  <=> big_f(a,b) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f18,plain,
    ( big_f(a,b)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f21,definition,
    ( spl0_4
  <=> ! [X1] :
        ( ~ big_f(X1,b)
        | big_f(X1,f(a)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f22,plain,
    ( ! [X1] :
        ( big_f(X1,f(a))
        | ~ big_f(X1,b) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f21]) ).

fof(f25,definition,
    ( spl0_5
  <=> ! [X0] :
        ( big_f(g(X0),X0)
        | ~ big_f(a,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f26,plain,
    ( ! [X0] :
        ( big_f(g(X0),X0)
        | ~ big_f(a,X0) )
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f25]) ).

fof(f27,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f5,f25,f10]) ).

fof(f30,plain,
    ( big_f(a,f(a))
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f10]) ).

fof(f31,plain,
    ( spl0_3
    | spl0_1 ),
    inference(avatar_split_clause,[],[f2,f10,f17]) ).

fof(f32,plain,
    ( spl0_4
    | spl0_1 ),
    inference(avatar_split_clause,[],[f1,f10,f21]) ).

fof(f33,plain,
    ( ~ big_f(a,b)
    | spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f22,f11]) ).

fof(f34,plain,
    ( $false
    | spl0_1
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f33,f18]) ).

fof(f35,plain,
    ( spl0_1
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f34]) ).

fof(f38,plain,
    ( ! [X0] : ~ big_f(a,X0)
    | ~ spl0_2
    | ~ spl0_5 ),
    inference(forward_subsumption_resolution,[],[f26,f14]) ).

fof(f40,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_2
    | ~ spl0_5 ),
    inference(resolution,[],[f38,f30]) ).

fof(f42,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_5 ),
    inference(avatar_contradiction_clause,[],[f40]) ).

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

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f27]) ).

cnf(s7,plain,
    ( spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f31]) ).

cnf(s8,plain,
    ( spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f32]) ).

cnf(s9,plain,
    ( spl0_1
    | ~ spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f35]) ).

cnf(s10,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f42]) ).

cnf(s12,plain,
    spl0_1,
    inference(rat,[],[s9,s7,s8]) ).

cnf(s13,plain,
    spl0_5,
    inference(rat,[],[s4,s12]) ).

cnf(s14,plain,
    spl0_2,
    inference(rat,[],[s1,s12]) ).

cnf(s15,plain,
    $false,
    inference(rat,[],[s10,s13,s12,s14]) ).

fof(f44,plain,
    $false,
    inference(avatar_sat_refutation,[],[s15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN082-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.19  % Computer : n016.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 15:37: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.23  Running first-order theorem proving
% 0.09/0.23  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
% 0.66/1.03  % (3712567)Input is clausal, will run a generic CNF schedule.
% 0.66/1.03  % (3712576)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2008509127:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.66/1.03  % (3712576)First to succeed.
% 0.66/1.03  % (3712576)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3712567"
% 0.66/1.03  % (3712573)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2163431435:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.66/1.03  % (3712572)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=133062197:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.66/1.03  % (3712574)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=806258539:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.66/1.03  % (3712575)lrs+10_1_sil=8000:sp=occurrence:random_seed=2731609059:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.66/1.03  % (3712578)dis-21_1_sil=8000:lcm=predicate:random_seed=2278852483: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)
% 0.66/1.03  % (3712575)Also succeeded, but the first one will report.
% 0.66/1.03  % (3712578)Also succeeded, but the first one will report.
% 0.66/1.03  % (3712577)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1216746657:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.66/1.03  % (3712577)Also succeeded, but the first one will report.
% 0.66/1.03  % (3712576)Refutation found. Thanks to Tanya!
% 0.66/1.03  % SZS status Unsatisfiable for theBenchmark
% 0.66/1.03  % SZS output start Proof for theBenchmark
% See solution above
% 0.66/1.03  % (3712576)------------------------------
% 0.66/1.03  % (3712576)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/1.03  % (3712576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/1.03  % (3712576)CaDiCaL version: 2.1.3
% 0.66/1.03  % (3712576)Termination reason: Refutation
% 0.66/1.03  % (3712576)Time elapsed: 0.001 s
% 0.66/1.03  % (3712576)Peak memory usage: 89 MB
% 0.66/1.03  % (3712576)Instructions burned: 1 (million)
% 0.66/1.03  % (3712576)------------------------------
% 0.66/1.03  % (3712576)------------------------------
% 0.66/1.03  % (3712567)Success in time 0.271 s
% 0.66/1.03  % Vampire exiting
%------------------------------------------------------------------------------