↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n014.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 2.72s 1.36s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (   5 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   23 (  23   !;   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(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(x,implies(implies(y,z),u)),implies(implies(y,v),implies(x,implies(implies(v,z),u))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_07) ).

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(f20,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(X0,implies(implies(X2,X3),implies(X1,X3))))
      | ~ is_a_theorem(implies(X0,implies(X1,X2))) ),
    inference(resolution,[],[f18,f2]) ).

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(f54,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),implies(X2,implies(X0,X3))))
      | ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
    inference(resolution,[],[f21,f2]) ).

fof(f165,plain,
    ~ is_a_theorem(implies(implies(y,v),implies(implies(implies(y,z),u),implies(implies(v,z),u)))),
    inference(resolution,[],[f54,f5]) ).

fof(f239,plain,
    ~ is_a_theorem(implies(implies(y,v),implies(implies(v,z),implies(y,z)))),
    inference(resolution,[],[f165,f20]) ).

fof(f242,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f239,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL358-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n014.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 15:36:16 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.42  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.72/1.36  % (955002)Input is clausal, will run a generic CNF schedule.
% 2.72/1.36  % (955010)lrs+10_1_sil=8000:sp=occurrence:random_seed=1380771886:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.72/1.36  % (955010)First to succeed.
% 2.72/1.36  % (955010)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-955002"
% 2.72/1.36  % (955008)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2659723271:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.72/1.36  % (955009)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=765252592:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.72/1.36  % (955007)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=4210099017:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.72/1.36  % (955013)dis-21_1_sil=8000:lcm=predicate:random_seed=814082061: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)
% 2.72/1.36  % (955011)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=1850728563:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.72/1.36  % (955012)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=688594480:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.72/1.36  % (955011)Also succeeded, but the first one will report.
% 2.72/1.36  % (955013)Instruction limit reached! 
% 2.72/1.36  % (955013)------------------------------
% 2.72/1.36  % (955013)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.36  % (955013)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.36  % (955013)CaDiCaL version: 2.1.3
% 2.72/1.36  % (955013)Termination reason: Instruction limit
% 2.72/1.36  % (955013)Termination phase: Saturation
% 2.72/1.36  % (955013)Time elapsed: 0.072 s
% 2.72/1.36  % (955013)Peak memory usage: 88 MB
% 2.72/1.36  % (955013)Instructions burned: 118 (million)
% 2.72/1.36  % (955012)Also succeeded, but the first one will report.
% 2.72/1.36  % (955010)Refutation found. Thanks to Tanya!
% 2.72/1.36  % SZS status Unsatisfiable for theBenchmark
% 2.72/1.36  % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.36  % (955010)------------------------------
% 2.72/1.36  % (955010)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.36  % (955010)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.36  % (955010)CaDiCaL version: 2.1.3
% 2.72/1.36  % (955010)Termination reason: Refutation
% 2.72/1.36  % (955010)Time elapsed: 0.005 s
% 2.72/1.36  % (955010)Peak memory usage: 88 MB
% 2.72/1.36  % (955010)Instructions burned: 10 (million)
% 2.72/1.36  % (955010)------------------------------
% 2.72/1.36  % (955010)------------------------------
% 2.72/1.36  % (955002)Success in time 0.303 s
% 2.72/1.36  % Vampire exiting
%------------------------------------------------------------------------------