↑ 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  : SWC013-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n008.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:04:17 PM UTC 2026

% Result   : Unsatisfiable 0.19s 0.47s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   73 (  18 unt;   7 def)
%            Number of atoms       :  209 (  30 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  258 ( 122   ~; 129   |;   0   &)
%                                         (   7 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   12 (  10 usr;   8 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn  22   !;   0   ?)

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

fof(f76,axiom,
    ! [X0] :
      ( ~ ssList(X0)
      | ssItem(hd(X0))
      | nil = X0 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause76) ).

fof(f86,axiom,
    ! [X0,X1] :
      ( ~ ssItem(X0)
      | ~ ssList(X1)
      | ssList(cons(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause86) ).

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

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

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

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

fof(f210,negated_conjecture,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk3 = X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).

fof(f211,negated_conjecture,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk1 != X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk2) != X1
      | ~ neq(nil,sk2)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).

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

fof(f218,plain,
    ! [X0,X1] :
      ( ~ ssList(X0)
      | sk3 != X0
      | ~ ssItem(X1)
      | cons(X1,nil) != X0
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f211,f205,f204,f204]) ).

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

fof(f247,plain,
    ! [X1] :
      ( ~ ssList(cons(X1,nil))
      | sk3 = cons(X1,nil)
      | ~ ssItem(X1)
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f210]) ).

fof(f248,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | sk3 = cons(hd(sk4),nil)
    | ~ ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f247]) ).

fof(f249,plain,
    ! [X1] :
      ( ~ ssList(sk3)
      | ~ ssItem(X1)
      | sk3 != cons(X1,nil)
      | hd(sk4) != X1
      | ~ neq(nil,sk4)
      | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f218]) ).

fof(f250,plain,
    ( ~ ssList(sk3)
    | ~ ssItem(hd(sk4))
    | sk3 != cons(hd(sk4),nil)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(equality_resolution,[],[f249]) ).

fof(f285,plain,
    ! [X0] :
      ( ~ ssItem(hd(X0))
      | ~ ssList(X0)
      | nil = X0 ),
    inference(consistent_polarity_flipping,[],[f76]) ).

fof(f289,plain,
    ! [X0,X1] :
      ( ssList(cons(X0,X1))
      | ~ ssList(X1)
      | ssItem(X0) ),
    inference(consistent_polarity_flipping,[],[f86]) ).

fof(f358,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | sk3 = cons(hd(sk4),nil)
    | ssItem(hd(sk4))
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(consistent_polarity_flipping,[],[f248]) ).

fof(f359,plain,
    ( ~ ssList(sk3)
    | ssItem(hd(sk4))
    | sk3 != cons(hd(sk4),nil)
    | ~ neq(nil,sk4)
    | ~ neq(sk4,nil) ),
    inference(consistent_polarity_flipping,[],[f250]) ).

fof(f360,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f214]) ).

fof(f365,plain,
    ! [X1] :
      ( ~ neq(X1,X1)
      | ~ ssList(X1) ),
    inference(duplicate_literal_removal,[],[f225]) ).

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

fof(f369,plain,
    ( neq(sk4,nil)
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f368]) ).

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

fof(f374,plain,
    ( ~ neq(nil,sk4)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f372]) ).

fof(f376,definition,
    ( spl0_3
  <=> sk3 = cons(hd(sk4),nil) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f380,definition,
    ( spl0_4
  <=> ssItem(hd(sk4)) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f382,plain,
    ( ssItem(hd(sk4))
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f380]) ).

fof(f384,definition,
    ( spl0_5
  <=> ssList(sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f387,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | spl0_4
    | ~ spl0_5 ),
    inference(avatar_split_clause,[],[f359,f384,f380,f376,f372,f368]) ).

fof(f389,definition,
    ( spl0_6
  <=> ssList(cons(hd(sk4),nil)) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f391,plain,
    ( ~ ssList(cons(hd(sk4),nil))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f389]) ).

fof(f392,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | spl0_4
    | spl0_3
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f358,f389,f376,f380,f372,f368]) ).

fof(f395,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f360,f368]) ).

fof(f396,plain,
    spl0_5,
    inference(avatar_split_clause,[],[f202,f384]) ).

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

fof(f403,plain,
    ( ssList(nil)
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f402]) ).

fof(f438,plain,
    spl0_8,
    inference(avatar_split_clause,[],[f8,f402]) ).

fof(f546,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk4)
    | nil = sk4
    | spl0_2 ),
    inference(resolution,[],[f102,f374]) ).

fof(f549,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | spl0_2
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f546,f403]) ).

fof(f550,plain,
    ( nil = sk4
    | spl0_2
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f549,f203]) ).

