↑ 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  : SWC024-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 : n009.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:20 PM UTC 2026

% Result   : Unsatisfiable 0.38s 0.47s
% Output   : Refutation 0.38s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   22
% Syntax   : Number of formulae    :   78 (  22 unt;   6 def)
%            Number of atoms       :  178 (  32 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  198 (  98   ~;  94   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?)

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

fof(f61,axiom,
    ! [X0] :
      ( frontsegP(X0,X0)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause61) ).

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

fof(f85,axiom,
    ! [X0,X1] :
      ( ssList(app(X1,X0))
      | ~ ssList(X1)
      | ~ ssList(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause85) ).

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(f123,axiom,
    ! [X0,X1] :
      ( app(X0,X1) != nil
      | ~ ssList(X1)
      | ~ ssList(X0)
      | nil = X1 ),
    file('/export/starexec/sandbox2/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(f155,axiom,
    ! [X2,X0,X1] :
      ( app(X0,X1) != X2
      | ~ ssList(X1)
      | ~ ssList(X0)
      | ~ ssList(X2)
      | frontsegP(X2,X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause144) ).

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

fof(f207,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ frontsegP(sk2,X0)
      | ~ frontsegP(sk1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).

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

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

fof(f210,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f209]) ).

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

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

fof(f218,plain,
    ! [X0] :
      ( ~ neq(X0,nil)
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(definition_unfolding,[],[f207,f204,f205]) ).

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

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

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

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

fof(f257,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f214,f254,f250]) ).

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

fof(f264,plain,
    ( ssList(nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f263]) ).

fof(f299,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f8,f263]) ).

fof(f300,plain,
    ( ~ ssList(sk4)
    | ~ frontsegP(sk4,sk4)
    | ~ frontsegP(sk3,sk4) ),
    inference(resolution,[],[f218,f217]) ).

fof(f301,plain,
    ( ~ frontsegP(sk4,sk4)
    | ~ frontsegP(sk3,sk4) ),
    inference(forward_subsumption_resolution,[],[f300,f203]) ).

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

fof(f305,plain,
    ( ~ frontsegP(sk3,sk4)
    | spl0_12 ),
    inference(avatar_component_clause,[],[f303]) ).

fof(f307,definition,
    ( spl0_13
  <=> frontsegP(sk4,sk4) ),
    introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).

fof(f309,plain,
    ( ~ frontsegP(sk4,sk4)
    | spl0_13 ),
    inference(avatar_component_clause,[],[f307]) ).

fof(f310,plain,
    ( ~ spl0_12
    | ~ spl0_13 ),
    inference(avatar_split_clause,[],[f301,f307,f303]) ).

fof(f351,plain,
    sk3 = app(sk3,nil),
    inference(resolution,[],[f73,f202]) ).

fof(f506,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ ssList(nil)
      | nil = X0
      | ~ ssList(X0)
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(resolution,[],[f102,f218]) ).

fof(f509,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ ssList(nil)
      | nil = X0
      | ~ frontsegP(sk4,X0)
      | ~ frontsegP(sk3,X0) ),
    inference(duplicate_literal_removal,[],[f506]) ).

fof(f510,plain,
    ( ! [X0] :
        ( ~ frontsegP(sk4,X0)
        | nil = X0
        | ~ ssList(X0)
        | ~ frontsegP(sk3,X0) )
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f509,f264]) ).

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

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

fof(f602,plain,
    ( sk4 = app(sk3,nil)
    | ~ spl0_14 ),
    inference(superposition,[],[f210,f578]) ).

fof(f607,plain,
    ( sk3 = sk4
    | ~ spl0_14 ),
    inference(forward_demodulation,[],[f602,f351]) ).

fof(f648,plain,
    ( ~ frontsegP(sk3,sk3)
    | spl0_12
    | ~ spl0_14 ),
    inference(superposition,[],[f305,f607]) ).

fof(f680,plain,
    ( nil != sk4
    | ~ ssList(sk5)
    | ~ ssList(sk3)
    | nil = sk5 ),
    inference(superposition,[],[f124,f210]) ).

fof(f681,plain,
    ( ~ ssList(sk3)
    | spl0_12
    | ~ spl0_14 ),
    inference(resolution,[],[f648,f61]) ).

fof(f682,plain,
    ( $false
    | spl0_12
    | ~ spl0_14 ),
    inference(forward_subsumption_resolution,[],[f681,f202]) ).

fof(f683,plain,
    ( spl0_12
    | ~ spl0_14 ),
    inference(avatar_contradiction_clause,[],[f682]) ).

fof(f698,plain,
    ( nil != sk4
    | ~ ssList(sk3)
    | nil = sk5 ),
    inference(forward_subsumption_resolution,[],[f680,f208]) ).

