%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : MSC003-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 : n007.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 2.17s 1.30s
% Output : CNFRefutation 2.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 23 ( 9 unt; 1 def)
% Number of atoms : 46 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 40 ( 21 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 5 ( 3 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-5 aty)
% Number of variables : 33 ( 0 sgn 33 !; 0 ?; 20 :)
% 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(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(n2,n1),hand),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_john_has_2_hands) ).
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_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(n2,n1),hand),
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,negated_conjecture,
~ has_parts(john,iPr_def_10,hand),
inference(demodulation,[status(thm)],[c_64,c_103]) ).
tcf(c_250,plain,
in(john,human),
inference(superposition,[status(thm)],[c_59,c_60]) ).
tcf(c_282,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_358,plain,
! [X0: $i,X1: $i] :
( has_parts(X0,times(X1,n1),hand)
| ~ has_parts(X0,X1,arm) ),
inference(superposition,[status(thm)],[c_57,c_282]) ).
tcf(c_366,plain,
! [X0: $i] :
( has_parts(X0,iPr_def_10,hand)
| ~ has_parts(X0,n2,arm) ),
inference(superposition,[status(thm)],[c_103,c_358]) ).
tcf(c_379,plain,
! [X0: $i] :
( has_parts(X0,iPr_def_10,hand)
| ~ in(X0,human) ),
inference(superposition,[status(thm)],[c_62,c_366]) ).
tcf(c_388,plain,
~ in(john,human),
inference(superposition,[status(thm)],[c_379,c_104]) ).
tcf(c_389,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_388,c_250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.38 % Computer : n007.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 01:24:22 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 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.44
% 0.11/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.44
% 0.11/0.44 % Detected problem language: tptp
% 0.11/0.45 % Proving...
% 2.17/1.30 % SZS status Started for theBenchmark.p
% 2.17/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.30
% 2.17/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.17/1.30
% 2.17/1.30 % ------ iProver source info
% 2.17/1.30
% 2.17/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.17/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.17/1.30 % git: non_committed_changes: false
% 2.17/1.30
% 2.17/1.30 % ------ Parsing...% successful
% 2.17/1.30
% 2.17/1.30
% 2.17/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.17/1.30
% 2.17/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.17/1.30
% 2.17/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.17/1.30
% 2.17/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.17/1.30 % ------ Proving...
% 2.17/1.30 % ------ Problem Properties
% 2.17/1.30
% 2.17/1.30 %
% 2.17/1.30 % clauses 9
% 2.17/1.30 % conjectures 1
% 2.17/1.30 % EPR 6
% 2.17/1.30 % Horn 8
% 2.17/1.30 % unary 3
% 2.17/1.30 % binary 4
% 2.17/1.30 % lits 17
% 2.17/1.30 % lits eq 1
% 2.17/1.31 % fd_pure 0
% 2.17/1.31 % fd_pseudo 0
% 2.17/1.31 % fd_cond 0
% 2.17/1.31 % fd_pseudo_cond 0
% 2.17/1.31 % AC symbols 0
% 2.17/1.31
% 2.17/1.31 % ------ Schedule dynamic 5 is on
% 2.17/1.31
% 2.17/1.31 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.17/1.31
% 2.17/1.31
% 2.17/1.31 % ------
% 2.17/1.31 % Current options:
% 2.17/1.31 % ------
% 2.17/1.31
% 2.17/1.31
% 2.17/1.31 %
% 2.17/1.31
% 2.17/1.31 % ------ Proving...
% 2.17/1.31 %
% 2.17/1.31
% 2.17/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 2.17/1.31
% 2.17/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.17/1.31
% 2.17/1.31
%------------------------------------------------------------------------------