TSTP Solution File: CSR135^2 by Leo-III---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.10
% Problem  : CSR135^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n019.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  7 07:38:56 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(num_type,type,
    num: $tType ).

thf(1,conjecture,
    ? [A: $i > $i > $o] :
      ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

thf(2,negated_conjecture,
    ~ ? [A: $i > $i > $o] :
        ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(14,plain,
    ~ ? [A: $i > $i > $o] :
        ( ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        & ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(15,plain,
    ! [A: $i > $i > $o] :
      ( ~ ( A @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( A @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(cnf,[status(esa)],[14]) ).

thf(41,plain,
    ( ~ $true
    | ~ $true ),
    inference(prim_subst,[status(thm)],[15:[bind(A,$thf( ^ [B: $i] : ^ [C: $i] : $true ))]]) ).

thf(64,plain,
    $false,
    inference(simp,[status(thm)],[41]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR135^2 : TPTP v8.1.2. Released v4.1.0.
% 0.14/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.37  % Computer : n019.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Mon May  6 15:47:24 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 0.89/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.16/0.97  % [INFO] 	 Parsing done (126ms). 
% 1.16/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.57/1.23  % [INFO] 	 eprover registered as external prover. 
% 1.57/1.23  % [INFO] 	 cvc4 registered as external prover. 
% 1.57/1.23  % [INFO] 	 Scanning for conjecture ... 
% 1.69/1.29  % [INFO] 	 Found a conjecture and 11 axioms. Running axiom selection ... 
% 1.80/1.31  % [INFO] 	 Axiom selection finished. Selected 11 axioms (removed 0 axioms). 
% 1.80/1.31  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.80/1.32  % [INFO] 	 Type checking passed. 
% 1.80/1.32  % [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 ... 
% 3.06/1.79  % [INFO] 	 Killing All external provers ... 
% 3.06/1.80  % Time passed: 1296ms (effective reasoning time: 802ms)
% 3.06/1.80  % 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)>
% 3.06/1.80  % Axioms used in derivation (0): 
% 3.06/1.80  % No. of inferences in proof: 6
% 3.06/1.80  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1296 ms resp. 802 ms w/o parsing
% 3.06/1.81  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.06/1.81  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------