↑ 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  : SWC254-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 : n011.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:16 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   39 (  11 unt;   4 def)
%            Number of atoms       :   78 (   7 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   75 (  36   ~;  35   |;   0   &)
%                                         (   4 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   8 usr;   5 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    3 (   0 sgn   3   !;   0   ?)

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

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

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(f215,negated_conjecture,
    ( ssItem(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).

fof(f217,negated_conjecture,
    ( cons(sk5,nil) = sk3
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).

fof(f218,plain,
    ( sk3 = cons(sk5,nil)
    | ~ neq(sk4,nil) ),
    inference(reorient_equations,[],[f217]) ).

fof(f221,negated_conjecture,
    ( ~ singletonP(sk1)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).

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

fof(f231,plain,
    ( ~ singletonP(sk3)
    | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f221,f205]) ).

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

fof(f256,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f224]) ).

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

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

fof(f270,plain,
    ( ~ singletonP(sk3)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f268]) ).

fof(f271,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f231,f268,f264]) ).

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

fof(f280,plain,
    ( sk3 = cons(sk5,nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f278]) ).

fof(f281,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f218,f278,f264]) ).

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

fof(f290,plain,
    ( ssItem(sk5)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f288]) ).

fof(f291,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(avatar_split_clause,[],[f215,f288,f264]) ).

fof(f297,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f256,f264]) ).

fof(f625,plain,
    ( ~ ssList(sk3)
    | ~ ssItem(sk5)
    | singletonP(sk3)
    | ~ spl0_4 ),
    inference(superposition,[],[f239,f280]) ).

fof(f627,plain,
    ( ~ ssItem(sk5)
    | singletonP(sk3)
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f625,f202]) ).

fof(f629,plain,
    ( singletonP(sk3)
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f627,f290]) ).

fof(f630,plain,
    ( $false
    | spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f629,f270]) ).

fof(f631,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f630]) ).

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

cnf(s3,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(sat_conversion,[],[f281]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(sat_conversion,[],[f291]) ).

cnf(s11,plain,
    spl0_1,
    inference(sat_conversion,[],[f297]) ).

cnf(s22,plain,
    ( spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f631]) ).

cnf(s27,plain,
    spl0_6,
    inference(rat,[],[s5,s11]) ).

cnf(s29,plain,
    spl0_4,
    inference(rat,[],[s3,s11]) ).

cnf(s30,plain,
    spl0_2,
    inference(rat,[],[s22,s27,s29]) ).

cnf(s32,plain,
    $false,
    inference(rat,[],[s1,s30,s11]) ).

fof(f632,plain,
    $false,
    inference(avatar_sat_refutation,[],[s32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC254-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.08/0.17  % Computer : n011.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Mon Sep 28 08:42:45 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20  Running first-order model finding
% 0.08/0.20  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.08/0.26  % (3255206)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (3255211)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1560076993_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % (3255212)% WARNING: option uhcvi not known.
% 0.08/0.26  % TRYING [1]
% 0.08/0.26  % TRYING [2]
% 0.08/0.26  % (3255213)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3548506434:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (3255214)dis+10_1_sil=32000:sp=arity:random_seed=2249100985:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (3255215)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1697418765:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (3255216)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=590129400:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26  % (3255217)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3557752091:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26  % TRYING [3]
% 0.08/0.26  % (3255212)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3207209172:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (3255214) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3255206-3255214"...
% 0.08/0.26  % TRYING [4]
% 0.08/0.26  % (3255212) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3255206-3255212"...
% 0.08/0.26  % (3255214)...printing done.
% 0.08/0.26  % (3255214)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (3255214)------------------------------
% 0.08/0.26  % (3255214)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (3255214)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (3255214)CaDiCaL version: 2.1.3
% 0.08/0.26  % (3255214)Termination reason: Refutation
% 0.08/0.26  % (3255214)Time elapsed: 0.011 s
% 0.08/0.26  % (3255214)Peak memory usage: 12 MB
% 0.08/0.26  % (3255214)Instructions burned: 16 (million)
% 0.08/0.26  % (3255206)Success in time 0.048 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------