↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n015.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:41 AM UTC 2026

% Result   : Unsatisfiable 4.58s 2.12s
% Output   : Refutation 4.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   23 (  11 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   38 (  21   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (  46   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_3) ).

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

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_6) ).

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

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X2),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X0),X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).

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

fof(f11,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f2,f6]) ).

fof(f13,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f7,f1]) ).

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

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

fof(f40,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f16,f11]) ).

fof(f46,plain,
    ! [X2,X3,X0,X1] :
      ( ~ axiom(or(not(X2),or(X3,X0)))
      | ~ theorem(or(not(X0),X1))
      | theorem(or(not(X2),or(X3,X1))) ),
    inference(resolution,[],[f20,f8]) ).

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

fof(f57,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f40,f13]) ).

fof(f106,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(X2),or(not(or(not(X3),X0)),X1)))
      | ~ axiom(or(not(X2),X3))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f47,f8]) ).

fof(f136,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(X0,or(X3,X1))),or(X3,X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f46,f4]) ).

fof(f344,plain,
    ~ theorem(or(not(or(not(or(not(p),q)),r)),or(not(q),r))),
    inference(resolution,[],[f136,f9]) ).

fof(f406,plain,
    ! [X2,X3,X0,X1] :
      ( theorem(or(not(or(not(X1),X2)),or(not(X0),X3)))
      | ~ theorem(or(not(X2),X3))
      | ~ axiom(or(not(X0),X1)) ),
    inference(resolution,[],[f106,f16]) ).

fof(f1385,plain,
    ( ~ theorem(or(not(r),r))
    | ~ axiom(or(not(q),or(not(p),q))) ),
    inference(resolution,[],[f406,f344]) ).

fof(f1391,plain,
    ~ axiom(or(not(q),or(not(p),q))),
    inference(forward_subsumption_resolution,[],[f1385,f57]) ).

fof(f1402,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1391,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL231-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.48  % Computer : n015.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.49  % CPULimit : 300
% 0.21/0.49  % WCLimit  : 300
% 0.21/0.49  % DateTime : Sun Sep 27 15:32:01 UTC 2026
% 0.21/0.49  % CPUTime  : 
% 0.21/0.49  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.55  Running first-order theorem proving
% 0.27/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.58/2.12  % (1789950)Input is clausal, will run a generic CNF schedule.
% 4.58/2.12  % (1789958)lrs+10_1_sil=8000:sp=occurrence:random_seed=1459825037:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 4.58/2.12  % (1789958)First to succeed.
% 4.58/2.12  % (1789958)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1789950"
% 4.58/2.12  % (1789956)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2580917996:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 4.58/2.12  % (1789959)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=3566149075:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 4.58/2.12  % (1789961)dis-21_1_sil=8000:lcm=predicate:random_seed=336883631: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.58/2.12  % (1789960)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3606341838:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 4.58/2.12  % (1789955)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=426116484:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 4.58/2.12  % (1789957)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=722355335:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 4.58/2.12  % (1789959)Also succeeded, but the first one will report.
% 4.58/2.12  % (1789961)Instruction limit reached! 
% 4.58/2.12  % (1789961)------------------------------
% 4.58/2.12  % (1789961)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/2.12  % (1789961)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/2.12  % (1789961)CaDiCaL version: 2.1.3
% 4.58/2.12  % (1789961)Termination reason: Instruction limit
% 4.58/2.12  % (1789961)Termination phase: Saturation
% 4.58/2.12  % (1789961)Time elapsed: 0.108 s
% 4.58/2.12  % (1789961)Peak memory usage: 88 MB
% 4.58/2.12  % (1789961)Instructions burned: 117 (million)
% 4.58/2.12  % (1789960)Instruction limit reached! 
% 4.58/2.12  % (1789960)------------------------------
% 4.58/2.12  % (1789960)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/2.12  % (1789960)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/2.12  % (1789960)CaDiCaL version: 2.1.3
% 4.58/2.12  % (1789960)Termination reason: Instruction limit
% 4.58/2.12  % (1789960)Termination phase: Saturation
% 4.58/2.12  % (1789960)Time elapsed: 0.180 s
% 4.58/2.12  % (1789960)Peak memory usage: 89 MB
% 4.58/2.12  % (1789960)Instructions burned: 180 (million)
% 4.58/2.12  % (1789958)Refutation found. Thanks to Tanya!
% 4.58/2.12  % SZS status Unsatisfiable for theBenchmark
% 4.58/2.12  % SZS output start Proof for theBenchmark
% See solution above
% 4.58/2.12  % (1789958)------------------------------
% 4.58/2.12  % (1789958)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.58/2.12  % (1789958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/2.12  % (1789958)CaDiCaL version: 2.1.3
% 4.58/2.12  % (1789958)Termination reason: Refutation
% 4.58/2.12  % (1789958)Time elapsed: 0.032 s
% 4.58/2.12  % (1789958)Peak memory usage: 88 MB
% 4.58/2.12  % (1789958)Instructions burned: 58 (million)
% 4.58/2.12  % (1789958)------------------------------
% 4.58/2.12  % (1789958)------------------------------
% 4.58/2.12  % (1789950)Success in time 0.491 s
% 4.58/2.12  % Vampire exiting
%------------------------------------------------------------------------------