↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : MSC004-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 : n016.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:13:56 PM UTC 2026

% Result   : Unsatisfiable 1.69s 6.48s
% Output   : CNFRefutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   30 (  10 unt;   2 def)
%            Number of atoms       :   65 (   2 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   54 (  28   ~;  26   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-5 aty)
%            Number of variables   :   42 (   0 sgn  42   !;   0   ?;  28   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ has_parts(X0,X3,X1)
      | has_parts(X0,times(X3,X4),X2)
      | in(object_in(X0,X1,X2,X3,X4),X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_part_inheritance) ).

fof(f2,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ has_parts(object_in(X0,X4,X3,X1,X2),X2,X3)
      | ~ has_parts(X0,X1,X4)
      | has_parts(X0,times(X1,X2),X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_inheritance) ).

fof(f3,axiom,
    in(john,boy),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',john_is_a_boy) ).

fof(f4,axiom,
    ! [X0] :
      ( ~ in(X0,boy)
      | in(X0,human) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_boy_in_human) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ in(X0,hand)
      | has_parts(X0,n5,fingers) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',hands_have_5_fingers) ).

fof(f6,axiom,
    ! [X0] :
      ( ~ in(X0,human)
      | has_parts(X0,n2,arm) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',humans_have_two_arms) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ in(X0,arm)
      | has_parts(X0,n1,hand) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arms_have_one_hand) ).

fof(f8,negated_conjecture,
    ~ has_parts(john,times(times(n2,n1),n5),fingers),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_john_has_10_fingers) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( has_parts(X0,times(X1,X4),X3)
      | in(object_in(X0,X2,X3,X1,X4),X2)
      | ~ has_parts(X0,X1,X2) ),
    inference(cnf_transformation,[],[f1]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( has_parts(X0,times(X3,X4),X2)
      | ~ has_parts(X0,X3,X1)
      | ~ has_parts(object_in(X0,X1,X2,X3,X4),X4,X2) ),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_59,plain,
    in(john,boy),
    inference(cnf_transformation,[],[f3]) ).

tcf(c_60,plain,
    ! [X0: $i] :
      ( in(X0,human)
      | ~ in(X0,boy) ),
    inference(cnf_transformation,[],[f4]) ).

tcf(c_61,plain,
    ! [X0: $i] :
      ( has_parts(X0,n5,fingers)
      | ~ in(X0,hand) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_62,plain,
    ! [X0: $i] :
      ( has_parts(X0,n2,arm)
      | ~ in(X0,human) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_63,plain,
    ! [X0: $i] :
      ( has_parts(X0,n1,hand)
      | ~ in(X0,arm) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_64,negated_conjecture,
    ~ has_parts(john,times(times(n2,n1),n5),fingers),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_103,definition,
    iPr_def_10 = times(n2,n1),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_104,definition,
    iPr_def_11 = times(iPr_def_10,n5),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_105,negated_conjecture,
    ~ has_parts(john,iPr_def_11,fingers),
    inference(demodulation,[status(thm)],[c_64,c_103,c_104]) ).

tcf(c_255,plain,
    in(john,human),
    inference(superposition,[status(thm)],[c_59,c_60]) ).

tcf(c_285,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( has_parts(X0,times(X2,n5),fingers)
      | ~ has_parts(X0,X2,X1)
      | ~ in(object_in(X0,X1,fingers,X2,n5),hand) ),
    inference(superposition,[status(thm)],[c_61,c_58]) ).

tcf(c_287,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( has_parts(X0,times(X2,n1),hand)
      | ~ has_parts(X0,X2,X1)
      | ~ in(object_in(X0,X1,hand,X2,n1),arm) ),
    inference(superposition,[status(thm)],[c_63,c_58]) ).

tcf(c_312,plain,
    ! [X0: $i,X1: $i] :
      ( has_parts(X0,times(X1,n5),fingers)
      | ~ has_parts(X0,X1,hand) ),
    inference(superposition,[status(thm)],[c_57,c_285]) ).

tcf(c_320,plain,
    ! [X0: $i] :
      ( has_parts(X0,iPr_def_11,fingers)
      | ~ has_parts(X0,iPr_def_10,hand) ),
    inference(superposition,[status(thm)],[c_104,c_312]) ).

tcf(c_371,plain,
    ! [X0: $i,X1: $i] :
      ( has_parts(X0,times(X1,n1),hand)
      | ~ has_parts(X0,X1,arm) ),
    inference(superposition,[status(thm)],[c_57,c_287]) ).

tcf(c_379,plain,
    ! [X0: $i] :
      ( has_parts(X0,iPr_def_10,hand)
      | ~ has_parts(X0,n2,arm) ),
    inference(superposition,[status(thm)],[c_103,c_371]) ).

tcf(c_392,plain,
    ! [X0: $i] :
      ( has_parts(X0,iPr_def_10,hand)
      | ~ in(X0,human) ),
    inference(superposition,[status(thm)],[c_62,c_379]) ).

tcf(c_403,plain,
    ! [X0: $i] :
      ( has_parts(X0,iPr_def_11,fingers)
      | ~ in(X0,human) ),
    inference(superposition,[status(thm)],[c_392,c_320]) ).

tcf(c_417,plain,
    ~ in(john,human),
    inference(superposition,[status(thm)],[c_403,c_105]) ).

tcf(c_418,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_417,c_255]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.22  % Problem  : MSC004-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.24  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/5.57  % Computer : n016.cluster.edu
% 0.09/5.57  % Model    : x86_64 x86_64
% 0.09/5.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.57  % Memory   : 8046.5625MB
% 0.09/5.57  % OS       : Linux 6.8.0-71-generic
% 0.09/5.57  % CPULimit : 300
% 0.09/5.57  % WCLimit  : 300
% 0.09/5.57  % DateTime : Thu Sep 24 01:31:03 UTC 2026
% 0.09/5.57  % CPUTime  : 
% 0.09/5.57  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/5.61  Running first-order theorem proving
% 0.13/5.61  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.13/5.62  
% 0.13/5.62  % ======== iProver multi-core TPTP/SMT =========
% 0.13/5.62  
% 0.13/5.62  % Detected problem language: tptp
% 0.13/5.64  % Proving...
% 1.69/6.48  % SZS status Started for theBenchmark.p
% 1.69/6.48  % SZS status Unsatisfiable for theBenchmark.p
% 1.69/6.48  
% 1.69/6.48  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.69/6.48  
% 1.69/6.48  % ------  iProver source info
% 1.69/6.48  
% 1.69/6.48  % git: date: 2026-07-19 20:42:38 +0200
% 1.69/6.48  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.69/6.48  % git: non_committed_changes: false
% 1.69/6.48  
% 1.69/6.48  % ------ Parsing...% successful
% 1.69/6.48  
% 1.69/6.48  
% 1.69/6.48  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.69/6.48  
% 1.69/6.48  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 1.69/6.48  
% 1.69/6.48  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.69/6.48  
% 1.69/6.48  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.69/6.48  % ------ Proving...
% 1.69/6.48  % ------ Problem Properties 
% 1.69/6.48  
% 1.69/6.48  % 
% 1.69/6.48  % clauses                               10
% 1.69/6.48  % conjectures                           1
% 1.69/6.48  % EPR                                   6
% 1.69/6.48  % Horn                                  9
% 1.69/6.48  % unary                                 4
% 1.69/6.48  % binary                                4
% 1.69/6.48  % lits                                  18
% 1.69/6.48  % lits eq                               2
% 1.69/6.48  % fd_pure                               0
% 1.69/6.48  % fd_pseudo                             0
% 1.69/6.48  % fd_cond                               0
% 1.69/6.48  % fd_pseudo_cond                        0
% 1.69/6.48  % AC symbols                            0
% 1.69/6.48  
% 1.69/6.48  % ------ Schedule dynamic 5 is on 
% 1.69/6.48  
% 1.69/6.48  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.69/6.48  
% 1.69/6.48  
% 1.69/6.48  % ------ 
% 1.69/6.48  % Current options:
% 1.69/6.48  % ------ 
% 1.69/6.48  
% 1.69/6.48  
% 1.69/6.48  % 
% 1.69/6.48  
% 1.69/6.48  % ------ Proving...
% 1.69/6.48  % 
% 1.69/6.48  
% 1.69/6.48  % SZS status Unsatisfiable for theBenchmark.p
% 1.69/6.48  
% 1.69/6.48  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.69/6.48  
% 1.69/6.48  
%------------------------------------------------------------------------------