↑ 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  : NUM689^1 : TPTP v9.3.1. Released v3.7.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 : n014.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:17:59 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(nat_type,type,
    nat: $tType ).

thf(x_decl,type,
    x: nat ).

thf(y_decl,type,
    y: nat ).

thf(z_decl,type,
    z: nat ).

thf(u_decl,type,
    u: nat ).

thf(lessis_decl,type,
    lessis: nat > nat > $o ).

thf(some_decl,type,
    some: ( nat > $o ) > $o ).

thf(diffprop_decl,type,
    diffprop: nat > nat > nat > $o ).

thf(pl_decl,type,
    pl: nat > nat > nat ).

thf(moreis_decl,type,
    moreis: nat > nat > $o ).

thf(5,axiom,
    ! [A: nat,B: nat,C: nat,D: nat] :
      ( ( moreis @ A @ B )
     => ( ( some @ ( diffprop @ C @ D ) )
       => ( some @ ( diffprop @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22a) ).

thf(10,plain,
    ! [A: nat,B: nat,C: nat,D: nat] :
      ( ( moreis @ A @ B )
     => ( ( some @ ( diffprop @ C @ D ) )
       => ( some @ ( diffprop @ ( pl @ A @ C ) @ ( pl @ B @ D ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(4,axiom,
    some @ ( diffprop @ u @ z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',k) ).

thf(9,plain,
    some @ ( diffprop @ u @ z ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(6,axiom,
    ! [A: nat,B: nat] :
      ( ( lessis @ A @ B )
     => ( moreis @ B @ A ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz14) ).

thf(13,plain,
    ! [A: nat,B: nat] :
      ( ( lessis @ A @ B )
     => ( moreis @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(1,conjecture,
    some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz22c) ).

thf(2,negated_conjecture,
    ~ ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(7,plain,
    ~ ( some @ ( diffprop @ ( pl @ y @ u ) @ ( pl @ x @ z ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    lessis @ x @ y,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l) ).

thf(8,plain,
    lessis @ x @ y,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(15,plain,
    $false,
    inference(e,[status(thm)],[10,9,13,7,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM689^1 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.07  % 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.09/0.18  % Computer : n014.cluster.edu
% 0.09/0.18  % Model    : x86_64 x86_64
% 0.09/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18  % Memory   : 8046.5625MB
% 0.09/0.18  % OS       : Linux 6.8.0-71-generic
% 0.09/0.18  % CPULimit : 300
% 0.09/0.18  % WCLimit  : 300
% 0.09/0.18  % DateTime : Tue Sep 29 12:39:15 UTC 2026
% 0.09/0.18  % CPUTime  : 
% 0.09/0.18  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.87/0.75  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.22/0.96  % [INFO] 	 Parsing done (201ms). 
% 1.22/0.97  % [INFO] 	 Running in sequential loop mode. 
% 1.86/1.36  % [INFO] 	 eprover registered as external prover. 
% 1.86/1.37  % [INFO] 	 Scanning for conjecture ... 
% 2.05/1.46  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.05/1.50  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.21/1.51  % [INFO] 	 Problem is higher-order (TPTP THF). 
% 2.21/1.52  % [INFO] 	 Type checking passed. 
% 2.21/1.52  % [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 ... 
% 3.13/2.02  % External prover 'e' found a proof!
% 3.13/2.02  % [INFO] 	 Killing All external provers ... 
% 3.13/2.03  % Time passed: 1706ms (effective reasoning time: 1046ms)
% 3.13/2.03  % 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)>
% 3.52/2.03  % Axioms used in derivation (4): satz22a, k, satz14, l
% 3.52/2.03  % No. of inferences in proof: 12
% 3.52/2.03  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1706 ms resp. 1046 ms w/o parsing
% 3.52/2.07  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.52/2.07  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------