↑ 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  : SWC030-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 : n018.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:22 PM UTC 2026

% Result   : Unsatisfiable 0.18s 0.47s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   89 (  18 unt;   6 def)
%            Number of atoms       :  227 (  75 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  268 ( 130   ~; 132   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   7 usr;   7 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?)

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

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

fof(f122,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X0 ),
    inference(reorient_equations,[],[f121]) ).

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

fof(f124,plain,
    ! [X0,X1] :
      ( nil != app(X0,X1)
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X1 ),
    inference(reorient_equations,[],[f123]) ).

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

fof(f157,plain,
    ! [X0,X1] :
      ( nil != X0
      | nil != X1
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = app(X0,X1) ),
    inference(reorient_equations,[],[f156]) ).

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

fof(f207,negated_conjecture,
    ssList(sk6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    app(sk5,sk6) = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f209,plain,
    sk4 = app(sk5,sk6),
    inference(reorient_equations,[],[f208]) ).

fof(f210,negated_conjecture,
    app(sk6,sk5) = sk3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).

fof(f211,plain,
    sk3 = app(sk6,sk5),
    inference(reorient_equations,[],[f210]) ).

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

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

fof(f218,plain,
    ( nil = sk4
    | nil = sk3 ),
    inference(definition_unfolding,[],[f212,f204,f205]) ).

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

fof(f234,plain,
    ! [X1] :
      ( nil != X1
      | ~ ssList(X1)
      | ~ ssList(nil)
      | nil = app(nil,X1) ),
    inference(equality_resolution,[],[f157]) ).

fof(f235,plain,
    ( ~ ssList(nil)
    | ~ ssList(nil)
    | nil = app(nil,nil) ),
    inference(equality_resolution,[],[f234]) ).

fof(f247,plain,
    ( ~ ssList(nil)
    | nil = app(nil,nil) ),
    inference(duplicate_literal_removal,[],[f235]) ).

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

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

fof(f258,plain,
    ( nil = sk3
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f259,plain,
    ( nil != sk3
    | spl0_2 ),
    inference(avatar_component_clause,[],[f257]) ).

fof(f260,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f221,f257,f253]) ).

fof(f261,plain,
    ( spl0_2
    | spl0_1 ),
    inference(avatar_split_clause,[],[f218,f253,f257]) ).

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

fof(f265,plain,
    ( nil = app(nil,nil)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f263]) ).

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

fof(f268,plain,
    ( ssList(nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f267]) ).

fof(f270,plain,
    ( spl0_3
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f247,f267,f263]) ).

fof(f303,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f8,f267]) ).

fof(f306,plain,
    ( nil = app(sk6,sk5)
    | ~ spl0_2 ),
    inference(forward_demodulation,[],[f211,f258]) ).

fof(f574,definition,
    ( spl0_12
  <=> nil = sk6 ),
    introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).

fof(f575,plain,
    ( nil != sk6
    | spl0_12 ),
    inference(avatar_component_clause,[],[f574]) ).

fof(f576,plain,
    ( nil = sk6
    | ~ spl0_12 ),
    inference(avatar_component_clause,[],[f574]) ).

fof(f583,definition,
    ( spl0_14
  <=> nil = sk5 ),
    introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).

fof(f584,plain,
    ( nil != sk5
    | spl0_14 ),
    inference(avatar_component_clause,[],[f583]) ).

fof(f585,plain,
    ( nil = sk5
    | ~ spl0_14 ),
    inference(avatar_component_clause,[],[f583]) ).

fof(f643,plain,
    ( sk4 = app(nil,sk6)
    | ~ spl0_14 ),
    inference(superposition,[],[f209,f585]) ).

fof(f650,plain,
    ( sk4 = app(nil,nil)
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f643,f576]) ).

fof(f651,plain,
    ( nil = sk4
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f650,f265]) ).

fof(f668,plain,
    ( nil != sk4
    | ~ ssList(sk6)
    | ~ ssList(sk5)
    | nil = sk5 ),
    inference(superposition,[],[f122,f209]) ).

fof(f676,plain,
    ( nil != sk4
    | ~ ssList(sk6)
    | ~ ssList(sk5)
    | nil = sk6 ),
    inference(superposition,[],[f124,f209]) ).

fof(f677,plain,
    ( nil != nil
    | ~ ssList(sk5)
    | ~ ssList(sk6)
    | nil = sk5
    | ~ spl0_2 ),
    inference(superposition,[],[f124,f306]) ).

fof(f678,plain,
    ( ~ ssList(sk5)
    | ~ ssList(sk6)
    | nil = sk5
    | ~ spl0_2 ),
    inference(trivial_inequality_removal,[],[f677]) ).

fof(f679,plain,
    ( ~ ssList(sk6)
    | nil = sk5
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f678,f206]) ).

fof(f680,plain,
    ( nil = sk5
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f679,f207]) ).

fof(f681,plain,
    ( $false
    | ~ spl0_2
    | spl0_14 ),
    inference(forward_subsumption_resolution,[],[f680,f584]) ).

fof(f682,plain,
    ( ~ spl0_2
    | spl0_14 ),
    inference(avatar_contradiction_clause,[],[f681]) ).

fof(f683,plain,
    ( sk3 = app(nil,sk5)
    | ~ spl0_12 ),
    inference(forward_demodulation,[],[f211,f576]) ).

fof(f704,plain,
    ( nil != sk4
    | ~ ssList(sk5)
    | nil = sk5 ),
    inference(forward_subsumption_resolution,[],[f668,f207]) ).

fof(f705,plain,
    ( nil != sk4
    | nil = sk5 ),
    inference(forward_subsumption_resolution,[],[f704,f206]) ).

