TSTP Solution File: SWV429^2 by Leo-III-SAT---1.7.12

View Problem - Process Solution

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

% Computer : n032.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 05:51:47 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(individuals_type,type,
    individuals: $tType ).

thf(icl_princ_type,type,
    icl_princ: ( $i > $o ) > $i > $o ).

thf(icl_princ_def,definition,
    ( icl_princ
    = ( ^ [A: $i > $o] : A ) ) ).

thf(iclval_type,type,
    iclval: ( $i > $o ) > $o ).

thf(iclval_def,definition,
    iclval = mvalid ).

thf(icl_impl_princ_type,type,
    icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(icl_impl_princ_def,definition,
    ( icl_impl_princ
    = ( ^ [A: $i > $o,B: $i > $o] : ( mbox @ rel @ ( mimpl @ A @ B ) ) ) ) ).

thf(a_type,type,
    a: $i > $o ).

thf(1,conjecture,
    iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).

thf(2,negated_conjecture,
    ~ ( iclval @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ a ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

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

thf(6,plain,
    $false,
    inference(simp,[status(thm)],[5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWV429^2 : TPTP v8.2.0. Released v3.6.0.
% 0.11/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n032.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Sun May 19 08:10:54 EDT 2024
% 0.15/0.36  % CPUTime  : 
% 1.18/1.13  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.89/1.39  % [INFO] 	 Parsing done (259ms). 
% 1.89/1.40  % [INFO] 	 Running in sequential loop mode. 
% 2.62/1.84  % [INFO] 	 nitpick registered as external prover. 
% 2.62/1.85  % [INFO] 	 Scanning for conjecture ... 
% 2.99/2.00  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.99/2.04  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.99/2.05  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.99/2.06  % [INFO] 	 Type checking passed. 
% 2.99/2.06  % [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.65/2.31  % [INFO] 	 Killing All external provers ... 
% 3.65/2.32  % Time passed: 1771ms (effective reasoning time: 904ms)
% 3.65/2.32  % 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.65/2.32  % Axioms used in derivation (0): 
% 3.65/2.32  % No. of inferences in proof: 4
% 3.65/2.32  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1771 ms resp. 904 ms w/o parsing
% 3.65/2.37  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.65/2.37  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------