fof(f553,plain,
    ( ~ neq(nil,nil)
    | spl0_2
    | ~ spl0_8 ),
    inference(superposition,[],[f374,f550]) ).

fof(f554,plain,
    ( neq(nil,nil)
    | ~ spl0_1
    | spl0_2
    | ~ spl0_8 ),
    inference(superposition,[],[f369,f550]) ).

fof(f560,plain,
    ( $false
    | ~ spl0_1
    | spl0_2
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f554,f553]) ).

fof(f561,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f560]) ).

fof(f566,plain,
    ( ~ ssList(nil)
    | ssItem(hd(sk4))
    | spl0_6 ),
    inference(resolution,[],[f289,f391]) ).

fof(f569,plain,
    ( ssItem(hd(sk4))
    | spl0_6
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f566,f403]) ).

fof(f570,plain,
    ( spl0_4
    | spl0_6
    | ~ spl0_8 ),
    inference(avatar_split_clause,[],[f569,f402,f389,f380]) ).

fof(f571,plain,
    ( ~ ssList(sk4)
    | nil = sk4
    | ~ spl0_4 ),
    inference(resolution,[],[f382,f285]) ).

fof(f572,plain,
    ( nil = sk4
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f571,f203]) ).

fof(f574,plain,
    ( neq(nil,nil)
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(superposition,[],[f369,f572]) ).

fof(f615,plain,
    ( ~ ssList(nil)
    | ~ spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f574,f365]) ).

fof(f617,plain,
    ( $false
    | ~ spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f615,f403]) ).

fof(f618,plain,
    ( ~ spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f617]) ).

cnf(s1,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3
    | spl0_4
    | ~ spl0_5 ),
    inference(sat_conversion,[],[f387]) ).

cnf(s2,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | spl0_3
    | spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f392]) ).

cnf(s5,plain,
    spl0_1,
    inference(sat_conversion,[],[f395]) ).

cnf(s6,plain,
    spl0_5,
    inference(sat_conversion,[],[f396]) ).

cnf(s17,plain,
    spl0_8,
    inference(sat_conversion,[],[f438]) ).

cnf(s19,plain,
    ( ~ spl0_1
    | spl0_2
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f561]) ).

cnf(s20,plain,
    ( spl0_4
    | spl0_6
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f570]) ).

cnf(s21,plain,
    ( ~ spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f618]) ).

cnf(s26,plain,
    ~ spl0_4,
    inference(rat,[],[s21,s17,s5]) ).

cnf(s27,plain,
    spl0_2,
    inference(rat,[],[s19,s17,s5]) ).

cnf(s28,plain,
    spl0_6,
    inference(rat,[],[s20,s17,s26]) ).

cnf(s29,plain,
    spl0_3,
    inference(rat,[],[s2,s28,s26,s27,s5]) ).

cnf(s30,plain,
    $false,
    inference(rat,[],[s1,s6,s26,s29,s27,s5]) ).

fof(f619,plain,
    $false,
    inference(avatar_sat_refutation,[],[s30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC013-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n008.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 28 07:26:39 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.47  % (2077060)Will run a generic schedule for satisfiability detection.
% 0.19/0.47  % (2077067)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4066813757:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.47  % (2077066)% WARNING: option uhcvi not known.
% 0.19/0.47  % (2077065)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3778275807_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.47  % (2077069)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3902960814:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.47  % (2077066)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=666745619:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.47  % (2077068)dis+10_1_sil=32000:sp=arity:random_seed=39839285:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.47  % (2077071)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1652164147:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.47  % (2077070)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3775937973:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.47  % (2077066) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077060-2077066"...
% 0.19/0.47  % (2077068) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077060-2077068"...
% 0.19/0.47  % (2077066)...printing done.
% 0.19/0.47  % TRYING [1]
% 0.19/0.47  % (2077068)...printing done.
% 0.19/0.47  % (2077069) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2077060-2077069"...
% 0.19/0.47  % (2077066)Refutation found. Thanks to Tanya!
% 0.19/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.48  % (2077066)------------------------------
% 0.19/0.48  % (2077066)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.48  % (2077066)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.48  % (2077066)CaDiCaL version: 2.1.3
% 0.19/0.48  % (2077066)Termination reason: Refutation
% 0.19/0.48  % (2077066)Time elapsed: 0.011 s
% 0.19/0.48  % (2077066)Peak memory usage: 13 MB
% 0.19/0.48  % (2077066)Instructions burned: 14 (million)
% 0.19/0.48  % (2077060)Success in time 0.052 s
% 0.19/0.48  % Vampire exiting
%------------------------------------------------------------------------------