TSTP Solution File: LCL580^1 by Leo-III---1.7.15

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.15
% Problem  : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d THM

% 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 : Mon Jun 24 11:14:42 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(mtrue_type,type,
    mtrue: $i > $o ).

thf(mtrue_def,definition,
    ( mtrue
    = ( ^ [A: $i] : $true ) ) ).

thf(mbox_type,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(mbox_def,definition,
    ( mbox
    = ( ^ [A: $i > $i > $o,B: $i > $o,C: $i] :
        ! [D: $i] :
          ( ( A @ C @ D )
         => ( B @ D ) ) ) ) ).

thf(individuals_type,type,
    individuals: $tType ).

thf(mvalid_type,type,
    mvalid: ( $i > $o ) > $o ).

thf(mvalid_def,definition,
    ( mvalid
    = ( '!' @ $i ) ) ).

thf(r_type,type,
    r: $i > $i > $o ).

thf(1,conjecture,
    mvalid @ ( mbox @ r @ mtrue ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).

thf(2,negated_conjecture,
    ~ ( mvalid @ ( mbox @ r @ mtrue ) ),
    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.12/0.12  % Problem  : LCL580^1 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.12  % Command  : run_Leo-III %s %d THM
% 0.12/0.33  % Computer : n019.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Sat Jun 22 17:15:40 EDT 2024
% 0.12/0.33  % CPUTime  : 
% 0.96/0.88  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.15/1.00  % [INFO] 	 Parsing done (118ms). 
% 1.37/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.73/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.83/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.90/1.29  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.90/1.30  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.90/1.30  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.90/1.30  % [INFO] 	 Type checking passed. 
% 1.90/1.31  % [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.27/1.38  % [INFO] 	 Killing All external provers ... 
% 2.27/1.38  % Time passed: 842ms (effective reasoning time: 372ms)
% 2.27/1.38  % 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.27/1.39  % Axioms used in derivation (0): 
% 2.27/1.39  % No. of inferences in proof: 4
% 2.27/1.39  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 842 ms resp. 372 ms w/o parsing
% 2.27/1.41  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.27/1.41  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------