↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n010.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 12:34:08 PM UTC 2026

% Result   : Theorem 5.96s 2.07s
% Output   : Refutation 5.96s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   22 (  17 unt;   1 def)
%            Number of atoms       :   32 (  24 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   16 (   6   ~;   0   |;   8   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   22 (  16   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux1_join_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',maddux2_join_associativity) ).

fof(f14,conjecture,
    ! [X0,X1,X2] :
      ( ( join(X0,X1) = X1
        & join(X2,X1) = X1 )
     => join(join(X0,X2),X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f15,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( join(X0,X1) = X1
          & join(X2,X1) = X1 )
       => join(join(X0,X2),X1) = X1 ),
    inference(negated_conjecture,[status(cth)],[f14]) ).

fof(f16,plain,
    ? [X0,X1,X2] :
      ( join(join(X0,X2),X1) != X1
      & join(X0,X1) = X1
      & join(X2,X1) = X1 ),
    inference(ennf_transformation,[],[f15]) ).

fof(f17,plain,
    ? [X0,X1,X2] :
      ( join(join(X0,X2),X1) != X1
      & join(X0,X1) = X1
      & join(X2,X1) = X1 ),
    inference(flattening,[],[f16]) ).

fof(f18,plain,
    ( sK1 != join(join(sK0,sK2),sK1)
    & sK1 = join(sK0,sK1)
    & sK1 = join(sK2,sK1) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f17]) ).

fof(f19,plain,
    sK1 = join(sK2,sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f20,plain,
    sK1 = join(sK0,sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f21,plain,
    sK1 != join(join(sK0,sK2),sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f22,plain,
    ! [X2,X0,X1] : join(X0,join(X1,X2)) = join(join(X0,X1),X2),
    inference(cnf_transformation,[],[f2]) ).

fof(f23,plain,
    ! [X0,X1] : join(X0,X1) = join(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f24,definition,
    ~ sP3(sK1),
    introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).

fof(f25,plain,
    sP3(join(join(sK0,sK2),sK1)),
    inference(inequality_splitting,[],[f21,f24]) ).

fof(f26,plain,
    sK1 = join(sK1,sK2),
    inference(forward_demodulation,[],[f19,f23]) ).

fof(f27,plain,
    sK1 = join(sK1,sK0),
    inference(forward_demodulation,[],[f20,f23]) ).

fof(f28,plain,
    sP3(join(sK0,join(sK2,sK1))),
    inference(forward_demodulation,[],[f25,f22]) ).

fof(f29,plain,
    sP3(join(sK0,join(sK1,sK2))),
    inference(forward_demodulation,[],[f28,f23]) ).

fof(f30,plain,
    sP3(join(sK0,sK1)),
    inference(forward_demodulation,[],[f29,f26]) ).

fof(f31,plain,
    sP3(join(sK1,sK0)),
    inference(forward_demodulation,[],[f30,f23]) ).

fof(f32,plain,
    sP3(sK1),
    inference(forward_demodulation,[],[f31,f27]) ).

fof(f33,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f32,f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : REL049+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  % Computer : n010.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sun Sep 27 22:57:17 UTC 2026
% 0.15/0.41  % CPUTime  : 
% 0.15/0.41  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.47  Running first-order theorem proving
% 0.21/0.47  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
% 5.96/2.07  % (1396325)Detected formulas, will run a generic FOF schedule.
% 5.96/2.07  % (1396330)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=2458162037:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.96/2.07  % (1396331)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=2563715402:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.96/2.07  % (1396336)dis-21_1_sil=8000:lcm=predicate:random_seed=1225997861: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)
% 5.96/2.07  % (1396336)Refutation not found, incomplete strategy
% 5.96/2.07  % (1396336)------------------------------
% 5.96/2.07  % (1396336)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.96/2.07  % (1396336)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.96/2.07  % (1396336)CaDiCaL version: 2.1.3
% 5.96/2.07  % (1396336)Termination reason: Refutation not found, incomplete strategy
% 5.96/2.07  % (1396336)Time elapsed: 0.003 s
% 5.96/2.07  % (1396336)Peak memory usage: 88 MB
% 5.96/2.07  % (1396336)Instructions burned: 1 (million)
% 5.96/2.07  % (1396334)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4066131672:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.96/2.07  % (1396333)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=401684201:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.96/2.07  % (1396335)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1829823592:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.96/2.07  % (1396332)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=3517474421:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.96/2.07  % (1396333)First to succeed.
% 5.96/2.07  % (1396334)Also succeeded, but the first one will report.
% 5.96/2.07  % (1396333)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-1396325"
% 5.96/2.07  % (1396335)Also succeeded, but the first one will report.
% 5.96/2.07  % (1396336)------------------------------
% 5.96/2.07  % (1396336)------------------------------
% 5.96/2.07  % (1396333)Refutation found. Thanks to Tanya!
% 5.96/2.07  % SZS status Theorem for theBenchmark
% 5.96/2.07  % SZS output start Proof for theBenchmark
% See solution above
% 5.96/2.07  % (1396333)------------------------------
% 5.96/2.07  % (1396333)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.96/2.07  % (1396333)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.96/2.07  % (1396333)CaDiCaL version: 2.1.3
% 5.96/2.07  % (1396333)Termination reason: Refutation
% 5.96/2.07  % (1396333)Time elapsed: 0.003 s
% 5.96/2.07  % (1396333)Peak memory usage: 88 MB
% 5.96/2.07  % (1396333)Instructions burned: 1 (million)
% 5.96/2.07  % (1396333)------------------------------
% 5.96/2.07  % (1396333)------------------------------
% 5.96/2.07  % (1396325)Success in time 0.714 s
% 5.96/2.07  % Vampire exiting
%------------------------------------------------------------------------------