TSTP Solution File: SET143^5 by Leo-III---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.12
% Problem  : SET143^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n028.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:01:52 EDT 2024

% Result   : Theorem 2.70s 2.04s
% Output   : Refutation 2.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    5 (   4 unt;   1 typ;   0 def)
%            Number of atoms       :    4 (   2 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   22 (   2   ~;   0   |;   8   &;  12   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    3 (   0 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (   4   ^   6   !;   0   ?;  10   :)

% Comments : 
%------------------------------------------------------------------------------
thf(a_type,type,
    a: $tType ).

thf(1,conjecture,
    ! [A: a > $o,B: a > $o,C: a > $o] :
      ( ( ^ [D: a] :
            ( ( A @ D )
            & ( B @ D )
            & ( C @ D ) ) )
      = ( ^ [D: a] :
            ( ( A @ D )
            & ( B @ D )
            & ( C @ D ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cBOOL_PROP_67_pme) ).

thf(2,negated_conjecture,
    ~ ! [A: a > $o,B: a > $o,C: a > $o] :
        ( ( ^ [D: a] :
              ( ( A @ D )
              & ( B @ D )
              & ( C @ D ) ) )
        = ( ^ [D: a] :
              ( ( A @ D )
              & ( B @ D )
              & ( C @ D ) ) ) ),
    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.11/0.12  % Problem  : SET143^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14  % Command  : run_Leo-III %s %d
% 0.13/0.35  % Computer : n028.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon May 20 11:47:08 EDT 2024
% 0.13/0.35  % CPUTime  : 
% 1.17/1.11  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.46/1.29  % [INFO] 	 Parsing done (177ms). 
% 1.46/1.30  % [INFO] 	 Running in sequential loop mode. 
% 2.15/1.72  % [INFO] 	 eprover registered as external prover. 
% 2.15/1.72  % [INFO] 	 cvc4 registered as external prover. 
% 2.15/1.73  % [INFO] 	 Scanning for conjecture ... 
% 2.38/1.82  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.38/1.86  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.38/1.86  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.38/1.87  % [INFO] 	 Type checking passed. 
% 2.38/1.87  % [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.70/2.04  % [INFO] 	 Killing All external provers ... 
% 2.70/2.04  % Time passed: 1512ms (effective reasoning time: 727ms)
% 2.70/2.04  % 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.70/2.04  % Axioms used in derivation (0): 
% 2.70/2.04  % No. of inferences in proof: 4
% 2.70/2.04  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1512 ms resp. 727 ms w/o parsing
% 2.87/2.09  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.87/2.09  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------