↑ 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  : SWC101-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 : n015.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.20s 0.47s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   60 (  22 unt;   8 def)
%            Number of atoms       :  121 (  16 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  114 (  53   ~;  53   |;   0   &)
%                                         (   8 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :    9 (   0 sgn   9   !;   0   ?)

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

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

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

fof(f203,negated_conjecture,
    ssList(sk4),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).

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,
    app(sk3,sk5) = sk4,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,plain,
    sk4 = app(sk3,sk5),
    inference(reorient_equations,[],[f207]) ).

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

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

fof(f214,negated_conjecture,
    ( ~ neq(sk1,nil)
    | ~ frontsegP(sk2,sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).

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

fof(f218,plain,
    ( ~ neq(sk3,nil)
    | ~ frontsegP(sk4,sk3) ),
    inference(definition_unfolding,[],[f214,f205,f204,f205]) ).

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

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

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

fof(f373,plain,
    ( ~ neq(sk3,nil)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f371]) ).

fof(f374,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f218,f371,f367]) ).

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

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

fof(f383,plain,
    ( ~ spl0_3
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f217,f380,f376]) ).

fof(f384,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f212,f380,f376]) ).

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

fof(f426,plain,
    spl0_6,
    inference(avatar_split_clause,[],[f8,f390]) ).

fof(f605,plain,
    ( ~ ssList(sk3)
    | ~ ssList(nil)
    | nil = sk3
    | spl0_2 ),
    inference(resolution,[],[f102,f373]) ).

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

fof(f611,plain,
    ( ~ ssList(sk3)
    | spl0_14 ),
    inference(avatar_component_clause,[],[f609]) ).

fof(f612,plain,
    ( spl0_3
    | ~ spl0_6
    | ~ spl0_14
    | spl0_2 ),
    inference(avatar_split_clause,[],[f605,f371,f609,f390,f376]) ).

fof(f613,plain,
    ( $false
    | spl0_14 ),
    inference(resolution,[],[f611,f202]) ).

fof(f614,plain,
    spl0_14,
    inference(avatar_contradiction_clause,[],[f613]) ).

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

fof(f847,plain,
    ( ~ ssList(sk5)
    | spl0_21 ),
    inference(avatar_component_clause,[],[f845]) ).

fof(f849,plain,
    ( $false
    | spl0_21 ),
    inference(resolution,[],[f847,f206]) ).

fof(f850,plain,
    spl0_21,
    inference(avatar_contradiction_clause,[],[f849]) ).

fof(f2072,plain,
    ( frontsegP(sk4,sk3)
    | ~ ssList(sk3)
    | ~ ssList(sk4)
    | ~ ssList(sk5) ),
    inference(superposition,[],[f230,f208]) ).

fof(f2142,definition,
    ( spl0_43
  <=> ssList(sk4) ),
    introduced(definition,[new_symbols(definition,[spl0_43])],[avatar_definition]) ).

fof(f2144,plain,
    ( ~ ssList(sk4)
    | spl0_43 ),
    inference(avatar_component_clause,[],[f2142]) ).

fof(f2145,plain,
    ( ~ spl0_21
    | ~ spl0_43
    | ~ spl0_14
    | spl0_1 ),
    inference(avatar_split_clause,[],[f2072,f367,f609,f2142,f845]) ).

fof(f2146,plain,
    ( $false
    | spl0_43 ),
    inference(resolution,[],[f2144,f203]) ).

fof(f2147,plain,
    spl0_43,
    inference(avatar_contradiction_clause,[],[f2146]) ).

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

cnf(s2,plain,
    ( ~ spl0_3
    | ~ spl0_4 ),
    inference(sat_conversion,[],[f383]) ).

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

cnf(s13,plain,
    spl0_6,
    inference(sat_conversion,[],[f426]) ).

cnf(s14,plain,
    ( spl0_2
    | spl0_3
    | ~ spl0_6
    | ~ spl0_14 ),
    inference(sat_conversion,[],[f612]) ).

cnf(s15,plain,
    spl0_14,
    inference(sat_conversion,[],[f614]) ).

cnf(s22,plain,
    spl0_21,
    inference(sat_conversion,[],[f850]) ).

cnf(s50,plain,
    ( spl0_1
    | ~ spl0_14
    | ~ spl0_21
    | ~ spl0_43 ),
    inference(sat_conversion,[],[f2145]) ).

cnf(s51,plain,
    spl0_43,
    inference(sat_conversion,[],[f2147]) ).

cnf(s52,plain,
    ( spl0_1
    | ~ spl0_14
    | ~ spl0_21 ),
    inference(rat,[],[s50,s51]) ).

cnf(s54,plain,
    spl0_1,
    inference(rat,[],[s52,s22,s15]) ).

cnf(s55,plain,
    ( spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(rat,[],[s14,s15]) ).

cnf(s61,plain,
    ~ spl0_2,
    inference(rat,[],[s1,s54]) ).

cnf(s62,plain,
    spl0_3,
    inference(rat,[],[s55,s13,s61]) ).

cnf(s63,plain,
    spl0_4,
    inference(rat,[],[s3,s62]) ).

cnf(s64,plain,
    $false,
    inference(rat,[],[s2,s63,s62]) ).

fof(f2148,plain,
    $false,
    inference(avatar_sat_refutation,[],[s64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC101-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.36  % Computer : n015.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 28 07:55:32 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.20/0.47  % (2458813)Will run a generic schedule for satisfiability detection.
% 0.20/0.47  % (2458824)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1055808040:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.47  % (2458820)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=926459828:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.47  % (2458818)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3468934005_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.47  % (2458821)dis+10_1_sil=32000:sp=arity:random_seed=3793906087:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.47  % (2458822)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=871146626:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.47  % (2458823)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3567065818:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.47  % (2458819)% WARNING: option uhcvi not known.
% 0.20/0.47  % (2458819)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2030549536:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.47  % TRYING [1]
% 0.20/0.47  % TRYING [2]
% 0.20/0.47  % TRYING [3]
% 0.20/0.47  % (2458824) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2458813-2458824"...
% 0.20/0.47  % (2458824)...printing done.
% 0.20/0.47  % (2458821) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2458813-2458821"...
% 0.20/0.47  % (2458824)Refutation found. Thanks to Tanya!
% 0.20/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.47  % (2458824)------------------------------
% 0.20/0.47  % (2458824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.47  % (2458824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.47  % (2458824)CaDiCaL version: 2.1.3
% 0.20/0.47  % (2458824)Termination reason: Refutation
% 0.20/0.47  % (2458824)Time elapsed: 0.027 s
% 0.20/0.47  % (2458824)Peak memory usage: 13 MB
% 0.20/0.47  % (2458824)Instructions burned: 84 (million)
% 0.20/0.47  % (2458813)Success in time 0.061 s
% 0.20/0.47  % Vampire exiting
%------------------------------------------------------------------------------