TSTP Solution File: SYN360^5 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYN360^5 : TPTP v8.2.0. Released v4.0.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 : Tue May 21 08:18:13 EDT 2024

% Result   : Theorem 2.38s 1.50s
% Output   : Refutation 2.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   17 (   7 unt;   5 typ;   0 def)
%            Number of atoms       :   25 (   1 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   64 (   6   ~;   2   |;   3   &;  47   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    5 (   5   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0   ^  28   !;   6   ?;  34   :)

% Comments : 
%------------------------------------------------------------------------------
thf(cQ_type,type,
    cQ: $i > $i > $o ).

thf(c_less__type,type,
    c_less_: $i > $i > $o ).

thf(sk1_type,type,
    sk1: $i > $i ).

thf(sk2_type,type,
    sk2: $i ).

thf(sk3_type,type,
    sk3: $i ).

thf(1,conjecture,
    ( ( ! [A: $i] :
          ( ? [B: $i] : ( c_less_ @ A @ B )
         => ! [B: $i] : ( cQ @ A @ B ) )
      & ! [A: $i] :
        ? [B: $i] : ( c_less_ @ A @ B ) )
   => ! [A: $i,B: $i] : ( cQ @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cX2111A_pme) ).

thf(2,negated_conjecture,
    ~ ( ( ! [A: $i] :
            ( ? [B: $i] : ( c_less_ @ A @ B )
           => ! [B: $i] : ( cQ @ A @ B ) )
        & ! [A: $i] :
          ? [B: $i] : ( c_less_ @ A @ B ) )
     => ! [A: $i,B: $i] : ( cQ @ B @ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(3,plain,
    ~ ( ( ! [A: $i] :
            ( ? [B: $i] : ( c_less_ @ A @ B )
           => ! [B: $i] : ( cQ @ A @ B ) )
        & ! [A: $i] :
          ? [B: $i] : ( c_less_ @ A @ B ) )
     => ! [A: $i,B: $i] : ( cQ @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(4,plain,
    ~ ( cQ @ sk3 @ sk2 ),
    inference(cnf,[status(esa)],[3]) ).

thf(5,plain,
    ! [A: $i] : ( c_less_ @ A @ ( sk1 @ A ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(7,plain,
    ! [A: $i] : ( c_less_ @ A @ ( sk1 @ A ) ),
    inference(simp,[status(thm)],[5]) ).

thf(6,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( c_less_ @ A @ B )
      | ( cQ @ A @ C ) ),
    inference(cnf,[status(esa)],[3]) ).

thf(9,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( cQ @ B @ D )
      | ( ( c_less_ @ A @ ( sk1 @ A ) )
       != ( c_less_ @ B @ C ) ) ),
    inference(paramod_ordered,[status(thm)],[7,6]) ).

thf(10,plain,
    ! [B: $i,A: $i] : ( cQ @ B @ A ),
    inference(pattern_uni,[status(thm)],[9:[bind(A,$thf( E )),bind(B,$thf( E )),bind(C,$thf( sk1 @ E ))]]) ).

thf(11,plain,
    ! [B: $i,A: $i] : ( cQ @ B @ A ),
    inference(simp,[status(thm)],[10]) ).

thf(12,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[4,11]) ).

thf(13,plain,
    $false,
    inference(simp,[status(thm)],[12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN360^5 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.16  % Command  : run_Leo-III %s %d
% 0.15/0.37  % Computer : n003.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 300
% 0.15/0.37  % DateTime : Mon May 20 15:53:39 EDT 2024
% 0.15/0.37  % CPUTime  : 
% 0.97/0.87  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.14/0.97  % [INFO] 	 Parsing done (94ms). 
% 1.14/0.98  % [INFO] 	 Running in sequential loop mode. 
% 1.46/1.17  % [INFO] 	 nitpick registered as external prover. 
% 1.46/1.17  % [INFO] 	 Scanning for conjecture ... 
% 1.74/1.22  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.80/1.24  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.80/1.24  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.80/1.25  % [INFO] 	 Type checking passed. 
% 1.80/1.25  % [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.38/1.50  % [INFO] 	 Killing All external provers ... 
% 2.38/1.50  % Time passed: 960ms (effective reasoning time: 520ms)
% 2.38/1.50  % 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.38/1.50  % Axioms used in derivation (0): 
% 2.38/1.50  % No. of inferences in proof: 12
% 2.38/1.50  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 960 ms resp. 520 ms w/o parsing
% 2.53/1.57  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.53/1.57  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------