↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN574-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 : n001.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 0.22s 1.14s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   34 (  13 unt;   1 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  59   ~;  49   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn  41   !;   0   ?)

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

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

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

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

fof(f6,negated_conjecture,
    p11(c14,c15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_6) ).

fof(f7,negated_conjecture,
    ! [X0] : p3(f4(f5(X0)),f4(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_7) ).

fof(f10,negated_conjecture,
    ! [X0] :
      ( p9(X0,f4(c14))
      | ~ p9(X0,c13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_10) ).

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

fof(f19,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ p9(X2,X3)
      | ~ p7(X2,X0)
      | p9(X0,X1)
      | ~ p3(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_19) ).

fof(f21,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p2(X1,f5(X2))
      | p9(f8(X0,X1),f4(X1))
      | ~ p11(X2,c15)
      | ~ p9(c12,X0)
      | p9(f8(X0,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_21) ).

fof(f22,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p9(f8(X1,X2),f4(X2))
      | ~ p9(c12,X1)
      | ~ p2(X2,f5(X0))
      | ~ p9(f8(X1,X2),X1)
      | ~ p11(X0,c15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_22) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ p3(X0,X1)
      | p3(X1,X0) ),
    inference(resolution,[],[f16,f3]) ).

fof(f34,plain,
    ! [X0] : p3(f4(X0),f4(f5(X0))),
    inference(resolution,[],[f28,f7]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( ~ p3(f4(c14),X2)
      | p9(X1,X2)
      | ~ p7(X0,X1)
      | ~ p9(X0,c13) ),
    inference(resolution,[],[f19,f10]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( p9(f8(X0,f5(X1)),f4(f5(X1)))
      | p9(f8(X0,f5(X1)),X0)
      | ~ p9(c12,X0)
      | ~ p11(X1,c15) ),
    inference(resolution,[],[f21,f4]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ~ p9(X1,c13)
      | ~ p7(X1,X0)
      | p9(X0,f4(f5(c14))) ),
    inference(resolution,[],[f46,f34]) ).

fof(f138,plain,
    ! [X0] :
      ( p9(f8(f4(f5(X0)),f5(X0)),f4(f5(X0)))
      | ~ p9(c12,f4(f5(X0)))
      | ~ p11(X0,c15) ),
    inference(factoring,[],[f53]) ).

fof(f213,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f4(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p9(c12,f4(f5(X0)))
      | ~ p2(f5(X0),f5(X1))
      | ~ p9(f8(f4(f5(X0)),f5(X0)),f4(f5(X0)))
      | ~ p11(X1,c15) ),
    inference(resolution,[],[f138,f22]) ).

fof(f215,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f4(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p2(f5(X0),f5(X1))
      | ~ p9(f8(f4(f5(X0)),f5(X0)),f4(f5(X0)))
      | ~ p11(X1,c15) ),
    inference(duplicate_literal_removal,[],[f213]) ).

fof(f216,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f4(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p2(f5(X0),f5(X1))
      | ~ p11(X1,c15) ),
    inference(forward_subsumption_resolution,[],[f215,f138]) ).

fof(f406,plain,
    ! [X0] :
      ( p9(X0,f4(f5(c14)))
      | ~ p7(c12,X0) ),
    inference(resolution,[],[f117,f5]) ).

fof(f410,definition,
    ( spl0_4
  <=> ! [X1] :
        ( ~ p2(f5(c14),f5(X1))
        | ~ p11(X1,c15) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f411,plain,
    ( ! [X1] :
        ( ~ p2(f5(c14),f5(X1))
        | ~ p11(X1,c15) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f410]) ).

fof(f421,plain,
    ( ~ p11(c14,c15)
    | ~ spl0_4 ),
    inference(resolution,[],[f411,f4]) ).

fof(f422,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f421,f6]) ).

fof(f423,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f422]) ).

fof(f617,plain,
    ! [X0] :
      ( ~ p11(c14,c15)
      | ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15)
      | ~ p7(c12,c12) ),
    inference(resolution,[],[f216,f406]) ).

fof(f621,plain,
    ! [X0] :
      ( ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15)
      | ~ p7(c12,c12) ),
    inference(forward_subsumption_resolution,[],[f617,f6]) ).

fof(f622,plain,
    ! [X0] :
      ( ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15) ),
    inference(forward_subsumption_resolution,[],[f621,f2]) ).

fof(f623,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f622,f410]) ).

cnf(s4,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f423]) ).

cnf(s5,plain,
    spl0_4,
    inference(sat_conversion,[],[f623]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s4,s5]) ).

fof(f624,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN574-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.10/0.19  % Computer : n001.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 16:35:34 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running first-order theorem proving
% 0.10/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.22/1.14  % (475576)Input is clausal, will run a generic CNF schedule.
% 0.22/1.14  % (475631)lrs+10_1_sil=8000:sp=occurrence:random_seed=2496186216:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.22/1.14  % (475631)First to succeed.
% 0.22/1.14  % (475631)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-475576"
% 0.22/1.14  % (475628)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=35844750:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.22/1.14  % (475632)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=172878306:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.22/1.14  % (475633)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2693529213:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.22/1.14  % (475630)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=910035393:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.22/1.14  % (475629)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2748023353:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.22/1.14  % (475634)dis-21_1_sil=8000:lcm=predicate:random_seed=22760463: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.22/1.14  % (475633)Also succeeded, but the first one will report.
% 0.22/1.14  % (475634)Also succeeded, but the first one will report.
% 0.22/1.14  % (475632)Also succeeded, but the first one will report.
% 0.22/1.14  % (475631)Refutation found. Thanks to Tanya!
% 0.22/1.14  % SZS status Unsatisfiable for theBenchmark
% 0.22/1.14  % SZS output start Proof for theBenchmark
% See solution above
% 0.22/1.14  % (475631)------------------------------
% 0.22/1.14  % (475631)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.22/1.14  % (475631)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/1.14  % (475631)CaDiCaL version: 2.1.3
% 0.22/1.14  % (475631)Termination reason: Refutation
% 0.22/1.14  % (475631)Time elapsed: 0.009 s
% 0.22/1.14  % (475631)Peak memory usage: 89 MB
% 0.22/1.14  % (475631)Instructions burned: 23 (million)
% 0.22/1.14  % (475631)------------------------------
% 0.22/1.14  % (475631)------------------------------
% 0.22/1.14  % (475576)Success in time 0.271 s
% 0.22/1.14  % Vampire exiting
%------------------------------------------------------------------------------