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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n006.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:39:46 EDT 2023

% Result   : Unsatisfiable 3.70s 1.85s
% Output   : Refutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   30
% Syntax   : Number of formulae    :   50 (  19 unt;  11 typ;   0 def)
%            Number of atoms       :   65 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  242 (  28   ~;  26   |;   0   &; 188   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   13 (  13   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   62 (   0   ^;  62   !;   0   ?;  62   :)

% Comments : 
%------------------------------------------------------------------------------
thf(divides_type,type,
    divides: $i > $i > $o ).

thf(c_type,type,
    c: $i ).

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

thf(equalish_type,type,
    equalish: $i > $i > $o ).

thf(successor_type,type,
    successor: $i > $i ).

thf(n0_type,type,
    n0: $i ).

thf(less_type,type,
    less: $i > $i > $o ).

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

thf(add_type,type,
    add: $i > $i > $i ).

thf(multiply_type,type,
    multiply: $i > $i > $i ).

thf(predecessor_of_1st_minus_2nd_type,type,
    predecessor_of_1st_minus_2nd: $i > $i > $i ).

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( divides @ A @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divides_if_equal) ).

thf(25,plain,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( divides @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(14,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( equalish @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry) ).

thf(41,plain,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( equalish @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(16,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_lemma) ).

thf(45,plain,
    ! [B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ( equalish @ ( add @ ( successor @ ( predecessor_of_1st_minus_2nd @ B @ A ) ) @ A ) @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(5,axiom,
    ~ ( less @ b @ a ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_greater_equal_a) ).

thf(27,plain,
    ~ ( less @ b @ a ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(19,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ( divides @ A @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divides_if_less) ).

thf(49,plain,
    ! [B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ( divides @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

thf(13,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( equalish @ ( successor @ A ) @ ( successor @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_substitution) ).

thf(39,plain,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ( equalish @ ( successor @ A ) @ ( successor @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(10,axiom,
    ! [B: $i,A: $i] : ( equalish @ ( multiply @ A @ ( successor @ B ) ) @ ( add @ ( multiply @ A @ B ) @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times) ).

thf(35,plain,
    ! [B: $i,A: $i] : ( equalish @ ( multiply @ A @ ( successor @ B ) ) @ ( add @ ( multiply @ A @ B ) @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(18,axiom,
    ! [B: $i,A: $i] : ( equalish @ ( add @ A @ ( successor @ B ) ) @ ( successor @ ( add @ A @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addition) ).

thf(48,plain,
    ! [B: $i,A: $i] : ( equalish @ ( add @ A @ ( successor @ B ) ) @ ( successor @ ( add @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(8,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( equalish @ ( add @ ( successor @ A ) @ B ) @ C )
      | ( less @ B @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',smaller_number) ).

thf(31,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( equalish @ ( add @ ( successor @ A ) @ B ) @ C )
      | ( less @ B @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(15,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ ( successor @ A ) @ ( successor @ B ) )
      | ( equalish @ A @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_equality1) ).

thf(43,plain,
    ! [B: $i,A: $i] :
      ( ~ ( equalish @ ( successor @ A ) @ ( successor @ B ) )
      | ( equalish @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ~ ( less @ C @ A )
      | ( less @ C @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_less) ).

thf(23,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( less @ A @ B )
      | ~ ( less @ C @ A )
      | ( less @ C @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(17,axiom,
    ! [A: $i] : ( equalish @ ( add @ A @ n0 ) @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',adding_zero) ).

thf(47,plain,
    ! [A: $i] : ( equalish @ ( add @ A @ n0 ) @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(1,negated_conjecture,
    divides @ c @ a,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',impossible_c_divides_a) ).

thf(20,plain,
    divides @ c @ a,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(6,axiom,
    less @ b @ c,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_less_than_c) ).

thf(29,plain,
    less @ b @ c,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(12,axiom,
    ! [A: $i] : ( equalish @ ( multiply @ A @ n0 ) @ n0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',times_zero) ).

thf(38,plain,
    ! [A: $i] : ( equalish @ ( multiply @ A @ n0 ) @ n0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(2,negated_conjecture,
    ! [A: $i] :
      ~ ( equalish @ ( successor @ A ) @ n0 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_contradiction) ).

thf(21,plain,
    ! [A: $i] :
      ~ ( equalish @ ( successor @ A ) @ n0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(9,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( divides @ A @ B )
      | ( less @ A @ B )
      | ( equalish @ A @ B ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',divides_only_less_or_equal) ).

thf(33,plain,
    ! [B: $i,A: $i] :
      ( ~ ( divides @ A @ B )
      | ( less @ A @ B )
      | ( equalish @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(11,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ~ ( equalish @ B @ C )
      | ( equalish @ A @ C ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity) ).

thf(36,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( equalish @ A @ B )
      | ~ ( equalish @ B @ C )
      | ( equalish @ A @ C ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(7,axiom,
    ! [A: $i] : ( equalish @ A @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

thf(30,plain,
    ! [A: $i] : ( equalish @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(71,plain,
    $false,
    inference(e,[status(thm)],[25,41,45,27,49,39,35,48,31,43,23,47,20,29,38,21,33,36,30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM021-1 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.14/0.15  % Command  : run_Leo-III %s %d
% 0.15/0.36  % Computer : n006.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 : Thu May 18 16:49:22 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 0.95/0.85  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.26/0.98  % [INFO] 	 Parsing done (129ms). 
% 1.26/0.99  % [INFO] 	 Running in sequential loop mode. 
% 1.76/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.76/1.21  % [INFO] 	 cvc4 registered as external prover. 
% 1.76/1.22  % [INFO] 	 Scanning for conjecture ... 
% 1.90/1.27  % [INFO] 	 Found a conjecture and 17 axioms. Running axiom selection ... 
% 2.10/1.31  % [INFO] 	 Axiom selection finished. Selected 17 axioms (removed 0 axioms). 
% 2.10/1.33  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.10/1.33  % [INFO] 	 Type checking passed. 
% 2.10/1.33  % [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.70/1.85  % External prover 'e' found a proof!
% 3.70/1.85  % [INFO] 	 Killing All external provers ... 
% 3.70/1.85  % Time passed: 1320ms (effective reasoning time: 851ms)
% 3.70/1.85  % 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.70/1.85  % Axioms used in derivation (17): divides_if_less, b_greater_equal_a, successor_equality1, less_lemma, divides_only_less_or_equal, successor_substitution, reflexivity, addition, times_zero, times, adding_zero, divides_if_equal, transitivity_of_less, transitivity, symmetry, smaller_number, b_less_than_c
% 3.70/1.85  % No. of inferences in proof: 39
% 3.70/1.85  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1320 ms resp. 851 ms w/o parsing
% 3.70/1.88  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.70/1.88  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------