↑ 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  : SYN296-1 : TPTP v9.3.1. Released v1.1.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 : n010.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 09:17:08 AM UTC 2026

% Result   : Unsatisfiable 168.98s 84.90s
% Output   : Refutation 169.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :   50 (   6 equ;   0 cnn)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  137 (  30   ~;  17   |;   0   &;  90   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   6 usr;   5 con; 0-3 aty)
%            Number of variables   :   36 (   0   ^;  36   !;   0   ?;  36   :)

% Comments : 
%------------------------------------------------------------------------------
thf(q1_decl,type,
    q1: $i > $i > $i > $o ).

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

thf(b_decl,type,
    b: $i ).

thf(d_decl,type,
    d: $i ).

thf(p0_decl,type,
    p0: $i > $i > $o ).

thf(n0_decl,type,
    n0: $i > $i > $o ).

thf(255,axiom,
    ! [A: $i] : ( A @ ( b @ p0 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_14) ).

thf(858,plain,
    ! [A: $i] : ( A @ ( b @ p0 ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[255]) ).

thf(313,axiom,
    b @ ( d @ n0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

thf(963,plain,
    b @ ( d @ n0 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[313]) ).

thf(342,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( A @ ( D @ p0 ) )
      | ~ ( B @ ( C @ n0 ) )
      | ( A @ ( B @ ( A @ q1 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rule_092) ).

thf(1015,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( A @ ( D @ p0 ) )
      | ~ ( B @ ( C @ n0 ) )
      | ( A @ ( B @ ( A @ q1 ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[342]) ).

thf(1016,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( A @ ( D @ p0 ) )
      | ~ ( B @ ( C @ n0 ) )
      | ( A @ ( B @ ( A @ q1 ) ) ) ),
    inference(cnf,[status(esa)],[1015]) ).

thf(1,negated_conjecture,
    ~ ( e @ ( b @ ( e @ q1 ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

thf(370,plain,
    ~ ( e @ ( b @ ( e @ q1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(371,plain,
    ~ ( e @ ( b @ ( e @ q1 ) ) ),
    inference(polarity_switch,[status(thm)],[370]) ).

thf(56318,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( ( A @ ( B @ ( A @ q1 ) ) )
       != ( e @ ( b @ ( e @ q1 ) ) ) )
      | ~ $true
      | ~ ( A @ ( D @ p0 ) )
      | ~ ( B @ ( C @ n0 ) ) ),
    inference(paramod_ordered,[status(thm)],[1016,371]) ).

thf(56319,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ( ( A @ ( B @ ( A @ q1 ) ) )
       != ( e @ ( b @ ( e @ q1 ) ) ) )
      | ~ ( A @ ( D @ p0 ) )
      | ~ ( B @ ( C @ n0 ) ) ),
    inference(simp,[status(thm)],[56318]) ).

thf(56320,plain,
    ! [B: $i,A: $i] :
      ( ~ ( e @ ( B @ p0 ) )
      | ~ ( b @ ( A @ n0 ) ) ),
    inference(pattern_uni,[status(thm)],[56319:[bind(A,$thf( e )),bind(B,$thf( b ))]]) ).

thf(56363,plain,
    ! [B: $i,A: $i] :
      ( ~ ( e @ ( B @ p0 ) )
      | ~ ( b @ ( A @ n0 ) ) ),
    inference(simp,[status(thm)],[56320]) ).

thf(56548,plain,
    ! [B: $i,A: $i] :
      ( ( ( b @ ( d @ n0 ) )
       != ( b @ ( A @ n0 ) ) )
      | ~ ( e @ ( B @ p0 ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[963,56363]) ).

thf(56549,plain,
    ! [B: $i,A: $i] :
      ( ( ( b @ ( d @ n0 ) )
       != ( b @ ( A @ n0 ) ) )
      | ~ ( e @ ( B @ p0 ) ) ),
    inference(simp,[status(thm)],[56548]) ).

thf(56550,plain,
    ! [A: $i] :
      ~ ( e @ ( A @ p0 ) ),
    inference(pattern_uni,[status(thm)],[56549:[bind(A,$thf( d ))]]) ).

thf(56560,plain,
    ! [A: $i] :
      ~ ( e @ ( A @ p0 ) ),
    inference(simp,[status(thm)],[56550]) ).

thf(56572,plain,
    ! [B: $i,A: $i] :
      ( ( ( A @ ( b @ p0 ) )
       != ( e @ ( B @ p0 ) ) )
      | ~ $true ),
    inference(paramod_ordered,[status(thm)],[858,56560]) ).

thf(56573,plain,
    ! [B: $i,A: $i] :
      ( ( A @ ( b @ p0 ) )
     != ( e @ ( B @ p0 ) ) ),
    inference(simp,[status(thm)],[56572]) ).

thf(56574,plain,
    $false,
    inference(pattern_uni,[status(thm)],[56573:[bind(A,$thf( e )),bind(B,$thf( b ))]]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SYN296-1 : TPTP v9.3.1. Released v1.1.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.12/0.40  % Computer : n010.cluster.edu
% 0.12/0.40  % Model    : x86_64 x86_64
% 0.12/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.40  % Memory   : 8046.5625MB
% 0.12/0.40  % OS       : Linux 6.8.0-71-generic
% 0.12/0.40  % CPULimit : 300
% 0.12/0.40  % WCLimit  : 300
% 0.12/0.40  % DateTime : Sat Sep 26 17:31:31 UTC 2026
% 0.12/0.40  % CPUTime  : 
% 0.12/0.40  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.82/0.98  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.38/1.27  % [INFO] 	 Parsing done (283ms). 
% 1.38/1.28  % [INFO] 	 Running in sequential loop mode. 
% 2.33/1.66  % [INFO] 	 eprover registered as external prover. 
% 2.33/1.67  % [INFO] 	 Scanning for conjecture ... 
% 2.77/1.80  % [INFO] 	 Found a conjecture (or negated_conjecture) and 368 axioms. Running axiom selection ... 
% 3.07/1.94  % [INFO] 	 Axiom selection finished. Selected 368 axioms (removed 0 axioms). 
% 3.63/2.11  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 3.63/2.12  % [INFO] 	 Type checking passed. 
% 3.63/2.12  % [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 ... 
% 168.98/84.89  % [INFO] 	 Killing All external provers ... 
% 168.98/84.89  % Time passed: 84345ms (effective reasoning time: 83601ms)
% 168.98/84.89  % Axioms used in derivation (3): axiom_14, axiom_7, rule_092
% 168.98/84.89  % No. of inferences in proof: 21
% 168.98/84.90  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 84345 ms resp. 83601 ms w/o parsing
% 169.18/84.92  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 169.18/84.92  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------