↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n013.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 10:19:21 AM UTC 2026

% Result   : Unsatisfiable 3.33s 1.35s
% Output   : Refutation 3.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   46 (  25 unt;   0 def)
%            Number of atoms       :   73 (   8 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  28   ~;  27   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-4 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  109 ( 109   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : nand(X0,X1) = not(and(X0,X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nand_definition) ).

fof(f2,axiom,
    ! [X0] : and(X0,n0) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_definition1) ).

fof(f3,plain,
    ! [X0] : n0 = and(X0,n0),
    inference(reorient_equations,[],[f2]) ).

fof(f4,axiom,
    ! [X0] : and(X0,n1) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_definition2) ).

fof(f5,axiom,
    not(n0) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_definition1) ).

fof(f6,plain,
    n1 = not(n0),
    inference(reorient_equations,[],[f5]) ).

fof(f7,axiom,
    not(n1) = n0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_definition2) ).

fof(f8,plain,
    n0 = not(n1),
    inference(reorient_equations,[],[f7]) ).

fof(f9,negated_conjecture,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ output(X0,X1,X2,X3)
      | ~ output(X4,X5,X6,X7)
      | output(nand(X0,X4),nand(X1,X5),nand(X2,X6),nand(X3,X7)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nand_table_definition) ).

fof(f10,negated_conjecture,
    output(n0,n0,n1,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',input1) ).

fof(f11,negated_conjecture,
    output(n0,n1,n0,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',input2) ).

fof(f12,negated_conjecture,
    ~ output(n0,n1,n1,n1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cannot_make_or) ).

fof(f13,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( output(not(and(X0,X4)),not(and(X1,X5)),not(and(X2,X6)),not(and(X3,X7)))
      | ~ output(X4,X5,X6,X7)
      | ~ output(X0,X1,X2,X3) ),
    inference(definition_unfolding,[],[f9,f1,f1,f1,f1]) ).

fof(f16,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( output(not(and(X0,X1)),not(n0),not(and(X3,X4)),not(and(X5,X6)))
      | ~ output(X1,n0,X4,X6)
      | ~ output(X0,X2,X3,X5) ),
    inference(superposition,[],[f13,f3]) ).

fof(f17,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( output(not(n0),not(and(X1,X2)),not(and(X3,X4)),not(and(X5,X6)))
      | ~ output(n0,X2,X4,X6)
      | ~ output(X0,X1,X3,X5) ),
    inference(superposition,[],[f13,f3]) ).

fof(f18,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ output(n0,X2,X4,X6)
      | output(n1,not(and(X1,X2)),not(and(X3,X4)),not(and(X5,X6)))
      | ~ output(X0,X1,X3,X5) ),
    inference(forward_demodulation,[],[f17,f6]) ).

fof(f19,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( ~ output(X1,n0,X4,X6)
      | output(not(and(X0,X1)),n1,not(and(X3,X4)),not(and(X5,X6)))
      | ~ output(X0,X2,X3,X5) ),
    inference(forward_demodulation,[],[f16,f6]) ).

fof(f26,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n0)),not(and(X1,n1)),not(and(X2,n1)))
      | ~ output(X3,X0,X1,X2) ),
    inference(resolution,[],[f18,f10]) ).

fof(f27,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n1)),not(and(X1,n0)),not(and(X2,n1)))
      | ~ output(X3,X0,X1,X2) ),
    inference(resolution,[],[f18,f11]) ).

fof(f28,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n1)),not(and(X1,n0)),not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f27,f4]) ).

fof(f29,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n0)),not(and(X1,n1)),not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f26,f4]) ).

fof(f30,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n1)),not(n0),not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f28,f3]) ).

fof(f31,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n0)),not(X1),not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f29,f4]) ).

fof(f32,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(and(X0,n1)),n1,not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f30,f6]) ).

fof(f33,plain,
    ! [X2,X3,X0,X1] :
      ( output(n1,not(n0),not(X1),not(X2))
      | ~ output(X3,X0,X1,X2) ),
    inference(forward_demodulation,[],[f31,f3]) ).

fof(f34,plain,
    ! [X2,X3,X0,X1] :
      ( ~ output(X3,X0,X1,X2)
      | output(n1,not(X0),n1,not(X2)) ),
    inference(forward_demodulation,[],[f32,f4]) ).

fof(f35,plain,
    ! [X2,X3,X0,X1] :
      ( ~ output(X3,X0,X1,X2)
      | output(n1,n1,not(X1),not(X2)) ),
    inference(forward_demodulation,[],[f33,f6]) ).

fof(f41,plain,
    output(n1,not(n0),n1,not(n1)),
    inference(resolution,[],[f34,f10]) ).

fof(f42,plain,
    output(n1,not(n1),n1,not(n1)),
    inference(resolution,[],[f34,f11]) ).

fof(f44,plain,
    output(n1,n0,n1,n0),
    inference(forward_demodulation,[],[f42,f8]) ).

fof(f45,plain,
    output(n1,not(n0),n1,n0),
    inference(forward_demodulation,[],[f41,f8]) ).

