↑ 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  : SWX203+1 : TPTP v9.3.1. Released v9.3.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 : n007.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 09:15:16 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(sorted_decl,type,
    sorted: $i > $o ).

thf(rev_decl,type,
    rev: $i > $i ).

thf(unique_decl,type,
    unique: $i > $o ).

thf(leqNat_decl,type,
    leqNat: $i > $i > $o ).

thf(lengthNat_decl,type,
    lengthNat: $i > $i ).

thf(s_decl,type,
    s: $i > $i ).

thf(z_decl,type,
    z: $i ).

thf(head_decl,type,
    head: $i > $i ).

thf(cons_decl,type,
    cons: $i > $i > $i ).

thf(nil_decl,type,
    nil: $i ).

thf(elemNat_decl,type,
    elemNat: $i > $i > $o ).

thf(append_decl,type,
    append: $i > $i > $i ).

thf(tail_decl,type,
    tail: $i > $i ).

thf(proj1S_decl,type,
    proj1S: $i > $i ).

thf(13,axiom,
    nil @ unique,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_016) ).

thf(69,plain,
    nil @ unique,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[13]) ).

thf(10,axiom,
    ( ( nil @ rev )
    = nil ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_020) ).

thf(56,plain,
    ( ( nil @ rev )
    = nil ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(19,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ cons ) @ ( A @ cons ) @ sorted )
    <=> ( ( C @ ( B @ cons ) @ sorted )
        & ( B @ ( A @ leqNat ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_011) ).

thf(85,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( ( C @ ( B @ cons ) @ sorted )
          & ( B @ ( A @ leqNat ) ) )
       => ( C @ ( B @ cons ) @ ( A @ cons ) @ sorted ) )
      & ( ( C @ ( B @ cons ) @ ( A @ cons ) @ sorted )
       => ( ( C @ ( B @ cons ) @ sorted )
          & ( B @ ( A @ leqNat ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[19]) ).

thf(14,axiom,
    nil @ sorted,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_009) ).

thf(70,plain,
    nil @ sorted,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[14]) ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ tail )
      = B ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_002) ).

