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

% Computer : n015.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:51:34 AM UTC 2026

% Result   : Unsatisfiable 2.44s 1.43s
% Output   : Refutation 2.44s
% 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 :   96 (   6   ~;   4   |;   0   &;  86   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   8 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   16 (   0   ^;  16   !;   0   ?;  16   :)

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

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

thf(x_decl,type,
    x: $i ).

thf(y_decl,type,
    y: $i ).

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

thf(u_decl,type,
    u: $i ).

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

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

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

thf(1,negated_conjecture,
    ~ ( u @ ( z @ ( y @ implies ) @ implies ) @ ( u @ ( z @ ( x @ implies ) @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_06) ).

thf(6,plain,
    ~ ( u @ ( z @ ( y @ implies ) @ implies ) @ ( u @ ( z @ ( x @ implies ) @ implies ) @ implies ) @ ( y @ ( x @ implies ) @ implies ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

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

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

thf(11,plain,
    ! [A: $i] : ( A @ ( A @ ( A @ not @ 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/sandbox2/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(13,plain,
    $false,
    inference(e,[status(thm)],[10,6,12,11,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL357-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.07  % Command  : java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.15/0.40  % Computer : n015.cluster.edu
% 0.15/0.40  % Model    : x86_64 x86_64
% 0.15/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40  % Memory   : 8046.5625MB
% 0.15/0.40  % OS       : Linux 6.8.0-71-generic
% 0.15/0.40  % CPULimit : 300
% 0.15/0.40  % WCLimit  : 300
% 0.15/0.40  % DateTime : Fri Sep 25 22:22:43 UTC 2026
% 0.15/0.41  % CPUTime  : 
% 0.15/0.41  Running java -Xss128m -Xmx2g -Xms1g -jar /export/starexec/sandbox2/solver/bin/leo3.jar /export/starexec/sandbox2/benchmark/theBenchmark.p -t 300 -p  --atp eprover=/export/starexec/sandbox2/solver/bin/externals/eprover --instantiate 39
% 0.71/0.70  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.71/0.80  % [INFO] 	 Parsing done (89ms). 
% 0.95/0.80  % [INFO] 	 Running in sequential loop mode. 
% 1.15/1.00  % [INFO] 	 eprover registered as external prover. 
% 1.15/1.00  % [INFO] 	 Scanning for conjecture ... 
% 1.44/1.05  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 1.44/1.06  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 1.44/1.07  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.44/1.07  % [INFO] 	 Type checking passed. 
% 1.44/1.07  % [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 ... 
% 2.44/1.43  % External prover 'e' found a proof!
% 2.44/1.43  % [INFO] 	 Killing All external provers ... 
% 2.44/1.43  % Time passed: 933ms (effective reasoning time: 623ms)
% 2.44/1.43  % Axioms used in derivation (4): cn_1, cn_3, cn_2, condensed_detachment
% 2.44/1.43  % No. of inferences in proof: 11
% 2.44/1.43  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 933 ms resp. 623 ms w/o parsing
% 2.44/1.47  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.44/1.47  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------