↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL321-3 : 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 : n018.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:51:58 AM UTC 2026

% Result   : Unsatisfiable 5.59s 1.85s
% Output   : Refutation 5.59s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   22 (  15 unt;   0 def)
%            Number of atoms       :   31 (   1 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  12   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   40 (  40   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] : axiom(implies(X0,or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_1_4) ).

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

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_definition) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_1) ).

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_2) ).

fof(f9,negated_conjecture,
    ~ theorem(or(implies(p,q),implies(p,not(q)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f10,plain,
    ~ theorem(or(or(not(p),q),or(not(p),not(q)))),
    inference(definition_unfolding,[],[f9,f6,f6]) ).

fof(f12,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f13,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f14,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f16,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f17,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

fof(f19,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f13,f7]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( theorem(or(X0,X1))
      | ~ theorem(X1) ),
    inference(resolution,[],[f16,f17]) ).

fof(f24,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f12,f7]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f19,f16]) ).

fof(f29,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f24,f16]) ).

fof(f30,plain,
    ! [X0,X1] : theorem(or(or(X0,X1),not(X1))),
    inference(resolution,[],[f27,f17]) ).

fof(f55,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X0,or(X1,X2)))
      | ~ theorem(or(X0,X2)) ),
    inference(resolution,[],[f29,f20]) ).

fof(f78,plain,
    ~ theorem(or(or(not(p),q),not(q))),
    inference(resolution,[],[f55,f10]) ).

fof(f83,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f78,f30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL321-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.08  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45  % Computer : n018.cluster.edu
% 0.18/0.45  % Model    : x86_64 x86_64
% 0.18/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45  % Memory   : 8046.5625MB
% 0.18/0.45  % OS       : Linux 6.8.0-71-generic
% 0.18/0.45  % CPULimit : 300
% 0.18/0.45  % WCLimit  : 300
% 0.18/0.45  % DateTime : Sun Sep 27 15:36:54 UTC 2026
% 0.18/0.45  % CPUTime  : 
% 0.18/0.45  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.50  Running first-order theorem proving
% 0.23/0.51  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
% 5.59/1.85  % (2523377)Input is clausal, will run a generic CNF schedule.
% 5.59/1.85  % (2523383)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=477494524:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 5.59/1.85  % (2523387)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3867710827:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 5.59/1.85  % (2523388)dis-21_1_sil=8000:lcm=predicate:random_seed=3534784520: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)
% 5.59/1.85  % (2523384)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=268293218:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 5.59/1.85  % (2523385)lrs+10_1_sil=8000:sp=occurrence:random_seed=2975908415:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 5.59/1.85  % (2523386)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2631692490:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 5.59/1.85  % (2523382)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=1242894422:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 5.59/1.85  % (2523385)First to succeed.
% 5.59/1.85  % (2523385)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2523377"
% 5.59/1.85  % (2523387)Also succeeded, but the first one will report.
% 5.59/1.85  % (2523388)Also succeeded, but the first one will report.
% 5.59/1.85  % (2523386)Instruction limit reached! 
% 5.59/1.85  % (2523386)------------------------------
% 5.59/1.85  % (2523386)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.85  % (2523386)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.85  % (2523386)CaDiCaL version: 2.1.3
% 5.59/1.85  % (2523386)Termination reason: Instruction limit
% 5.59/1.85  % (2523386)Termination phase: Saturation
% 5.59/1.85  % (2523386)Time elapsed: 0.114 s
% 5.59/1.85  % (2523386)Peak memory usage: 88 MB
% 5.59/1.85  % (2523386)Instructions burned: 114 (million)
% 5.59/1.85  % (2523398)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=1055433562:i=143:sd=2:aac=none:ss=axioms:sgt=16_2996 on theBenchmark for (2996ds/143Mi)
% 5.59/1.85  % (2523398)Refutation not found, incomplete strategy
% 5.59/1.85  % (2523398)------------------------------
% 5.59/1.85  % (2523398)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.85  % (2523398)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.85  % (2523398)CaDiCaL version: 2.1.3
% 5.59/1.85  % (2523398)Termination reason: Refutation not found, incomplete strategy
% 5.59/1.85  % (2523398)Time elapsed: 0.002 s
% 5.59/1.85  % (2523398)Peak memory usage: 88 MB
% 5.59/1.85  % (2523385)Refutation found. Thanks to Tanya!
% 5.59/1.85  % SZS status Unsatisfiable for theBenchmark
% 5.59/1.85  % SZS output start Proof for theBenchmark
% See solution above
% 5.59/1.85  % (2523385)------------------------------
% 5.59/1.85  % (2523385)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.59/1.85  % (2523385)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.59/1.85  % (2523385)CaDiCaL version: 2.1.3
% 5.59/1.85  % (2523385)Termination reason: Refutation
% 5.59/1.85  % (2523385)Time elapsed: 0.005 s
% 5.59/1.85  % (2523385)Peak memory usage: 88 MB
% 5.59/1.85  % (2523385)Instructions burned: 2 (million)
% 5.59/1.85  % (2523385)------------------------------
% 5.59/1.85  % (2523385)------------------------------
% 5.59/1.85  % (2523377)Success in time 0.691 s
% 5.59/1.85  % Vampire exiting
%------------------------------------------------------------------------------