↑ 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  : SET917+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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:44:59 PM UTC 2026

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   26 (  11 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   18 (   9   ~;   6   |;   1   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   22 (  20   !;   2   ?)

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

fof(f4,axiom,
    ! [X0,X1] :
      ( ~ in(X0,X1)
     => disjoint(singleton(X0),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l28_zfmisc_1) ).

fof(f5,axiom,
    ! [X0,X1] :
      ( in(X0,X1)
     => set_intersection2(X1,singleton(X0)) = singleton(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l32_zfmisc_1) ).

fof(f9,conjecture,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | set_intersection2(singleton(X0),X1) = singleton(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t58_zfmisc_1) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1] :
        ( disjoint(singleton(X0),X1)
        | set_intersection2(singleton(X0),X1) = singleton(X0) ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( set_intersection2(X1,singleton(X0)) = singleton(X0)
      | ~ in(X0,X1) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f16,plain,
    ? [X0,X1] :
      ( ~ disjoint(singleton(X0),X1)
      & singleton(X0) != set_intersection2(singleton(X0),X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f18,plain,
    ! [X0,X1] : set_intersection2(X0,X1) = set_intersection2(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( disjoint(singleton(X0),X1)
      | in(X0,X1) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ~ in(X0,X1)
      | singleton(X0) = set_intersection2(X1,singleton(X0)) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f25,plain,
    singleton(sK2) != set_intersection2(singleton(sK2),sK3),
    inference(cnf_transformation,[],[f16]) ).

fof(f26,plain,
    ~ disjoint(singleton(sK2),sK3),
    inference(cnf_transformation,[],[f16]) ).

fof(f29,plain,
    singleton(sK2) != set_intersection2(sK3,singleton(sK2)),
    inference(superposition,[],[f25,f18]) ).

fof(f31,plain,
    in(sK2,sK3),
    inference(resolution,[],[f20,f26]) ).

fof(f34,plain,
    singleton(sK2) = set_intersection2(sK3,singleton(sK2)),
    inference(resolution,[],[f21,f31]) ).

fof(f35,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f34,f29]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SET917+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37  % Computer : n019.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 28 03:10:03 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.09/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.41  Running first-order model finding
% 0.09/0.41  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.17/0.47  % (3625468)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (3625473)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1229566886_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47  % TRYING [1]
% 0.17/0.47  % TRYING [2]
% 0.17/0.47  % TRYING [3]
% 0.17/0.47  % TRYING [4]
% 0.17/0.47  % TRYING [5]
% 0.17/0.47  % (3625474)% WARNING: option uhcvi not known.
% 0.17/0.47  % TRYING [6]
% 0.17/0.47  % TRYING [7]
% 0.17/0.47  % (3625474)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2523705700:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (3625475)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4115057996:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47  % (3625476)dis+10_1_sil=32000:sp=arity:random_seed=3796238802:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47  % (3625477)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1379617623:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47  % (3625478)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2089229165:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47  % (3625479)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2070976000:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47  % (3625474) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625474"...
% 0.17/0.47  % (3625476) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625476"...
% 0.17/0.47  % (3625477) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625477"...
% 0.17/0.47  % (3625478) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625478"...
% 0.17/0.47  % (3625479) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625479"...
% 0.17/0.47  % TRYING [8]
% 0.17/0.47  % (3625475) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3625468-3625475"...
% 0.17/0.47  % (3625474)...printing done.
% 0.17/0.47  % (3625476)...printing done.
% 0.17/0.47  % (3625477)...printing done.
% 0.17/0.47  % (3625478)...printing done.
% 0.17/0.47  % (3625479)...printing done.
% 0.17/0.47  % (3625474)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (3625474)------------------------------
% 0.17/0.47  % (3625474)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (3625474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (3625474)CaDiCaL version: 2.1.3
% 0.17/0.47  % (3625474)Termination reason: Refutation
% 0.17/0.47  % (3625474)Time elapsed: 0.002 s
% 0.17/0.47  % (3625474)Peak memory usage: 12 MB
% 0.17/0.47  % (3625474)Instructions burned: 1 (million)
% 0.17/0.47  % (3625468)Success in time 0.051 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------