↑ 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  : SYN358^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39

% Computer : n012.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 : Wed Sep 30 08:41:31 AM UTC 2026

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

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

thf(p_decl,type,
    p: $o ).

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

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

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

thf(15,plain,
    $false,
    inference(e,[status(thm)],[3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SYN358^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.06/0.12  % Computer : n012.cluster.edu
% 0.06/0.12  % Model    : x86_64 x86_64
% 0.06/0.12  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.12  % Memory   : 8046.5625MB
% 0.06/0.12  % OS       : Linux 6.8.0-71-generic
% 0.06/0.12  % CPULimit : 300
% 0.06/0.12  % WCLimit  : 300
% 0.06/0.12  % DateTime : Tue Sep 29 16:14:48 UTC 2026
% 0.06/0.12  % CPUTime  : 
% 0.06/0.12  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox/solver/bin/leo3.jar /export/starexec/sandbox/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox/solver/bin/externals/eprover --instantiate 39
% 0.40/0.43  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.56/0.52  % [INFO] 	 Parsing done (95ms). 
% 0.56/0.53  % [INFO] 	 Running in sequential loop mode. 
% 1.00/0.73  % [INFO] 	 eprover registered as external prover. 
% 1.00/0.73  % [INFO] 	 Scanning for conjecture ... 
% 1.00/0.77  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 1.00/0.79  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 1.00/0.79  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 1.00/0.79  % [INFO] 	 Type checking passed. 
% 1.20/0.80  % [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 ... 
% 1.75/1.04  % External prover 'e' found a proof!
% 1.75/1.04  % [INFO] 	 Killing All external provers ... 
% 1.75/1.04  % Time passed: 844ms (effective reasoning time: 509ms)
% 1.75/1.04  % 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)>
% 1.75/1.05  % Axioms used in derivation (0): 
% 1.75/1.05  % No. of inferences in proof: 4
% 1.75/1.05  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 844 ms resp. 509 ms w/o parsing
% 1.75/1.06  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.75/1.06  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------