TSTP Solution File: SYO549^1 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : SYO549^1 : TPTP v8.2.0. Released v5.2.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 : Tue May 21 09:00:54 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
thf(p_type,type,
    p: ( $o > $o ) > ( $o > $o ) > $o ).

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

thf(g_type,type,
    g: $o > $o ).

thf(3,axiom,
    ( p
    @ ^ [A: $o] :
        ( f
        @ ~ ~ A )
    @ g ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfg) ).

thf(5,plain,
    p @ f @ g,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,conjecture,
    ( p @ f
    @ ^ [A: $o] :
        ( g
        @ ~ ~ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pfgc) ).

thf(2,negated_conjecture,
    ~ ( p @ f
      @ ^ [A: $o] :
          ( g
          @ ~ ~ A ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(4,plain,
    ~ ( p @ f @ g ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYO549^1 : TPTP v8.2.0. Released v5.2.0.
% 0.12/0.16  % Command  : run_Leo-III %s %d
% 0.16/0.37  % Computer : n005.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Mon May 20 08:36:54 EDT 2024
% 0.16/0.37  % CPUTime  : 
% 0.99/0.86  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.21/0.96  % [INFO] 	 Parsing done (102ms). 
% 1.21/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.65/1.18  % [INFO] 	 nitpick registered as external prover. 
% 1.65/1.19  % [INFO] 	 Scanning for conjecture ... 
% 1.78/1.24  % [INFO] 	 Found a conjecture (or negated_conjecture) and 1 axioms. Running axiom selection ... 
% 1.85/1.26  % [INFO] 	 Axiom selection finished. Selected 1 axioms (removed 0 axioms). 
% 1.85/1.26  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.85/1.26  % [INFO] 	 Type checking passed. 
% 1.85/1.26  % [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.14/1.43  % [INFO] 	 Killing All external provers ... 
% 2.14/1.44  % Time passed: 903ms (effective reasoning time: 463ms)
% 2.14/1.44  % 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.14/1.44  % Axioms used in derivation (1): pfg
% 2.14/1.44  % No. of inferences in proof: 7
% 2.14/1.44  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 903 ms resp. 463 ms w/o parsing
% 2.31/1.46  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.31/1.46  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------