↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Result   : Unsatisfiable 2.74s 1.14s
% Output   : Refutation 2.74s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   59 (  15 unt;   7 def)
%            Number of atoms       :  148 (   2 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  177 (  88   ~;  82   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   8 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    1 (   0 sgn   1   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).

fof(f205,negated_conjecture,
    sk1 = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).

fof(f206,negated_conjecture,
    segmentP(sk4,sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    totalorderedP(sk3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ! [X0] :
      ( ~ neq(sk3,X0)
      | ~ ssList(X0)
      | ~ segmentP(sk4,X0)
      | ~ segmentP(X0,sk3)
      | ~ totalorderedP(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( ssList(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( neq(sk1,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( segmentP(sk2,sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f212,negated_conjecture,
    ( segmentP(sk5,sk1)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

fof(f213,negated_conjecture,
    ( totalorderedP(sk5)
    | ~ segmentP(sk2,sk1)
    | ~ totalorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f216,plain,
    ( ssList(sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f209,f204,f205,f205]) ).

fof(f217,plain,
    ( neq(sk3,sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f210,f205,f204,f205,f205]) ).

fof(f218,plain,
    ( segmentP(sk4,sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f211,f204,f204,f205,f205]) ).

fof(f219,plain,
    ( segmentP(sk5,sk3)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f212,f205,f204,f205,f205]) ).

fof(f220,plain,
    ( totalorderedP(sk5)
    | ~ segmentP(sk4,sk3)
    | ~ totalorderedP(sk3) ),
    inference(definition_unfolding,[],[f213,f204,f205,f205]) ).

fof(f240,definition,
    ( spl0_4
  <=> totalorderedP(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f241,plain,
    ( ~ totalorderedP(sk3)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f240]) ).

fof(f243,definition,
    ( spl0_5
  <=> segmentP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f244,plain,
    ( ~ segmentP(sk4,sk3)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f243]) ).

fof(f246,definition,
    ( spl0_6
  <=> totalorderedP(sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f247,plain,
    ( totalorderedP(sk5)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f246]) ).

fof(f248,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_6 ),
    inference(avatar_split_clause,[],[f220,f246,f243,f240]) ).

fof(f250,definition,
    ( spl0_7
  <=> segmentP(sk5,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f251,plain,
    ( segmentP(sk5,sk3)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f252,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_7 ),
    inference(avatar_split_clause,[],[f219,f250,f243,f240]) ).

fof(f254,definition,
    ( spl0_8
  <=> segmentP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f255,plain,
    ( segmentP(sk4,sk5)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f256,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_8 ),
    inference(avatar_split_clause,[],[f218,f254,f243,f240]) ).

fof(f258,definition,
    ( spl0_9
  <=> neq(sk3,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f259,plain,
    ( neq(sk3,sk5)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f258]) ).

fof(f260,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_9 ),
    inference(avatar_split_clause,[],[f217,f258,f243,f240]) ).

fof(f262,definition,
    ( spl0_10
  <=> ssList(sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).

fof(f263,plain,
    ( ssList(sk5)
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f262]) ).

fof(f264,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_10 ),
    inference(avatar_split_clause,[],[f216,f262,f243,f240]) ).

fof(f265,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f241,f207]) ).

fof(f266,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f265]) ).

fof(f267,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f244,f206]) ).

fof(f268,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f267]) ).

fof(f269,plain,
    ( ~ ssList(sk5)
    | ~ segmentP(sk4,sk5)
    | ~ segmentP(sk5,sk3)
    | ~ totalorderedP(sk5)
    | ~ spl0_9 ),
    inference(resolution,[],[f208,f259]) ).

fof(f270,plain,
    ( ~ segmentP(sk4,sk5)
    | ~ segmentP(sk5,sk3)
    | ~ totalorderedP(sk5)
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f269,f263]) ).

fof(f271,plain,
    ( ~ segmentP(sk5,sk3)
    | ~ totalorderedP(sk5)
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f270,f255]) ).

fof(f272,plain,
    ( ~ totalorderedP(sk5)
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f271,f251]) ).

fof(f273,plain,
    ( $false
    | ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(forward_subsumption_resolution,[],[f272,f247]) ).

fof(f274,plain,
    ( ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(avatar_contradiction_clause,[],[f273]) ).

cnf(s3,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s4,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_7 ),
    inference(sat_conversion,[],[f252]) ).

cnf(s5,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_8 ),
    inference(sat_conversion,[],[f256]) ).

cnf(s6,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_9 ),
    inference(sat_conversion,[],[f260]) ).

cnf(s7,plain,
    ( ~ spl0_4
    | ~ spl0_5
    | spl0_10 ),
    inference(sat_conversion,[],[f264]) ).

cnf(s8,plain,
    spl0_4,
    inference(sat_conversion,[],[f266]) ).

cnf(s9,plain,
    spl0_5,
    inference(sat_conversion,[],[f268]) ).

cnf(s10,plain,
    ( ~ spl0_6
    | ~ spl0_7
    | ~ spl0_8
    | ~ spl0_9
    | ~ spl0_10 ),
    inference(sat_conversion,[],[f274]) ).

cnf(s11,plain,
    spl0_10,
    inference(rat,[],[s7,s9,s8]) ).

cnf(s12,plain,
    spl0_9,
    inference(rat,[],[s6,s9,s8]) ).

cnf(s13,plain,
    spl0_8,
    inference(rat,[],[s5,s9,s8]) ).

cnf(s14,plain,
    spl0_7,
    inference(rat,[],[s4,s9,s8]) ).

cnf(s15,plain,
    ~ spl0_6,
    inference(rat,[],[s10,s11,s12,s13,s14]) ).

cnf(s16,plain,
    $false,
    inference(rat,[],[s3,s15,s9,s8]) ).

fof(f275,plain,
    $false,
    inference(avatar_sat_refutation,[],[s16]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC333-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.17  % Computer : n020.cluster.edu
% 0.06/0.17  % Model    : x86_64 x86_64
% 0.06/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17  % Memory   : 8046.5625MB
% 0.06/0.17  % OS       : Linux 6.8.0-71-generic
% 0.06/0.17  % CPULimit : 300
% 0.06/0.17  % WCLimit  : 300
% 0.06/0.17  % DateTime : Mon Sep 28 09:10:19 UTC 2026
% 0.06/0.17  % CPUTime  : 
% 0.06/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.19  Running first-order theorem proving
% 0.06/0.19  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
% 2.74/1.14  % (45992)Input is clausal, will run a generic CNF schedule.
% 2.74/1.14  % (46001)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1342957009:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.74/1.14  % (46001)First to succeed.
% 2.74/1.14  % (46001)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-45992"
% 2.74/1.14  % (45999)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1972664651:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.74/1.14  % (45997)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=920295052:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.74/1.14  % (45998)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=154015268:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.74/1.14  % (46000)lrs+10_1_sil=8000:sp=occurrence:random_seed=2281528744:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.74/1.14  % (46000)Also succeeded, but the first one will report.
% 2.74/1.14  % (46002)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4044412722:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.74/1.14  % (46003)dis-21_1_sil=8000:lcm=predicate:random_seed=2441758309: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)
% 2.74/1.14  % (46003)Also succeeded, but the first one will report.
% 2.74/1.14  % (46002)Also succeeded, but the first one will report.
% 2.74/1.14  % (46001)Refutation found. Thanks to Tanya!
% 2.74/1.14  % SZS status Unsatisfiable for theBenchmark
% 2.74/1.14  % SZS output start Proof for theBenchmark
% See solution above
% 2.74/1.14  % (46001)------------------------------
% 2.74/1.14  % (46001)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.74/1.14  % (46001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.74/1.14  % (46001)CaDiCaL version: 2.1.3
% 2.74/1.14  % (46001)Termination reason: Refutation
% 2.74/1.14  % (46001)Time elapsed: 0.002 s
% 2.74/1.14  % (46001)Peak memory usage: 89 MB
% 2.74/1.14  % (46001)Instructions burned: 3 (million)
% 2.74/1.14  % (46001)------------------------------
% 2.74/1.14  % (46001)------------------------------
% 2.74/1.14  % (45992)Success in time 0.313 s
% 2.74/1.14  % Vampire exiting
%------------------------------------------------------------------------------