↑ 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  : LCL072-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 : n020.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 07:50:44 AM UTC 2026

% Result   : Unsatisfiable 5.65s 3.32s
% Output   : Refutation 5.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   11 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   15 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  106 (   6   ~;   4   |;   0   &;  96   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   9 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    6 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   24 (   0   ^;  24   !;   0   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
thf(is_a_theorem_decl,type,
    is_a_theorem: $i > $o ).

thf(implies_decl,type,
    implies: $i > $i > $i ).

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

thf(not_decl,type,
    not: $i > $i ).

thf(b_decl,type,
    b: $i ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] : ( C @ ( B @ implies ) @ ( C @ ( B @ ( A @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_19) ).

thf(10,plain,
    ! [C: $i,B: $i,A: $i] : ( C @ ( B @ implies ) @ ( C @ ( B @ ( A @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(1,negated_conjecture,
    ~ ( b @ ( a @ not @ implies ) @ ( a @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_3) ).

thf(6,plain,
    ~ ( b @ ( a @ not @ implies ) @ ( a @ implies ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(5,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( D @ ( B @ implies ) @ implies ) @ ( C @ ( D @ implies ) @ implies ) @ ( A @ implies ) @ ( C @ ( B @ not @ implies ) @ ( A @ implies ) @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_60) ).

thf(12,plain,
    ! [D: $i,C: $i,B: $i,A: $i] : ( C @ ( D @ ( B @ implies ) @ implies ) @ ( C @ ( D @ implies ) @ implies ) @ ( A @ implies ) @ ( C @ ( B @ not @ implies ) @ ( A @ implies ) @ implies ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(4,axiom,
    ! [C: $i,B: $i,A: $i] : ( C @ ( A @ not @ implies ) @ ( C @ ( B @ ( A @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_37) ).

thf(11,plain,
    ! [C: $i,B: $i,A: $i] : ( C @ ( A @ not @ implies ) @ ( C @ ( B @ ( A @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ is_a_theorem )
      | ~ ( A @ is_a_theorem )
      | ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

thf(8,plain,
    ! [B: $i,A: $i] :
      ( ( B @ is_a_theorem )
      | ~ ( A @ is_a_theorem )
      | ~ ( B @ ( A @ implies ) @ is_a_theorem ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(25,plain,
    $false,
    inference(e,[status(thm)],[10,6,12,11,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL072-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.10  % 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.17/0.42  % Computer : n020.cluster.edu
% 0.17/0.42  % Model    : x86_64 x86_64
% 0.17/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42  % Memory   : 8046.5625MB
% 0.17/0.42  % OS       : Linux 6.8.0-71-generic
% 0.17/0.42  % CPULimit : 300
% 0.17/0.42  % WCLimit  : 300
% 0.17/0.42  % DateTime : Fri Sep 25 21:49:33 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  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.24/1.23  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.63/1.49  % [INFO] 	 Parsing done (259ms). 
% 1.82/1.51  % [INFO] 	 Running in sequential loop mode. 
% 2.61/2.13  % [INFO] 	 eprover registered as external prover. 
% 2.61/2.14  % [INFO] 	 Scanning for conjecture ... 
% 2.92/2.26  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 3.07/2.31  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 3.07/2.33  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.07/2.33  % [INFO] 	 Type checking passed. 
% 3.07/2.34  % [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 ... 
% 5.65/3.32  % External prover 'e' found a proof!
% 5.65/3.32  % [INFO] 	 Killing All external provers ... 
% 5.65/3.32  % Time passed: 2736ms (effective reasoning time: 1800ms)
% 5.65/3.32  % Axioms used in derivation (4): cn_19, cn_60, cn_37, condensed_detachment
% 5.65/3.32  % No. of inferences in proof: 11
% 5.65/3.32  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 2736 ms resp. 1800 ms w/o parsing
% 5.65/3.38  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.65/3.38  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------