↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL363-1 : TPTP v9.3.1. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% 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:52:05 AM UTC 2026

% Result   : Unsatisfiable 4.37s 2.09s
% Output   : Refutation 4.37s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   15 (   6 unt;   0 def)
%            Number of atoms       :   27 (   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    :    5 (   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   :   29 (  29   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',cn_1) ).

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

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

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

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(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(f150,plain,
    ~ is_a_theorem(implies(implies(not(y),y),y)),
    inference(resolution,[],[f126,f5]) ).

fof(f151,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f150,f3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL363-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48  % Computer : n016.cluster.edu
% 0.21/0.48  % Model    : x86_64 x86_64
% 0.21/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48  % Memory   : 8046.5625MB
% 0.21/0.48  % OS       : Linux 6.8.0-71-generic
% 0.21/0.48  % CPULimit : 300
% 0.21/0.48  % WCLimit  : 300
% 0.21/0.48  % DateTime : Sun Sep 27 15:41:02 UTC 2026
% 0.21/0.49  % CPUTime  : 
% 0.21/0.49  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55  Running first-order theorem proving
% 0.24/0.55  Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.37/2.09  % (2797093)Input is clausal, will run a generic CNF schedule.
% 4.37/2.09  % (2797101)lrs+10_1_sil=8000:sp=occurrence:random_seed=4284530144:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.37/2.09  % (2797101)First to succeed.
% 4.37/2.09  % (2797101)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2797093"
% 4.37/2.09  % (2797099)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2761549504:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.37/2.09  % (2797098)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=1795553510:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.37/2.09  % (2797100)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2566078859:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.37/2.09  % (2797103)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=985393417:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.37/2.09  % (2797104)dis-21_1_sil=8000:lcm=predicate:random_seed=1344672579:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 4.37/2.09  % (2797102)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3111949825:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.37/2.09  % (2797102)Also succeeded, but the first one will report.
% 4.37/2.09  % (2797104)Instruction limit reached! 
% 4.37/2.09  % (2797104)------------------------------
% 4.37/2.09  % (2797104)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.37/2.09  % (2797104)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.37/2.09  % (2797104)CaDiCaL version: 2.1.3
% 4.37/2.09  % (2797104)Termination reason: Instruction limit
% 4.37/2.09  % (2797104)Termination phase: Saturation
% 4.37/2.09  % (2797104)Time elapsed: 0.109 s
% 4.37/2.09  % (2797104)Peak memory usage: 88 MB
% 4.37/2.09  % (2797104)Instructions burned: 117 (million)
% 4.37/2.09  % (2797101)Refutation found. Thanks to Tanya!
% 4.37/2.09  % SZS status Unsatisfiable for theBenchmark
% 4.37/2.09  % SZS output start Proof for theBenchmark
% See solution above
% 4.37/2.09  % (2797101)------------------------------
% 4.37/2.09  % (2797101)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.37/2.09  % (2797101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.37/2.09  % (2797101)CaDiCaL version: 2.1.3
% 4.37/2.09  % (2797101)Termination reason: Refutation
% 4.37/2.09  % (2797101)Time elapsed: 0.004 s
% 4.37/2.09  % (2797101)Peak memory usage: 88 MB
% 4.37/2.09  % (2797101)Instructions burned: 5 (million)
% 4.37/2.09  % (2797101)------------------------------
% 4.37/2.09  % (2797101)------------------------------
% 4.37/2.09  % (2797093)Success in time 0.468 s
% 4.37/2.09  % Vampire exiting
%------------------------------------------------------------------------------