↑ 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  : LCL416-1 : TPTP v9.3.1. Released v2.5.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 : 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:51:45 AM UTC 2026

% Result   : Unsatisfiable 1.89s 6.33s
% Output   : Refutation 1.89s
% 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 :   48 (   6   ~;   4   |;   0   &;  38   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    4 (   3 usr;   2 con; 0-2 aty)
%            Number of variables   :   10 (   0   ^;  10   !;   0   ?;  10   :)

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

thf(equivalent_decl,type,
    equivalent: $i > $i > $i ).

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

thf(1,negated_conjecture,
    ~ ( a @ ( a @ equivalent ) @ is_a_theorem ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).

thf(4,plain,
    ~ ( a @ ( a @ equivalent ) @ 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 @ equivalent ) @ is_a_theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : LCL416-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % 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.06/5.34  % Computer : n012.cluster.edu
% 0.06/5.34  % Model    : x86_64 x86_64
% 0.06/5.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/5.34  % Memory   : 8046.5625MB
% 0.06/5.34  % OS       : Linux 6.8.0-71-generic
% 0.06/5.34  % CPULimit : 300
% 0.06/5.34  % WCLimit  : 300
% 0.06/5.34  % DateTime : Fri Sep 25 22:28:40 UTC 2026
% 0.06/5.34  % CPUTime  : 
% 0.06/5.34  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.09/5.65  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 0.09/5.74  % [INFO] 	 Parsing done (87ms). 
% 0.09/5.74  % [INFO] 	 Running in sequential loop mode. 
% 0.09/5.96  % [INFO] 	 eprover registered as external prover. 
% 0.09/5.96  % [INFO] 	 Scanning for conjecture ... 
% 0.09/6.01  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 1.15/6.03  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 1.15/6.03  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.15/6.03  % [INFO] 	 Type checking passed. 
% 1.15/6.04  % [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 ... 
% 1.89/6.33  % External prover 'e' found a proof!
% 1.89/6.33  % [INFO] 	 Killing All external provers ... 
% 1.89/6.33  % Time passed: 916ms (effective reasoning time: 586ms)
% 1.89/6.33  % Axioms used in derivation (2): condensed_detachment, xcb
% 1.89/6.33  % No. of inferences in proof: 7
% 1.89/6.33  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 916 ms resp. 586 ms w/o parsing
% 1.89/6.35  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 1.89/6.35  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------