↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

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

% Computer : n006.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 02:22:58 PM UTC 2026

% Result   : Theorem 0.20s 0.28s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   17 (   6 unt;   0 def)
%            Number of atoms       :   41 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   39 (  15   ~;  12   |;   2   &)
%                                         (   6 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   27 (  25   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0,X1] :
        ( eq(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) )
   => ! [X3,X4] :
        ( eq(X3,X4)
       => eq(X4,X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1] :
          ( eq(X0,X1)
        <=> ! [X2] :
              ( a_member_of(X2,X0)
            <=> a_member_of(X2,X1) ) )
     => ! [X3,X4] :
          ( eq(X3,X4)
         => eq(X4,X3) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ? [X3,X4] :
        ( ~ eq(X4,X3)
        & eq(X3,X4) )
    & ! [X0,X1] :
        ( eq(X0,X1)
      <=> ! [X2] :
            ( a_member_of(X2,X0)
          <=> a_member_of(X2,X1) ) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ! [X2,X0,X1] :
      ( ~ eq(X0,X1)
      | a_member_of(X2,X0)
      | ~ a_member_of(X2,X1) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f5,plain,
    ! [X2,X0,X1] :
      ( ~ eq(X0,X1)
      | ~ a_member_of(X2,X0)
      | a_member_of(X2,X1) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f6,plain,
    ! [X0,X1] :
      ( eq(X0,X1)
      | a_member_of(sK2(X0,X1),X0)
      | a_member_of(sK2(X0,X1),X1) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f7,plain,
    ! [X0,X1] :
      ( eq(X0,X1)
      | ~ a_member_of(sK2(X0,X1),X0)
      | ~ a_member_of(sK2(X0,X1),X1) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f8,plain,
    eq(sK0,sK1),
    inference(cnf_transformation,[],[f3]) ).

fof(f9,plain,
    ~ eq(sK1,sK0),
    inference(cnf_transformation,[],[f3]) ).

fof(f10,plain,
    ! [X0] :
      ( ~ a_member_of(X0,sK1)
      | a_member_of(X0,sK0) ),
    inference(resolution,[],[f4,f8]) ).

fof(f11,plain,
    ! [X0] :
      ( a_member_of(X0,sK1)
      | ~ a_member_of(X0,sK0) ),
    inference(resolution,[],[f5,f8]) ).

fof(f12,plain,
    ( a_member_of(sK2(sK1,sK0),sK1)
    | a_member_of(sK2(sK1,sK0),sK0) ),
    inference(resolution,[],[f6,f9]) ).

fof(f15,plain,
    a_member_of(sK2(sK1,sK0),sK0),
    inference(forward_subsumption_resolution,[],[f12,f10]) ).

fof(f16,plain,
    ( ~ a_member_of(sK2(sK1,sK0),sK1)
    | ~ a_member_of(sK2(sK1,sK0),sK0) ),
    inference(resolution,[],[f7,f9]) ).

fof(f19,plain,
    ~ a_member_of(sK2(sK1,sK0),sK1),
    inference(forward_subsumption_resolution,[],[f16,f10]) ).

fof(f21,plain,
    ~ a_member_of(sK2(sK1,sK0),sK0),
    inference(resolution,[],[f11,f19]) ).

fof(f22,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f21,f15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN966+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  % Computer : n006.cluster.edu
% 0.07/0.21  % Model    : x86_64 x86_64
% 0.07/0.21  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.21  % Memory   : 8046.5625MB
% 0.07/0.21  % OS       : Linux 6.8.0-71-generic
% 0.07/0.21  % CPULimit : 300
% 0.07/0.21  % WCLimit  : 300
% 0.07/0.21  % DateTime : Mon Sep 28 17:16:41 UTC 2026
% 0.07/0.21  % CPUTime  : 
% 0.07/0.21  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.24  Running first-order model finding
% 0.07/0.24  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.28  % (4124310)Will run a generic schedule for satisfiability detection.
% 0.20/0.28  % (4124315)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3520652361_3000 on theBenchmark for (3000ds/0Mi)
% 0.20/0.28  % TRYING [1]
% 0.20/0.28  % TRYING [2]
% 0.20/0.28  % TRYING [3]
% 0.20/0.28  % TRYING [4]
% 0.20/0.28  % TRYING [5]
% 0.20/0.28  % TRYING [6]
% 0.20/0.28  % TRYING [7]
% 0.20/0.28  % TRYING [8]
% 0.20/0.28  % TRYING [9]
% 0.20/0.28  % TRYING [10]
% 0.20/0.28  % (4124316)% WARNING: option uhcvi not known.
% 0.20/0.28  % TRYING [11]
% 0.20/0.28  % TRYING [12]
% 0.20/0.28  % TRYING [13]
% 0.20/0.28  % (4124316)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=35445874:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.20/0.28  % (4124317)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3779300114:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.20/0.28  % (4124318)dis+10_1_sil=32000:sp=arity:random_seed=1564184609:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.20/0.28  % TRYING [14]
% 0.20/0.28  % (4124319)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3237917423:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.20/0.28  % (4124320)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2873791548:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.20/0.28  % (4124321)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1455416291:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.20/0.28  % (4124319) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124319"...
% 0.20/0.28  % TRYING [15]
% 0.20/0.28  % (4124318) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124318"...
% 0.20/0.28  % (4124320) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124320"...
% 0.20/0.28  % (4124316) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124316"...
% 0.20/0.28  % (4124321) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124321"...
% 0.20/0.28  % (4124319)...printing done.
% 0.20/0.28  % (4124317) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-4124310-4124317"...
% 0.20/0.28  % (4124318)...printing done.
% 0.20/0.28  % (4124319)Refutation found. Thanks to Tanya!
% 0.20/0.28  % SZS status Theorem for theBenchmark
% 0.20/0.28  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28  % (4124319)------------------------------
% 0.20/0.28  % (4124319)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28  % (4124319)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28  % (4124319)CaDiCaL version: 2.1.3
% 0.20/0.28  % (4124319)Termination reason: Refutation
% 0.20/0.28  % (4124319)Time elapsed: 0.001 s
% 0.20/0.28  % (4124319)Peak memory usage: 11 MB
% 0.20/0.28  % (4124319)Instructions burned: 1 (million)
% 0.20/0.28  % (4124310)Success in time 0.025 s
% 0.20/0.28  % Vampire exiting
%------------------------------------------------------------------------------