↑ Up

Leo-III---1.8.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Leo-III---1.8.0
% Problem  : LCL674+1.001 : TPTP v9.3.1. Released v4.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 : n026.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:52:28 AM UTC 2026

% Result   : Theorem 3.86s 2.46s
% Output   : Refutation 4.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :  120 (   0 equ;   0 cnn)
%            Maximal formula atoms :   37 (  15 avg)
%            Number of connectives :  367 ( 104   ~;  66   |;  44   &; 151   @)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    7 (   6 usr;   1 con; 0-2 aty)
%            Number of variables   :   35 (   0   ^;  32   !;   3   ?;  35   :)

% Comments : 
%------------------------------------------------------------------------------
thf(r1_decl,type,
    r1: $i > $i > $o ).

thf(p2_decl,type,
    p2: $i > $o ).

thf(p102_decl,type,
    p102: $i > $o ).

thf(p101_decl,type,
    p101: $i > $o ).

thf(p100_decl,type,
    p100: $i > $o ).

thf(p1_decl,type,
    p1: $i > $o ).

thf(1,conjecture,
    ~ ? [A: $i] :
        ~ ( ~ ( ( A @ p100 )
              & ~ ( A @ p101 )
              & ! [B: $i] :
                  ( ( ( ~ ( B @ p101 )
                      | ( B @ p100 ) )
                    & ( ~ ( B @ p102 )
                      | ( B @ p101 ) )
                    & ( ~ ( B @ p100 )
                      | ( ( ~ ( B @ p1 )
                          | ! [C: $i] :
                              ( ~ ( C @ p100 )
                              | ( C @ p1 )
                              | ~ ( C @ ( B @ r1 ) ) ) )
                        & ( ( B @ p1 )
                          | ! [C: $i] :
                              ( ~ ( C @ p100 )
                              | ~ ( C @ p1 )
                              | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                    & ( ~ ( B @ p101 )
                      | ( ( ~ ( B @ p2 )
                          | ! [C: $i] :
                              ( ~ ( C @ p101 )
                              | ( C @ p2 )
                              | ~ ( C @ ( B @ r1 ) ) ) )
                        & ( ( B @ p2 )
                          | ! [C: $i] :
                              ( ~ ( C @ p101 )
                              | ~ ( C @ p2 )
                              | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                    & ( ~ ( ( B @ p100 )
                          & ~ ( B @ p101 ) )
                      | ( ~ ! [C: $i] :
                              ( ~ ( ( C @ p101 )
                                  & ~ ( C @ p102 )
                                  & ( C @ p2 ) )
                              | ~ ( C @ ( B @ r1 ) ) )
                        & ~ ! [C: $i] :
                              ( ~ ( ( C @ p101 )
                                  & ~ ( C @ p102 )
                                  & ~ ( C @ p2 ) )
                              | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                  | ~ ( B @ ( A @ r1 ) ) ) )
          | ~ ! [B: $i] :
                ( ( B @ p2 )
                | ~ ( B @ ( A @ r1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

thf(2,negated_conjecture,
    ~ ~ ? [A: $i] :
          ~ ( ~ ( ( A @ p100 )
                & ~ ( A @ p101 )
                & ! [B: $i] :
                    ( ( ( ~ ( B @ p101 )
                        | ( B @ p100 ) )
                      & ( ~ ( B @ p102 )
                        | ( B @ p101 ) )
                      & ( ~ ( B @ p100 )
                        | ( ( ~ ( B @ p1 )
                            | ! [C: $i] :
                                ( ~ ( C @ p100 )
                                | ( C @ p1 )
                                | ~ ( C @ ( B @ r1 ) ) ) )
                          & ( ( B @ p1 )
                            | ! [C: $i] :
                                ( ~ ( C @ p100 )
                                | ~ ( C @ p1 )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                      & ( ~ ( B @ p101 )
                        | ( ( ~ ( B @ p2 )
                            | ! [C: $i] :
                                ( ~ ( C @ p101 )
                                | ( C @ p2 )
                                | ~ ( C @ ( B @ r1 ) ) ) )
                          & ( ( B @ p2 )
                            | ! [C: $i] :
                                ( ~ ( C @ p101 )
                                | ~ ( C @ p2 )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                      & ( ~ ( ( B @ p100 )
                            & ~ ( B @ p101 ) )
                        | ( ~ ! [C: $i] :
                                ( ~ ( ( C @ p101 )
                                    & ~ ( C @ p102 )
                                    & ( C @ p2 ) )
                                | ~ ( C @ ( B @ r1 ) ) )
                          & ~ ! [C: $i] :
                                ( ~ ( ( C @ p101 )
                                    & ~ ( C @ p102 )
                                    & ~ ( C @ p2 ) )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                    | ~ ( B @ ( A @ r1 ) ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p2 )
                  | ~ ( B @ ( A @ r1 ) ) ) ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(5,plain,
    ~ ~ ? [A: $i] :
          ~ ( ~ ( ( A @ p100 )
                & ~ ( A @ p101 )
                & ! [B: $i] :
                    ( ( ( ~ ( B @ p101 )
                        | ( B @ p100 ) )
                      & ( ~ ( B @ p102 )
                        | ( B @ p101 ) )
                      & ( ~ ( B @ p100 )
                        | ( ( ~ ( B @ p1 )
                            | ! [C: $i] :
                                ( ~ ( C @ p100 )
                                | ( C @ p1 )
                                | ~ ( C @ ( B @ r1 ) ) ) )
                          & ( ( B @ p1 )
                            | ! [C: $i] :
                                ( ~ ( C @ p100 )
                                | ~ ( C @ p1 )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                      & ( ~ ( B @ p101 )
                        | ( ( ~ ( B @ p2 )
                            | ! [C: $i] :
                                ( ~ ( C @ p101 )
                                | ( C @ p2 )
                                | ~ ( C @ ( B @ r1 ) ) ) )
                          & ( ( B @ p2 )
                            | ! [C: $i] :
                                ( ~ ( C @ p101 )
                                | ~ ( C @ p2 )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                      & ( ~ ( ( B @ p100 )
                            & ~ ( B @ p101 ) )
                        | ( ~ ! [C: $i] :
                                ( ~ ( ( C @ p101 )
                                    & ~ ( C @ p102 )
                                    & ( C @ p2 ) )
                                | ~ ( C @ ( B @ r1 ) ) )
                          & ~ ! [C: $i] :
                                ( ~ ( ( C @ p101 )
                                    & ~ ( C @ p102 )
                                    & ~ ( C @ p2 ) )
                                | ~ ( C @ ( B @ r1 ) ) ) ) ) )
                    | ~ ( B @ ( A @ r1 ) ) ) )
            | ~ ! [B: $i] :
                  ( ( B @ p2 )
                  | ~ ( B @ ( A @ r1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).

thf(40,plain,
    ! [A: $i] : ( A @ ( A @ r1 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(4,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ r1 ) )
        & ( B @ ( A @ r1 ) ) )
     => ( C @ ( A @ r1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity) ).

thf(42,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( C @ ( B @ r1 ) )
        & ( B @ ( A @ r1 ) ) )
     => ( C @ ( A @ r1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(44,plain,
    $false,
    inference(e,[status(thm)],[5,40,42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08  % 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.15/0.43  % Computer : n026.cluster.edu
% 0.15/0.43  % Model    : x86_64 x86_64
% 0.15/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.43  % Memory   : 8046.5625MB
% 0.15/0.43  % OS       : Linux 6.8.0-71-generic
% 0.15/0.43  % CPULimit : 300
% 0.15/0.43  % WCLimit  : 300
% 0.15/0.43  % DateTime : Fri Sep 25 23:16:41 UTC 2026
% 0.15/0.43  % CPUTime  : 
% 0.15/0.43  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.91/1.01  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.46/1.21  % [INFO] 	 Parsing done (195ms). 
% 1.46/1.22  % [INFO] 	 Running in sequential loop mode. 
% 2.22/1.62  % [INFO] 	 eprover registered as external prover. 
% 2.22/1.63  % [INFO] 	 Scanning for conjecture ... 
% 2.38/1.75  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.57/1.80  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.57/1.81  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.57/1.81  % [INFO] 	 Type checking passed. 
% 2.57/1.82  % [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.86/2.45  % External prover 'e' found a proof!
% 3.86/2.45  % [INFO] 	 Killing All external provers ... 
% 3.86/2.46  % Time passed: 1879ms (effective reasoning time: 1226ms)
% 3.86/2.46  % Solved by 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)>
% 3.86/2.46  % Axioms used in derivation (2): reflexivity, transitivity
% 3.86/2.46  % No. of inferences in proof: 8
% 3.86/2.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : 1879 ms resp. 1226 ms w/o parsing
% 4.18/2.50  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.18/2.51  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------