↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SYN569-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 02:00:59 PM UTC 2026

% Result   : Unsatisfiable 0.18s 1.13s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   44 (  14 unt;   3 def)
%            Number of atoms       :   96 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  112 (  60   ~;  49   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   4 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    ! [X0] : p2(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_1) ).

fof(f3,negated_conjecture,
    p8(c14,c12),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_3) ).

fof(f5,negated_conjecture,
    p8(c11,c14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p8_5) ).

fof(f6,negated_conjecture,
    p9(c13,c15,c14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_6) ).

fof(f7,negated_conjecture,
    ! [X0,X1] :
      ( p10(X0,X1)
      | ~ p8(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p10_7) ).

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

fof(f11,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ p9(X2,X1,X3)
      | ~ p9(X2,X0,X3)
      | p2(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_11) ).

fof(f12,negated_conjecture,
    ! [X0] :
      ( p9(c13,f3(X0),X0)
      | ~ p10(X0,c12)
      | ~ p10(c11,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p9_12) ).

fof(f15,negated_conjecture,
    p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),c15)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_15) ).

fof(f16,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( p2(f4(X0,X1),f4(X2,X3))
      | ~ p2(X0,X2)
      | ~ p2(X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_16) ).

fof(f20,negated_conjecture,
    ! [X0] :
      ( ~ p2(f5(f7(c13,c12),f7(c13,c11)),f4(f5(c12,c11),f3(X0)))
      | ~ p8(c11,X0)
      | ~ p8(X0,c12) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p8_20) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ p9(c13,X1,X0)
      | ~ p10(c11,X0)
      | ~ p10(X0,c12)
      | p2(X1,f3(X0)) ),
    inference(resolution,[],[f12,f11]) ).

fof(f27,definition,
    ( spl0_1
  <=> p10(c11,c14) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f28,plain,
    ( ~ p10(c11,c14)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f27]) ).

fof(f30,definition,
    ( spl0_2
  <=> p10(c14,c12) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f31,plain,
    ( ~ p10(c14,c12)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f30]) ).

fof(f37,plain,
    ( ~ p8(c11,c14)
    | spl0_1 ),
    inference(resolution,[],[f28,f7]) ).

fof(f38,plain,
    ( $false
    | spl0_1 ),
    inference(forward_subsumption_resolution,[],[f37,f5]) ).

fof(f39,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f38]) ).

fof(f41,plain,
    ( ~ p8(c14,c12)
    | spl0_2 ),
    inference(resolution,[],[f31,f7]) ).

fof(f42,plain,
    ( $false
    | spl0_2 ),
    inference(forward_subsumption_resolution,[],[f41,f3]) ).

fof(f43,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f42]) ).

fof(f44,plain,
    ( ~ p10(c11,c14)
    | ~ p10(c14,c12)
    | p2(c15,f3(c14)) ),
    inference(resolution,[],[f23,f6]) ).

fof(f48,definition,
    ( spl0_4
  <=> p2(c15,f3(c14)) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f49,plain,
    ( p2(c15,f3(c14))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f48]) ).

fof(f50,plain,
    ( spl0_4
    | ~ spl0_2
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f44,f27,f30,f48]) ).

fof(f54,plain,
    ! [X0,X1] :
      ( ~ p2(X1,f5(f7(c13,c12),f7(c13,c11)))
      | ~ p8(X0,c12)
      | ~ p8(c11,X0)
      | ~ p2(X1,f4(f5(c12,c11),f3(X0))) ),
    inference(resolution,[],[f20,f10]) ).

fof(f66,plain,
    ! [X2,X0,X1] :
      ( ~ p2(X2,f5(f7(c13,c12),f7(c13,c11)))
      | ~ p8(c11,X0)
      | ~ p2(X1,f4(f5(c12,c11),f3(X0)))
      | ~ p2(X2,X1)
      | ~ p8(X0,c12) ),
    inference(resolution,[],[f54,f10]) ).

fof(f89,plain,
    ! [X0,X1] :
      ( ~ p2(f5(f7(c13,c12),f7(c13,c11)),X1)
      | ~ p2(X1,f4(f5(c12,c11),f3(X0)))
      | ~ p8(c11,X0)
      | ~ p8(X0,c12) ),
    inference(resolution,[],[f66,f1]) ).

fof(f154,plain,
    ! [X0] :
      ( ~ p2(f4(f5(c12,c11),c15),f4(f5(c12,c11),f3(X0)))
      | ~ p8(c11,X0)
      | ~ p8(X0,c12) ),
    inference(resolution,[],[f89,f15]) ).

