↑ Up

Leo-III---1.8.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : SWV009-1 : TPTP v9.3.1. Released v1.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 : 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:57:55 AM UTC 2026

% Result   : Unsatisfiable 3.08s 2.21s
% Output   : Refutation 3.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   19 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (   0 equ;   0 cnn)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  140 (  22   ~;  22   |;   0   &;  96   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   9 usr;   7 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^;  16   !;   0   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
thf(less_or_equal_decl,type,
    less_or_equal: $i > $i > $o ).

thf(less_decl,type,
    less: $i > $i > $o ).

thf(j_decl,type,
    j: $i ).

thf(i_decl,type,
    i: $i ).

thf(m_decl,type,
    m: $i ).

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

thf(q_decl,type,
    q: $i ).

thf(n_decl,type,
    n: $i ).

thf(a_decl,type,
    a: $i > $i ).

thf(5,negated_conjecture,
    n @ ( q @ less_or_equal ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

thf(10,plain,
    n @ ( q @ less_or_equal ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(2,negated_conjecture,
    i @ ( j @ less ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

thf(14,plain,
    i @ ( j @ less ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(9,negated_conjecture,
    ~ ( q @ a @ ( p @ a @ less_or_equal ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_9) ).

thf(13,plain,
    ~ ( q @ a @ ( p @ a @ less_or_equal ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(8,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( n @ ( B @ less_or_equal ) )
      | ~ ( B @ ( A @ less_or_equal ) )
      | ~ ( A @ ( i @ less_or_equal ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

thf(17,plain,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( n @ ( B @ less_or_equal ) )
      | ~ ( B @ ( A @ less_or_equal ) )
      | ~ ( A @ ( i @ less_or_equal ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(6,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( n @ ( B @ less_or_equal ) )
      | ~ ( B @ ( j @ less ) )
      | ~ ( i @ ( A @ less ) )
      | ~ ( A @ ( m @ less_or_equal ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

thf(12,plain,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( n @ ( B @ less_or_equal ) )
      | ~ ( B @ ( j @ less ) )
      | ~ ( i @ ( A @ less ) )
      | ~ ( A @ ( m @ less_or_equal ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(4,negated_conjecture,
    q @ ( p @ less_or_equal ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_4) ).

thf(18,plain,
    q @ ( p @ less_or_equal ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,negated_conjecture,
    p @ ( m @ less_or_equal ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_3) ).

thf(16,plain,
    p @ ( m @ less_or_equal ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ( A @ ( B @ less ) )
      | ( B @ ( A @ less_or_equal ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ( A @ ( B @ less ) )
      | ( B @ ( A @ less_or_equal ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(7,negated_conjecture,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( j @ ( B @ less_or_equal ) )
      | ~ ( B @ ( A @ less_or_equal ) )
      | ~ ( A @ ( m @ less_or_equal ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_7) ).

thf(15,plain,
    ! [B: $i,A: $i] :
      ( ( B @ a @ ( A @ a @ less_or_equal ) )
      | ~ ( j @ ( B @ less_or_equal ) )
      | ~ ( B @ ( A @ less_or_equal ) )
      | ~ ( A @ ( m @ less_or_equal ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(24,plain,
    $false,
    inference(e,[status(thm)],[10,14,13,17,12,18,16,11,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV009-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08  % 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.14/0.40  % Computer : n006.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sat Sep 26 13:04:27 UTC 2026
% 0.14/0.41  % CPUTime  : 
% 0.14/0.41  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.83/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.17/1.16  % [INFO] 	 Parsing done (170ms). 
% 1.17/1.18  % [INFO] 	 Running in sequential loop mode. 
% 1.70/1.58  % [INFO] 	 eprover registered as external prover. 
% 1.70/1.58  % [INFO] 	 Scanning for conjecture ... 
% 1.89/1.69  % [INFO] 	 Found a conjecture (or negated_conjecture) and 0 axioms. Running axiom selection ... 
% 2.04/1.74  % [INFO] 	 Axiom selection finished. Selected 0 axioms (removed 0 axioms). 
% 2.04/1.74  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.04/1.74  % [INFO] 	 Type checking passed. 
% 2.04/1.75  % [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.08/2.21  % External prover 'e' found a proof!
% 3.08/2.21  % [INFO] 	 Killing All external provers ... 
% 3.08/2.21  % Time passed: 1658ms (effective reasoning time: 1026ms)
% 3.08/2.21  % Axioms used in derivation (0): 
% 3.08/2.21  % No. of inferences in proof: 19
% 3.08/2.21  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1658 ms resp. 1026 ms w/o parsing
% 3.08/2.25  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.08/2.25  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------