↑ 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  : LCL075-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 : n012.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 2.67s 1.85s
% Output   : Refutation 2.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    7 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   11 (   0 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   74 (   6   ~;   4   |;   0   &;  64   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   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   :   14 (   0   ^;  14   !;   0   ?;  14   :)

% 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(1,negated_conjecture,
    ~ ( b @ ( a @ not @ implies ) @ ( a @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_3) ).

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

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(6,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(3,axiom,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( A @ ( D @ implies ) @ ( A @ ( E @ implies ) @ implies ) @ ( E @ ( C @ ( D @ not @ ( C @ not @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ implies ) @ implies ) @ implies ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_CAMeredith) ).

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

thf(13,plain,
    $false,
    inference(e,[status(thm)],[4,6,8]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL075-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % 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.06/0.32  % Computer : n012.cluster.edu
% 0.06/0.32  % Model    : x86_64 x86_64
% 0.06/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.32  % Memory   : 8046.5625MB
% 0.06/0.32  % OS       : Linux 6.8.0-71-generic
% 0.06/0.32  % CPULimit : 300
% 0.06/0.32  % WCLimit  : 300
% 0.06/0.32  % DateTime : Fri Sep 25 21:48:50 UTC 2026
% 0.06/0.32  % CPUTime  : 
% 0.06/0.32  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.64/0.74  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.82/0.88  % [INFO] 	 Parsing done (144ms). 
% 1.01/0.90  % [INFO] 	 Running in sequential loop mode. 
% 1.44/1.24  % [INFO] 	 eprover registered as external prover. 
% 1.44/1.24  % [INFO] 	 Scanning for conjecture ... 
% 1.63/1.32  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 1.63/1.34  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 1.63/1.35  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.63/1.35  % [INFO] 	 Type checking passed. 
% 1.63/1.36  % [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.67/1.85  % External prover 'e' found a proof!
% 2.67/1.85  % [INFO] 	 Killing All external provers ... 
% 2.67/1.85  % Time passed: 1445ms (effective reasoning time: 946ms)
% 2.67/1.85  % Axioms used in derivation (2): condensed_detachment, cn_CAMeredith
% 2.67/1.85  % No. of inferences in proof: 7
% 2.67/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1445 ms resp. 946 ms w/o parsing
% 2.67/1.88  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.67/1.88  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------