↑ 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  : LCL097-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 : n001.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:49 AM UTC 2026

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

% 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(b_decl,type,
    b: $i ).

thf(c_decl,type,
    c: $i ).

thf(e_decl,type,
    e: $i ).

thf(falsehood_decl,type,
    falsehood: $i ).

thf(1,negated_conjecture,
    ~ ( e @ ( falsehood @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( falsehood @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ ( c @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).

thf(5,plain,
    ~ ( e @ ( falsehood @ ( b @ equivalent ) @ equivalent ) @ ( c @ ( falsehood @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ ( e @ ( c @ ( b @ ( a @ equivalent ) @ equivalent ) @ equivalent ) @ 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/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).

thf(7,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,
    ! [D: $i,C: $i,B: $i,A: $i] : ( D @ ( D @ ( C @ ( B @ equivalent ) @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).

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

thf(4,axiom,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ ( D @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).

thf(10,plain,
    ! [E: $i,D: $i,C: $i,B: $i,A: $i] : ( E @ ( E @ ( D @ ( C @ ( B @ equivalent ) @ equivalent ) @ ( D @ ( C @ ( A @ equivalent ) @ ( B @ ( A @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ equivalent ) @ is_a_theorem ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(604,plain,
    $false,
    inference(e,[status(thm)],[5,7,9,10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % 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.13/0.60  % Computer : n001.cluster.edu
% 0.13/0.60  % Model    : x86_64 x86_64
% 0.13/0.60  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.60  % Memory   : 8046.5625MB
% 0.13/0.60  % OS       : Linux 6.8.0-71-generic
% 0.13/0.60  % CPULimit : 300
% 0.13/0.60  % WCLimit  : 300
% 0.13/0.60  % DateTime : Fri Sep 25 21:56:27 UTC 2026
% 0.13/0.60  % CPUTime  : 
% 0.13/0.60  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.89/1.18  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.15/1.36  % [INFO] 	 Parsing done (178ms). 
% 1.15/1.38  % [INFO] 	 Running in sequential loop mode. 
% 1.72/1.78  % [INFO] 	 eprover registered as external prover. 
% 1.72/1.79  % [INFO] 	 Scanning for conjecture ... 
% 1.91/1.87  % [INFO] 	 Found a conjecture (or negated_conjecture) and 3 axioms. Running axiom selection ... 
% 2.05/1.91  % [INFO] 	 Axiom selection finished. Selected 3 axioms (removed 0 axioms). 
% 2.05/1.92  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.05/1.92  % [INFO] 	 Type checking passed. 
% 2.05/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 ... 
% 13.79/4.57  % External prover 'e' found a proof!
% 13.79/4.57  % [INFO] 	 Killing All external provers ... 
% 13.79/4.58  % Time passed: 3832ms (effective reasoning time: 3190ms)
% 13.79/4.58  % Axioms used in derivation (3): condensed_detachment, lg_2, lg_3
% 13.79/4.58  % No. of inferences in proof: 9
% 13.79/4.58  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 3832 ms resp. 3190 ms w/o parsing
% 14.27/4.60  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.27/4.61  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------