fof(f706,plain,
    ( spl0_14
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f705,f253,f583]) ).

fof(f707,plain,
    ( spl0_1
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(avatar_split_clause,[],[f651,f583,f574,f263,f253]) ).

fof(f721,plain,
    ( sk3 = app(nil,nil)
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f683,f585]) ).

fof(f722,plain,
    ( nil = sk3
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f721,f265]) ).

fof(f723,plain,
    ( $false
    | spl0_2
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f722,f259]) ).

fof(f724,plain,
    ( spl0_2
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(avatar_contradiction_clause,[],[f723]) ).

fof(f730,plain,
    ( sk3 = app(sk6,nil)
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f211,f585]) ).

fof(f736,plain,
    ( nil != sk4
    | ~ ssList(sk5)
    | nil = sk6 ),
    inference(forward_subsumption_resolution,[],[f676,f207]) ).

fof(f737,plain,
    ( nil != sk4
    | nil = sk6 ),
    inference(forward_subsumption_resolution,[],[f736,f206]) ).

fof(f738,plain,
    ( spl0_12
    | ~ spl0_1 ),
    inference(avatar_split_clause,[],[f737,f253,f574]) ).

fof(f740,plain,
    ( nil = app(sk6,nil)
    | ~ spl0_2
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f730,f258]) ).

fof(f743,plain,
    ( nil != nil
    | ~ ssList(nil)
    | ~ ssList(sk6)
    | nil = sk6
    | ~ spl0_2
    | ~ spl0_14 ),
    inference(superposition,[],[f122,f740]) ).

fof(f745,plain,
    ( ~ ssList(nil)
    | ~ ssList(sk6)
    | nil = sk6
    | ~ spl0_2
    | ~ spl0_14 ),
    inference(trivial_inequality_removal,[],[f743]) ).

fof(f746,plain,
    ( ~ ssList(sk6)
    | nil = sk6
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f745,f268]) ).

fof(f751,plain,
    ( nil = sk6
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f746,f207]) ).

fof(f752,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_4
    | spl0_12
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f751,f575]) ).

fof(f753,plain,
    ( ~ spl0_2
    | ~ spl0_4
    | spl0_12
    | ~ spl0_14 ),
    inference(avatar_contradiction_clause,[],[f752]) ).

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

cnf(s2,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f261]) ).

cnf(s3,plain,
    ( spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f270]) ).

cnf(s12,plain,
    spl0_4,
    inference(sat_conversion,[],[f303]) ).

cnf(s18,plain,
    ( ~ spl0_2
    | spl0_14 ),
    inference(sat_conversion,[],[f682]) ).

cnf(s23,plain,
    ( ~ spl0_1
    | spl0_14 ),
    inference(sat_conversion,[],[f706]) ).

cnf(s24,plain,
    ( spl0_1
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f707]) ).

cnf(s25,plain,
    ( spl0_2
    | ~ spl0_3
    | ~ spl0_12
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f724]) ).

cnf(s28,plain,
    ( ~ spl0_1
    | spl0_12 ),
    inference(sat_conversion,[],[f738]) ).

cnf(s31,plain,
    ( ~ spl0_2
    | ~ spl0_4
    | spl0_12
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f753]) ).

cnf(s35,plain,
    spl0_3,
    inference(rat,[],[s3,s12]) ).

cnf(s36,plain,
    spl0_1,
    inference(rat,[],[s24,s31,s18,s2,s35,s12]) ).

cnf(s37,plain,
    spl0_12,
    inference(rat,[],[s28,s36]) ).

cnf(s38,plain,
    spl0_14,
    inference(rat,[],[s23,s36]) ).

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

cnf(s40,plain,
    $false,
    inference(rat,[],[s25,s39,s35,s37,s38]) ).

fof(f754,plain,
    $false,
    inference(avatar_sat_refutation,[],[s40]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC030-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.12/0.37  % Computer : n018.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 28 07:34:10 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.18/0.47  % (3208646)Will run a generic schedule for satisfiability detection.
% 0.18/0.47  % (3208651)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=784096855_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.47  % (3208652)% WARNING: option uhcvi not known.
% 0.18/0.47  % TRYING [1]
% 0.18/0.47  % (3208652)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2412160880:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.47  % TRYING [2]
% 0.18/0.47  % (3208655)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3617626025:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.47  % (3208653)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4178509405:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.47  % (3208654)dis+10_1_sil=32000:sp=arity:random_seed=2820791604:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.47  % (3208656)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=27905224:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.47  % (3208657)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3333994616:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.47  % TRYING [3]
% 0.18/0.47  % (3208654) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3208646-3208654"...
% 0.18/0.47  % TRYING [4]
% 0.18/0.47  % (3208652) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3208646-3208652"...
% 0.18/0.47  % (3208654)...printing done.
% 0.18/0.47  % (3208652)...printing done.
% 0.18/0.47  % (3208654)Refutation found. Thanks to Tanya!
% 0.18/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.47  % (3208654)------------------------------
% 0.18/0.47  % (3208654)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.47  % (3208654)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.47  % (3208654)CaDiCaL version: 2.1.3
% 0.18/0.47  % (3208654)Termination reason: Refutation
% 0.18/0.47  % (3208654)Time elapsed: 0.015 s
% 0.18/0.47  % (3208654)Peak memory usage: 12 MB
% 0.18/0.47  % (3208654)Instructions burned: 22 (million)
% 0.18/0.47  % (3208646)Success in time 0.051 s
% 0.18/0.47  % Vampire exiting
%------------------------------------------------------------------------------