↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : SWC346-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 : n026.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:34 PM UTC 2026

% Result   : Unsatisfiable 0.21s 1.20s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   75 (  13 unt;   8 def)
%            Number of atoms       :  177 (  20 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  182 (  80   ~;  94   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   9 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause3) ).

fof(f56,axiom,
    ! [X0] :
      ( segmentP(X0,nil)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause56) ).

fof(f66,axiom,
    ! [X0] :
      ( strictorderedP(cons(X0,nil))
      | ~ ssItem(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause66) ).

fof(f187,axiom,
    ! [X2,X3,X0,X1] :
      ( app(app(X0,X1),X2) != X3
      | ~ ssList(X2)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(X3)
      | segmentP(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause173) ).

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

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

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(f207,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

fof(f216,negated_conjecture,
    ( ssList(sk6)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).

fof(f217,negated_conjecture,
    ( ssList(sk7)
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f218,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).

fof(f219,plain,
    ( sk3 = cons(sk5,nil)
    | nil = sk3 ),
    inference(reorient_equations,[],[f218]) ).

fof(f220,negated_conjecture,
    ( app(app(sk6,sk3),sk7) = sk4
    | nil = sk3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

fof(f221,plain,
    ( sk4 = app(app(sk6,sk3),sk7)
    | nil = sk3 ),
    inference(reorient_equations,[],[f220]) ).

fof(f224,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ strictorderedP(sk1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_21) ).

fof(f227,plain,
    ( ~ segmentP(sk4,sk3)
    | ~ strictorderedP(sk3) ),
    inference(definition_unfolding,[],[f224,f204,f205,f205]) ).

fof(f235,plain,
    ! [X2,X0,X1] :
      ( segmentP(app(app(X0,X1),X2),X1)
      | ~ ssList(X0)
      | ~ ssList(X1)
      | ~ ssList(app(app(X0,X1),X2))
      | ~ ssList(X2) ),
    inference(equality_resolution,[],[f187]) ).

fof(f241,definition,
    ( spl0_1
  <=> strictorderedP(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f243,plain,
    ( ~ strictorderedP(sk3)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f241]) ).

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

fof(f247,plain,
    ( ~ segmentP(sk4,sk3)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f248,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f227,f245,f241]) ).

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

fof(f252,plain,
    ( nil = sk3
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f250]) ).

fof(f262,definition,
    ( spl0_6
  <=> sk4 = app(app(sk6,sk3),sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f264,plain,
    ( sk4 = app(app(sk6,sk3),sk7)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f262]) ).

fof(f265,plain,
    ( spl0_3
    | spl0_6 ),
    inference(avatar_split_clause,[],[f221,f262,f250]) ).

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

fof(f269,plain,
    ( sk3 = cons(sk5,nil)
    | ~ spl0_7 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f270,plain,
    ( spl0_3
    | spl0_7 ),
    inference(avatar_split_clause,[],[f219,f267,f250]) ).

fof(f272,definition,
    ( spl0_8
  <=> ssList(sk7) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f274,plain,
    ( ssList(sk7)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f272]) ).

fof(f275,plain,
    ( spl0_3
    | spl0_8 ),
    inference(avatar_split_clause,[],[f217,f272,f250]) ).

fof(f277,definition,
    ( spl0_9
  <=> ssList(sk6) ),
    introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).

fof(f279,plain,
    ( ssList(sk6)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f277]) ).

fof(f280,plain,
    ( spl0_3
    | spl0_9 ),
    inference(avatar_split_clause,[],[f216,f277,f250]) ).

fof(f292,definition,
    ( spl0_11
  <=> ssItem(sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).

fof(f294,plain,
    ( ssItem(sk5)
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f292]) ).

fof(f295,plain,
    ( spl0_3
    | spl0_11 ),
    inference(avatar_split_clause,[],[f207,f292,f250]) ).

fof(f297,plain,
    ( ~ segmentP(sk4,nil)
    | spl0_2
    | ~ spl0_3 ),
    inference(superposition,[],[f247,f252]) ).

fof(f307,plain,
    ( strictorderedP(sk3)
    | ~ ssItem(sk5)
    | ~ spl0_7 ),
    inference(superposition,[],[f66,f269]) ).

fof(f308,plain,
    ( strictorderedP(sk3)
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f307,f294]) ).

fof(f309,plain,
    ( spl0_1
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(avatar_split_clause,[],[f308,f292,f267,f241]) ).

fof(f414,plain,
    ( ~ strictorderedP(nil)
    | spl0_1
    | ~ spl0_3 ),
    inference(superposition,[],[f243,f252]) ).

fof(f421,plain,
    ( $false
    | spl0_1
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f414,f3]) ).

fof(f422,plain,
    ( spl0_1
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f421]) ).

fof(f434,plain,
    ( ~ ssList(sk4)
    | spl0_2
    | ~ spl0_3 ),
    inference(resolution,[],[f297,f56]) ).

fof(f435,plain,
    ( $false
    | spl0_2
    | ~ spl0_3 ),
    inference(forward_subsumption_resolution,[],[f434,f203]) ).

fof(f436,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(avatar_contradiction_clause,[],[f435]) ).

fof(f940,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk6)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | ~ spl0_6 ),
    inference(superposition,[],[f235,f264]) ).

fof(f944,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_2
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f940,f247]) ).

fof(f950,plain,
    ( ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_2
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f944,f279]) ).

fof(f956,plain,
    ( ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_2
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f950,f202]) ).

