↑ 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  : SWC348-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 : n016.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:39 PM UTC 2026

% Result   : Unsatisfiable 0.11s 0.26s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   60 (  19 unt;   6 def)
%            Number of atoms       :  139 (  13 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  144 (  65   ~;  73   |;   0   &)
%                                         (   6 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   7 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    strictorderedP(nil),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause3) ).

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

fof(f47,axiom,
    ! [X0] : ssItem(skaf44(X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).

fof(f66,axiom,
    ! [X0] :
      ( ~ ssItem(X0)
      | strictorderedP(cons(X0,nil)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause66) ).

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

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(f103,axiom,
    ! [X0] :
      ( ~ singletonP(X0)
      | ~ ssList(X0)
      | cons(skaf44(X0),nil) = X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).

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

fof(f207,negated_conjecture,
    ( singletonP(sk3)
    | ~ neq(sk4,nil) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).

fof(f208,negated_conjecture,
    ( ~ segmentP(sk2,sk1)
    | ~ strictorderedP(sk1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).

fof(f211,plain,
    ( ~ segmentP(sk4,sk3)
    | ~ strictorderedP(sk3) ),
    inference(definition_unfolding,[],[f208,f204,f205,f205]) ).

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

fof(f243,plain,
    ( ~ strictorderedP(sk3)
    | spl0_1 ),
    inference(avatar_component_clause,[],[f241]) ).

fof(f245,definition,
    ( spl0_2
  <=> segmentP(sk4,sk3) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f246,plain,
    ( segmentP(sk4,sk3)
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f245]) ).

fof(f248,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f211,f245,f241]) ).

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

fof(f252,plain,
    ( ~ neq(sk4,nil)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f250]) ).

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

fof(f256,plain,
    ( singletonP(sk3)
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f254]) ).

fof(f257,plain,
    ( ~ spl0_3
    | spl0_4 ),
    inference(avatar_split_clause,[],[f207,f254,f250]) ).

fof(f258,plain,
    spl0_2,
    inference(avatar_split_clause,[],[f206,f245]) ).

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

fof(f265,plain,
    ( ssList(nil)
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f264]) ).

fof(f273,definition,
    ( spl0_8
  <=> ! [X1] :
        ( ~ ssItem(X1)
        | strictorderedP(cons(X1,nil)) ) ),
    introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).

fof(f274,plain,
    ( ! [X1] :
        ( strictorderedP(cons(X1,nil))
        | ~ ssItem(X1) )
    | ~ spl0_8 ),
    inference(avatar_component_clause,[],[f273]) ).

fof(f299,plain,
    spl0_8,
    inference(avatar_split_clause,[],[f66,f273]) ).

fof(f300,plain,
    spl0_6,
    inference(avatar_split_clause,[],[f8,f264]) ).

fof(f504,plain,
    ( ~ ssList(sk4)
    | ~ ssList(nil)
    | nil = sk4
    | spl0_3 ),
    inference(resolution,[],[f102,f252]) ).

fof(f505,plain,
    ( ~ ssList(nil)
    | nil = sk4
    | spl0_3 ),
    inference(forward_subsumption_resolution,[],[f504,f203]) ).

fof(f506,plain,
    ( nil = sk4
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f505,f265]) ).

fof(f510,plain,
    ( segmentP(nil,sk3)
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(superposition,[],[f246,f506]) ).

fof(f517,plain,
    ( ~ ssList(sk3)
    | nil = sk3
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(resolution,[],[f510,f80]) ).

fof(f518,plain,
    ( nil = sk3
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f517,f202]) ).

fof(f520,plain,
    ( ~ strictorderedP(nil)
    | spl0_1
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(superposition,[],[f243,f518]) ).

fof(f527,plain,
    ( $false
    | spl0_1
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f520,f3]) ).

fof(f528,plain,
    ( spl0_1
    | ~ spl0_2
    | spl0_3
    | ~ spl0_6 ),
    inference(avatar_contradiction_clause,[],[f527]) ).

fof(f529,plain,
    ( ~ ssList(sk3)
    | sk3 = cons(skaf44(sk3),nil)
    | ~ spl0_4 ),
    inference(resolution,[],[f256,f103]) ).

fof(f530,plain,
    ( sk3 = cons(skaf44(sk3),nil)
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f529,f202]) ).

fof(f537,plain,
    ( strictorderedP(sk3)
    | ~ ssItem(skaf44(sk3))
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(superposition,[],[f274,f530]) ).

fof(f541,plain,
    ( ~ ssItem(skaf44(sk3))
    | spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f537,f243]) ).

fof(f549,plain,
    ( $false
    | spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(forward_subsumption_resolution,[],[f541,f47]) ).

fof(f550,plain,
    ( spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(avatar_contradiction_clause,[],[f549]) ).

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

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

cnf(s3,plain,
    spl0_2,
    inference(sat_conversion,[],[f258]) ).

cnf(s12,plain,
    spl0_8,
    inference(sat_conversion,[],[f299]) ).

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

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

cnf(s15,plain,
    ( spl0_1
    | ~ spl0_4
    | ~ spl0_8 ),
    inference(sat_conversion,[],[f550]) ).

cnf(s20,plain,
    ~ spl0_1,
    inference(rat,[],[s1,s3]) ).

cnf(s21,plain,
    ~ spl0_4,
    inference(rat,[],[s15,s12,s20]) ).

cnf(s22,plain,
    spl0_3,
    inference(rat,[],[s14,s13,s3,s20]) ).

cnf(s23,plain,
    $false,
    inference(rat,[],[s2,s21,s22]) ).

fof(f551,plain,
    $false,
    inference(avatar_sat_refutation,[],[s23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWC348-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.18  % Computer : n016.cluster.edu
% 0.11/0.18  % Model    : x86_64 x86_64
% 0.11/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.18  % Memory   : 8046.5625MB
% 0.11/0.18  % OS       : Linux 6.8.0-71-generic
% 0.11/0.18  % CPULimit : 300
% 0.11/0.18  % WCLimit  : 300
% 0.11/0.18  % DateTime : Mon Sep 28 09:17:18 UTC 2026
% 0.11/0.18  % CPUTime  : 
% 0.11/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.21  Running first-order model finding
% 0.11/0.21  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.11/0.26  % (3500275)Will run a generic schedule for satisfiability detection.
% 0.11/0.26  % (3500284)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2178959038:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.26  % (3500281)% WARNING: option uhcvi not known.
% 0.11/0.26  % (3500284) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3500275-3500284"...
% 0.11/0.26  % (3500282)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4170261256:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.26  % (3500280)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1683809612_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.26  % (3500283)dis+10_1_sil=32000:sp=arity:random_seed=1012955078:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.26  % (3500285)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1646146064:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.26  % (3500284)...printing done.
% 0.11/0.26  % (3500286)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3561320172:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.26  % (3500281)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4285268758:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.26  % (3500284)Refutation found. Thanks to Tanya!
% 0.11/0.26  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.26  % (3500284)------------------------------
% 0.11/0.26  % (3500284)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.26  % (3500284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.26  % (3500284)CaDiCaL version: 2.1.3
% 0.11/0.26  % (3500284)Termination reason: Refutation
% 0.11/0.26  % (3500284)Time elapsed: 0.007 s
% 0.11/0.26  % (3500284)Peak memory usage: 13 MB
% 0.11/0.26  % (3500284)Instructions burned: 22 (million)
% 0.11/0.26  % (3500275)Success in time 0.042 s
% 0.11/0.26  % Vampire exiting
%------------------------------------------------------------------------------