thf(53,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ tail )
      = B ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(22,axiom,
    ! [A: $i] :
      ~ ( z @ ( A @ s @ leqNat ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_007) ).

thf(96,plain,
    ! [A: $i] :
      ~ ( z @ ( A @ s @ leqNat ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[22]) ).

thf(16,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ s @ ( A @ s @ leqNat ) )
    <=> ( B @ ( A @ leqNat ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_008) ).

thf(73,plain,
    ! [A: $i,B: $i] :
      ( ( ( B @ ( A @ leqNat ) )
       => ( B @ s @ ( A @ s @ leqNat ) ) )
      & ( ( B @ s @ ( A @ s @ leqNat ) )
       => ( B @ ( A @ leqNat ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[16]) ).

thf(5,axiom,
    ! [A: $i] :
      ~ ( nil @ ( A @ elemNat ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).

thf(34,plain,
    ! [A: $i] :
      ~ ( nil @ ( A @ elemNat ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(3,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ head )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_001) ).

thf(27,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ head )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(15,axiom,
    ! [A: $i] : ( nil @ ( A @ cons ) @ sorted ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_010) ).

thf(71,plain,
    ! [A: $i] : ( nil @ ( A @ cons ) @ sorted ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[15]) ).

thf(8,axiom,
    ! [A: $i] :
      ( ( A @ ( nil @ append ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_018) ).

thf(50,plain,
    ! [A: $i] :
      ( ( A @ ( nil @ append ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(23,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ lengthNat )
      = ( B @ lengthNat @ s ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_013) ).

thf(99,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ lengthNat )
      = ( B @ lengthNat @ s ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[23]) ).

thf(7,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( C @ ( B @ cons ) @ ( A @ elemNat ) )
    <=> ( ( C @ ( A @ elemNat ) )
        | ( A = B ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_015) ).

thf(40,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( ( C @ ( A @ elemNat ) )
          | ( A = B ) )
       => ( C @ ( B @ cons ) @ ( A @ elemNat ) ) )
      & ( ( C @ ( B @ cons ) @ ( A @ elemNat ) )
       => ( ( C @ ( A @ elemNat ) )
          | ( A = B ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(4,axiom,
    ! [A: $i,B: $i] :
      ( nil
     != ( B @ ( A @ cons ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_003) ).

thf(30,plain,
    ! [A: $i,B: $i] :
      ( nil
     != ( B @ ( A @ cons ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(1,conjecture,
    ? [A: $i] :
      ~ ( ( A @ rev @ sorted )
       => ( ( A @ unique )
         => ( z @ s @ s @ s @ ( A @ lengthNat @ leqNat ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_022) ).

thf(2,negated_conjecture,
    ~ ? [A: $i] :
        ~ ( ( A @ rev @ sorted )
         => ( ( A @ unique )
           => ( z @ s @ s @ s @ ( A @ lengthNat @ leqNat ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(24,plain,
    ~ ? [A: $i] :
        ~ ( ( A @ rev @ sorted )
         => ( ( A @ unique )
           => ( z @ s @ s @ s @ ( A @ lengthNat @ leqNat ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(6,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( A @ ( C @ ( B @ cons ) @ append ) )
      = ( A @ ( C @ append ) @ ( B @ cons ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_019) ).

thf(37,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( A @ ( C @ ( B @ cons ) @ append ) )
      = ( A @ ( C @ append ) @ ( B @ cons ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(20,axiom,
    ! [A: $i] : ( A @ ( z @ leqNat ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_006) ).

thf(92,plain,
    ! [A: $i] : ( A @ ( z @ leqNat ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[20]) ).

thf(12,axiom,
    ! [A: $i] :
      ( z
     != ( A @ s ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_005) ).

thf(65,plain,
    ! [A: $i] :
      ( z
     != ( A @ s ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[12]) ).

thf(11,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ unique )
    <=> ( ( B @ unique )
        & ~ ( B @ ( A @ elemNat ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_017) ).

thf(58,plain,
    ! [A: $i,B: $i] :
      ( ( ( ( B @ unique )
          & ~ ( B @ ( A @ elemNat ) ) )
       => ( B @ ( A @ cons ) @ unique ) )
      & ( ( B @ ( A @ cons ) @ unique )
       => ( ( B @ unique )
          & ~ ( B @ ( A @ elemNat ) ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(18,axiom,
    ! [A: $i] :
      ( ( A @ s @ proj1S )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_004) ).

thf(82,plain,
    ! [A: $i] :
      ( ( A @ s @ proj1S )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[18]) ).

thf(17,axiom,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ rev )
      = ( nil @ ( A @ cons ) @ ( B @ rev @ append ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_021) ).

thf(79,plain,
    ! [A: $i,B: $i] :
      ( ( B @ ( A @ cons ) @ rev )
      = ( nil @ ( A @ cons ) @ ( B @ rev @ append ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[17]) ).

thf(21,axiom,
    ( ( nil @ lengthNat )
    = z ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_012) ).

thf(94,plain,
    ( ( nil @ lengthNat )
    = z ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[21]) ).

thf(147,plain,
    $false,
    inference(e,[status(thm)],[69,56,85,70,53,96,73,34,27,71,50,99,40,30,24,37,92,65,58,82,79,94]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWX203+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.12  % 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.25/0.49  % Computer : n007.cluster.edu
% 0.25/0.49  % Model    : x86_64 x86_64
% 0.25/0.49  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.49  % Memory   : 8046.5625MB
% 0.25/0.49  % OS       : Linux 6.8.0-71-generic
% 0.25/0.49  % CPULimit : 300
% 0.25/0.49  % WCLimit  : 300
% 0.25/0.49  % DateTime : Sat Sep 26 16:52:54 UTC 2026
% 0.25/0.50  % CPUTime  : 
% 0.25/0.50  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
% 1.11/1.12  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.40/1.29  % [INFO] 	 Parsing done (164ms). 
% 1.60/1.30  % [INFO] 	 Running in sequential loop mode. 
% 2.11/1.63  % [INFO] 	 eprover registered as external prover. 
% 2.11/1.63  % [INFO] 	 Scanning for conjecture ... 
% 2.37/1.71  % [INFO] 	 Found a conjecture (or negated_conjecture) and 21 axioms. Running axiom selection ... 
% 2.37/1.77  % [INFO] 	 Axiom selection finished. Selected 21 axioms (removed 0 axioms). 
% 2.58/1.80  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.58/1.81  % [INFO] 	 Type checking passed. 
% 2.58/1.81  % [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 ... 
% 6.37/2.95  % External prover 'e' found a proof!
% 6.37/2.95  % [INFO] 	 Killing All external provers ... 
% 6.37/2.95  % Time passed: 2272ms (effective reasoning time: 1650ms)
% 6.37/2.96  % 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)>
% 6.37/2.96  % Axioms used in derivation (21): axiom_010, axiom_021, axiom_002, axiom_016, axiom_005, axiom_012, axiom_001, axiom_011, axiom_020, axiom_003, axiom_014, axiom_007, axiom_018, axiom_009, axiom_017, axiom_013, axiom_006, axiom_015, axiom_004, axiom_019, axiom_008
% 6.37/2.96  % No. of inferences in proof: 46
% 6.37/2.96  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 2272 ms resp. 1650 ms w/o parsing
% 6.37/3.05  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.37/3.05  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------