↑ 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  : COL075-2 : TPTP v9.3.1. Released v1.2.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 : n015.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 06:56:24 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
thf(apply_decl,type,
    apply: $i > $i > $i ).

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

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

thf(k_decl,type,
    k: $i ).

thf(abstraction_decl,type,
    abstraction: $i ).

thf(1,negated_conjecture,
    ! [A: $i] :
      ( ( A @ c @ ( A @ b @ ( A @ apply ) @ apply ) )
     != ( A @ b @ ( A @ b @ apply ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_diagonal_combinator) ).

thf(4,plain,
    ! [A: $i] :
      ( ( A @ c @ ( A @ b @ ( A @ apply ) @ apply ) )
     != ( A @ b @ ( A @ b @ apply ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ ( k @ apply ) @ apply ) )
      = A ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_definition) ).

thf(7,plain,
    ! [B: $i,A: $i] :
      ( ( B @ ( A @ ( k @ apply ) @ apply ) )
      = A ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(3,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ ( abstraction @ apply ) @ apply ) @ apply ) )
      = ( C @ ( B @ apply ) @ ( C @ ( k @ apply ) @ ( A @ apply ) @ apply ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstraction) ).

thf(9,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ ( abstraction @ apply ) @ apply ) @ apply ) )
      = ( C @ ( B @ apply ) @ ( C @ ( k @ apply ) @ ( A @ apply ) @ apply ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(14,plain,
    $false,
    inference(e,[status(thm)],[4,7,9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : COL075-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.11  % 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.16/0.44  % Computer : n015.cluster.edu
% 0.16/0.44  % Model    : x86_64 x86_64
% 0.16/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.44  % Memory   : 8046.5625MB
% 0.16/0.44  % OS       : Linux 6.8.0-71-generic
% 0.16/0.44  % CPULimit : 300
% 0.16/0.44  % WCLimit  : 300
% 0.16/0.44  % DateTime : Sat Sep 26 23:14:44 UTC 2026
% 0.16/0.44  % CPUTime  : 
% 0.16/0.45  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
% 1.31/1.20  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 1.55/1.35  % [INFO] 	 Parsing done (141ms). 
% 1.55/1.36  % [INFO] 	 Running in sequential loop mode. 
% 2.20/1.74  % [INFO] 	 eprover registered as external prover. 
% 2.20/1.75  % [INFO] 	 Scanning for conjecture ... 
% 2.46/1.81  % [INFO] 	 Found a conjecture (or negated_conjecture) and 2 axioms. Running axiom selection ... 
% 2.46/1.84  % [INFO] 	 Axiom selection finished. Selected 2 axioms (removed 0 axioms). 
% 2.46/1.85  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.46/1.85  % [INFO] 	 Type checking passed. 
% 2.46/1.85  % [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.88/2.32  % External prover 'e' found a proof!
% 3.88/2.32  % [INFO] 	 Killing All external provers ... 
% 3.88/2.32  % Time passed: 1692ms (effective reasoning time: 958ms)
% 3.88/2.32  % Axioms used in derivation (2): k_definition, abstraction
% 3.88/2.32  % No. of inferences in proof: 7
% 3.88/2.32  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1692 ms resp. 958 ms w/o parsing
% 3.88/2.38  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.88/2.38  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------