↑ 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  : LCL258-3 : 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 : n005.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:23 AM UTC 2026

% Result   : Unsatisfiable 4.87s 3.09s
% Output   : Refutation 4.87s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   19 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   25 (   2 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  130 (   8   ~;   6   |;   0   &; 116   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   7 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   0   ^;  32   !;   0   ?;  32   :)

% Comments : 
%------------------------------------------------------------------------------
thf(theorem_decl,type,
    theorem: $i > $o ).

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

thf(p_decl,type,
    p: $i ).

thf(q_decl,type,
    q: $i ).

thf(axiom_decl,type,
    axiom: $i > $o ).

thf(or_decl,type,
    or: $i > $i > $i ).

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

thf(1,negated_conjecture,
    ~ ( q @ ( q @ ( p @ implies ) @ implies ) @ ( p @ implies ) @ theorem ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

thf(10,plain,
    ~ ( q @ ( q @ ( p @ implies ) @ implies ) @ ( p @ implies ) @ theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

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

thf(14,plain,
    ! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( B @ ( A @ or ) @ implies ) @ axiom ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(9,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( B @ theorem )
      | ~ ( A @ ( B @ implies ) @ theorem )
      | ( A @ theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_2) ).

thf(21,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ theorem )
      | ~ ( A @ ( B @ implies ) @ theorem )
      | ( A @ theorem ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

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

thf(13,plain,
    ! [B: $i,A: $i] : ( A @ ( B @ or ) @ ( A @ implies ) @ axiom ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(7,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ implies ) )
      = ( B @ ( A @ not @ or ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',implies_definition) ).

thf(17,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ implies ) )
      = ( B @ ( A @ not @ or ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(2,axiom,
    ! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_1_2) ).

thf(12,plain,
    ! [A: $i] : ( A @ ( A @ ( A @ or ) @ implies ) @ axiom ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

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

thf(16,plain,
    ! [C: $i,B: $i,A: $i] : ( B @ ( C @ or ) @ ( A @ ( C @ or ) @ implies ) @ ( B @ ( A @ implies ) @ implies ) @ axiom ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(8,axiom,
    ! [A: $i] :
      ( ~ ( A @ axiom )
      | ( A @ theorem ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rule_1) ).

thf(19,plain,
    ! [A: $i] :
      ( ~ ( A @ axiom )
      | ( A @ theorem ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

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

thf(15,plain,
    ! [C: $i,B: $i,A: $i] : ( C @ ( A @ or ) @ ( B @ or ) @ ( C @ ( B @ or ) @ ( A @ or ) @ implies ) @ axiom ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(23,plain,
    $false,
    inference(e,[status(thm)],[10,14,21,13,17,12,16,19,15]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL258-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.12  % 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.21/0.48  % Computer : n005.cluster.edu
% 0.21/0.48  % Model    : x86_64 x86_64
% 0.21/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.48  % Memory   : 8046.5625MB
% 0.21/0.48  % OS       : Linux 6.8.0-71-generic
% 0.21/0.48  % CPULimit : 300
% 0.21/0.48  % WCLimit  : 300
% 0.21/0.48  % DateTime : Fri Sep 25 22:09:17 UTC 2026
% 0.21/0.49  % CPUTime  : 
% 0.21/0.49  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
% 1.38/1.35  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.86/1.63  % [INFO] 	 Parsing done (278ms). 
% 1.86/1.65  % [INFO] 	 Running in sequential loop mode. 
% 2.85/2.27  % [INFO] 	 eprover registered as external prover. 
% 2.85/2.28  % [INFO] 	 Scanning for conjecture ... 
% 3.21/2.41  % [INFO] 	 Found a conjecture (or negated_conjecture) and 8 axioms. Running axiom selection ... 
% 3.21/2.46  % [INFO] 	 Axiom selection finished. Selected 8 axioms (removed 0 axioms). 
% 3.21/2.48  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.21/2.49  % [INFO] 	 Type checking passed. 
% 3.38/2.50  % [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 ... 
% 4.87/3.09  % External prover 'e' found a proof!
% 4.87/3.09  % [INFO] 	 Killing All external provers ... 
% 4.87/3.09  % Time passed: 2393ms (effective reasoning time: 1424ms)
% 4.87/3.09  % Axioms used in derivation (8): axiom_1_5, axiom_1_4, rule_1, axiom_1_3, implies_definition, axiom_1_2, rule_2, axiom_1_6
% 4.87/3.09  % No. of inferences in proof: 19
% 4.87/3.09  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 2393 ms resp. 1424 ms w/o parsing
% 4.87/3.12  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.87/3.13  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------