↑ 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  : COL052-2 : TPTP v9.3.1. Released v1.0.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 : 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 06:56:18 AM UTC 2026

% Result   : Unsatisfiable 3.32s 2.27s
% Output   : Refutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   13 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (   8 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   60 (   6   ~;   4   |;   0   &;  50   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   14 (   0   ^;  14   !;   0   ?;  14   :)

% Comments : 
%------------------------------------------------------------------------------
thf(agreeable_decl,type,
    agreeable: $i > $o ).

thf(a_decl,type,
    a: $i ).

thf(response_decl,type,
    response: $i > $i > $i ).

thf(compose_decl,type,
    compose: $i > $i > $i ).

thf(common_bird_decl,type,
    common_bird: $i > $i ).

thf(compatible_decl,type,
    compatible: $i > $i ).

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

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

thf(4,axiom,
    ! [B: $i,A: $i] :
      ( ( A @ agreeable )
      | ( ( B @ ( A @ response ) )
       != ( B @ ( A @ compatible @ response ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agreeable2) ).

thf(14,plain,
    ! [B: $i,A: $i] :
      ( ( A @ agreeable )
      | ( ( B @ ( A @ response ) )
       != ( B @ ( A @ compatible @ response ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(2,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ compose ) @ response ) )
      = ( C @ ( B @ response ) @ ( A @ response ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',composer_exists) ).

thf(9,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( C @ ( B @ ( A @ compose ) @ response ) )
      = ( C @ ( B @ response ) @ ( A @ response ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,axiom,
    c @ agreeable,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_agreeable) ).

thf(17,plain,
    c @ agreeable,
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(1,negated_conjecture,
    ~ ( a @ agreeable ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_a_is_agreeable) ).

thf(7,plain,
    ~ ( a @ agreeable ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(6,axiom,
    ( c
    = ( b @ ( a @ compose ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_composes_a_with_b) ).

thf(18,plain,
    ( c
    = ( b @ ( a @ compose ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(3,axiom,
    ! [B: $i,A: $i] :
      ( ( ( B @ common_bird @ ( A @ response ) )
        = ( B @ common_bird @ ( B @ response ) ) )
      | ~ ( A @ agreeable ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',agreeable1) ).

thf(11,plain,
    ! [B: $i,A: $i] :
      ( ( ( B @ common_bird @ ( A @ response ) )
        = ( B @ common_bird @ ( B @ response ) ) )
      | ~ ( A @ agreeable ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(23,plain,
    $false,
    inference(e,[status(thm)],[14,9,17,7,18,11]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COL052-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.07  % 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.14/0.39  % Computer : n010.cluster.edu
% 0.14/0.39  % Model    : x86_64 x86_64
% 0.14/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.39  % Memory   : 8046.5625MB
% 0.14/0.39  % OS       : Linux 6.8.0-71-generic
% 0.14/0.39  % CPULimit : 300
% 0.14/0.39  % WCLimit  : 300
% 0.14/0.39  % DateTime : Sat Sep 26 23:09:33 UTC 2026
% 0.14/0.39  % CPUTime  : 
% 0.14/0.39  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
% 0.87/0.97  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.30/1.16  % [INFO] 	 Parsing done (183ms). 
% 1.30/1.18  % [INFO] 	 Running in sequential loop mode. 
% 1.87/1.58  % [INFO] 	 eprover registered as external prover. 
% 1.87/1.59  % [INFO] 	 Scanning for conjecture ... 
% 2.07/1.67  % [INFO] 	 Found a conjecture (or negated_conjecture) and 5 axioms. Running axiom selection ... 
% 2.25/1.70  % [INFO] 	 Axiom selection finished. Selected 5 axioms (removed 0 axioms). 
% 2.25/1.72  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 2.25/1.72  % [INFO] 	 Type checking passed. 
% 2.25/1.73  % [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.32/2.26  % External prover 'e' found a proof!
% 3.32/2.26  % [INFO] 	 Killing All external provers ... 
% 3.32/2.27  % Time passed: 1726ms (effective reasoning time: 1083ms)
% 3.32/2.27  % Axioms used in derivation (5): c_composes_a_with_b, agreeable1, c_is_agreeable, composer_exists, agreeable2
% 3.32/2.27  % No. of inferences in proof: 13
% 3.32/2.27  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p : 1726 ms resp. 1083 ms w/o parsing
% 3.66/2.31  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.66/2.31  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------