↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL214-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 : n005.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:36 AM UTC 2026

% Result   : Unsatisfiable 6.06s 2.11s
% Output   : Refutation 6.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   18 (   8 unt;   0 def)
%            Number of atoms       :   32 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   36 (  22   ~;  14   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   28 (  28   !;   0   ?)

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

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

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] :
      ( theorem(X0)
      | ~ axiom(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(X0),X1))
      | ~ axiom(or(not(X0),X2))
      | ~ theorem(or(not(X2),X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_3) ).

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

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

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

fof(f19,plain,
    ! [X0] :
      ( ~ theorem(or(not(X0),or(not(or(not(p),q)),q)))
      | ~ axiom(or(not(or(p,q)),X0)) ),
    inference(resolution,[],[f8,f9]) ).

fof(f33,plain,
    ! [X0] :
      ( ~ theorem(or(not(or(not(p),q)),or(not(X0),q)))
      | ~ axiom(or(not(or(p,q)),X0)) ),
    inference(resolution,[],[f14,f19]) ).

fof(f57,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),or(not(X0),q)))
      | ~ axiom(or(not(or(not(p),q)),X1))
      | ~ axiom(or(not(or(p,q)),X0)) ),
    inference(resolution,[],[f33,f8]) ).

fof(f131,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(not(p),q)),or(not(X0),X1)))
      | ~ axiom(or(not(or(p,q)),X0))
      | ~ theorem(or(not(X1),q)) ),
    inference(resolution,[],[f57,f16]) ).

fof(f265,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(p,q)),or(X0,p)))
      | ~ theorem(or(not(or(X0,q)),q)) ),
    inference(resolution,[],[f131,f5]) ).

fof(f548,plain,
    ~ theorem(or(not(or(q,q)),q)),
    inference(resolution,[],[f265,f3]) ).

fof(f553,plain,
    ~ axiom(or(not(or(q,q)),q)),
    inference(resolution,[],[f548,f6]) ).

fof(f554,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f553,f1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL214-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  % Computer : n005.cluster.edu
% 0.21/0.46  % Model    : x86_64 x86_64
% 0.21/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.46  % Memory   : 8046.5625MB
% 0.21/0.46  % OS       : Linux 6.8.0-71-generic
% 0.21/0.46  % CPULimit : 300
% 0.21/0.46  % WCLimit  : 300
% 0.21/0.46  % DateTime : Sun Sep 27 15:26:32 UTC 2026
% 0.21/0.47  % CPUTime  : 
% 0.21/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53  Running first-order theorem proving
% 0.25/0.53  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
% 6.06/2.11  % (4137006)Input is clausal, will run a generic CNF schedule.
% 6.06/2.11  % (4137012)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3404435330:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 6.06/2.11  % (4137011)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=172236497:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 6.06/2.11  % (4137013)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2021707914:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 6.06/2.11  % (4137014)lrs+10_1_sil=8000:sp=occurrence:random_seed=1606394902:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 6.06/2.11  % (4137015)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4083846249:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 6.06/2.11  % (4137016)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=25996153:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 6.06/2.11  % (4137017)dis-21_1_sil=8000:lcm=predicate:random_seed=1002166283: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)
% 6.06/2.11  % (4137015)First to succeed.
% 6.06/2.11  % (4137015)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-4137006"
% 6.06/2.11  % (4137016)Also succeeded, but the first one will report.
% 6.06/2.11  % (4137014)Instruction limit reached! 
% 6.06/2.11  % (4137014)------------------------------
% 6.06/2.11  % (4137014)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.06/2.11  % (4137014)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.06/2.11  % (4137014)CaDiCaL version: 2.1.3
% 6.06/2.11  % (4137014)Termination reason: Instruction limit
% 6.06/2.11  % (4137014)Termination phase: Saturation
% 6.06/2.11  % (4137014)Time elapsed: 0.108 s
% 6.06/2.11  % (4137014)Peak memory usage: 88 MB
% 6.06/2.11  % (4137014)Instructions burned: 107 (million)
% 6.06/2.11  % (4137017)Instruction limit reached! 
% 6.06/2.11  % (4137017)------------------------------
% 6.06/2.11  % (4137017)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.06/2.11  % (4137017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.06/2.11  % (4137017)CaDiCaL version: 2.1.3
% 6.06/2.11  % (4137017)Termination reason: Instruction limit
% 6.06/2.11  % (4137017)Termination phase: Saturation
% 6.06/2.11  % (4137017)Time elapsed: 0.112 s
% 6.06/2.11  % (4137017)Peak memory usage: 88 MB
% 6.06/2.11  % (4137017)Instructions burned: 118 (million)
% 6.06/2.11  % (4137026)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=2782916428:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2995 on theBenchmark for (2995ds/189Mi)
% 6.06/2.11  % (4137025)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=3529768523:i=143:sd=2:aac=none:ss=axioms:sgt=16_2995 on theBenchmark for (2995ds/143Mi)
% 6.06/2.11  % (4137025)Refutation not found, incomplete strategy
% 6.06/2.11  % (4137025)------------------------------
% 6.06/2.11  % (4137025)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.06/2.11  % (4137025)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.06/2.11  % (4137025)CaDiCaL version: 2.1.3
% 6.06/2.11  % (4137025)Termination reason: Refutation not found, incomplete strategy
% 6.06/2.11  % (4137025)Time elapsed: 0.001 s
% 6.06/2.11  % (4137025)Peak memory usage: 87 MB
% 6.06/2.11  % (4137015)Refutation found. Thanks to Tanya!
% 6.06/2.11  % SZS status Unsatisfiable for theBenchmark
% 6.06/2.11  % SZS output start Proof for theBenchmark
% See solution above
% 6.06/2.12  % (4137015)------------------------------
% 6.06/2.12  % (4137015)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 6.06/2.12  % (4137015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 6.06/2.12  % (4137015)CaDiCaL version: 2.1.3
% 6.06/2.12  % (4137015)Termination reason: Refutation
% 6.06/2.12  % (4137015)Time elapsed: 0.022 s
% 6.06/2.12  % (4137015)Peak memory usage: 88 MB
% 6.06/2.12  % (4137015)Instructions burned: 19 (million)
% 6.06/2.12  % (4137015)------------------------------
% 6.06/2.12  % (4137015)------------------------------
% 6.06/2.12  % (4137006)Success in time 0.74 s
% 6.06/2.12  % Vampire exiting
%------------------------------------------------------------------------------