TSTP Solution File: SYO691-1.000 by Leo-III---1.7.7

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III---1.7.7
% Problem  : SYO691-1.000 : TPTP v8.1.2. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n003.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 12:37:04 EDT 2023

% Result   : Unsatisfiable 2.67s 1.53s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   22 (   7 unt;   7 typ;   0 def)
%            Number of atoms       :   25 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  126 (  12   ~;  10   |;   0   &; 104   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   10 (  10   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   34 (   0   ^;  34   !;   0   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
thf(seq_type,type,
    seq: $i > $i > $i > $o ).

thf(succ_type,type,
    succ: $i > $i ).

thf(zero_type,type,
    zero: $i ).

thf(top_type,type,
    top: $i > $i > $o ).

thf(f_type,type,
    f: $i > $i > $i ).

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

thf(step_type,type,
    step: $i > $i > $o ).

thf(2,axiom,
    ! [C: $i,B: $i,A: $i] : ( top @ ( f @ ( f @ A @ B ) @ ( f @ C @ a ) ) @ ( f @ ( f @ C @ ( f @ B @ a ) ) @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

thf(10,plain,
    ! [C: $i,B: $i,A: $i] : ( top @ ( f @ ( f @ A @ B ) @ ( f @ C @ a ) ) @ ( f @ ( f @ C @ ( f @ B @ a ) ) @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( step @ A @ B )
      | ( step @ ( f @ A @ C ) @ ( f @ B @ C ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_left) ).

thf(13,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( step @ A @ B )
      | ( step @ ( f @ A @ C ) @ ( f @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(6,axiom,
    ! [A: $i] : ( seq @ zero @ A @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_zero) ).

thf(17,plain,
    ! [A: $i] : ( seq @ zero @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(7,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( seq @ A @ B @ C )
      | ~ ( step @ C @ D )
      | ( seq @ ( succ @ A ) @ B @ D ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_sequence_succ) ).

thf(18,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( seq @ A @ B @ C )
      | ~ ( step @ C @ D )
      | ( seq @ ( succ @ A ) @ B @ D ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

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

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ~ ( top @ A @ B )
      | ( step @ A @ B ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,negated_conjecture,
    ! [A: $i] :
      ~ ( seq @ ( succ @ ( succ @ ( succ @ zero ) ) ) @ A @ A ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).

thf(8,plain,
    ! [A: $i] :
      ~ ( seq @ ( succ @ ( succ @ ( succ @ zero ) ) ) @ A @ A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(5,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( step @ A @ B )
      | ( step @ ( f @ C @ A ) @ ( f @ C @ B ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_right) ).

thf(15,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( step @ A @ B )
      | ( step @ ( f @ C @ A ) @ ( f @ C @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(23,plain,
    $false,
    inference(e,[status(thm)],[10,13,17,18,11,8,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYO691-1.000 : TPTP v8.1.2. Released v7.3.0.
% 0.12/0.15  % Command  : run_Leo-III %s %d
% 0.14/0.35  % Computer : n003.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Thu May 18 18:15:16 EDT 2023
% 0.14/0.36  % CPUTime  : 
% 0.84/0.83  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/0.94  % [INFO] 	 Parsing done (107ms). 
% 1.23/0.94  % [INFO] 	 Running in sequential loop mode. 
% 1.47/1.14  % [INFO] 	 eprover registered as external prover. 
% 1.47/1.14  % [INFO] 	 cvc4 registered as external prover. 
% 1.47/1.15  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.19  % [INFO] 	 Found a conjecture and 6 axioms. Running axiom selection ... 
% 1.82/1.21  % [INFO] 	 Axiom selection finished. Selected 6 axioms (removed 0 axioms). 
% 1.82/1.22  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.82/1.22  % [INFO] 	 Type checking passed. 
% 1.82/1.22  % [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.67/1.53  % External prover 'e' found a proof!
% 2.67/1.53  % [INFO] 	 Killing All external provers ... 
% 2.67/1.53  % Time passed: 1021ms (effective reasoning time: 584ms)
% 2.67/1.53  % 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.67/1.53  % Axioms used in derivation (6): rewrite_right, rewrite_top, rule_1, rewrite_sequence_succ, rewrite_sequence_zero, rewrite_left
% 2.67/1.53  % No. of inferences in proof: 15
% 2.67/1.53  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1021 ms resp. 584 ms w/o parsing
% 2.67/1.56  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.67/1.56  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------