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

% Computer : n006.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:58:32 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.45s
% Output   : Refutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   28 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   26 (  14   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   30 (  30   !;   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,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).

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

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

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(x,implies(y,y))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_63) ).

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

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

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

fof(f19,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),X1)))
      | is_a_theorem(implies(X0,X1)) ),
    inference(resolution,[],[f18,f3]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X0,implies(X3,X2)))
      | ~ is_a_theorem(implies(X3,X1)) ),
    inference(resolution,[],[f18,f8]) ).

fof(f26,plain,
    ! [X0] : is_a_theorem(implies(X0,X0)),
    inference(resolution,[],[f19,f4]) ).

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

fof(f82,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),not(X1)))
      | is_a_theorem(implies(X1,X0)) ),
    inference(resolution,[],[f58,f19]) ).

fof(f126,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X1) ),
    inference(resolution,[],[f82,f7]) ).

fof(f149,plain,
    ~ is_a_theorem(implies(y,y)),
    inference(resolution,[],[f126,f5]) ).

fof(f151,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f149,f26]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL397-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n006.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:39:41 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.40  Running first-order model finding
% 0.12/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.12/0.45  % (3120690)Will run a generic schedule for satisfiability detection.
% 0.12/0.45  % (3120700)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3858911598:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.12/0.45  % (3120696)% WARNING: option uhcvi not known.
% 0.12/0.45  % (3120695)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4010098811_2999 on theBenchmark for (2999ds/0Mi)
% 0.12/0.45  % (3120696)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3489848230:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.12/0.45  % (3120697)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4281868576:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.12/0.45  % (3120698)dis+10_1_sil=32000:sp=arity:random_seed=2399434281:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.12/0.45  % (3120701)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1670110582:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.12/0.45  % TRYING [1]
% 0.12/0.45  % TRYING [2]
% 0.12/0.45  % TRYING [3]
% 0.12/0.45  % (3120699)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1293522590:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.12/0.45  % (3120698) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3120690-3120698"...
% 0.12/0.45  % (3120698)...printing done.
% 0.12/0.45  % TRYING [4]
% 0.12/0.45  % (3120698)Refutation found. Thanks to Tanya!
% 0.12/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.12/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.12/0.45  % (3120698)------------------------------
% 0.12/0.45  % (3120698)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.12/0.45  % (3120698)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.12/0.45  % (3120698)CaDiCaL version: 2.1.3
% 0.12/0.45  % (3120698)Termination reason: Refutation
% 0.12/0.45  % (3120698)Time elapsed: 0.004 s
% 0.12/0.45  % (3120698)Peak memory usage: 11 MB
% 0.12/0.45  % (3120698)Instructions burned: 4 (million)
% 0.12/0.45  % (3120690)Success in time 0.039 s
% 0.12/0.45  % Vampire exiting
%------------------------------------------------------------------------------