↑ 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  : SWC050-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 : n014.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:27 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (  12 unt;   6 def)
%            Number of atoms       :  113 (   2 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  134 (  68   ~;  60   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   7 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?)

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

fof(f213,negated_conjecture,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ rearsegP(sk2,X0)
      | ~ rearsegP(sk1,X0)
      | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).

fof(f214,negated_conjecture,
    ( ssList(sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).

fof(f215,negated_conjecture,
    ( neq(sk5,nil)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_16) ).

fof(f216,negated_conjecture,
    ( rearsegP(sk4,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_17) ).

fof(f217,negated_conjecture,
    ( rearsegP(sk3,sk5)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_18) ).

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

fof(f227,plain,
    ! [X0] :
      ( ~ ssList(X0)
      | ~ neq(X0,nil)
      | ~ rearsegP(sk4,X0)
      | ~ rearsegP(sk3,X0)
      | ~ neq(sk4,nil) ),
    inference(definition_unfolding,[],[f213,f204,f205]) ).

fof(f252,plain,
    neq(sk4,nil),
    inference(duplicate_literal_removal,[],[f220]) ).

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

fof(f264,definition,
    ( spl0_2
  <=> rearsegP(sk3,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f266,plain,
    ( rearsegP(sk3,sk5)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f264]) ).

fof(f267,plain,
    ( ~ spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f217,f264,f260]) ).

fof(f269,definition,
    ( spl0_3
  <=> rearsegP(sk4,sk5) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f271,plain,
    ( rearsegP(sk4,sk5)
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f269]) ).

fof(f272,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(avatar_split_clause,[],[f216,f269,f260]) ).

fof(f274,definition,
    ( spl0_4
  <=> neq(sk5,nil) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f276,plain,
    ( neq(sk5,nil)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f274]) ).

fof(f277,plain,
    ( ~ spl0_1
    | spl0_4 ),
    inference(avatar_split_clause,[],[f215,f274,f260]) ).

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

fof(f281,plain,
    ( ssList(sk5)
    | ~ spl0_5 ),
    inference(avatar_component_clause,[],[f279]) ).

fof(f282,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(avatar_split_clause,[],[f214,f279,f260]) ).

fof(f284,definition,
    ( spl0_6
  <=> ! [X0] :
        ( ~ ssList(X0)
        | ~ rearsegP(sk3,X0)
        | ~ rearsegP(sk4,X0)
        | ~ neq(X0,nil) ) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f285,plain,
    ( ! [X0] :
        ( ~ neq(X0,nil)
        | ~ rearsegP(sk3,X0)
        | ~ rearsegP(sk4,X0)
        | ~ ssList(X0) )
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f284]) ).

fof(f286,plain,
    ( ~ spl0_1
    | spl0_6 ),
    inference(avatar_split_clause,[],[f227,f284,f260]) ).

fof(f292,plain,
    spl0_1,
    inference(avatar_split_clause,[],[f252,f260]) ).

fof(f336,plain,
    ( ~ rearsegP(sk3,sk5)
    | ~ rearsegP(sk4,sk5)
    | ~ ssList(sk5)
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(resolution,[],[f285,f276]) ).

fof(f337,plain,
    ( ~ rearsegP(sk4,sk5)
    | ~ ssList(sk5)
    | ~ spl0_2
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f336,f266]) ).

fof(f339,plain,
    ( ~ ssList(sk5)
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f337,f271]) ).

fof(f349,plain,
    ( $false
    | ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f339,f281]) ).

fof(f350,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f349]) ).

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

cnf(s2,plain,
    ( ~ spl0_1
    | spl0_3 ),
    inference(sat_conversion,[],[f272]) ).

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

cnf(s4,plain,
    ( ~ spl0_1
    | spl0_5 ),
    inference(sat_conversion,[],[f282]) ).

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

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

cnf(s23,plain,
    ( ~ spl0_2
    | ~ spl0_3
    | ~ spl0_4
    | ~ spl0_5
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f350]) ).

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

cnf(s29,plain,
    spl0_5,
    inference(rat,[],[s4,s11]) ).

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

cnf(s31,plain,
    spl0_3,
    inference(rat,[],[s2,s11]) ).

cnf(s32,plain,
    ~ spl0_2,
    inference(rat,[],[s23,s28,s29,s30,s31]) ).

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

fof(f351,plain,
    $false,
    inference(avatar_sat_refutation,[],[s33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC050-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38  % Computer : n014.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:37:41 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.15/0.48  % (1611159)Will run a generic schedule for satisfiability detection.
% 0.15/0.48  % (1611164)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3312615905_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48  % (1611165)% WARNING: option uhcvi not known.
% 0.15/0.48  % TRYING [1]
% 0.15/0.48  % (1611166)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=967201392:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48  % TRYING [2]
% 0.15/0.48  % (1611165)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=594119825:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48  % (1611167)dis+10_1_sil=32000:sp=arity:random_seed=3309547088:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48  % (1611168)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=589296223:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48  % (1611169)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=772404214:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48  % (1611170)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2564953922:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48  % TRYING [3]
% 0.15/0.48  % (1611167) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1611159-1611167"...
% 0.15/0.48  % (1611165) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1611159-1611165"...
% 0.15/0.48  % (1611166) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1611159-1611166"...
% 0.15/0.48  % (1611167)...printing done.
% 0.15/0.48  % (1611165)...printing done.
% 0.15/0.48  % (1611169) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1611159-1611169"...
% 0.15/0.48  % (1611167)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (1611167)------------------------------
% 0.15/0.48  % (1611167)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48  % (1611167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48  % (1611167)CaDiCaL version: 2.1.3
% 0.15/0.48  % (1611167)Termination reason: Refutation
% 0.15/0.48  % (1611167)Time elapsed: 0.004 s
% 0.15/0.48  % (1611167)Peak memory usage: 12 MB
% 0.15/0.48  % (1611167)Instructions burned: 4 (million)
% 0.15/0.48  % (1611159)Success in time 0.048 s
% 0.15/0.48  % Vampire exiting
%------------------------------------------------------------------------------