↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n002.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 : Fri Sep 25 02:30:57 PM UTC 2026

% Result   : Unsatisfiable 1.66s 1.26s
% Output   : CNFRefutation 1.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   31 (   8 unt;   0 def)
%            Number of atoms       :   54 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   51 (  28   ~;  23   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   8 con; 0-3 aty)
%            Number of variables   :   62 (   0 sgn  62   !;   0   ?;  39   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1)
      | can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',climb_up) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1)
      | can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_holding_ladder) ).

fof(f5,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ can(monkey(X3,floor,nothing),X1,X2)
      | can(monkey(X0,floor,nothing),X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',go_holding_nothing) ).

fof(f6,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ can(monkey(X0,X1,the_ladder),ladder(X0,X3),X2)
      | can(monkey(X0,X1,nothing),ladder(X0,floor),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',drop_ladder) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
      | can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',grab_bananas) ).

fof(f9,axiom,
    ! [X2,X0,X1] :
      ( ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2)
      | can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',grab_ladder) ).

fof(f10,axiom,
    can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_situation) ).

fof(f11,negated_conjecture,
    ! [X2,X3,X0,X1] : ~ can(monkey(X0,X1,the_bananas),X2,X3),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_the_monkey_can_get_the_bananas) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] :
      ( can(monkey(X0,ceiling,nothing),ladder(X0,floor),X1)
      | ~ can(monkey(X0,floor,nothing),ladder(X0,floor),X1) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( can(monkey(X2,floor,the_ladder),ladder(X2,floor),X1)
      | ~ can(monkey(X0,floor,the_ladder),ladder(X0,floor),X1) ),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( can(monkey(X3,floor,nothing),X1,X2)
      | ~ can(monkey(X0,floor,nothing),X1,X2) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( can(monkey(X0,X1,nothing),ladder(X0,floor),X3)
      | ~ can(monkey(X0,X1,the_ladder),ladder(X0,X2),X3) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_67,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1))
      | ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_68,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( can(monkey(X0,X1,the_ladder),ladder(X0,X1),X2)
      | ~ can(monkey(X0,X1,nothing),ladder(X0,X1),X2) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_69,plain,
    can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)),
    inference(cnf_transformation,[],[f10]) ).

tcf(c_70,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : ~ can(monkey(X0,X1,the_bananas),X2,X3),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_92,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1))
      | can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1)) ),
    inference(prop_impl_just,[status(thm)],[c_67]) ).

tcf(c_93,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( can(monkey(X0,X1,the_bananas),X2,bananas(X0,X1))
      | ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)) ),
    inference(renaming,[status(thm)],[c_92]) ).

tcf(c_134,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)),
    inference(backward_subsumption_resolution,[status(thm)],[c_93,c_70]) ).

tcf(c_228,plain,
    ! [X0: $i,X1: $i,X2: $i] : ~ can(monkey(X0,X1,nothing),X2,bananas(X0,X1)),
    inference(demodulation,[status(thm)],[c_134]) ).

tcf(c_229,plain,
    ! [X0: $i] :
      ( can(monkey(X0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling))
      | ~ can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_64]) ).

tcf(c_231,plain,
    ( can(monkey(l1,floor,nothing),ladder(l1,floor),bananas(l2,ceiling))
    | ~ can(monkey(l0,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_229]) ).

tcf(c_237,plain,
    ( can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling))
    | ~ can(monkey(l1,floor,nothing),ladder(l1,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_68]) ).

tcf(c_244,plain,
    ! [X0: $i] :
      ( can(monkey(X0,floor,the_ladder),ladder(X0,floor),bananas(l2,ceiling))
      | ~ can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_62]) ).

tcf(c_254,plain,
    ! [X0: $i] :
      ( can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(l2,ceiling))
      | ~ can(monkey(X0,floor,the_ladder),ladder(X0,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_65]) ).

