%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : MSC003-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n009.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:04:16 AM UTC 2026
% Result : Unsatisfiable 0.10s 0.40s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 22 ( 10 unt; 0 def)
% Number of atoms : 38 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 17 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-5 aty)
% Number of variables : 29 ( 0 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(not_part_inheritance,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ has_parts(VAR_0,VAR_3,VAR_1)
| has_parts(VAR_0,times(VAR_3,VAR_4),VAR_2)
| in(object_in(VAR_0,VAR_1,VAR_2,VAR_3,VAR_4),VAR_1) ),
file('theBenchmark.p',not_part_inheritance) ).
cnf(c_1,plain,
( ~ has_parts(A,D,B)
| has_parts(A,times(D,E),C)
| in(object_in(A,B,C,D,E),B) ),
inference(clausify,[status(thm)],[not_part_inheritance]) ).
fof(part_inheritance,axiom,
! [VAR_0,VAR_1,VAR_2,VAR_3,VAR_4] :
( ~ has_parts(object_in(VAR_0,VAR_4,VAR_3,VAR_1,VAR_2),VAR_2,VAR_3)
| ~ has_parts(VAR_0,VAR_1,VAR_4)
| has_parts(VAR_0,times(VAR_1,VAR_2),VAR_3) ),
file('theBenchmark.p',part_inheritance) ).
cnf(c_2,plain,
( ~ has_parts(object_in(A,E,D,B,C),C,D)
| ~ has_parts(A,B,E)
| has_parts(A,times(B,C),D) ),
inference(clausify,[status(thm)],[part_inheritance]) ).
fof(john_is_a_boy,axiom,
in(john,boy),
file('theBenchmark.p',john_is_a_boy) ).
cnf(c_3,plain,
in(john,boy),
inference(clausify,[status(thm)],[john_is_a_boy]) ).
fof(in_boy_in_human,axiom,
! [VAR_0] :
( ~ in(VAR_0,boy)
| in(VAR_0,human) ),
file('theBenchmark.p',in_boy_in_human) ).
cnf(c_4,plain,
( ~ in(A,boy)
| in(A,human) ),
inference(clausify,[status(thm)],[in_boy_in_human]) ).
fof(humans_have_two_arms,axiom,
! [VAR_0] :
( ~ in(VAR_0,human)
| has_parts(VAR_0,n2,arm) ),
file('theBenchmark.p',humans_have_two_arms) ).
cnf(c_6,plain,
( ~ in(A,human)
| has_parts(A,n2,arm) ),
inference(clausify,[status(thm)],[humans_have_two_arms]) ).
fof(arms_have_one_hand,axiom,
! [VAR_0] :
( ~ in(VAR_0,arm)
| has_parts(VAR_0,n1,hand) ),
file('theBenchmark.p',arms_have_one_hand) ).
cnf(c_7,plain,
( ~ in(A,arm)
| has_parts(A,n1,hand) ),
inference(clausify,[status(thm)],[arms_have_one_hand]) ).
fof(prove_john_has_2_hands,axiom,
~ has_parts(john,times(n2,n1),hand),
file('theBenchmark.p',prove_john_has_2_hands) ).
cnf(c_8,plain,
~ has_parts(john,times(n2,n1),hand),
inference(clausify,[status(thm)],[prove_john_has_2_hands]) ).
cnf(c_9,plain,
in(john,human),
inference(resolve,[status(thm)],[c_4,c_3]) ).
cnf(c_10,plain,
has_parts(john,n2,arm),
inference(resolve,[status(thm)],[c_9,c_6]) ).
cnf(c_11,plain,
( has_parts(john,times(n2,B),A)
| in(object_in(john,arm,A,n2,B),arm) ),
inference(resolve,[status(thm)],[c_10,c_1]) ).
cnf(c_16,plain,
( ~ has_parts(object_in(john,A,hand,n2,n1),n1,hand)
| ~ has_parts(john,n2,A) ),
inference(resolve,[status(thm)],[c_2,c_8]) ).
cnf(c_12,plain,
~ has_parts(object_in(john,arm,hand,n2,n1),n1,hand),
inference(resolve,[status(thm)],[c_16,c_10]) ).
cnf(c_13,plain,
in(object_in(john,arm,hand,n2,n1),arm),
inference(resolve,[status(thm)],[c_11,c_8]) ).
cnf(c_17,plain,
has_parts(object_in(john,arm,hand,n2,n1),n1,hand),
inference(resolve,[status(thm)],[c_13,c_7]) ).
cnf(c_15,plain,
$false,
inference(resolve,[status(thm)],[c_12,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC003-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.38 % Computer : n009.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sat Sep 26 00:14:44 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.38 % Process 2903190 was started by sandbox2 on n009,
% 0.10/0.38 % Sat Sep 26 00:14:44 2026
% 0.10/0.38 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.10/0.39
% 0.10/0.39 % From the command line: assign(max_seconds, 300).
% 0.10/0.40
% 0.10/0.40 % SZS status Unsatisfiable for theBenchmark
% 0.10/0.40
% 0.10/0.40 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.40 % Length of proof is 13.
% 0.10/0.40 % Level of proof is 5.
% 0.10/0.40 % Maximum clause weight is 19.000.
% 0.10/0.40 % Given clauses 12.
% 0.10/0.40
% 0.10/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------