↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : PUZ008-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 : n017.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:32:40 PM UTC 2026

% Result   : Unsatisfiable 2.14s 1.31s
% Output   : CNFRefutation 2.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   26 (  22 unt;   9 def)
%            Number of atoms       :   61 (   9 equ)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :   11 (   7   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  10 usr;  10 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn  37   !;   0   ?;  24   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X2,X3,X0,X1] :
      ( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
      | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cannibal_east_to_west) ).

fof(f9,axiom,
    ! [X2,X3,X0,X1] :
      ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
      | ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',missionary_and_cannibal_west_to_east) ).

fof(f13,axiom,
    ! [X2,X3,X0,X1] : achievable(west(X0,X1),X2,east(m(s(X3)),c(s(s(X3))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',extra_cannibal_meal_on_east_bank) ).

fof(f16,negated_conjecture,
    ! [X0] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_can_get_to_east_bank) ).

tcf(c_66,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( achievable(west(m(X0),c(s(X1))),boatonwest,east(m(X2),c(X3)))
      | ~ achievable(west(m(X0),c(X1)),boatoneast,east(m(X2),c(s(X3)))) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_73,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( achievable(west(m(X0),c(X1)),boatoneast,east(m(s(X2)),c(s(X3))))
      | ~ achievable(west(m(s(X0)),c(s(X1))),boatonwest,east(m(X2),c(X3))) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_77,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] : achievable(west(X0,X1),X2,east(m(s(X3)),c(s(s(X3))))),
    inference(cnf_transformation,[],[f13]) ).

tcf(c_80,negated_conjecture,
    ! [X0: $i] : ~ achievable(west(m(n0),c(n0)),X0,east(m(s(s(s(n0)))),c(s(s(s(n0)))))),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_204,definition,
    iPr_def_10 = m(n0),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_205,definition,
    iPr_def_11 = c(n0),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_206,definition,
    iPr_def_12 = west(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_207,definition,
    iPr_def_13 = s(n0),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_208,definition,
    iPr_def_14 = s(iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_209,definition,
    iPr_def_15 = s(iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_210,definition,
    iPr_def_16 = m(iPr_def_15),
    introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).

tcf(c_211,definition,
    iPr_def_17 = c(iPr_def_15),
    introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).

tcf(c_212,definition,
    iPr_def_18 = east(iPr_def_16,iPr_def_17),
    introduced(definition,[new_symbols(definition,[iPr_def_18])],[]) ).

tcf(c_213,negated_conjecture,
    ! [X0: $i] : ~ achievable(iPr_def_12,X0,iPr_def_18),
    inference(demodulation,[status(thm)],[c_80,c_211,c_207,c_208,c_209,c_210,c_212,c_205,c_204,c_206]) ).

tcf(c_788,plain,
    ! [X0: $i,X1: $i,X2: $i] : achievable(west(m(X0),c(s(X1))),boatonwest,east(m(s(X2)),c(s(X2)))),
    inference(superposition,[status(thm)],[c_77,c_66]) ).

tcf(c_3535,plain,
    ! [X0: $i,X1: $i] : achievable(west(m(X0),c(s(X1))),boatonwest,east(m(iPr_def_14),c(iPr_def_14))),
    inference(superposition,[status(thm)],[c_208,c_788]) ).

tcf(c_4108,plain,
    ! [X0: $i,X1: $i] : achievable(west(m(X0),c(X1)),boatoneast,east(m(s(iPr_def_14)),c(s(iPr_def_14)))),
    inference(superposition,[status(thm)],[c_3535,c_73]) ).

tcf(c_4111,plain,
    ! [X0: $i,X1: $i] : achievable(west(m(X0),c(X1)),boatoneast,iPr_def_18),
    inference(light_normalisation,[status(thm)],[c_4108,c_209,c_210,c_211,c_212]) ).

tcf(c_4122,plain,
    ! [X0: $i] : achievable(west(iPr_def_10,c(X0)),boatoneast,iPr_def_18),
    inference(superposition,[status(thm)],[c_204,c_4111]) ).

tcf(c_4130,plain,
    achievable(west(iPr_def_10,iPr_def_11),boatoneast,iPr_def_18),
    inference(superposition,[status(thm)],[c_205,c_4122]) ).

tcf(c_4132,plain,
    achievable(iPr_def_12,boatoneast,iPr_def_18),
    inference(light_normalisation,[status(thm)],[c_4130,c_206]) ).

tcf(c_4133,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_4132,c_213]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ008-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.11/0.38  % Computer : n017.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Thu Sep 24 06:31:46 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  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.11/0.43  
% 0.11/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.43  
% 0.11/0.44  % Detected problem language: tptp
% 0.11/0.45  % Proving...
% 2.14/1.31  % SZS status Started for theBenchmark.p
% 2.14/1.31  % SZS status Unsatisfiable for theBenchmark.p
% 2.14/1.31  
% 2.14/1.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.14/1.31  
% 2.14/1.31  % ------  iProver source info
% 2.14/1.31  
% 2.14/1.31  % git: date: 2026-07-19 20:42:38 +0200
% 2.14/1.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.14/1.31  % git: non_committed_changes: false
% 2.14/1.31  
% 2.14/1.31  % ------ Parsing...% successful
% 2.14/1.31  
% 2.14/1.31  
% 2.14/1.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.14/1.31  
% 2.14/1.31  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 2.14/1.31  
% 2.14/1.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.14/1.31  
% 2.14/1.31  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.14/1.31  % ------ Proving...
% 2.14/1.31  % ------ Problem Properties 
% 2.14/1.31  
% 2.14/1.31  % 
% 2.14/1.31  % clauses                               25
% 2.14/1.31  % conjectures                           1
% 2.14/1.31  % EPR                                   1
% 2.14/1.31  % Horn                                  25
% 2.14/1.31  % unary                                 15
% 2.14/1.31  % binary                                10
% 2.14/1.31  % lits                                  35
% 2.14/1.31  % lits eq                               9
% 2.14/1.31  % fd_pure                               0
% 2.14/1.31  % fd_pseudo                             0
% 2.14/1.31  % fd_cond                               0
% 2.14/1.31  % fd_pseudo_cond                        0
% 2.14/1.31  % AC symbols                            0
% 2.14/1.31  
% 2.14/1.31  % ------ Schedule dynamic 5 is on 
% 2.14/1.31  
% 2.14/1.31  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.14/1.31  
% 2.14/1.31  
% 2.14/1.31  % ------ 
% 2.14/1.31  % Current options:
% 2.14/1.31  % ------ 
% 2.14/1.31  
% 2.14/1.31  
% 2.14/1.31  % 
% 2.14/1.31  
% 2.14/1.31  % ------ Proving...
% 2.14/1.31  % 
% 2.14/1.31  
% 2.14/1.31  % SZS status Unsatisfiable for theBenchmark.p
% 2.14/1.31  
% 2.14/1.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.14/1.31  
% 2.14/1.31  
%------------------------------------------------------------------------------