fof(f372,plain,
    ! [X0] :
      ( ~ p8(c11,X0)
      | ~ p8(X0,c12)
      | ~ p2(f5(c12,c11),f5(c12,c11))
      | ~ p2(c15,f3(X0)) ),
    inference(resolution,[],[f154,f16]) ).

fof(f374,plain,
    ! [X0] :
      ( ~ p2(c15,f3(X0))
      | ~ p8(X0,c12)
      | ~ p8(c11,X0) ),
    inference(forward_subsumption_resolution,[],[f372,f1]) ).

fof(f375,plain,
    ( ~ p8(c14,c12)
    | ~ p8(c11,c14)
    | ~ spl0_4 ),
    inference(resolution,[],[f374,f49]) ).

fof(f387,plain,
    ( ~ p8(c11,c14)
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f375,f3]) ).

fof(f392,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f387,f5]) ).

fof(f393,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f392]) ).

cnf(s2,plain,
    spl0_1,
    inference(sat_conversion,[],[f39]) ).

cnf(s3,plain,
    spl0_2,
    inference(sat_conversion,[],[f43]) ).

cnf(s4,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | spl0_4 ),
    inference(sat_conversion,[],[f50]) ).

cnf(s38,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f393]) ).

cnf(s51,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(rat,[],[s4,s38]) ).

cnf(s52,plain,
    ~ spl0_1,
    inference(rat,[],[s51,s3]) ).

cnf(s53,plain,
    $false,
    inference(rat,[],[s2,s52]) ).

fof(f395,plain,
    $false,
    inference(avatar_sat_refutation,[],[s53]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN569-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.16  % Computer : n016.cluster.edu
% 0.07/0.16  % Model    : x86_64 x86_64
% 0.07/0.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.16  % Memory   : 8046.5625MB
% 0.07/0.16  % OS       : Linux 6.8.0-71-generic
% 0.07/0.16  % CPULimit : 300
% 0.07/0.16  % WCLimit  : 300
% 0.07/0.16  % DateTime : Mon Sep 28 16:33:48 UTC 2026
% 0.07/0.17  % CPUTime  : 
% 0.07/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.20  Running first-order theorem proving
% 0.07/0.20  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/1.13  % (3749737)Input is clausal, will run a generic CNF schedule.
% 0.18/1.13  % (3749746)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2822863165:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.18/1.13  % (3749746)First to succeed.
% 0.18/1.13  % (3749746)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3749737"
% 0.18/1.13  % (3749745)lrs+10_1_sil=8000:sp=occurrence:random_seed=1508738146:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.18/1.13  % (3749742)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=1907624003:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.18/1.13  % (3749748)dis-21_1_sil=8000:lcm=predicate:random_seed=2958961468: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.18/1.13  % (3749743)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3828017000:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.18/1.13  % (3749744)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2983352783:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.18/1.13  % (3749747)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2965989781:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.18/1.13  % (3749748)Also succeeded, but the first one will report.
% 0.18/1.13  % (3749747)Also succeeded, but the first one will report.
% 0.18/1.13  % (3749745)Instruction limit reached! 
% 0.18/1.13  % (3749745)------------------------------
% 0.18/1.13  % (3749745)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.13  % (3749745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.13  % (3749745)CaDiCaL version: 2.1.3
% 0.18/1.13  % (3749745)Termination reason: Instruction limit
% 0.18/1.13  % (3749745)Termination phase: Saturation
% 0.18/1.13  % (3749745)Time elapsed: 0.065 s
% 0.18/1.13  % (3749745)Peak memory usage: 88 MB
% 0.18/1.13  % (3749745)Instructions burned: 108 (million)
% 0.18/1.13  % (3749746)Refutation found. Thanks to Tanya!
% 0.18/1.13  % SZS status Unsatisfiable for theBenchmark
% 0.18/1.13  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.13  % (3749746)------------------------------
% 0.18/1.13  % (3749746)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.13  % (3749746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.13  % (3749746)CaDiCaL version: 2.1.3
% 0.18/1.13  % (3749746)Termination reason: Refutation
% 0.18/1.13  % (3749746)Time elapsed: 0.006 s
% 0.18/1.13  % (3749746)Peak memory usage: 89 MB
% 0.18/1.13  % (3749746)Instructions burned: 14 (million)
% 0.18/1.13  % (3749746)------------------------------
% 0.18/1.13  % (3749746)------------------------------
% 0.18/1.13  % (3749737)Success in time 0.293 s
% 0.18/1.13  % Vampire exiting
%------------------------------------------------------------------------------