↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC116-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 : n005.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:02:31 PM UTC 2026

% Result   : Unsatisfiable 3.70s 1.49s
% Output   : Refutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   42 (  10 unt;   5 def)
%            Number of atoms       :   82 (  16 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   75 (  35   ~;  35   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   6 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).

fof(f101,axiom,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | ~ ssList(X1)
      | neq(X1,X0)
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause100) ).

fof(f102,plain,
    ! [X0,X1] :
      ( neq(X1,X0)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | X0 = X1 ),
    inference(reorient_equations,[],[f101]) ).

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

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,
    ( nil = sk3
    | nil != sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( ~ neq(sk1,nil)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,negated_conjecture,
    ( ~ neq(sk4,nil)
    | neq(sk3,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( ~ neq(sk4,nil)
    | segmentP(sk4,sk3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f213,plain,
    ( nil != sk4
    | nil != sk3 ),
    inference(definition_unfolding,[],[f207,f204,f205]) ).

fof(f214,plain,
    ( ~ neq(sk3,nil)
    | ~ segmentP(sk4,sk3) ),
    inference(definition_unfolding,[],[f208,f205,f204,f205]) ).

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

fof(f237,definition,
    ( spl0_5
  <=> neq(sk4,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f238,plain,
    ( ~ neq(sk4,nil)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f237]) ).

fof(f239,plain,
    ( spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f210,f237,f234]) ).

fof(f241,definition,
    ( spl0_6
  <=> neq(sk3,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f243,plain,
    ( spl0_6
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f209,f237,f241]) ).

fof(f246,plain,
    ( ~ spl0_4
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f214,f241,f234]) ).

fof(f248,definition,
    ( spl0_7
  <=> nil = sk3 ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f251,definition,
    ( spl0_8
  <=> nil = sk4 ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f252,plain,
    ( nil != sk4
    | spl0_8 ),
    inference(avatar_component_clause,[],[f251]) ).

fof(f253,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f213,f251,f248]) ).

fof(f255,plain,
    ( ~ spl0_8
    | spl0_7 ),
    inference(avatar_split_clause,[],[f206,f248,f251]) ).

fof(f269,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil = sk4
    | spl0_5 ),
    inference(resolution,[],[f102,f238]) ).

fof(f274,plain,
    ( ~ ssList(nil)
    | nil = sk4
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f269,f203]) ).

fof(f276,plain,
    ( nil = sk4
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f274,f8]) ).

fof(f278,plain,
    ( $false
    | spl0_5
    | spl0_8 ),
    inference(forward_subsumption_resolution,[],[f276,f252]) ).

fof(f279,plain,
    ( spl0_5
    | spl0_8 ),
    inference(avatar_contradiction_clause,[],[f278]) ).

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

cnf(s4,plain,
    ( ~ spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f243]) ).

cnf(s5,plain,
    ( ~ spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f246]) ).

cnf(s6,plain,
    ( ~ spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f253]) ).

cnf(s7,plain,
    ( spl0_7
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f255]) ).

cnf(s10,plain,
    ( spl0_5
    | spl0_8 ),
    inference(sat_conversion,[],[f279]) ).

cnf(s13,plain,
    ~ spl0_8,
    inference(rat,[],[s6,s7]) ).

cnf(s14,plain,
    spl0_5,
    inference(rat,[],[s10,s13]) ).

cnf(s15,plain,
    spl0_6,
    inference(rat,[],[s4,s14]) ).

cnf(s16,plain,
    spl0_4,
    inference(rat,[],[s3,s14]) ).

cnf(s17,plain,
    $false,
    inference(rat,[],[s5,s15,s16]) ).

fof(f280,plain,
    $false,
    inference(avatar_sat_refutation,[],[s17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC116-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.09/0.36  % Computer : n005.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 07:59:16 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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
% 3.70/1.49  % (630070)Input is clausal, will run a generic CNF schedule.
% 3.70/1.49  % (630081)dis-21_1_sil=8000:lcm=predicate:random_seed=1051546038: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.70/1.49  % (630081)Instruction limit reached! 
% 3.70/1.49  % (630081)------------------------------
% 3.70/1.49  % (630081)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.49  % (630081)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.49  % (630081)CaDiCaL version: 2.1.3
% 3.70/1.49  % (630081)Termination reason: Instruction limit
% 3.70/1.49  % (630081)Termination phase: Saturation
% 3.70/1.49  % (630081)Time elapsed: 0.028 s
% 3.70/1.49  % (630081)Peak memory usage: 89 MB
% 3.70/1.49  % (630081)Instructions burned: 117 (million)
% 3.70/1.49  % (630078)lrs+10_1_sil=8000:sp=occurrence:random_seed=2598909967:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.70/1.49  % (630079)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1912958176:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.70/1.49  % (630075)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=1141845026:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.70/1.49  % (630080)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2958540284:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.70/1.49  % (630076)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1498275002:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.70/1.49  % (630077)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=570197450:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.70/1.49  % (630078)Also succeeded, but the first one will report.
% 3.70/1.49  % (630079)First to succeed.
% 3.70/1.49  % (630079)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-630070"
% 3.70/1.49  % (630080)Also succeeded, but the first one will report.
% 3.70/1.49  % (630089)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=2557543229:i=143:sd=2:aac=none:ss=axioms:sgt=16_2998 on theBenchmark for (2998ds/143Mi)
% 3.70/1.49  % (630089)Also succeeded, but the first one will report.
% 3.70/1.49  % (630079)Refutation found. Thanks to Tanya!
% 3.70/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.70/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.70/1.49  % (630079)------------------------------
% 3.70/1.49  % (630079)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.49  % (630079)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.49  % (630079)CaDiCaL version: 2.1.3
% 3.70/1.49  % (630079)Termination reason: Refutation
% 3.70/1.49  % (630079)Time elapsed: 0.004 s
% 3.70/1.49  % (630079)Peak memory usage: 89 MB
% 3.70/1.49  % (630079)Instructions burned: 3 (million)
% 3.70/1.49  % (630079)------------------------------
% 3.70/1.49  % (630079)------------------------------
% 3.70/1.49  % (630070)Success in time 0.446 s
% 3.70/1.49  % Vampire exiting
%------------------------------------------------------------------------------