fof(f46,plain,
    output(n1,n1,n1,n0),
    inference(forward_demodulation,[],[f45,f6]) ).

fof(f52,plain,
    ! [X2,X3,X0,X1] :
      ( output(not(and(X0,n1)),n1,not(and(X1,n1)),not(and(X2,n0)))
      | ~ output(X0,X3,X1,X2) ),
    inference(resolution,[],[f44,f19]) ).

fof(f55,plain,
    ! [X2,X3,X0,X1] :
      ( output(not(and(X0,n1)),n1,not(and(X1,n1)),not(n0))
      | ~ output(X0,X3,X1,X2) ),
    inference(forward_demodulation,[],[f52,f3]) ).

fof(f56,plain,
    ! [X2,X3,X0,X1] :
      ( output(not(and(X0,n1)),n1,not(and(X1,n1)),n1)
      | ~ output(X0,X3,X1,X2) ),
    inference(forward_demodulation,[],[f55,f6]) ).

fof(f57,plain,
    ! [X2,X3,X0,X1] :
      ( output(not(and(X0,n1)),n1,not(X1),n1)
      | ~ output(X0,X3,X1,X2) ),
    inference(forward_demodulation,[],[f56,f4]) ).

fof(f58,plain,
    ! [X2,X3,X0,X1] :
      ( ~ output(X0,X3,X1,X2)
      | output(not(X0),n1,not(X1),n1) ),
    inference(forward_demodulation,[],[f57,f4]) ).

fof(f65,plain,
    output(n1,not(n1),n1,not(n0)),
    inference(resolution,[],[f46,f34]) ).

fof(f66,plain,
    output(n1,not(n1),n1,n1),
    inference(forward_demodulation,[],[f65,f6]) ).

fof(f68,plain,
    output(n1,n0,n1,n1),
    inference(forward_demodulation,[],[f66,f8]) ).

fof(f125,plain,
    output(n1,n1,not(n1),not(n1)),
    inference(resolution,[],[f35,f68]) ).

fof(f126,plain,
    output(n1,n1,n0,n0),
    inference(forward_demodulation,[],[f125,f8]) ).

fof(f198,plain,
    output(not(n1),n1,not(n0),n1),
    inference(resolution,[],[f58,f126]) ).

fof(f199,plain,
    output(not(n1),n1,n1,n1),
    inference(forward_demodulation,[],[f198,f6]) ).

fof(f207,plain,
    output(n0,n1,n1,n1),
    inference(forward_demodulation,[],[f199,f8]) ).

fof(f210,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f207,f12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HWC001-1 : TPTP v9.3.1. Bugfixed v1.1.1.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38  % Computer : n013.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 10:50:52 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.41  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
% 3.33/1.35  % (45174)Input is clausal, will run a generic CNF schedule.
% 3.33/1.35  % (45180)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=2099401982:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 3.33/1.35  % (45179)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=4275652940:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 3.33/1.35  % (45185)dis-21_1_sil=8000:lcm=predicate:random_seed=3155347204: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)
% 3.33/1.35  % (45182)lrs+10_1_sil=8000:sp=occurrence:random_seed=2258523010:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 3.33/1.35  % (45183)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2427840097:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 3.33/1.35  % (45181)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=1676148532:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 3.33/1.35  % (45185)Refutation not found, incomplete strategy
% 3.33/1.35  % (45185)------------------------------
% 3.33/1.35  % (45185)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.35  % (45185)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.35  % (45185)CaDiCaL version: 2.1.3
% 3.33/1.35  % (45185)Termination reason: Refutation not found, incomplete strategy
% 3.33/1.35  % (45185)Time elapsed: 0.001 s
% 3.33/1.35  % (45185)Peak memory usage: 88 MB
% 3.33/1.35  % (45182)First to succeed.
% 3.33/1.35  % (45182)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-45174"
% 3.33/1.35  % (45184)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2425281812:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 3.33/1.35  % (45184)Also succeeded, but the first one will report.
% 3.33/1.35  % (45183)Also succeeded, but the first one will report.
% 3.33/1.35  % (45185)------------------------------
% 3.33/1.35  % (45185)------------------------------
% 3.33/1.35  % (45182)Refutation found. Thanks to Tanya!
% 3.33/1.35  % SZS status Unsatisfiable for theBenchmark
% 3.33/1.35  % SZS output start Proof for theBenchmark
% See solution above
% 3.33/1.36  % (45182)------------------------------
% 3.33/1.36  % (45182)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.33/1.36  % (45182)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.33/1.36  % (45182)CaDiCaL version: 2.1.3
% 3.33/1.36  % (45182)Termination reason: Refutation
% 3.33/1.36  % (45182)Time elapsed: 0.006 s
% 3.33/1.36  % (45182)Peak memory usage: 88 MB
% 3.33/1.36  % (45182)Instructions burned: 8 (million)
% 3.33/1.36  % (45182)------------------------------
% 3.33/1.36  % (45182)------------------------------
% 3.33/1.36  % (45174)Success in time 0.407 s
% 3.33/1.36  % Vampire exiting
%------------------------------------------------------------------------------