↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n020.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:54 PM UTC 2026

% Result   : Unsatisfiable 3.93s 1.49s
% Output   : Refutation 3.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   76 (  24 unt;   8 def)
%            Number of atoms       :  165 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  177 (  88   ~;  81   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   21 (  20 usr;   9 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   49 (   0 sgn  49   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,axiom,
    ! [X0] : p0(b,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_14) ).

fof(f15,axiom,
    n0(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_15) ).

fof(f19,axiom,
    ! [X0,X1] : m0(X0,d,X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_19) ).

fof(f24,axiom,
    l0(c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_24) ).

fof(f26,axiom,
    n0(d,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_26) ).

fof(f33,axiom,
    q0(d,c),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_33) ).

fof(f39,axiom,
    ! [X0,X1] :
      ( ~ n0(X1,X0)
      | k1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_001) ).

fof(f104,axiom,
    ! [X0,X1] :
      ( ~ n0(X1,X0)
      | p1(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_066) ).

fof(f163,axiom,
    ! [X0] :
      ( ~ p0(X0,X0)
      | s1(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_125) ).

fof(f164,axiom,
    ! [X2,X0,X1] :
      ( s1(X0)
      | ~ q0(X0,X1)
      | ~ s1(X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_126) ).

fof(f171,axiom,
    ! [X2,X3,X0,X1] :
      ( l2(X0,X0)
      | ~ p0(X1,X1)
      | ~ s1(X2)
      | ~ m0(X3,X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_133) ).

fof(f219,axiom,
    ! [X0] :
      ( ~ p1(X0,X0,X0)
      | q2(X0,X0,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_181) ).

fof(f221,axiom,
    ! [X0,X1] :
      ( q2(X0,c,X1)
      | ~ k1(X1)
      | ~ l0(c)
      | ~ l2(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_183) ).

fof(f227,axiom,
    ! [X0] :
      ( s2(X0)
      | ~ q2(b,X0,b)
      | ~ s1(b) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_189) ).

fof(f311,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ q2(X2,X0,X2)
      | s3(X0,X1)
      | ~ s2(X0)
      | ~ m0(X2,X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_273) ).

fof(f369,negated_conjecture,
    ! [X0] : ~ s3(X0,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f582,definition,
    ( spl0_52
  <=> p1(c,c,c) ),
    introduced(definition,[new_symbols(definition,[spl0_52])],[avatar_definition]) ).

fof(f584,plain,
    ( p1(c,c,c)
    | ~ spl0_52 ),
    inference(avatar_component_clause,[],[f582]) ).

fof(f699,definition,
    ( spl0_80
  <=> ! [X2] : ~ p0(X2,X2) ),
    introduced(definition,[new_symbols(definition,[spl0_80])],[avatar_definition]) ).

fof(f700,plain,
    ( ! [X2] : ~ p0(X2,X2)
    | ~ spl0_80 ),
    inference(avatar_component_clause,[],[f699]) ).

fof(f816,definition,
    ( spl0_108
  <=> ! [X2] : ~ s1(X2) ),
    introduced(definition,[new_symbols(definition,[spl0_108])],[avatar_definition]) ).

fof(f817,plain,
    ( ! [X2] : ~ s1(X2)
    | ~ spl0_108 ),
    inference(avatar_component_clause,[],[f816]) ).

fof(f819,definition,
    ( spl0_109
  <=> ! [X0,X1] :
        ( s1(X0)
        | ~ q0(X0,X1) ) ),
    introduced(definition,[new_symbols(definition,[spl0_109])],[avatar_definition]) ).

fof(f820,plain,
    ( ! [X0,X1] :
        ( ~ q0(X0,X1)
        | s1(X0) )
    | ~ spl0_109 ),
    inference(avatar_component_clause,[],[f819]) ).

fof(f821,plain,
    ( spl0_108
    | spl0_109 ),
    inference(avatar_split_clause,[],[f164,f819,f816]) ).

fof(f823,definition,
    ( spl0_110
  <=> ! [X2,X0,X3] :
        ( l2(X0,X0)
        | ~ s1(X2)
        | ~ m0(X3,X2,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl0_110])],[avatar_definition]) ).

fof(f824,plain,
    ( ! [X2,X3,X0] :
        ( ~ m0(X3,X2,X0)
        | ~ s1(X2)
        | l2(X0,X0) )
    | ~ spl0_110 ),
    inference(avatar_component_clause,[],[f823]) ).

fof(f825,plain,
    ( spl0_80
    | spl0_110 ),
    inference(avatar_split_clause,[],[f171,f823,f699]) ).

fof(f848,definition,
    ( spl0_116
  <=> s1(b) ),
    introduced(definition,[new_symbols(definition,[spl0_116])],[avatar_definition]) ).

fof(f850,plain,
    ( ~ s1(b)
    | spl0_116 ),
    inference(avatar_component_clause,[],[f848]) ).

fof(f852,definition,
    ( spl0_117
  <=> ! [X0] :
        ( s2(X0)
        | ~ q2(b,X0,b) ) ),
    introduced(definition,[new_symbols(definition,[spl0_117])],[avatar_definition]) ).

fof(f853,plain,
    ( ! [X0] :
        ( ~ q2(b,X0,b)
        | s2(X0) )
    | ~ spl0_117 ),
    inference(avatar_component_clause,[],[f852]) ).

fof(f854,plain,
    ( ~ spl0_116
    | spl0_117 ),
    inference(avatar_split_clause,[],[f227,f852,f848]) ).

fof(f877,definition,
    ( spl0_123
  <=> s2(c) ),
    introduced(definition,[new_symbols(definition,[spl0_123])],[avatar_definition]) ).

fof(f878,plain,
    ( s2(c)
    | ~ spl0_123 ),
    inference(avatar_component_clause,[],[f877]) ).

fof(f879,plain,
    ( ~ s2(c)
    | spl0_123 ),
    inference(avatar_component_clause,[],[f877]) ).

fof(f902,plain,
    ! [X0,X1] :
      ( q2(X0,c,X1)
      | ~ k1(X1)
      | ~ l2(X1,X0) ),
    inference(forward_subsumption_resolution,[],[f221,f24]) ).

fof(f1033,plain,
    ( $false
    | ~ spl0_80 ),
    inference(resolution,[],[f700,f14]) ).

fof(f1034,plain,
    ~ spl0_80,
    inference(avatar_contradiction_clause,[],[f1033]) ).

fof(f1054,plain,
    k1(b),
    inference(resolution,[],[f39,f15]) ).

fof(f1073,plain,
    s1(b),
    inference(resolution,[],[f163,f14]) ).

fof(f1074,plain,
    ( $false
    | ~ spl0_108 ),
    inference(forward_subsumption_resolution,[],[f1073,f817]) ).

fof(f1075,plain,
    ~ spl0_108,
    inference(avatar_contradiction_clause,[],[f1074]) ).

fof(f1076,plain,
    ( $false
    | spl0_116 ),
    inference(forward_subsumption_resolution,[],[f1073,f850]) ).

fof(f1077,plain,
    spl0_116,
    inference(avatar_contradiction_clause,[],[f1076]) ).

fof(f1082,plain,
    ( s1(d)
    | ~ spl0_109 ),
    inference(resolution,[],[f820,f33]) ).

fof(f1135,plain,
    p1(c,c,c),
    inference(resolution,[],[f104,f26]) ).

fof(f1141,plain,
    spl0_52,
    inference(avatar_split_clause,[],[f1135,f582]) ).

fof(f1322,plain,
    ( q2(c,c,c)
    | ~ spl0_52 ),
    inference(resolution,[],[f219,f584]) ).

fof(f1556,plain,
    ( ! [X0] :
        ( ~ s1(d)
        | l2(X0,X0) )
    | ~ spl0_110 ),
    inference(resolution,[],[f824,f19]) ).

fof(f1573,plain,
    ( ! [X0] : l2(X0,X0)
    | ~ spl0_109
    | ~ spl0_110 ),
    inference(forward_subsumption_resolution,[],[f1556,f1082]) ).

fof(f1582,plain,
    ( ~ k1(b)
    | ~ l2(b,b)
    | s2(c)
    | ~ spl0_117 ),
    inference(resolution,[],[f902,f853]) ).

fof(f1592,plain,
    ( ~ l2(b,b)
    | s2(c)
    | ~ spl0_117 ),
    inference(forward_subsumption_resolution,[],[f1582,f1054]) ).

fof(f1593,plain,
    ( s2(c)
    | ~ spl0_109
    | ~ spl0_110
    | ~ spl0_117 ),
    inference(forward_subsumption_resolution,[],[f1592,f1573]) ).

fof(f1594,plain,
    ( $false
    | ~ spl0_109
    | ~ spl0_110
    | ~ spl0_117
    | spl0_123 ),
    inference(forward_subsumption_resolution,[],[f1593,f879]) ).

fof(f1595,plain,
    ( ~ spl0_109
    | ~ spl0_110
    | ~ spl0_117
    | spl0_123 ),
    inference(avatar_contradiction_clause,[],[f1594]) ).

fof(f2390,plain,
    ( ! [X0,X1] :
        ( s3(c,X0)
        | ~ s2(c)
        | ~ m0(c,X1,X0) )
    | ~ spl0_52 ),
    inference(resolution,[],[f311,f1322]) ).

fof(f2391,plain,
    ( ! [X0,X1] :
        ( ~ m0(c,X1,X0)
        | s3(c,X0) )
    | ~ spl0_52
    | ~ spl0_123 ),
    inference(forward_subsumption_resolution,[],[f2390,f878]) ).

fof(f3339,plain,
    ( ! [X0] : s3(c,X0)
    | ~ spl0_52
    | ~ spl0_123 ),
    inference(resolution,[],[f2391,f19]) ).

fof(f3347,plain,
    ( $false
    | ~ spl0_52
    | ~ spl0_123 ),
    inference(resolution,[],[f3339,f369]) ).

fof(f3348,plain,
    ( ~ spl0_52
    | ~ spl0_123 ),
    inference(avatar_contradiction_clause,[],[f3347]) ).

cnf(s55,plain,
    ( spl0_108
    | spl0_109 ),
    inference(sat_conversion,[],[f821]) ).

cnf(s56,plain,
    ( spl0_80
    | spl0_110 ),
    inference(sat_conversion,[],[f825]) ).

cnf(s59,plain,
    ( ~ spl0_116
    | spl0_117 ),
    inference(sat_conversion,[],[f854]) ).

cnf(s88,plain,
    ~ spl0_80,
    inference(sat_conversion,[],[f1034]) ).

cnf(s104,plain,
    ~ spl0_108,
    inference(sat_conversion,[],[f1075]) ).

cnf(s105,plain,
    spl0_116,
    inference(sat_conversion,[],[f1077]) ).

cnf(s119,plain,
    spl0_52,
    inference(sat_conversion,[],[f1141]) ).

cnf(s157,plain,
    ( ~ spl0_109
    | ~ spl0_110
    | ~ spl0_117
    | spl0_123 ),
    inference(sat_conversion,[],[f1595]) ).

cnf(s231,plain,
    ( ~ spl0_52
    | ~ spl0_123 ),
    inference(sat_conversion,[],[f3348]) ).

cnf(s237,plain,
    ~ spl0_123,
    inference(rat,[],[s231,s119]) ).

cnf(s246,plain,
    spl0_117,
    inference(rat,[],[s59,s105]) ).

cnf(s247,plain,
    spl0_110,
    inference(rat,[],[s56,s88]) ).

cnf(s248,plain,
    ~ spl0_109,
    inference(rat,[],[s157,s237,s246,s247]) ).

cnf(s250,plain,
    $false,
    inference(rat,[],[s55,s248,s104]) ).

fof(f3349,plain,
    $false,
    inference(avatar_sat_refutation,[],[s250]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYN203-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.31  % Computer : n020.cluster.edu
% 0.28/0.31  % Model    : x86_64 x86_64
% 0.28/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.28/0.31  % Memory   : 8046.5625MB
% 0.28/0.31  % OS       : Linux 6.8.0-71-generic
% 0.28/0.31  % CPULimit : 300
% 0.28/0.31  % WCLimit  : 300
% 0.28/0.31  % DateTime : Mon Sep 28 15:39:20 UTC 2026
% 0.28/0.31  % CPUTime  : 
% 0.28/0.31  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.28/0.37  Running first-order theorem proving
% 0.28/0.37  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.93/1.49  % (253855)Input is clausal, will run a generic CNF schedule.
% 3.93/1.49  % (253952)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4000000503:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.93/1.49  % (253951)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2275721202:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.93/1.49  % (253949)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=10753226:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.93/1.49  % (253954)lrs+10_1_sil=8000:sp=occurrence:random_seed=3096071143:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.93/1.49  % (253957)dis-21_1_sil=8000:lcm=predicate:random_seed=4170227052: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.93/1.49  % (253955)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2482991228:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.93/1.49  % (253956)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2829235341:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.93/1.49  % (253954)First to succeed.
% 3.93/1.49  % (253954)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-253855"
% 3.93/1.49  % (253955)Also succeeded, but the first one will report.
% 3.93/1.49  % (253956)Also succeeded, but the first one will report.
% 3.93/1.49  % (253957)Instruction limit reached! 
% 3.93/1.49  % (253957)------------------------------
% 3.93/1.49  % (253957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.49  % (253957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.49  % (253957)CaDiCaL version: 2.1.3
% 3.93/1.49  % (253957)Termination reason: Instruction limit
% 3.93/1.49  % (253957)Termination phase: Saturation
% 3.93/1.49  % (253957)Time elapsed: 0.056 s
% 3.93/1.49  % (253957)Peak memory usage: 89 MB
% 3.93/1.49  % (253957)Instructions burned: 118 (million)
% 3.93/1.49  % (254026)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3871457213:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.93/1.49  % (254026)Refutation not found, incomplete strategy
% 3.93/1.49  % (254026)------------------------------
% 3.93/1.49  % (254026)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.49  % (254026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.49  % (254026)CaDiCaL version: 2.1.3
% 3.93/1.49  % (254026)Termination reason: Refutation not found, incomplete strategy
% 3.93/1.49  % (254026)Time elapsed: 0.001 s
% 3.93/1.49  % (254026)Peak memory usage: 87 MB
% 3.93/1.49  % (254026)Instructions burned: 1 (million)
% 3.93/1.49  % (253954)Refutation found. Thanks to Tanya!
% 3.93/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.93/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.93/1.49  % (253954)------------------------------
% 3.93/1.49  % (253954)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.93/1.49  % (253954)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.93/1.49  % (253954)CaDiCaL version: 2.1.3
% 3.93/1.49  % (253954)Termination reason: Refutation
% 3.93/1.49  % (253954)Time elapsed: 0.035 s
% 3.93/1.49  % (253954)Peak memory usage: 90 MB
% 3.93/1.49  % (253954)Instructions burned: 51 (million)
% 3.93/1.49  % (253954)------------------------------
% 3.93/1.49  % (253954)------------------------------
% 3.93/1.49  % (253855)Success in time 0.46 s
% 3.93/1.49  % Vampire exiting
%------------------------------------------------------------------------------