↑ 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  : SEU167+3 : 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:52:13 PM UTC 2026

% Result   : Theorem 0.11s 0.44s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   21 (   7 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   40 (  15   ~;  10   |;  11   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   44 (  36   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f4,axiom,
    ! [X0,X1,X2] :
      ( subset(X0,X1)
     => ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
        & subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t118_zfmisc_1) ).

fof(f5,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( subset(X0,X1)
        & subset(X2,X3) )
     => subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t119_zfmisc_1) ).

fof(f6,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( subset(X0,X1)
          & subset(X2,X3) )
       => subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3)) ),
    inference(negated_conjecture,[status(cth)],[f5]) ).

fof(f7,axiom,
    ! [X0,X1,X2] :
      ( ( subset(X0,X1)
        & subset(X1,X2) )
     => subset(X0,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).

fof(f9,plain,
    ! [X0,X1,X2] :
      ( ( subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2))
        & subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) )
      | ~ subset(X0,X1) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f10,plain,
    ? [X0,X1,X2,X3] :
      ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
      & subset(X0,X1)
      & subset(X2,X3) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f11,plain,
    ? [X0,X1,X2,X3] :
      ( ~ subset(cartesian_product2(X0,X2),cartesian_product2(X1,X3))
      & subset(X0,X1)
      & subset(X2,X3) ),
    inference(flattening,[],[f10]) ).

fof(f12,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X0,X1)
      | ~ subset(X1,X2) ),
    inference(ennf_transformation,[],[f7]) ).

fof(f13,plain,
    ! [X0,X1,X2] :
      ( subset(X0,X2)
      | ~ subset(X0,X1)
      | ~ subset(X1,X2) ),
    inference(flattening,[],[f12]) ).

fof(f16,plain,
    ( ~ subset(cartesian_product2(sK2,sK4),cartesian_product2(sK3,sK5))
    & subset(sK2,sK3)
    & subset(sK4,sK5) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5]),skolemize(X0,sK2),skolemize(X1,sK3),skolemize(X2,sK4),skolemize(X3,sK5)],[f11]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | subset(cartesian_product2(X2,X0),cartesian_product2(X2,X1)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f21,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | subset(cartesian_product2(X0,X2),cartesian_product2(X1,X2)) ),
    inference(cnf_transformation,[],[f9]) ).

fof(f22,plain,
    subset(sK4,sK5),
    inference(cnf_transformation,[],[f16]) ).

fof(f23,plain,
    subset(sK2,sK3),
    inference(cnf_transformation,[],[f16]) ).

fof(f24,plain,
    ~ subset(cartesian_product2(sK2,sK4),cartesian_product2(sK3,sK5)),
    inference(cnf_transformation,[],[f16]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( ~ subset(X0,X1)
      | subset(X0,X2)
      | ~ subset(X1,X2) ),
    inference(cnf_transformation,[],[f13]) ).

fof(f29,plain,
    ! [X0] : subset(cartesian_product2(X0,sK4),cartesian_product2(X0,sK5)),
    inference(resolution,[],[f20,f22]) ).

fof(f34,plain,
    ! [X0] : subset(cartesian_product2(sK2,X0),cartesian_product2(sK3,X0)),
    inference(resolution,[],[f21,f23]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ subset(cartesian_product2(X0,sK5),X1)
      | subset(cartesian_product2(X0,sK4),X1) ),
    inference(resolution,[],[f29,f25]) ).

fof(f50,plain,
    subset(cartesian_product2(sK2,sK4),cartesian_product2(sK3,sK5)),
    inference(resolution,[],[f39,f34]) ).

fof(f52,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f50,f24]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU167+3 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n019.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Mon Sep 28 03:52:04 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.40  Running first-order model finding
% 0.11/0.40  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.11/0.44  % (3643196)Will run a generic schedule for satisfiability detection.
% 0.11/0.44  % (3643206)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2373542750:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.44  % (3643206) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3643196-3643206"...
% 0.11/0.44  % (3643206)...printing done.
% 0.11/0.44  % (3643206)Refutation found. Thanks to Tanya!
% 0.11/0.44  % SZS status Theorem for theBenchmark
% 0.11/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.44  % (3643206)------------------------------
% 0.11/0.44  % (3643206)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.44  % (3643206)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.44  % (3643206)CaDiCaL version: 2.1.3
% 0.11/0.44  % (3643206)Termination reason: Refutation
% 0.11/0.44  % (3643206)Time elapsed: 0.001 s
% 0.11/0.44  % (3643206)Peak memory usage: 11 MB
% 0.11/0.44  % (3643206)Instructions burned: 1 (million)
% 0.11/0.44  % (3643196)Success in time 0.028 s
% 0.11/0.44  % Vampire exiting
%------------------------------------------------------------------------------