↑ 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  : SWV263-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 : 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 08:58:37 AM UTC 2026

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

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

thf(v_G_decl,type,
    v_G: $i ).

thf(v_H_decl,type,
    v_H: $i ).

thf(tc_set_decl,type,
    tc_set: $i > $i ).

thf(tc_Message_Omsg_decl,type,
    tc_Message_Omsg: $i ).

thf(c_in_decl,type,
    c_in: $i > $i > $i > $o ).

thf(v_X_decl,type,
    v_X: $i ).

thf(c_Message_Oparts_decl,type,
    c_Message_Oparts: $i > $i ).

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ( tc_Message_Omsg @ ( B @ c_Message_Oparts @ ( A @ c_in ) ) )
      | ~ ( tc_Message_Omsg @ ( B @ ( A @ c_in ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Message_Oparts_OInj_0) ).

thf(10,plain,
    ! [B: $i,A: $i] :
      ( ( tc_Message_Omsg @ ( B @ c_Message_Oparts @ ( A @ c_in ) ) )
      | ~ ( tc_Message_Omsg @ ( B @ ( A @ c_in ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(1,negated_conjecture,
    tc_Message_Omsg @ tc_set @ ( v_H @ ( v_G @ c_lessequals ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_0) ).

thf(6,plain,
    tc_Message_Omsg @ tc_set @ ( v_H @ ( v_G @ c_lessequals ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(5,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( C @ ( D @ ( A @ c_in ) ) )
      | ~ ( C @ tc_set @ ( D @ ( B @ c_lessequals ) ) )
      | ~ ( C @ ( B @ ( A @ c_in ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_OsubsetD_0) ).

thf(12,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( C @ ( D @ ( A @ c_in ) ) )
      | ~ ( C @ tc_set @ ( D @ ( B @ c_lessequals ) ) )
      | ~ ( C @ ( B @ ( A @ c_in ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(2,negated_conjecture,
    tc_Message_Omsg @ ( v_G @ ( v_X @ c_in ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).

thf(7,plain,
    tc_Message_Omsg @ ( v_G @ ( v_X @ c_in ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,negated_conjecture,
    ~ ( tc_Message_Omsg @ ( v_H @ c_Message_Oparts @ ( v_X @ c_in ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

thf(8,plain,
    ~ ( tc_Message_Omsg @ ( v_H @ c_Message_Oparts @ ( v_X @ c_in ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV263-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.60  % Computer : n020.cluster.edu
% 0.15/0.60  % Model    : x86_64 x86_64
% 0.15/0.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.60  % Memory   : 8046.5625MB
% 0.15/0.60  % OS       : Linux 6.8.0-71-generic
% 0.15/0.60  % CPULimit : 300
% 0.15/0.60  % WCLimit  : 300
% 0.15/0.60  % DateTime : Sat Sep 26 13:25:35 UTC 2026
% 0.15/0.60  % CPUTime  : 
% 0.15/0.60  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.93/1.18  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.23/1.36  % [INFO] 	 Parsing done (171ms). 
% 1.23/1.37  % [INFO] 	 Running in sequential loop mode. 
% 1.82/1.77  % [INFO] 	 eprover registered as external prover. 
% 1.82/1.78  % [INFO] 	 Scanning for conjecture ... 
% 2.03/1.87  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.20/1.90  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.20/1.91  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.20/1.91  % [INFO] 	 Type checking passed. 
% 2.20/1.92  % [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.05/2.37  % External prover 'e' found a proof!
% 3.05/2.37  % [INFO] 	 Killing All external provers ... 
% 3.05/2.37  % Time passed: 1622ms (effective reasoning time: 996ms)
% 3.05/2.37  % Axioms used in derivation (2): cls_Message_Oparts_OInj_0, cls_Set_OsubsetD_0
% 3.05/2.37  % No. of inferences in proof: 11
% 3.05/2.38  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1622 ms resp. 996 ms w/o parsing
% 3.37/2.41  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.37/2.41  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------