tcf(c_258,plain,
    ! [X0: $i] :
      ( can(monkey(X0,ceiling,nothing),ladder(X0,floor),bananas(l2,ceiling))
      | ~ can(monkey(X0,floor,nothing),ladder(X0,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_60]) ).

tcf(c_265,plain,
    ( can(monkey(l2,ceiling,nothing),ladder(l2,floor),bananas(l2,ceiling))
    | ~ can(monkey(l2,floor,nothing),ladder(l2,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_258]) ).

tcf(c_266,plain,
    ~ can(monkey(l2,ceiling,nothing),ladder(l2,floor),bananas(l2,ceiling)),
    inference(instantiation,[status(thm)],[c_228]) ).

tcf(c_275,plain,
    ( can(monkey(l2,floor,nothing),ladder(l2,floor),bananas(l2,ceiling))
    | ~ can(monkey(l2,floor,the_ladder),ladder(l2,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_254]) ).

tcf(c_287,plain,
    ( can(monkey(l2,floor,the_ladder),ladder(l2,floor),bananas(l2,ceiling))
    | ~ can(monkey(l1,floor,the_ladder),ladder(l1,floor),bananas(l2,ceiling)) ),
    inference(instantiation,[status(thm)],[c_244]) ).

tcf(c_288,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_287,c_275,c_266,c_265,c_237,c_231,c_69]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : PLA003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.35  % Computer : n002.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Thu Sep 24 06:10:20 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38  Running first-order theorem proving
% 0.12/0.38  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.40  
% 0.12/0.40  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40  
% 0.12/0.40  % Detected problem language: tptp
% 0.12/0.41  % Proving...
% 1.66/1.26  % SZS status Started for theBenchmark.p
% 1.66/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 1.66/1.26  
% 1.66/1.26  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.66/1.26  
% 1.66/1.26  % ------  iProver source info
% 1.66/1.26  
% 1.66/1.26  % git: date: 2026-07-19 20:42:38 +0200
% 1.66/1.26  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.66/1.26  % git: non_committed_changes: false
% 1.66/1.26  
% 1.66/1.26  % ------ Parsing...% successful
% 1.66/1.26  
% 1.66/1.26  
% 1.66/1.26  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.66/1.26  
% 1.66/1.26  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  pe_s  pe_e  sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.66/1.26  
% 1.66/1.26  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 1.66/1.26  % ------ Proving...
% 1.66/1.26  % ------ Problem Properties 
% 1.66/1.26  
% 1.66/1.26  % 
% 1.66/1.26  % clauses                               8
% 1.66/1.26  % conjectures                           0
% 1.66/1.26  % EPR                                   0
% 1.66/1.26  % Horn                                  8
% 1.66/1.26  % unary                                 2
% 1.66/1.26  % binary                                6
% 1.66/1.26  % lits                                  14
% 1.66/1.26  % lits eq                               0
% 1.66/1.26  % fd_pure                               0
% 1.66/1.26  % fd_pseudo                             0
% 1.66/1.26  % fd_cond                               0
% 1.66/1.26  % fd_pseudo_cond                        0
% 1.66/1.26  % AC symbols                            0
% 1.66/1.26  
% 1.66/1.26  % ------ Schedule dynamic 5 is on 
% 1.66/1.26  
% 1.66/1.26  % ------ no conjectures: strip conj schedule 
% 1.66/1.26  
% 1.66/1.26  % ------ no equalities: superposition off 
% 1.66/1.26  
% 1.66/1.26  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.66/1.26  
% 1.66/1.26  
% 1.66/1.26  % ------ 
% 1.66/1.26  % Current options:
% 1.66/1.26  % ------ 
% 1.66/1.26  
% 1.66/1.26  
% 1.66/1.26  % 
% 1.66/1.26  
% 1.66/1.26  % ------ Proving...
% 1.66/1.26  % 
% 1.66/1.26  
% 1.66/1.26  % SZS status Unsatisfiable for theBenchmark.p
% 1.66/1.26  
% 1.66/1.26  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.66/1.26  
% 1.66/1.26  
%------------------------------------------------------------------------------