TSTP Solution File: LCL072-1 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : LCL072-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n005.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 : Fri May 19 11:29:17 EDT 2023

% Result   : Unsatisfiable 8.29s 2.52s
% Output   : Refutation 8.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   16 (   9 unt;   5 typ;   0 def)
%            Number of atoms       :   15 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  106 (   6   ~;   4   |;   0   &;  96   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   4   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0   ^;  24   !;   0   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
thf(is_a_theorem_type,type,
    is_a_theorem: $i > $o ).

thf(implies_type,type,
    implies: $i > $i > $i ).

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

thf(not_type,type,
    not: $i > $i ).

thf(b_type,type,
    b: $i ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( implies @ A @ B ) @ C ) @ ( implies @ B @ C ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).

thf(10,plain,
    ! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( implies @ A @ B ) @ C ) @ ( implies @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,negated_conjecture,
    ~ ( is_a_theorem @ ( implies @ a @ ( implies @ ( not @ a ) @ b ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_3) ).

thf(6,plain,
    ~ ( is_a_theorem @ ( implies @ a @ ( implies @ ( not @ a ) @ b ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(5,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ ( not @ B ) @ C ) ) @ ( implies @ A @ ( implies @ ( implies @ D @ C ) @ ( implies @ ( implies @ B @ D ) @ C ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_60) ).

thf(12,plain,
    ! [D: $i,C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ A @ ( implies @ ( not @ B ) @ C ) ) @ ( implies @ A @ ( implies @ ( implies @ D @ C ) @ ( implies @ ( implies @ B @ D ) @ C ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(4,axiom,
    ! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( implies @ A @ B ) @ C ) @ ( implies @ ( not @ A ) @ C ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).

thf(11,plain,
    ! [C: $i,B: $i,A: $i] : ( is_a_theorem @ ( implies @ ( implies @ ( implies @ A @ B ) @ C ) @ ( implies @ ( not @ A ) @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( is_a_theorem @ ( implies @ A @ B ) )
      | ~ ( is_a_theorem @ A )
      | ( is_a_theorem @ B ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

thf(8,plain,
    ! [B: $i,A: $i] :
      ( ~ ( is_a_theorem @ ( implies @ A @ B ) )
      | ~ ( is_a_theorem @ A )
      | ( is_a_theorem @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(259,plain,
    $false,
    inference(e,[status(thm)],[10,6,12,11,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL072-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.35  % Computer : n005.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu May 18 15:37:24 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 0.96/0.84  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.28/0.95  % [INFO] 	 Parsing done (109ms). 
% 1.28/0.96  % [INFO] 	 Running in sequential loop mode. 
% 1.66/1.16  % [INFO] 	 eprover registered as external prover. 
% 1.66/1.16  % [INFO] 	 cvc4 registered as external prover. 
% 1.66/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.21  % [INFO] 	 Found a conjecture and 4 axioms. Running axiom selection ... 
% 1.84/1.23  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 1.87/1.24  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.87/1.24  % [INFO] 	 Type checking passed. 
% 1.87/1.24  % [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 ... 
% 8.29/2.51  % External prover 'e' found a proof!
% 8.29/2.51  % [INFO] 	 Killing All external provers ... 
% 8.29/2.52  % Time passed: 1999ms (effective reasoning time: 1551ms)
% 8.29/2.52  % 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)>
% 8.29/2.52  % Axioms used in derivation (4): cn_19, cn_60, cn_37, condensed_detachment
% 8.29/2.52  % No. of inferences in proof: 11
% 8.29/2.52  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1999 ms resp. 1551 ms w/o parsing
% 8.29/2.53  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.29/2.53  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------