TSTP Solution File: NUM632+1 by Leo-III-SAT---1.7.12

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.12
% Problem  : NUM632+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n032.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 01:35:29 EDT 2024

% Result   : Theorem 25.62s 5.10s
% Output   : Refutation 25.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   18 (  12 unt;   6 typ;   0 def)
%            Number of atoms       :   12 (  11 equ;   0 cnn)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   39 (   3   ~;   0   |;   0   &;  36   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    3 (   3   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0   ^   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
thf(sdtlpdtrp0_type,type,
    sdtlpdtrp0: $i > $i > $i ).

thf(xc_type,type,
    xc: $i ).

thf(xQ_type,type,
    xQ: $i ).

thf(szDzizrdt0_type,type,
    szDzizrdt0: $i > $i ).

thf(xd_type,type,
    xd: $i ).

thf(xn_type,type,
    xn: $i ).

thf(80,axiom,
    ( ( sdtlpdtrp0 @ xc @ xQ )
    = ( sdtlpdtrp0 @ xd @ xn ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5568) ).

thf(463,plain,
    ( ( sdtlpdtrp0 @ xc @ xQ )
    = ( sdtlpdtrp0 @ xd @ xn ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[80]) ).

thf(464,plain,
    ( ( sdtlpdtrp0 @ xd @ xn )
    = ( sdtlpdtrp0 @ xc @ xQ ) ),
    inference(lifteq,[status(thm)],[463]) ).

thf(100,axiom,
    ( ( sdtlpdtrp0 @ xd @ xn )
    = ( szDzizrdt0 @ xd ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5321) ).

thf(582,plain,
    ( ( sdtlpdtrp0 @ xd @ xn )
    = ( szDzizrdt0 @ xd ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[100]) ).

thf(583,plain,
    ( ( sdtlpdtrp0 @ xd @ xn )
    = ( szDzizrdt0 @ xd ) ),
    inference(lifteq,[status(thm)],[582]) ).

thf(5309,plain,
    ( ( sdtlpdtrp0 @ xc @ xQ )
    = ( szDzizrdt0 @ xd ) ),
    inference(rewrite,[status(thm)],[464,583]) ).

thf(1,conjecture,
    ( ( sdtlpdtrp0 @ xc @ xQ )
    = ( szDzizrdt0 @ xd ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

thf(2,negated_conjecture,
    ( ( sdtlpdtrp0 @ xc @ xQ )
   != ( szDzizrdt0 @ xd ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(117,plain,
    ( ( sdtlpdtrp0 @ xc @ xQ )
   != ( szDzizrdt0 @ xd ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(118,plain,
    ( ( sdtlpdtrp0 @ xc @ xQ )
   != ( szDzizrdt0 @ xd ) ),
    inference(lifteq,[status(thm)],[117]) ).

thf(5310,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[5309,118]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : NUM632+1 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.11  % Command  : run_Leo-III %s %d
% 0.11/0.29  % Computer : n032.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8042.1875MB
% 0.11/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29  % CPULimit : 300
% 0.11/0.29  % WCLimit  : 300
% 0.11/0.29  % DateTime : Mon May 20 07:04:53 EDT 2024
% 0.11/0.29  % CPUTime  : 
% 0.63/0.70  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.91/0.85  % [INFO] 	 Parsing done (152ms). 
% 0.91/0.86  % [INFO] 	 Running in sequential loop mode. 
% 1.46/1.06  % [INFO] 	 nitpick registered as external prover. 
% 1.46/1.07  % [INFO] 	 Scanning for conjecture ... 
% 1.64/1.11  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.11  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.12  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.13  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.15  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.15  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.15  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.64/1.16  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 1.88/1.18  % [INFO] 	 Found a conjecture (or negated_conjecture) and 114 axioms. Running axiom selection ... 
% 2.02/1.25  % [INFO] 	 Axiom selection finished. Selected 114 axioms (removed 0 axioms). 
% 2.02/1.25  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.27  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.27  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.28  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.28  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.29  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.30  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.02/1.31  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.31/1.32  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.31/1.32  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.31/1.33  % [INFO] 	 Type checking passed. 
% 2.31/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 ... 
% 25.62/5.08  % [INFO] 	 Killing All external provers ... 
% 25.62/5.10  % Time passed: 4692ms (effective reasoning time: 4232ms)
% 25.62/5.10  % 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)>
% 25.62/5.10  % Axioms used in derivation (2): m__5568, m__5321
% 25.62/5.10  % No. of inferences in proof: 12
% 25.62/5.10  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 4692 ms resp. 4232 ms w/o parsing
% 25.62/5.14  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 25.62/5.14  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------