↑ 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  : PLA003-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 : n012.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 08:19:52 AM UTC 2026

% Result   : Unsatisfiable 2.03s 1.81s
% Output   : Refutation 2.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   23 (   5 unt;   0 typ;   0 def)
%            Number of atoms       :   41 (   0 equ;   0 cnn)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :  350 (  20   ~;  18   |;   0   &; 312   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (  11 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  12 usr;   9 con; 0-3 aty)
%            Number of variables   :   62 (   0   ^;  62   !;   0   ?;  62   :)

% Comments : 
%------------------------------------------------------------------------------
thf(can_decl,type,
    can: $i > $i > $i > $o ).

thf(monkey_decl,type,
    monkey: $i > $i > $i > $i ).

thf(the_bananas_decl,type,
    the_bananas: $i ).

thf(ceiling_decl,type,
    ceiling: $i ).

thf(nothing_decl,type,
    nothing: $i ).

thf(ladder_decl,type,
    ladder: $i > $i > $i ).

thf(floor_decl,type,
    floor: $i ).

thf(the_ladder_decl,type,
    the_ladder: $i ).

thf(bananas_decl,type,
    bananas: $i > $i > $i ).

thf(l0_decl,type,
    l0: $i ).

thf(l1_decl,type,
    l1: $i ).

thf(l2_decl,type,
    l2: $i ).

thf(7,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( D @ ( A @ ladder ) @ ( the_ladder @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( C @ ( floor @ ( A @ ladder ) @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drop_ladder) ).

thf(24,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( D @ ( A @ ladder ) @ ( the_ladder @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( C @ ( floor @ ( A @ ladder ) @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[7]) ).

thf(2,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( ceiling @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_up) ).

thf(14,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( ceiling @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(5,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( floor @ ( C @ bananas ) @ ( B @ ( the_bananas @ ( floor @ ( C @ monkey ) ) @ can ) ) )
      | ( floor @ ( A @ bananas ) @ ( B @ ( the_bananas @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_holding_bananas) ).

thf(20,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( floor @ ( C @ bananas ) @ ( B @ ( the_bananas @ ( floor @ ( C @ monkey ) ) @ can ) ) )
      | ( floor @ ( A @ bananas ) @ ( B @ ( the_bananas @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[5]) ).

thf(9,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( A @ bananas ) @ ( C @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( A @ bananas ) @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',grab_bananas) ).

thf(28,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( A @ bananas ) @ ( C @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( A @ bananas ) @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(11,axiom,
    ceiling @ ( l2 @ bananas ) @ ( floor @ ( l1 @ ladder ) @ ( nothing @ ( floor @ ( l0 @ monkey ) ) @ can ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',initial_situation) ).

thf(32,plain,
    ceiling @ ( l2 @ bananas ) @ ( floor @ ( l1 @ ladder ) @ ( nothing @ ( floor @ ( l0 @ monkey ) ) @ can ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[11]) ).

thf(6,axiom,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ ( nothing @ ( floor @ ( D @ monkey ) ) @ can ) ) )
      | ( C @ ( B @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_holding_nothing) ).

thf(22,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ ( nothing @ ( floor @ ( D @ monkey ) ) @ can ) ) )
      | ( C @ ( B @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(1,negated_conjecture,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ~ ( D @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_the_monkey_can_get_the_bananas) ).

thf(12,plain,
    ! [D: $i,C: $i,B: $i,A: $i] :
      ~ ( D @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[1]) ).

thf(4,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( C @ ladder ) @ ( the_ladder @ ( floor @ ( C @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( the_ladder @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',go_holding_ladder) ).

thf(18,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( C @ ladder ) @ ( the_ladder @ ( floor @ ( C @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( the_ladder @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[4]) ).

thf(3,axiom,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( ceiling @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',climb_down) ).

thf(16,plain,
    ! [B: $i,A: $i] :
      ( ~ ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( ceiling @ ( A @ monkey ) ) @ can ) ) )
      | ( B @ ( floor @ ( A @ ladder ) @ ( nothing @ ( floor @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[3]) ).

thf(8,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( A @ bananas ) @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( floor @ ( A @ bananas ) @ ( C @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',drop_bananas) ).

thf(26,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( B @ ( A @ bananas ) @ ( C @ ( the_bananas @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( floor @ ( A @ bananas ) @ ( C @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[8]) ).

thf(10,axiom,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ ( A @ ladder ) @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( C @ ( B @ ( A @ ladder ) @ ( the_ladder @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',grab_ladder) ).

thf(30,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( C @ ( B @ ( A @ ladder ) @ ( nothing @ ( B @ ( A @ monkey ) ) @ can ) ) )
      | ( C @ ( B @ ( A @ ladder ) @ ( the_ladder @ ( B @ ( A @ monkey ) ) @ can ) ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[10]) ).

thf(33,plain,
    $false,
    inference(e,[status(thm)],[24,14,20,28,32,22,12,18,16,26,30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % 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.05/0.32  % Computer : n012.cluster.edu
% 0.05/0.32  % Model    : x86_64 x86_64
% 0.05/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.05/0.32  % Memory   : 8046.5625MB
% 0.05/0.32  % OS       : Linux 6.8.0-71-generic
% 0.05/0.32  % CPULimit : 300
% 0.05/0.32  % WCLimit  : 300
% 0.05/0.32  % DateTime : Sat Sep 26 04:42:07 UTC 2026
% 0.05/0.32  % CPUTime  : 
% 0.05/0.32  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.46/0.79  % [INFO] 	 Parsing problem /export/starexec/sandbox/benchmark/theBenchmark.p ... 
% 0.70/0.93  % [INFO] 	 Parsing done (134ms). 
% 0.70/0.93  % [INFO] 	 Running in sequential loop mode. 
% 1.10/1.21  % [INFO] 	 eprover registered as external prover. 
% 1.10/1.21  % [INFO] 	 Scanning for conjecture ... 
% 1.10/1.28  % [INFO] 	 Found a conjecture (or negated_conjecture) and 10 axioms. Running axiom selection ... 
% 1.26/1.32  % [INFO] 	 Axiom selection finished. Selected 10 axioms (removed 0 axioms). 
% 1.26/1.33  % [INFO] 	 Problem is propositional (TPTP CNF). 
% 1.26/1.34  % [INFO] 	 Type checking passed. 
% 1.26/1.34  % [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 ... 
% 2.03/1.81  % External prover 'e' found a proof!
% 2.03/1.81  % [INFO] 	 Killing All external provers ... 
% 2.03/1.81  % Time passed: 1368ms (effective reasoning time: 868ms)
% 2.03/1.81  % Axioms used in derivation (10): drop_ladder, drop_bananas, grab_bananas, grab_ladder, climb_up, climb_down, go_holding_nothing, initial_situation, go_holding_ladder, go_holding_bananas
% 2.03/1.81  % No. of inferences in proof: 23
% 2.03/1.81  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : 1368 ms resp. 868 ms w/o parsing
% 2.03/1.84  % SZS output start Refutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.03/1.84  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------