↑ 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  : SYN575-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n003.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 02:17:38 PM UTC 2026

% Result   : Unsatisfiable 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   34 (  13 unt;   1 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  109 (  59   ~;  49   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   2 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (   0 sgn  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,negated_conjecture,
    ! [X0] : p7(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p7_2) ).

fof(f3,negated_conjecture,
    ! [X0] : p3(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_3) ).

fof(f4,negated_conjecture,
    ! [X0] : p2(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p2_4) ).

fof(f5,negated_conjecture,
    p9(c12,c13),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_5) ).

fof(f6,negated_conjecture,
    p11(c14,c15),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p11_6) ).

fof(f8,negated_conjecture,
    ! [X0] : p3(f6(f5(X0)),f6(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_8) ).

fof(f10,negated_conjecture,
    ! [X0] :
      ( p9(X0,f6(c14))
      | ~ p9(X0,c13) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_10) ).

fof(f16,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p3(X2,X1)
      | ~ p3(X2,X0)
      | p3(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p3_16) ).

fof(f19,negated_conjecture,
    ! [X2,X3,X0,X1] :
      ( ~ p9(X2,X3)
      | ~ p7(X2,X0)
      | p9(X0,X1)
      | ~ p3(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_19) ).

fof(f21,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p2(X1,f5(X2))
      | p9(f8(X0,X1),f6(X1))
      | ~ p11(X2,c15)
      | ~ p9(c12,X0)
      | p9(f8(X0,X1),X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',p9_21) ).

fof(f22,negated_conjecture,
    ! [X2,X0,X1] :
      ( ~ p9(f8(X1,X2),f6(X2))
      | ~ p9(c12,X1)
      | ~ p2(X2,f5(X0))
      | ~ p9(f8(X1,X2),X1)
      | ~ p11(X0,c15) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_p11_22) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ p3(X0,X1)
      | p3(X1,X0) ),
    inference(resolution,[],[f16,f3]) ).

fof(f36,plain,
    ! [X0] : p3(f6(X0),f6(f5(X0))),
    inference(resolution,[],[f28,f8]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( ~ p3(f6(c14),X2)
      | p9(X1,X2)
      | ~ p7(X0,X1)
      | ~ p9(X0,c13) ),
    inference(resolution,[],[f19,f10]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( p9(f8(X0,f5(X1)),f6(f5(X1)))
      | p9(f8(X0,f5(X1)),X0)
      | ~ p9(c12,X0)
      | ~ p11(X1,c15) ),
    inference(resolution,[],[f21,f4]) ).

fof(f117,plain,
    ! [X0,X1] :
      ( ~ p9(X1,c13)
      | ~ p7(X1,X0)
      | p9(X0,f6(f5(c14))) ),
    inference(resolution,[],[f46,f36]) ).

fof(f138,plain,
    ! [X0] :
      ( p9(f8(f6(f5(X0)),f5(X0)),f6(f5(X0)))
      | ~ p9(c12,f6(f5(X0)))
      | ~ p11(X0,c15) ),
    inference(factoring,[],[f53]) ).

fof(f213,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f6(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p9(c12,f6(f5(X0)))
      | ~ p2(f5(X0),f5(X1))
      | ~ p9(f8(f6(f5(X0)),f5(X0)),f6(f5(X0)))
      | ~ p11(X1,c15) ),
    inference(resolution,[],[f138,f22]) ).

fof(f215,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f6(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p2(f5(X0),f5(X1))
      | ~ p9(f8(f6(f5(X0)),f5(X0)),f6(f5(X0)))
      | ~ p11(X1,c15) ),
    inference(duplicate_literal_removal,[],[f213]) ).

fof(f216,plain,
    ! [X0,X1] :
      ( ~ p9(c12,f6(f5(X0)))
      | ~ p11(X0,c15)
      | ~ p2(f5(X0),f5(X1))
      | ~ p11(X1,c15) ),
    inference(forward_subsumption_resolution,[],[f215,f138]) ).

fof(f362,plain,
    ! [X0] :
      ( p9(X0,f6(f5(c14)))
      | ~ p7(c12,X0) ),
    inference(resolution,[],[f117,f5]) ).

fof(f366,definition,
    ( spl0_4
  <=> ! [X1] :
        ( ~ p2(f5(c14),f5(X1))
        | ~ p11(X1,c15) ) ),
    introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).

fof(f367,plain,
    ( ! [X1] :
        ( ~ p2(f5(c14),f5(X1))
        | ~ p11(X1,c15) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f366]) ).

fof(f377,plain,
    ( ~ p11(c14,c15)
    | ~ spl0_4 ),
    inference(resolution,[],[f367,f4]) ).

fof(f378,plain,
    ( $false
    | ~ spl0_4 ),
    inference(forward_subsumption_resolution,[],[f377,f6]) ).

fof(f379,plain,
    ~ spl0_4,
    inference(avatar_contradiction_clause,[],[f378]) ).

fof(f539,plain,
    ! [X0] :
      ( ~ p11(c14,c15)
      | ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15)
      | ~ p7(c12,c12) ),
    inference(resolution,[],[f216,f362]) ).

fof(f543,plain,
    ! [X0] :
      ( ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15)
      | ~ p7(c12,c12) ),
    inference(forward_subsumption_resolution,[],[f539,f6]) ).

fof(f544,plain,
    ! [X0] :
      ( ~ p2(f5(c14),f5(X0))
      | ~ p11(X0,c15) ),
    inference(forward_subsumption_resolution,[],[f543,f2]) ).

fof(f545,plain,
    spl0_4,
    inference(avatar_split_clause,[],[f544,f366]) ).

cnf(s4,plain,
    ~ spl0_4,
    inference(sat_conversion,[],[f379]) ).

cnf(s5,plain,
    spl0_4,
    inference(sat_conversion,[],[f545]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s4,s5]) ).

fof(f546,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN575-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19  % Computer : n003.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 16:32:42 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22  Running first-order model finding
% 0.08/0.22  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  % (1736076)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (1736084)dis+10_1_sil=32000:sp=arity:random_seed=2072614301:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (1736082)% WARNING: option uhcvi not known.
% 0.08/0.26  % (1736084) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1736076-1736084"...
% 0.08/0.26  % (1736082)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2226755415:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (1736081)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4000844410_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % (1736084)...printing done.
% 0.08/0.26  % (1736083)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1866919272:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (1736085)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1637807856:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (1736084)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  % (1736084)------------------------------
% 0.08/0.26  % (1736084)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (1736084)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (1736084)CaDiCaL version: 2.1.3
% 0.08/0.26  % (1736084)Termination reason: Refutation
% 0.08/0.26  % (1736084)Time elapsed: 0.007 s
% 0.08/0.26  % (1736084)Peak memory usage: 11 MB
% 0.08/0.26  % (1736084)Instructions burned: 18 (million)
% 0.08/0.26  % (1736076)Success in time 0.031 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------