↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n007.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 01:09:02 PM UTC 2026

% Result   : Theorem 3.63s 1.27s
% Output   : Refutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   16 (  11 unt;   1 def)
%            Number of atoms       :   21 (  14 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   13 (   8   ~;   0   |;   3   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :   66 (  52   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f55,axiom,
    ! [X0,X1,X2,X3,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).

fof(f63,conjecture,
    ! [X0] :
      ( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
     => ! [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) = i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_co) ).

fof(f64,negated_conjecture,
    ~ ! [X0] :
        ( ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4))
       => ! [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) = i(triple(X6,insert_slb(X0,pair(X9,X10)),X8)) ),
    inference(negated_conjecture,[status(cth)],[f63]) ).

fof(f65,plain,
    ? [X0] :
      ( ? [X5,X6,X7,X8,X9,X10] : i(triple(X5,insert_slb(X0,pair(X9,X10)),X7)) != i(triple(X6,insert_slb(X0,pair(X9,X10)),X8))
      & ! [X1,X2,X3,X4] : i(triple(X1,X0,X3)) = i(triple(X2,X0,X4)) ),
    inference(ennf_transformation,[],[f64]) ).

fof(f66,plain,
    ? [X0] :
      ( ? [X1,X2,X3,X4,X5,X6] : i(triple(X1,insert_slb(X0,pair(X5,X6)),X3)) != i(triple(X2,insert_slb(X0,pair(X5,X6)),X4))
      & ! [X7,X8,X9,X10] : i(triple(X7,X0,X9)) = i(triple(X8,X0,X10)) ),
    inference(rectify,[],[f65]) ).

fof(f67,plain,
    ( i(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),sK3)) != i(triple(sK2,insert_slb(sK0,pair(sK5,sK6)),sK4))
    & ! [X7,X8,X9,X10] : i(triple(X7,sK0,X9)) = i(triple(X8,sK0,X10)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6)],[f66]) ).

fof(f68,plain,
    ! [X10,X8,X9,X7] : i(triple(X7,sK0,X9)) = i(triple(X8,sK0,X10)),
    inference(cnf_transformation,[],[f67]) ).

fof(f69,plain,
    i(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),sK3)) != i(triple(sK2,insert_slb(sK0,pair(sK5,sK6)),sK4)),
    inference(cnf_transformation,[],[f67]) ).

fof(f70,plain,
    ! [X2,X3,X0,X1,X4] : i(triple(X0,insert_slb(X1,pair(X3,X4)),X2)) = insert_pq(i(triple(X0,X1,X2)),X3),
    inference(cnf_transformation,[],[f55]) ).

fof(f71,definition,
    ~ sP7(i(triple(sK1,insert_slb(sK0,pair(sK5,sK6)),sK3))),
    introduced(definition,[new_symbols(definition,[sP7])],[inequality_splitting_name_introduction]) ).

fof(f72,plain,
    sP7(i(triple(sK2,insert_slb(sK0,pair(sK5,sK6)),sK4))),
    inference(inequality_splitting,[],[f69,f71]) ).

fof(f73,plain,
    ~ sP7(insert_pq(i(triple(sK1,sK0,sK3)),sK5)),
    inference(forward_demodulation,[],[f71,f70]) ).

fof(f74,plain,
    sP7(insert_pq(i(triple(sK2,sK0,sK4)),sK5)),
    inference(forward_demodulation,[],[f72,f70]) ).

fof(f81,plain,
    ! [X0,X1] : ~ sP7(insert_pq(i(triple(X0,sK0,X1)),sK5)),
    inference(superposition,[],[f73,f68]) ).

fof(f82,plain,
    ! [X0,X1] : sP7(insert_pq(i(triple(X0,sK0,X1)),sK5)),
    inference(superposition,[],[f74,f68]) ).

fof(f83,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f81,f82]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV366+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n007.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Mon Sep 28 10:42:25 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.20  Running first-order theorem proving
% 0.09/0.20  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.63/1.27  % (2311650)Detected formulas, will run a generic FOF schedule.
% 3.63/1.27  % (2311655)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=1884504269:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.63/1.27  % (2311660)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4227598935:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.63/1.27  % (2311659)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3474125323:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.63/1.27  % (2311661)dis-21_1_sil=8000:lcm=predicate:random_seed=2361900038: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)
% 3.63/1.27  % (2311656)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=2053910987:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.63/1.27  % (2311657)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=4105367277:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.63/1.27  % (2311658)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3158125156:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.63/1.27  % (2311658)First to succeed.
% 3.63/1.27  % (2311659)Also succeeded, but the first one will report.
% 3.63/1.27  % (2311658)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2311650"
% 3.63/1.27  % (2311661)Refutation not found, incomplete strategy
% 3.63/1.27  % (2311661)------------------------------
% 3.63/1.27  % (2311661)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.27  % (2311661)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.27  % (2311661)CaDiCaL version: 2.1.3
% 3.63/1.27  % (2311661)Termination reason: Refutation not found, incomplete strategy
% 3.63/1.27  % (2311661)Time elapsed: 0.004 s
% 3.63/1.27  % (2311661)Peak memory usage: 88 MB
% 3.63/1.27  % (2311661)Instructions burned: 4 (million)
% 3.63/1.27  % (2311660)Also succeeded, but the first one will report.
% 3.63/1.27  % (2311661)------------------------------
% 3.63/1.27  % (2311661)------------------------------
% 3.63/1.27  % (2311658)Refutation found. Thanks to Tanya!
% 3.63/1.27  % SZS status Theorem for theBenchmark
% 3.63/1.27  % SZS output start Proof for theBenchmark
% See solution above
% 3.63/1.27  % (2311658)------------------------------
% 3.63/1.27  % (2311658)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.63/1.27  % (2311658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.63/1.27  % (2311658)CaDiCaL version: 2.1.3
% 3.63/1.27  % (2311658)Termination reason: Refutation
% 3.63/1.27  % (2311658)Time elapsed: 0.002 s
% 3.63/1.27  % (2311658)Peak memory usage: 88 MB
% 3.63/1.27  % (2311658)Instructions burned: 1 (million)
% 3.63/1.27  % (2311658)------------------------------
% 3.63/1.27  % (2311658)------------------------------
% 3.63/1.27  % (2311650)Success in time 0.432 s
% 3.63/1.27  % Vampire exiting
%------------------------------------------------------------------------------