fof(f701,plain,
    ( nil != sk4
    | nil = sk5 ),
    inference(forward_subsumption_resolution,[],[f698,f202]) ).

fof(f704,plain,
    ( spl0_14
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f701,f254,f576]) ).

fof(f706,plain,
    ( ~ ssList(sk4)
    | spl0_13 ),
    inference(resolution,[],[f309,f61]) ).

fof(f707,plain,
    ( $false
    | spl0_13 ),
    inference(forward_subsumption_resolution,[],[f706,f203]) ).

fof(f708,plain,
    spl0_13,
    inference(avatar_contradiction_clause,[],[f707]) ).

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

fof(f1241,plain,
    ( frontsegP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sk5) ),
    inference(superposition,[],[f1221,f210]) ).

fof(f1247,plain,
    ( frontsegP(sk4,sk3)
    | ~ ssList(sk5) ),
    inference(forward_subsumption_resolution,[],[f1241,f202]) ).

fof(f1249,plain,
    frontsegP(sk4,sk3),
    inference(forward_subsumption_resolution,[],[f1247,f208]) ).

fof(f1250,plain,
    ( nil = sk3
    | ~ ssList(sk3)
    | ~ frontsegP(sk3,sk3)
    | ~ spl0_4 ),
    inference(resolution,[],[f1249,f510]) ).

fof(f1252,plain,
    ( ~ ssList(sk3)
    | ~ frontsegP(sk3,sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f1250,f252]) ).

fof(f1253,plain,
    ( ~ frontsegP(sk3,sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f1252,f202]) ).

fof(f1307,plain,
    ( ~ ssList(sk3)
    | spl0_1
    | ~ spl0_4 ),
    inference(resolution,[],[f1253,f61]) ).

fof(f1308,plain,
    ( $false
    | spl0_1
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f1307,f202]) ).

fof(f1309,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(avatar_contradiction_clause,[],[f1308]) ).

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

cnf(s11,plain,
    spl0_4,
    inference(sat_conversion,[],[f299]) ).

cnf(s12,plain,
    ( ~ spl0_12
    | ~ spl0_13 ),
    inference(sat_conversion,[],[f310]) ).

cnf(s16,plain,
    ( spl0_12
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f683]) ).

cnf(s21,plain,
    ( ~ spl0_2
    | spl0_14 ),
    inference(sat_conversion,[],[f704]) ).

cnf(s24,plain,
    spl0_13,
    inference(sat_conversion,[],[f708]) ).

cnf(s59,plain,
    ( spl0_1
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f1309]) ).

cnf(s60,plain,
    ~ spl0_12,
    inference(rat,[],[s12,s24]) ).

cnf(s61,plain,
    ~ spl0_14,
    inference(rat,[],[s16,s60]) ).

cnf(s64,plain,
    ~ spl0_2,
    inference(rat,[],[s21,s61]) ).

cnf(s75,plain,
    spl0_1,
    inference(rat,[],[s59,s11]) ).

cnf(s80,plain,
    $false,
    inference(rat,[],[s1,s64,s75]) ).

fof(f1310,plain,
    $false,
    inference(avatar_sat_refutation,[],[s80]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC024-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n009.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Mon Sep 28 07:30:00 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.38/0.47  % (2861070)Will run a generic schedule for satisfiability detection.
% 0.38/0.47  % (2861077)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=115509688:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.47  % (2861078)dis+10_1_sil=32000:sp=arity:random_seed=1088396593:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.47  % (2861075)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2710970802_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.47  % (2861079)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2638381051:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.47  % (2861080)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1077993222:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.47  % (2861081)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3078403795:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.47  % (2861076)% WARNING: option uhcvi not known.
% 0.38/0.47  % (2861076)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1133334006:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.47  % TRYING [1]
% 0.38/0.47  % TRYING [2]
% 0.38/0.47  % TRYING [3]
% 0.38/0.47  % (2861078) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2861070-2861078"...
% 0.38/0.47  % (2861078)...printing done.
% 0.38/0.47  % (2861078)Refutation found. Thanks to Tanya!
% 0.38/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.38/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.47  % (2861078)------------------------------
% 0.38/0.47  % (2861078)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.47  % (2861078)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.47  % (2861078)CaDiCaL version: 2.1.3
% 0.38/0.47  % (2861078)Termination reason: Refutation
% 0.38/0.47  % (2861078)Time elapsed: 0.024 s
% 0.38/0.47  % (2861078)Peak memory usage: 13 MB
% 0.38/0.47  % (2861078)Instructions burned: 36 (million)
% 0.38/0.47  % (2861070)Success in time 0.065 s
% 0.38/0.47  % Vampire exiting
%------------------------------------------------------------------------------