↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n013.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:27 PM UTC 2026

% Result   : Unsatisfiable 3.55s 1.49s
% Output   : Refutation 3.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   48 (  14 unt;   4 def)
%            Number of atoms       :   99 (  19 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   97 (  46   ~;  47   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?)

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

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause85) ).

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

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

fof(f155,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != X2
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | frontsegP(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause144) ).

fof(f202,negated_conjecture,
    ssList(sk3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).

fof(f204,negated_conjecture,
    sk2 = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).

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

fof(f206,negated_conjecture,
    ssList(sk5),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f208,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f207]) ).

fof(f212,negated_conjecture,
    ( nil = sk4
    | nil != sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f213,negated_conjecture,
    ( nil != sk2
    | nil != sk1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

fof(f214,negated_conjecture,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).

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

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

fof(f221,plain,
    ! [X0,X1] :
      ( ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(app(X0,X1))
      | frontsegP(app(X0,X1),X0) ),
    inference(equality_resolution,[],[f155]) ).

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

fof(f239,plain,
    ( ~ frontsegP(sk4,sk3)
    | spl0_4 ),
    inference(avatar_component_clause,[],[f238]) ).

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

fof(f242,plain,
    ( ~ neq(sk3,nil)
    | spl0_5 ),
    inference(avatar_component_clause,[],[f241]) ).

fof(f243,plain,
    ( ~ spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f218,f241,f238]) ).

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

fof(f246,plain,
    ( nil != sk3
    | spl0_6 ),
    inference(avatar_component_clause,[],[f245]) ).

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

fof(f250,plain,
    ( ~ spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f217,f248,f245]) ).

fof(f252,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(avatar_split_clause,[],[f212,f248,f245]) ).

fof(f287,plain,
    ! [X0,X1] :
      ( frontsegP(app(X0,X1),X0)
      | ~ ssList(X0)
      | ~ ssList(X1) ),
    inference(forward_subsumption_resolution,[],[f221,f85]) ).

fof(f289,plain,
    ( frontsegP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sk5) ),
    inference(superposition,[],[f287,f208]) ).

fof(f297,plain,
    ( ~ ssList(sk3)
    | ~ ssList(sk5)
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f289,f239]) ).

fof(f299,plain,
    ( ~ ssList(sk5)
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f297,f202]) ).

fof(f300,plain,
    ( $false
    | spl0_4 ),
    inference(forward_subsumption_resolution,[],[f299,f206]) ).

fof(f301,plain,
    spl0_4,
    inference(avatar_contradiction_clause,[],[f300]) ).

fof(f304,plain,
    ( ~ ssList(sk3)
    | ~ ssList(nil)
    | nil = sk3
    | spl0_5 ),
    inference(resolution,[],[f242,f102]) ).

fof(f305,plain,
    ( ~ ssList(nil)
    | nil = sk3
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f304,f202]) ).

fof(f306,plain,
    ( nil = sk3
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f305,f8]) ).

fof(f307,plain,
    ( $false
    | spl0_5
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f306,f246]) ).

fof(f308,plain,
    ( spl0_5
    | spl0_6 ),
    inference(avatar_contradiction_clause,[],[f307]) ).

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

cnf(s4,plain,
    ( ~ spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f250]) ).

cnf(s5,plain,
    ( ~ spl0_6
    | spl0_7 ),
    inference(sat_conversion,[],[f252]) ).

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

cnf(s9,plain,
    ( spl0_5
    | spl0_6 ),
    inference(sat_conversion,[],[f308]) ).

cnf(s10,plain,
    ~ spl0_5,
    inference(rat,[],[s3,s8]) ).

cnf(s11,plain,
    spl0_6,
    inference(rat,[],[s9,s10]) ).

cnf(s12,plain,
    spl0_7,
    inference(rat,[],[s5,s11]) ).

cnf(s13,plain,
    $false,
    inference(rat,[],[s4,s12,s11]) ).

fof(f309,plain,
    $false,
    inference(avatar_sat_refutation,[],[s13]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC101-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.38  % Computer : n013.cluster.edu
% 0.13/0.38  % Model    : x86_64 x86_64
% 0.13/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38  % Memory   : 8046.5625MB
% 0.13/0.38  % OS       : Linux 6.8.0-71-generic
% 0.13/0.38  % CPULimit : 300
% 0.13/0.38  % WCLimit  : 300
% 0.13/0.38  % DateTime : Mon Sep 28 07:51:52 UTC 2026
% 0.13/0.38  % CPUTime  : 
% 0.13/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  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.55/1.49  % (1009628)Input is clausal, will run a generic CNF schedule.
% 3.55/1.49  % (1009633)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=1368480842:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.55/1.49  % (1009634)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2411407989:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.55/1.49  % (1009636)lrs+10_1_sil=8000:sp=occurrence:random_seed=2808816993:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.55/1.49  % (1009639)dis-21_1_sil=8000:lcm=predicate:random_seed=1041624360: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.55/1.49  % (1009637)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=636464482:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.55/1.49  % (1009635)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3718650527:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.55/1.49  % (1009638)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=714794590:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.55/1.49  % (1009637)First to succeed.
% 3.55/1.49  % (1009637)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1009628"
% 3.55/1.49  % (1009636)Also succeeded, but the first one will report.
% 3.55/1.49  % (1009638)Also succeeded, but the first one will report.
% 3.55/1.49  % (1009639)Instruction limit reached! 
% 3.55/1.49  % (1009639)------------------------------
% 3.55/1.49  % (1009639)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.49  % (1009639)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.49  % (1009639)CaDiCaL version: 2.1.3
% 3.55/1.49  % (1009639)Termination reason: Instruction limit
% 3.55/1.49  % (1009639)Termination phase: Saturation
% 3.55/1.49  % (1009639)Time elapsed: 0.068 s
% 3.55/1.49  % (1009639)Peak memory usage: 90 MB
% 3.55/1.49  % (1009639)Instructions burned: 119 (million)
% 3.55/1.49  % (1009647)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=4103629794:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 3.55/1.49  % (1009647)Also succeeded, but the first one will report.
% 3.55/1.49  % (1009637)Refutation found. Thanks to Tanya!
% 3.55/1.49  % SZS status Unsatisfiable for theBenchmark
% 3.55/1.49  % SZS output start Proof for theBenchmark
% See solution above
% 3.55/1.49  % (1009637)------------------------------
% 3.55/1.49  % (1009637)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.55/1.49  % (1009637)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.55/1.49  % (1009637)CaDiCaL version: 2.1.3
% 3.55/1.49  % (1009637)Termination reason: Refutation
% 3.55/1.49  % (1009637)Time elapsed: 0.005 s
% 3.55/1.49  % (1009637)Peak memory usage: 90 MB
% 3.55/1.49  % (1009637)Instructions burned: 4 (million)
% 3.55/1.49  % (1009637)------------------------------
% 3.55/1.49  % (1009637)------------------------------
% 3.55/1.49  % (1009628)Success in time 0.418 s
% 3.55/1.49  % Vampire exiting
%------------------------------------------------------------------------------