%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SEU667^2 : TPTP v8.2.0. Released v3.7.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n003.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May 21 03:43:14 EDT 2024

% Result   : Theorem 2.35s 1.76s
% Output   : Refutation 2.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   10 (   5 unt;   3 typ;   3 def)
%            Number of atoms       :   21 (   4 equ;   0 cnn)
%            Maximal formula atoms :    2 (   3 avg)
%            Number of connectives :   42 (   2   ~;   0   |;   3   &;  35   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   16 (  16   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   8 usr;   8 con; 0-3 aty)
%            Number of variables   :   18 (   7   ^   9   !;   2   ?;  18   :)

% Comments : 
%------------------------------------------------------------------------------
thf(breln_type,type,
    breln: $i > $i > $i > $o ).

thf(breln_def,definition,
    ( breln
    = ( ^ [A: $i,B: $i,C: $i] : ( subset @ C @ ( cartprod @ A @ B ) ) ) ) ).

thf(dpsetconstr_type,type,
    dpsetconstr: $i > $i > ( $i > $i > $o ) > $i ).

thf(dpsetconstr_def,definition,
    ( dpsetconstr
    = ( ^ [A: $i,B: $i,C: $i > $i > $o] :
          ( dsetconstr @ ( cartprod @ A @ B )
          @ ^ [D: $i] :
            ? [E: $i] :
              ( ( in @ E @ A )
              & ? [F: $i] :
                  ( ( in @ F @ B )
                  & ( C @ E @ F )
                  & ( D
                    = ( kpair @ E @ F ) ) ) ) ) ) ) ).

thf(dpsetconstrSub_type,type,
    dpsetconstrSub: $o ).

thf(dpsetconstrSub_def,definition,
    ( dpsetconstrSub
    = ( ! [A: $i,B: $i,C: $i > $i > $o] : ( subset @ ( dpsetconstr @ A @ B @ C ) @ ( cartprod @ A @ B ) ) ) ) ).

thf(1,conjecture,
    ( dpsetconstrSub
   => ! [A: $i,B: $i,C: $i > $i > $o] : ( breln @ A @ B @ ( dpsetconstr @ A @ B @ C ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',setOfPairsIsBReln) ).

thf(2,negated_conjecture,
    ~ ( dpsetconstrSub
     => ! [A: $i,B: $i,C: $i > $i > $o] : ( breln @ A @ B @ ( dpsetconstr @ A @ B @ C ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ $true,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    $false,
    inference(simp,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : SEU667^2 : TPTP v8.2.0. Released v3.7.0.
% 0.02/0.12  % Command  : run_Leo-III %s %d
% 0.13/0.32  % Computer : n003.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 300
% 0.13/0.32  % DateTime : Sun May 19 16:08:24 EDT 2024
% 0.13/0.33  % CPUTime  : 
% 1.02/0.93  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.31/1.11  % [INFO] 	 Parsing done (168ms). 
% 1.31/1.12  % [INFO] 	 Running in sequential loop mode. 
% 1.87/1.47  % [INFO] 	 nitpick registered as external prover. 
% 1.87/1.47  % [INFO] 	 Scanning for conjecture ... 
% 2.05/1.58  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.05/1.61  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.05/1.61  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.05/1.62  % [INFO] 	 Type checking passed. 
% 2.05/1.62  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 2.35/1.76  % [INFO] 	 Killing All external provers ... 
% 2.35/1.76  % Time passed: 1286ms (effective reasoning time: 636ms)
% 2.35/1.76  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 2.35/1.76  % Axioms used in derivation (0): 
% 2.35/1.76  % No. of inferences in proof: 4
% 2.35/1.76  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1286 ms resp. 636 ms w/o parsing
% 2.58/1.82  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.58/1.82  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------