↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n001.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:05:49 PM UTC 2026

% Result   : Unsatisfiable 0.20s 0.33s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   82 (  19 unt;   9 def)
%            Number of atoms       :  189 (  22 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  198 (  91   ~;  98   |;   0   &)
%                                         (   9 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   16 (  14 usr;  10 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   14 (   0 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ssList(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).

fof(f118,axiom,
    ! [X0,X1] :
      ( X0 != X1
      | ~ neq(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).

fof(f119,axiom,
    ! [X0,X1] :
      ( cons(X0,nil) != X1
      | ~ ssItem(X0)
      | ~ ssList(X1)
      | singletonP(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause116) ).

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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).

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

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,
    neq(sk2,nil),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).

fof(f207,negated_conjecture,
    ( ssItem(sk5)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f209,negated_conjecture,
    ( ssList(sk6)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f210,negated_conjecture,
    ( ssList(sk7)
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).

fof(f212,plain,
    ( sk3 = cons(sk5,nil)
    | nil = sk4 ),
    inference(reorient_equations,[],[f211]) ).

fof(f213,negated_conjecture,
    ( app(app(sk6,sk3),sk7) = sk4
    | nil = sk4 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

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

fof(f225,negated_conjecture,
    ( ~ singletonP(sk1)
    | ~ segmentP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_22) ).

fof(f228,plain,
    neq(sk4,nil),
    inference(definition_unfolding,[],[f206,f204]) ).

fof(f229,plain,
    ( ~ singletonP(sk3)
    | ~ segmentP(sk4,sk3) ),
    inference(definition_unfolding,[],[f225,f205,f204,f205]) ).

fof(f236,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1)
      | ~ ssList(X1) ),
    inference(equality_resolution,[],[f118]) ).

fof(f237,plain,
    ! [X0] :
      ( ~ ssList(cons(X0,nil))
      | ~ ssItem(X0)
      | singletonP(cons(X0,nil)) ),
    inference(equality_resolution,[],[f119]) ).

fof(f244,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(f258,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f236]) ).

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

fof(f263,plain,
    ( ~ segmentP(sk4,sk3)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f261]) ).

fof(f265,definition,
    ( spl0_2
  <=> singletonP(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f268,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f229,f265,f261]) ).

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

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

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

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

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

fof(f294,plain,
    ( ssList(sk7)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f292]) ).

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

fof(f299,plain,
    ( ssList(sk6)
    | ~ spl0_9 ),
    inference(avatar_component_clause,[],[f297]) ).

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

fof(f304,plain,
    ( nil = sk4
    | ~ spl0_10 ),
    inference(avatar_component_clause,[],[f302]) ).

fof(f307,plain,
    ( spl0_10
    | spl0_6 ),
    inference(avatar_split_clause,[],[f214,f282,f302]) ).

fof(f308,plain,
    ( spl0_10
    | spl0_7 ),
    inference(avatar_split_clause,[],[f212,f287,f302]) ).

fof(f309,plain,
    ( spl0_10
    | spl0_8 ),
    inference(avatar_split_clause,[],[f210,f292,f302]) ).

fof(f310,plain,
    ( spl0_10
    | spl0_9 ),
    inference(avatar_split_clause,[],[f209,f297,f302]) ).

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

fof(f314,plain,
    ( ssItem(sk5)
    | ~ spl0_11 ),
    inference(avatar_component_clause,[],[f312]) ).

fof(f316,plain,
    ( spl0_10
    | spl0_11 ),
    inference(avatar_split_clause,[],[f207,f312,f302]) ).

fof(f322,definition,
    ( spl0_13
  <=> ssList(nil) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f323,plain,
    ( ssList(nil)
    | ~ spl0_13 ),
    inference(avatar_component_clause,[],[f322]) ).

fof(f358,plain,
    spl0_13,
    inference(avatar_split_clause,[],[f8,f322]) ).

fof(f362,plain,
    ( neq(nil,nil)
    | ~ spl0_10 ),
    inference(superposition,[],[f228,f304]) ).

fof(f405,plain,
    ( ~ ssList(nil)
    | ~ spl0_10 ),
    inference(resolution,[],[f258,f362]) ).

fof(f406,plain,
    ( $false
    | ~ spl0_10
    | ~ spl0_13 ),
    inference(forward_subsumption_resolution,[],[f405,f323]) ).

fof(f407,plain,
    ( ~ spl0_10
    | ~ spl0_13 ),
    inference(avatar_contradiction_clause,[],[f406]) ).

fof(f682,plain,
    ( ~ ssList(sk3)
    | ~ ssItem(sk5)
    | singletonP(sk3)
    | ~ spl0_7 ),
    inference(superposition,[],[f237,f289]) ).

fof(f684,plain,
    ( ~ ssItem(sk5)
    | singletonP(sk3)
    | ~ spl0_7 ),
    inference(forward_subsumption_resolution,[],[f682,f202]) ).

fof(f686,plain,
    ( singletonP(sk3)
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(forward_subsumption_resolution,[],[f684,f314]) ).

fof(f689,plain,
    ( spl0_2
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(avatar_split_clause,[],[f686,f312,f287,f265]) ).

fof(f2209,plain,
    ( segmentP(sk4,sk3)
    | ~ ssList(sk6)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | ~ spl0_6 ),
    inference(superposition,[],[f244,f284]) ).

fof(f2214,plain,
    ( ~ ssList(sk6)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_1
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f2209,f263]) ).

fof(f2220,plain,
    ( ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_1
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f2214,f299]) ).

fof(f2226,plain,
    ( ~ ssList(sk4)
    | ~ ssList(sk7)
    | spl0_1
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f2220,f202]) ).

fof(f2227,plain,
    ( ~ ssList(sk7)
    | spl0_1
    | ~ spl0_6
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f2226,f203]) ).

fof(f2228,plain,
    ( $false
    | spl0_1
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(forward_subsumption_resolution,[],[f2227,f294]) ).

fof(f2229,plain,
    ( spl0_1
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(avatar_contradiction_clause,[],[f2228]) ).

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

cnf(s10,plain,
    ( spl0_6
    | spl0_10 ),
    inference(sat_conversion,[],[f307]) ).

cnf(s11,plain,
    ( spl0_7
    | spl0_10 ),
    inference(sat_conversion,[],[f308]) ).

cnf(s12,plain,
    ( spl0_8
    | spl0_10 ),
    inference(sat_conversion,[],[f309]) ).

cnf(s13,plain,
    ( spl0_9
    | spl0_10 ),
    inference(sat_conversion,[],[f310]) ).

cnf(s15,plain,
    ( spl0_10
    | spl0_11 ),
    inference(sat_conversion,[],[f316]) ).

cnf(s25,plain,
    spl0_13,
    inference(sat_conversion,[],[f358]) ).

cnf(s29,plain,
    ( ~ spl0_10
    | ~ spl0_13 ),
    inference(sat_conversion,[],[f407]) ).

cnf(s32,plain,
    ( spl0_2
    | ~ spl0_7
    | ~ spl0_11 ),
    inference(sat_conversion,[],[f689]) ).

cnf(s101,plain,
    ( spl0_1
    | ~ spl0_6
    | ~ spl0_8
    | ~ spl0_9 ),
    inference(sat_conversion,[],[f2229]) ).

cnf(s102,plain,
    ~ spl0_10,
    inference(rat,[],[s29,s25]) ).

cnf(s107,plain,
    spl0_11,
    inference(rat,[],[s15,s102]) ).

cnf(s109,plain,
    spl0_9,
    inference(rat,[],[s13,s102]) ).

cnf(s112,plain,
    spl0_8,
    inference(rat,[],[s12,s102]) ).

cnf(s113,plain,
    spl0_7,
    inference(rat,[],[s11,s102]) ).

cnf(s114,plain,
    spl0_2,
    inference(rat,[],[s32,s107,s113]) ).

cnf(s121,plain,
    spl0_6,
    inference(rat,[],[s10,s102]) ).

cnf(s122,plain,
    spl0_1,
    inference(rat,[],[s101,s109,s112,s121]) ).

cnf(s131,plain,
    $false,
    inference(rat,[],[s1,s114,s122]) ).

fof(f2230,plain,
    $false,
    inference(avatar_sat_refutation,[],[s131]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC384-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  % Computer : n001.cluster.edu
% 0.08/0.21  % Model    : x86_64 x86_64
% 0.08/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.21  % Memory   : 8046.5625MB
% 0.08/0.21  % OS       : Linux 6.8.0-71-generic
% 0.08/0.21  % CPULimit : 300
% 0.08/0.21  % WCLimit  : 300
% 0.08/0.21  % DateTime : Mon Sep 28 09:29:33 UTC 2026
% 0.08/0.21  % CPUTime  : 
% 0.08/0.21  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.24  Running first-order model finding
% 0.08/0.24  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.33  % (241158)Will run a generic schedule for satisfiability detection.
% 0.20/0.33  % (241167)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2144925030:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.33  % (241164)% WARNING: option uhcvi not known.
% 0.20/0.33  % (241163)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2628335821_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.33  % (241164)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3668607371:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.33  % (241165)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=672700960:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.33  % (241166)dis+10_1_sil=32000:sp=arity:random_seed=722813984:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.33  % (241168)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=318399013:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.33  % (241169)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2783071979:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.33  % TRYING [1]
% 0.20/0.33  % TRYING [2]
% 0.20/0.33  % TRYING [3]
% 0.20/0.33  % (241167)Instruction limit reached! 
% 0.20/0.33  % (241167)------------------------------
% 0.20/0.33  % (241167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33  % (241167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33  % (241167)CaDiCaL version: 2.1.3
% 0.20/0.33  % (241167)Termination reason: Instruction limit
% 0.20/0.33  % (241167)Termination phase: Saturation
% 0.20/0.33  % (241167)Time elapsed: 0.032 s
% 0.20/0.33  % (241167)Peak memory usage: 13 MB
% 0.20/0.33  % (241167)Instructions burned: 116 (million)
% 0.20/0.33  % (241177)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3623865803:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.33  % (241166) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-241158-241166"...
% 0.20/0.33  % (241164) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-241158-241164"...
% 0.20/0.33  % TRYING [4]
% 0.20/0.33  % (241166)...printing done.
% 0.20/0.33  % (241164)...printing done.
% 0.20/0.33  % (241166)Refutation found. Thanks to Tanya!
% 0.20/0.33  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.33  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.33  % (241166)------------------------------
% 0.20/0.33  % (241166)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.33  % (241166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.33  % (241166)CaDiCaL version: 2.1.3
% 0.20/0.33  % (241166)Termination reason: Refutation
% 0.20/0.33  % (241166)Time elapsed: 0.037 s
% 0.20/0.33  % (241166)Peak memory usage: 13 MB
% 0.20/0.33  % (241166)Instructions burned: 60 (million)
% 0.20/0.33  % (241158)Success in time 0.079 s
% 0.20/0.33  % Vampire exiting
%------------------------------------------------------------------------------