↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : NUM632+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39

% Computer : n006.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun Sep 27 08:09:21 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(aElementOf0_decl,type,
    aElementOf0: $i > $i > $o ).

thf(szNzAzT0_decl,type,
    szNzAzT0: $i ).

thf(sdtlbdtrb0_decl,type,
    sdtlbdtrb0: $i > $i > $i ).

thf(szDzozmdt0_decl,type,
    szDzozmdt0: $i > $i ).

thf(sdtlpdtrp0_decl,type,
    sdtlpdtrp0: $i > $i > $i ).

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

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

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

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

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

thf(xe_decl,type,
    xe: $i ).

thf(xp_decl,type,
    xp: $i ).

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

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

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

thf(86,axiom,
    ( ( ( xn @ ( xe @ sdtlpdtrp0 ) )
      = xp )
    & ( szNzAzT0 @ ( xn @ aElementOf0 ) )
    & ( xd @ szDzizrdt0 @ ( xd @ sdtlbdtrb0 ) @ ( xn @ aElementOf0 ) )
    & ( ( xn @ ( xd @ sdtlpdtrp0 ) )
      = ( xd @ szDzizrdt0 ) )
    & ( xd @ szDzozmdt0 @ ( xn @ aElementOf0 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).

thf(554,plain,
    ( ( ( xn @ ( xe @ sdtlpdtrp0 ) )
      = xp )
    & ( szNzAzT0 @ ( xn @ aElementOf0 ) )
    & ( xd @ szDzizrdt0 @ ( xd @ sdtlbdtrb0 ) @ ( xn @ aElementOf0 ) )
    & ( ( xn @ ( xd @ sdtlpdtrp0 ) )
      = ( xd @ szDzizrdt0 ) )
    & ( xd @ szDzozmdt0 @ ( xn @ aElementOf0 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[86]) ).

thf(555,plain,
    ( ( ( xn @ ( xe @ sdtlpdtrp0 ) )
      = xp )
    & ( szNzAzT0 @ ( xn @ aElementOf0 ) )
    & ( xd @ szDzizrdt0 @ ( xd @ sdtlbdtrb0 ) @ ( xn @ aElementOf0 ) )
    & ( ( xn @ ( xd @ sdtlpdtrp0 ) )
      = ( xd @ szDzizrdt0 ) )
    & ( xd @ szDzozmdt0 @ ( xn @ aElementOf0 ) ) ),
    inference(cnf,[status(esa)],[554]) ).

thf(560,plain,
    ( ( xn @ ( xd @ sdtlpdtrp0 ) )
    = ( xd @ szDzizrdt0 ) ),
    inference(cnfConj,[status(thm)],[555]) ).

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

thf(6261,plain,
    ( ( xQ @ ( xc @ sdtlpdtrp0 ) )
    = ( xd @ szDzizrdt0 ) ),
    inference(rewrite,[status(thm)],[899,562]) ).

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

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

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

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

thf(6262,plain,
    $false,
    inference(simplifyReflect,[status(thm)],[6261,118]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM632+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.13/0.39  % Computer : n006.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sat Sep 26 03:30:55 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.87/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.46/1.29  % [INFO] 	 Parsing done (307ms). 
% 1.96/1.31  % [INFO] 	 Running in sequential loop mode. 
% 2.77/1.71  % [INFO] 	 eprover registered as external prover. 
% 2.77/1.72  % [INFO] 	 Scanning for conjecture ... 
% 2.77/1.79  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.80  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.82  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.82  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.84  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.85  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.85  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.86  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.87  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.87  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 2.97/1.88  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.21/1.94  % [INFO] 	 Found a conjecture (or negated_conjecture) and 114 axioms. Running axiom selection ... 
% 3.63/2.07  % [INFO] 	 Axiom selection finished. Selected 114 axioms (removed 0 axioms). 
% 3.63/2.08  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.11  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.11  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.12  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.13  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 3.63/2.14  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.08/2.16  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.08/2.18  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.08/2.19  % [INFO] 	 Definitions in FOF are currently treated as axioms. 
% 4.19/2.23  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 4.19/2.26  % [INFO] 	 Type checking passed. 
% 4.19/2.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 ... 
% 40.68/11.32  % [INFO] 	 Killing All external provers ... 
% 40.68/11.33  % Time passed: 10784ms (effective reasoning time: 10009ms)
% 40.68/11.33  % 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)>
% 40.68/11.33  % Axioms used in derivation (2): m__5568, m__5309
% 40.68/11.33  % No. of inferences in proof: 14
% 40.68/11.33  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 10784 ms resp. 10009 ms w/o parsing
% 40.68/11.35  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 40.68/11.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------