↑ 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  : LCL027-1 : TPTP v9.3.1. Released v1.0.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 11:57:27 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.46s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   20 (  11 unt;   1 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  11   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_2) ).

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(implies(X0,falsehood),falsehood),X0)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_5) ).

fof(f4,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(implies(X0,X1),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_6) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(falsehood,a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_4) ).

fof(f15,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f1,f2]) ).

fof(f46,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(X0,X2)))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f4,f1]) ).

fof(f53,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | ~ is_a_theorem(implies(X0,X1))
      | is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[],[f46,f1]) ).

fof(f72,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X1,X2))
      | is_a_theorem(implies(X0,X2))
      | ~ is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f53,f15]) ).

fof(f91,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(implies(X1,falsehood),falsehood)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f72,f3]) ).

fof(f260,definition,
    ( spl0_16
  <=> ! [X0] : is_a_theorem(implies(falsehood,X0)) ),
    introduced(definition,[new_symbols(definition,[spl0_16])],[avatar_definition]) ).

fof(f261,plain,
    ( ! [X0] : is_a_theorem(implies(falsehood,X0))
    | ~ spl0_16 ),
    inference(avatar_component_clause,[],[f260]) ).

fof(f280,plain,
    ( $false
    | ~ spl0_16 ),
    inference(resolution,[],[f261,f5]) ).

fof(f287,plain,
    ~ spl0_16,
    inference(avatar_contradiction_clause,[],[f280]) ).

fof(f336,plain,
    ! [X0] : is_a_theorem(implies(falsehood,X0)),
    inference(resolution,[],[f91,f2]) ).

fof(f363,plain,
    spl0_16,
    inference(avatar_split_clause,[],[f336,f260]) ).

cnf(s191,plain,
    ~ spl0_16,
    inference(sat_conversion,[],[f287]) ).

cnf(s237,plain,
    spl0_16,
    inference(sat_conversion,[],[f363]) ).

cnf(s238,plain,
    $false,
    inference(rat,[],[s191,s237]) ).

fof(f364,plain,
    $false,
    inference(avatar_sat_refutation,[],[s238]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL027-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n016.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 15:22:47 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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.12/0.46  % (2771868)Will run a generic schedule for satisfiability detection.
% 0.12/0.46  % (2771875)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=294153892:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.46  % (2771874)% WARNING: option uhcvi not known.
% 0.12/0.46  % (2771875) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2771868-2771875"...
% 0.12/0.46  % (2771875)...printing done.
% 0.12/0.46  % (2771873)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1052373970_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.46  % (2771874)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=695808401:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.46  % (2771876)dis+10_1_sil=32000:sp=arity:random_seed=3593558403:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.46  % (2771877)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2393031173:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.46  % TRYING [1]
% 0.12/0.46  % TRYING [2]
% 0.12/0.46  % (2771875)Refutation found. Thanks to Tanya!
% 0.12/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.46  % (2771875)------------------------------
% 0.12/0.46  % (2771875)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.46  % (2771875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.46  % (2771875)CaDiCaL version: 2.1.3
% 0.12/0.46  % (2771875)Termination reason: Refutation
% 0.12/0.46  % (2771875)Time elapsed: 0.004 s
% 0.12/0.46  % (2771875)Peak memory usage: 12 MB
% 0.12/0.46  % (2771875)Instructions burned: 7 (million)
% 0.12/0.46  % (2771868)Success in time 0.034 s
% 0.12/0.46  % Vampire exiting
%------------------------------------------------------------------------------