fof(f961,plain,
    ( ~ ssList(sk7)
    | spl0_2
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f956,f203]) ).

fof(f962,plain,
    ( $false
    | spl0_2
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f961,f274]) ).

fof(f963,plain,
    ( spl0_2
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f962]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f248]) ).

cnf(s4,plain,
    ( spl0_3
    | spl0_6 ),
    inference(sat_conversion,[],[f265]) ).

cnf(s5,plain,
    ( spl0_3
    | spl0_7 ),
    inference(sat_conversion,[],[f270]) ).

cnf(s6,plain,
    ( spl0_3
    | spl0_8 ),
    inference(sat_conversion,[],[f275]) ).

cnf(s7,plain,
    ( spl0_3
    | spl0_9 ),
    inference(sat_conversion,[],[f280]) ).

cnf(s14,plain,
    ( spl0_3
    | spl0_11 ),
    inference(sat_conversion,[],[f295]) ).

cnf(s17,plain,
    ( spl0_1
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(sat_conversion,[],[f309]) ).

cnf(s21,plain,
    ( spl0_1
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f422]) ).

cnf(s22,plain,
    ( spl0_2
    | ~ spl0_3 ),
    inference(sat_conversion,[],[f436]) ).

cnf(s37,plain,
    ( spl0_2
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f963]) ).

cnf(s39,plain,
    spl0_1,
    inference(rat,[],[s17,s5,s14,s21]) ).

cnf(s40,plain,
    ~ spl0_2,
    inference(rat,[],[s1,s39]) ).

cnf(s41,plain,
    ~ spl0_3,
    inference(rat,[],[s22,s40]) ).

cnf(s43,plain,
    spl0_9,
    inference(rat,[],[s7,s41]) ).

cnf(s44,plain,
    spl0_8,
    inference(rat,[],[s6,s41]) ).

cnf(s46,plain,
    spl0_6,
    inference(rat,[],[s4,s41]) ).

cnf(s52,plain,
    $false,
    inference(rat,[],[s37,s43,s40,s44,s46]) ).

fof(f964,plain,
    $false,
    inference(avatar_sat_refutation,[],[s52]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC346-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.10/0.19  % Computer : n026.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 09:14:41 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.23  Running first-order theorem proving
% 0.10/0.23  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
% 0.21/1.20  % (3713291)Input is clausal, will run a generic CNF schedule.
% 0.21/1.20  % (3713296)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=1942996449:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.21/1.20  % (3713299)lrs+10_1_sil=8000:sp=occurrence:random_seed=634598501:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.21/1.20  % (3713297)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=302489366:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.21/1.20  % (3713300)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2449782570:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.21/1.20  % (3713298)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2768454960:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.21/1.20  % (3713302)dis-21_1_sil=8000:lcm=predicate:random_seed=874799311: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.21/1.20  % (3713301)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2066147473:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.21/1.20  % (3713299)First to succeed.
% 0.21/1.20  % (3713299)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-3713291"
% 0.21/1.20  % (3713301)Also succeeded, but the first one will report.
% 0.21/1.20  % (3713300)Also succeeded, but the first one will report.
% 0.21/1.20  % (3713302)Instruction limit reached! 
% 0.21/1.20  % (3713302)------------------------------
% 0.21/1.20  % (3713302)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.20  % (3713302)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.20  % (3713302)CaDiCaL version: 2.1.3
% 0.21/1.20  % (3713302)Termination reason: Instruction limit
% 0.21/1.20  % (3713302)Termination phase: Saturation
% 0.21/1.20  % (3713302)Time elapsed: 0.052 s
% 0.21/1.20  % (3713302)Peak memory usage: 89 MB
% 0.21/1.20  % (3713302)Instructions burned: 118 (million)
% 0.21/1.20  % (3713310)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=4252241266:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 0.21/1.20  % (3713310)Also succeeded, but the first one will report.
% 0.21/1.20  % (3713299)Refutation found. Thanks to Tanya!
% 0.21/1.20  % SZS status Unsatisfiable for theBenchmark
% 0.21/1.20  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/1.20  % (3713299)------------------------------
% 0.21/1.20  % (3713299)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.21/1.20  % (3713299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/1.20  % (3713299)CaDiCaL version: 2.1.3
% 0.21/1.20  % (3713299)Termination reason: Refutation
% 0.21/1.20  % (3713299)Time elapsed: 0.017 s
% 0.21/1.20  % (3713299)Peak memory usage: 90 MB
% 0.21/1.20  % (3713299)Instructions burned: 23 (million)
% 0.21/1.20  % (3713299)------------------------------
% 0.21/1.20  % (3713299)------------------------------
% 0.21/1.20  % (3713291)Success in time 0.431 s
% 0.21/1.20  % Vampire exiting
%------------------------------------------------------------------------------