↑ Up

Vampire---5.0.1.THM-Ref.s

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

% Computer : n009.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:42:17 PM UTC 2026

% Result   : Theorem 2.69s 1.32s
% Output   : Refutation 2.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   20 (   6 unt;   0 def)
%            Number of atoms       :   49 (  10 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   50 (  21   ~;  12   |;  13   &)
%                                         (   1 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   30 (  24   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f8,axiom,
    ! [X0,X1] :
      ( subset(X0,X1)
     => set_intersection2(X0,X1) = X0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).

fof(f9,axiom,
    ! [X0,X1,X2] :
      ( subset(unordered_pair(X0,X1),X2)
    <=> ( in(X0,X2)
        & in(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t38_zfmisc_1) ).

fof(f10,conjecture,
    ! [X0,X1,X2] :
      ( ( in(X0,X1)
        & in(X2,X1) )
     => set_intersection2(unordered_pair(X0,X2),X1) = unordered_pair(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t53_zfmisc_1) ).

fof(f11,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( in(X0,X1)
          & in(X2,X1) )
       => set_intersection2(unordered_pair(X0,X2),X1) = unordered_pair(X0,X2) ),
    inference(negated_conjecture,[status(cth)],[f10]) ).

fof(f14,plain,
    ? [X0,X1,X2] :
      ( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
      & in(X0,X1)
      & in(X2,X1) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f15,plain,
    ? [X0,X1,X2] :
      ( unordered_pair(X0,X2) != set_intersection2(unordered_pair(X0,X2),X1)
      & in(X0,X1)
      & in(X2,X1) ),
    inference(flattening,[],[f14]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f8]) ).

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

fof(f19,plain,
    ! [X0,X1,X2] :
      ( ( subset(unordered_pair(X0,X1),X2)
        | ~ in(X0,X2)
        | ~ in(X1,X2) )
      & ( ( in(X0,X2)
          & in(X1,X2) )
        | ~ subset(unordered_pair(X0,X1),X2) ) ),
    inference(nnf_transformation,[],[f9]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( ( subset(unordered_pair(X0,X1),X2)
        | ~ in(X0,X2)
        | ~ in(X1,X2) )
      & ( ( in(X0,X2)
          & in(X1,X2) )
        | ~ subset(unordered_pair(X0,X1),X2) ) ),
    inference(flattening,[],[f19]) ).

fof(f21,plain,
    in(sK2,sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f22,plain,
    in(sK0,sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f23,plain,
    unordered_pair(sK0,sK2) != set_intersection2(unordered_pair(sK0,sK2),sK1),
    inference(cnf_transformation,[],[f18]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( subset(unordered_pair(X0,X1),X2)
      | ~ in(X0,X2)
      | ~ in(X1,X2) ),
    inference(cnf_transformation,[],[f20]) ).

fof(f31,plain,
    ! [X0,X1] :
      ( set_intersection2(X0,X1) = X0
      | ~ subset(X0,X1) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f49,plain,
    ( unordered_pair(sK0,sK2) != unordered_pair(sK0,sK2)
    | ~ subset(unordered_pair(sK0,sK2),sK1) ),
    inference(superposition,[],[f23,f31]) ).

fof(f53,plain,
    ~ subset(unordered_pair(sK0,sK2),sK1),
    inference(trivial_inequality_removal,[],[f49]) ).

fof(f56,plain,
    ( ~ in(sK0,sK1)
    | ~ in(sK2,sK1) ),
    inference(resolution,[],[f26,f53]) ).

fof(f59,plain,
    ~ in(sK2,sK1),
    inference(forward_subsumption_resolution,[],[f56,f22]) ).

fof(f60,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f59,f21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SET912+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n009.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 28 03:09:30 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.69/1.32  % (2627317)Detected formulas, will run a generic FOF schedule.
% 2.69/1.32  % (2627326)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2233131684:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 2.69/1.32  % (2627326)First to succeed.
% 2.69/1.32  % (2627326)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-2627317"
% 2.69/1.32  % (2627323)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=1011472806:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 2.69/1.32  % (2627322)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=4114204143:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 2.69/1.32  % (2627324)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=1177162769:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 2.69/1.32  % (2627327)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=873592315:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 2.69/1.32  % (2627325)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3274697200:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 2.69/1.32  % (2627328)dis-21_1_sil=8000:lcm=predicate:random_seed=432097217: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.69/1.32  % (2627325)Refutation not found, incomplete strategy
% 2.69/1.32  % (2627325)------------------------------
% 2.69/1.32  % (2627325)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.32  % (2627325)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.32  % (2627325)CaDiCaL version: 2.1.3
% 2.69/1.32  % (2627325)Termination reason: Refutation not found, incomplete strategy
% 2.69/1.32  % (2627325)Time elapsed: 0.001 s
% 2.69/1.32  % (2627325)Peak memory usage: 88 MB
% 2.69/1.32  % (2627328)Also succeeded, but the first one will report.
% 2.69/1.32  % (2627327)Also succeeded, but the first one will report.
% 2.69/1.32  % (2627326)Refutation found. Thanks to Tanya!
% 2.69/1.32  % SZS status Theorem for theBenchmark
% 2.69/1.32  % SZS output start Proof for theBenchmark
% See solution above
% 2.69/1.32  % (2627326)------------------------------
% 2.69/1.32  % (2627326)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.69/1.32  % (2627326)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.69/1.32  % (2627326)CaDiCaL version: 2.1.3
% 2.69/1.32  % (2627326)Termination reason: Refutation
% 2.69/1.32  % (2627326)Time elapsed: 0.002 s
% 2.69/1.32  % (2627326)Peak memory usage: 88 MB
% 2.69/1.32  % (2627326)Instructions burned: 2 (million)
% 2.69/1.32  % (2627326)------------------------------
% 2.69/1.32  % (2627326)------------------------------
% 2.69/1.32  % (2627317)Success in time 0.292 s
% 2.69/1.32  % Vampire exiting
%------------------------------------------------------------------------------