↑ 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  : SWV254-2 : TPTP v9.3.1. Released v3.2.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 08:58:34 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(c_lessequals_decl,type,
    c_lessequals: $i > $i > $i > $o ).

thf(v_x_decl,type,
    v_x: $i > $i ).

thf(tc_nat_decl,type,
    tc_nat: $i ).

thf(v_nat_decl,type,
    v_nat: $i ).

thf(class_Orderings_Oorder_decl,type,
    class_Orderings_Oorder: $i > $o ).

thf(c_SetInterval_OatLeastLessThan_decl,type,
    c_SetInterval_OatLeastLessThan: $i > $i > $i > $i ).

thf(c_emptyset_decl,type,
    c_emptyset: $i ).

thf(c_Suc_decl,type,
    c_Suc: $i > $i ).

thf(c_insert_decl,type,
    c_insert: $i > $i > $i > $i ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ ( B @ ( C @ c_SetInterval_OatLeastLessThan ) ) )
        = c_emptyset )
      | ~ ( A @ ( C @ ( B @ c_lessequals ) ) )
      | ~ ( A @ class_Orderings_Oorder ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_SetInterval_OatLeastLessThan__empty_0) ).

thf(10,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( ( A @ ( B @ ( C @ c_SetInterval_OatLeastLessThan ) ) )
        = c_emptyset )
      | ~ ( A @ ( C @ ( B @ c_lessequals ) ) )
      | ~ ( A @ class_Orderings_Oorder ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i] :
      ( ( tc_nat @ ( A @ c_Suc @ ( A @ c_SetInterval_OatLeastLessThan ) ) )
      = ( tc_nat @ ( c_emptyset @ ( A @ c_insert ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_SetInterval_OatLeastLessThan__singleton_0) ).

thf(13,plain,
    ! [A: $i] :
      ( ( tc_nat @ ( A @ c_Suc @ ( A @ c_SetInterval_OatLeastLessThan ) ) )
      = ( tc_nat @ ( c_emptyset @ ( A @ c_insert ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(1,negated_conjecture,
    ! [A: $i] : ( tc_nat @ ( A @ v_x @ ( A @ c_lessequals ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

thf(7,plain,
    ! [A: $i] : ( tc_nat @ ( A @ v_x @ ( A @ c_lessequals ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(6,axiom,
    tc_nat @ class_Orderings_Oorder,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clsarity_nat_3) ).

thf(18,plain,
    tc_nat @ class_Orderings_Oorder,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(2,negated_conjecture,
    ! [A: $i] :
      ( ( A @ v_x )
      = v_nat ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

thf(8,plain,
    ! [A: $i] :
      ( ( A @ v_x )
      = v_nat ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( c_emptyset
     != ( C @ ( B @ ( A @ c_insert ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Oempty__not__insert_0) ).

thf(15,plain,
    ! [C: $i,B: $i,A: $i] :
      ( c_emptyset
     != ( C @ ( B @ ( A @ c_insert ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(19,plain,
    $false,
    inference(e,[status(thm)],[10,13,7,18,8,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV254-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08  % 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.41  % Computer : n015.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sat Sep 26 13:26:44 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.85/0.99  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.20/1.16  % [INFO] 	 Parsing done (169ms). 
% 1.20/1.17  % [INFO] 	 Running in sequential loop mode. 
% 1.71/1.57  % [INFO] 	 eprover registered as external prover. 
% 1.71/1.57  % [INFO] 	 Scanning for conjecture ... 
% 1.89/1.67  % [INFO] 	 Found a conjecture (or negated_conjecture) and 4 axioms. Running axiom selection ... 
% 2.05/1.71  % [INFO] 	 Axiom selection finished. Selected 4 axioms (removed 0 axioms). 
% 2.05/1.71  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.05/1.72  % [INFO] 	 Type checking passed. 
% 2.05/1.72  % [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.07/2.22  % External prover 'e' found a proof!
% 3.07/2.22  % [INFO] 	 Killing All external provers ... 
% 3.07/2.22  % Time passed: 1659ms (effective reasoning time: 1040ms)
% 3.07/2.22  % Axioms used in derivation (4): cls_SetInterval_OatLeastLessThan__empty_0, cls_SetInterval_OatLeastLessThan__singleton_0, clsarity_nat_3, cls_Set_Oempty__not__insert_0
% 3.07/2.22  % No. of inferences in proof: 13
% 3.07/2.22  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1659 ms resp. 1040 ms w/o parsing
% 3.07/2.26  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.07/2.26  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------