↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n004.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 09:18:05 AM UTC 2026

% Result   : Theorem 2.72s 1.17s
% Output   : Refutation 2.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   18 (   8 unt;   4 def)
%            Number of atoms       :  230 ( 221 equ)
%            Maximal formula atoms :   50 (  12 avg)
%            Number of connectives :  330 ( 118   ~;  20   |; 192   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   37 (  11 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   5 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f5,axiom,
    ( e0 != e1
    & e0 != e2
    & e0 != e3
    & e0 != e4
    & e1 != e2
    & e1 != e3
    & e1 != e4
    & e2 != e3
    & e2 != e4
    & e3 != e4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).

fof(f6,axiom,
    ( e0 = op(op(e3,op(e3,e3)),op(e3,op(e3,e3)))
    & e1 = op(e3,op(e3,op(e3,e3)))
    & e2 = op(e3,e3)
    & e4 = op(e3,op(e3,e3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax6) ).

fof(f7,conjecture,
    ~ ( ( ( op(e0,e0) != e0
          & op(e0,e1) != e1
          & op(e0,e2) != e2
          & op(e0,e3) != e3
          & op(e0,e4) != e4 )
        | ( op(e1,e0) != e0
          & op(e1,e1) != e1
          & op(e1,e2) != e2
          & op(e1,e3) != e3
          & op(e1,e4) != e4 )
        | ( op(e2,e0) != e0
          & op(e2,e1) != e1
          & op(e2,e2) != e2
          & op(e2,e3) != e3
          & op(e2,e4) != e4 )
        | ( op(e3,e0) != e0
          & op(e3,e1) != e1
          & op(e3,e2) != e2
          & op(e3,e3) != e3
          & op(e3,e4) != e4 )
        | ( op(e4,e0) != e0
          & op(e4,e1) != e1
          & op(e4,e2) != e2
          & op(e4,e3) != e3
          & op(e4,e4) != e4 ) )
      & op(e0,op(e0,e0)) = e0
      & op(e0,op(e0,e1)) = e1
      & op(e0,op(e0,e2)) = e2
      & op(e0,op(e0,e3)) = e3
      & op(e0,op(e0,e4)) = e4
      & op(e1,op(e1,e0)) = e0
      & op(e1,op(e1,e1)) = e1
      & op(e1,op(e1,e2)) = e2
      & op(e1,op(e1,e3)) = e3
      & op(e1,op(e1,e4)) = e4
      & op(e2,op(e2,e0)) = e0
      & op(e2,op(e2,e1)) = e1
      & op(e2,op(e2,e2)) = e2
      & op(e2,op(e2,e3)) = e3
      & op(e2,op(e2,e4)) = e4
      & op(e3,op(e3,e0)) = e0
      & op(e3,op(e3,e1)) = e1
      & op(e3,op(e3,e2)) = e2
      & op(e3,op(e3,e3)) = e3
      & op(e3,op(e3,e4)) = e4
      & op(e4,op(e4,e0)) = e0
      & op(e4,op(e4,e1)) = e1
      & op(e4,op(e4,e2)) = e2
      & op(e4,op(e4,e3)) = e3
      & op(e4,op(e4,e4)) = e4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(f8,negated_conjecture,
    ~ ~ ( ( ( op(e0,e0) != e0
            & op(e0,e1) != e1
            & op(e0,e2) != e2
            & op(e0,e3) != e3
            & op(e0,e4) != e4 )
          | ( op(e1,e0) != e0
            & op(e1,e1) != e1
            & op(e1,e2) != e2
            & op(e1,e3) != e3
            & op(e1,e4) != e4 )
          | ( op(e2,e0) != e0
            & op(e2,e1) != e1
            & op(e2,e2) != e2
            & op(e2,e3) != e3
            & op(e2,e4) != e4 )
          | ( op(e3,e0) != e0
            & op(e3,e1) != e1
            & op(e3,e2) != e2
            & op(e3,e3) != e3
            & op(e3,e4) != e4 )
          | ( op(e4,e0) != e0
            & op(e4,e1) != e1
            & op(e4,e2) != e2
            & op(e4,e3) != e3
            & op(e4,e4) != e4 ) )
        & op(e0,op(e0,e0)) = e0
        & op(e0,op(e0,e1)) = e1
        & op(e0,op(e0,e2)) = e2
        & op(e0,op(e0,e3)) = e3
        & op(e0,op(e0,e4)) = e4
        & op(e1,op(e1,e0)) = e0
        & op(e1,op(e1,e1)) = e1
        & op(e1,op(e1,e2)) = e2
        & op(e1,op(e1,e3)) = e3
        & op(e1,op(e1,e4)) = e4
        & op(e2,op(e2,e0)) = e0
        & op(e2,op(e2,e1)) = e1
        & op(e2,op(e2,e2)) = e2
        & op(e2,op(e2,e3)) = e3
        & op(e2,op(e2,e4)) = e4
        & op(e3,op(e3,e0)) = e0
        & op(e3,op(e3,e1)) = e1
        & op(e3,op(e3,e2)) = e2
        & op(e3,op(e3,e3)) = e3
        & op(e3,op(e3,e4)) = e4
        & op(e4,op(e4,e0)) = e0
        & op(e4,op(e4,e1)) = e1
        & op(e4,op(e4,e2)) = e2
        & op(e4,op(e4,e3)) = e3
        & op(e4,op(e4,e4)) = e4 ),
    inference(negated_conjecture,[status(cth)],[f7]) ).

fof(f9,plain,
    ( ( ( op(e0,e0) != e0
        & op(e0,e1) != e1
        & op(e0,e2) != e2
        & op(e0,e3) != e3
        & op(e0,e4) != e4 )
      | ( op(e1,e0) != e0
        & op(e1,e1) != e1
        & op(e1,e2) != e2
        & op(e1,e3) != e3
        & op(e1,e4) != e4 )
      | ( op(e2,e0) != e0
        & op(e2,e1) != e1
        & op(e2,e2) != e2
        & op(e2,e3) != e3
        & op(e2,e4) != e4 )
      | ( op(e3,e0) != e0
        & op(e3,e1) != e1
        & op(e3,e2) != e2
        & op(e3,e3) != e3
        & op(e3,e4) != e4 )
      | ( op(e4,e0) != e0
        & op(e4,e1) != e1
        & op(e4,e2) != e2
        & op(e4,e3) != e3
        & op(e4,e4) != e4 ) )
    & op(e0,op(e0,e0)) = e0
    & op(e0,op(e0,e1)) = e1
    & op(e0,op(e0,e2)) = e2
    & op(e0,op(e0,e3)) = e3
    & op(e0,op(e0,e4)) = e4
    & op(e1,op(e1,e0)) = e0
    & op(e1,op(e1,e1)) = e1
    & op(e1,op(e1,e2)) = e2
    & op(e1,op(e1,e3)) = e3
    & op(e1,op(e1,e4)) = e4
    & op(e2,op(e2,e0)) = e0
    & op(e2,op(e2,e1)) = e1
    & op(e2,op(e2,e2)) = e2
    & op(e2,op(e2,e3)) = e3
    & op(e2,op(e2,e4)) = e4
    & op(e3,op(e3,e0)) = e0
    & op(e3,op(e3,e1)) = e1
    & op(e3,op(e3,e2)) = e2
    & op(e3,op(e3,e3)) = e3
    & op(e3,op(e3,e4)) = e4
    & op(e4,op(e4,e0)) = e0
    & op(e4,op(e4,e1)) = e1
    & op(e4,op(e4,e2)) = e2
    & op(e4,op(e4,e3)) = e3
    & op(e4,op(e4,e4)) = e4 ),
    inference(flattening,[],[f8]) ).

fof(f10,definition,
    ( ( op(e4,e0) != e0
      & op(e4,e1) != e1
      & op(e4,e2) != e2
      & op(e4,e3) != e3
      & op(e4,e4) != e4 )
    | ~ sP0 ),
    introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).

fof(f11,definition,
    ( ( op(e3,e0) != e0
      & op(e3,e1) != e1
      & op(e3,e2) != e2
      & op(e3,e3) != e3
      & op(e3,e4) != e4 )
    | ~ sP1 ),
    introduced(definition,[new_symbols(definition,[sP1])],[predicate_definition_introduction]) ).

fof(f12,definition,
    ( ( op(e2,e0) != e0
      & op(e2,e1) != e1
      & op(e2,e2) != e2
      & op(e2,e3) != e3
      & op(e2,e4) != e4 )
    | ~ sP2 ),
    introduced(definition,[new_symbols(definition,[sP2])],[predicate_definition_introduction]) ).

fof(f13,definition,
    ( ( op(e1,e0) != e0
      & op(e1,e1) != e1
      & op(e1,e2) != e2
      & op(e1,e3) != e3
      & op(e1,e4) != e4 )
    | ~ sP3 ),
    introduced(definition,[new_symbols(definition,[sP3])],[predicate_definition_introduction]) ).

fof(f14,plain,
    ( ( ( op(e0,e0) != e0
        & op(e0,e1) != e1
        & op(e0,e2) != e2
        & op(e0,e3) != e3
        & op(e0,e4) != e4 )
      | sP3
      | sP2
      | sP1
      | sP0 )
    & op(e0,op(e0,e0)) = e0
    & op(e0,op(e0,e1)) = e1
    & op(e0,op(e0,e2)) = e2
    & op(e0,op(e0,e3)) = e3
    & op(e0,op(e0,e4)) = e4
    & op(e1,op(e1,e0)) = e0
    & op(e1,op(e1,e1)) = e1
    & op(e1,op(e1,e2)) = e2
    & op(e1,op(e1,e3)) = e3
    & op(e1,op(e1,e4)) = e4
    & op(e2,op(e2,e0)) = e0
    & op(e2,op(e2,e1)) = e1
    & op(e2,op(e2,e2)) = e2
    & op(e2,op(e2,e3)) = e3
    & op(e2,op(e2,e4)) = e4
    & op(e3,op(e3,e0)) = e0
    & op(e3,op(e3,e1)) = e1
    & op(e3,op(e3,e2)) = e2
    & op(e3,op(e3,e3)) = e3
    & op(e3,op(e3,e4)) = e4
    & op(e4,op(e4,e0)) = e0
    & op(e4,op(e4,e1)) = e1
    & op(e4,op(e4,e2)) = e2
    & op(e4,op(e4,e3)) = e3
    & op(e4,op(e4,e4)) = e4 ),
    inference(definition_folding,[],[f9,f13,f12,f11,f10]) ).

fof(f45,plain,
    e3 = op(e3,op(e3,e3)),
    inference(cnf_transformation,[],[f14]) ).

fof(f69,plain,
    e3 != e4,
    inference(cnf_transformation,[],[f5]) ).

fof(f79,plain,
    e4 = op(e3,op(e3,e3)),
    inference(cnf_transformation,[],[f6]) ).

fof(f80,plain,
    e2 = op(e3,e3),
    inference(cnf_transformation,[],[f6]) ).

fof(f283,plain,
    e3 = op(e3,e2),
    inference(superposition,[],[f45,f80]) ).

fof(f287,plain,
    e4 = op(e3,e2),
    inference(forward_demodulation,[],[f79,f80]) ).

fof(f289,plain,
    e3 = e4,
    inference(superposition,[],[f283,f287]) ).

fof(f291,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f289,f69]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ALG173+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n004.cluster.edu
% 0.08/0.19  % Model    : x86_64 x86_64
% 0.08/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19  % Memory   : 8046.5625MB
% 0.08/0.19  % OS       : Linux 6.8.0-71-generic
% 0.08/0.19  % CPULimit : 300
% 0.08/0.19  % WCLimit  : 300
% 0.08/0.19  % DateTime : Mon Sep 28 19:37:22 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running first-order theorem proving
% 0.08/0.23  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
% 2.72/1.17  % (679100)Detected formulas, will run a generic FOF schedule.
% 2.72/1.17  % (679109)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=686530951:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.72/1.17  % (679109)First to succeed.
% 2.72/1.17  % (679109)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-679100"
% 2.72/1.17  % (679105)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=2887487946:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.72/1.17  % (679106)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=3031688316:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.72/1.17  % (679108)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3477111278:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.72/1.17  % (679107)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3602216001:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.72/1.17  % (679110)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=687215564:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.72/1.17  % (679108)Refutation not found, incomplete strategy
% 2.72/1.17  % (679108)------------------------------
% 2.72/1.17  % (679108)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.17  % (679108)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.17  % (679108)CaDiCaL version: 2.1.3
% 2.72/1.17  % (679108)Termination reason: Refutation not found, incomplete strategy
% 2.72/1.17  % (679108)Time elapsed: 0.010 s
% 2.72/1.17  % (679108)Peak memory usage: 88 MB
% 2.72/1.17  % (679108)Instructions burned: 19 (million)
% 2.72/1.17  % (679111)dis-21_1_sil=8000:lcm=predicate:random_seed=1993361575:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 2.72/1.17  % (679111)Refutation not found, incomplete strategy
% 2.72/1.17  % (679111)------------------------------
% 2.72/1.17  % (679111)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.17  % (679111)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.17  % (679111)CaDiCaL version: 2.1.3
% 2.72/1.17  % (679111)Termination reason: Refutation not found, incomplete strategy
% 2.72/1.17  % (679111)Time elapsed: 0.011 s
% 2.72/1.17  % (679111)Peak memory usage: 88 MB
% 2.72/1.17  % (679111)Instructions burned: 21 (million)
% 2.72/1.17  % (679110)Instruction limit reached! 
% 2.72/1.17  % (679110)------------------------------
% 2.72/1.17  % (679110)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.17  % (679110)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.17  % (679110)CaDiCaL version: 2.1.3
% 2.72/1.17  % (679110)Termination reason: Instruction limit
% 2.72/1.17  % (679110)Termination phase: Saturation
% 2.72/1.17  % (679110)Time elapsed: 0.075 s
% 2.72/1.17  % (679110)Peak memory usage: 88 MB
% 2.72/1.17  % (679110)Instructions burned: 140 (million)
% 2.72/1.17  % (679109)Refutation found. Thanks to Tanya!
% 2.72/1.17  % SZS status Theorem for theBenchmark
% 2.72/1.17  % SZS output start Proof for theBenchmark
% See solution above
% 2.72/1.17  % (679109)------------------------------
% 2.72/1.17  % (679109)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.72/1.17  % (679109)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.72/1.17  % (679109)CaDiCaL version: 2.1.3
% 2.72/1.17  % (679109)Termination reason: Refutation
% 2.72/1.17  % (679109)Time elapsed: 0.004 s
% 2.72/1.17  % (679109)Peak memory usage: 88 MB
% 2.72/1.17  % (679109)Instructions burned: 14 (million)
% 2.72/1.17  % (679109)------------------------------
% 2.72/1.17  % (679109)------------------------------
% 2.72/1.17  % (679100)Success in time 0.296 s
% 2.72/1.17  % Vampire exiting
%------------------------------------------------------------------------------