TSTP Solution File: MSC003-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : MSC003-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n027.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:20:50 EDT 2023
% Result : Unsatisfiable 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 20
% Syntax : Number of formulae : 32 ( 6 unt; 13 typ; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 35 ( 17 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 12 ( 4 >; 8 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-5 aty)
% Number of variables : 33 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
object_in: ( $i * $i * $i * $i * $i ) > $i ).
tff(decl_23,type,
in: ( $i * $i ) > $o ).
tff(decl_24,type,
times: ( $i * $i ) > $i ).
tff(decl_25,type,
has_parts: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
john: $i ).
tff(decl_27,type,
boy: $i ).
tff(decl_28,type,
human: $i ).
tff(decl_29,type,
n5: $i ).
tff(decl_30,type,
fingers: $i ).
tff(decl_31,type,
hand: $i ).
tff(decl_32,type,
n2: $i ).
tff(decl_33,type,
arm: $i ).
tff(decl_34,type,
n1: $i ).
cnf(arms_have_one_hand,hypothesis,
( has_parts(X1,n1,hand)
| ~ in(X1,arm) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arms_have_one_hand) ).
cnf(not_part_inheritance,axiom,
( in(object_in(X1,X2,X3,X4,X5),X2)
| has_parts(X1,times(X4,X5),X3)
| ~ has_parts(X1,X4,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_part_inheritance) ).
cnf(humans_have_two_arms,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,human) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',humans_have_two_arms) ).
cnf(in_boy_in_human,hypothesis,
( in(X1,human)
| ~ in(X1,boy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',in_boy_in_human) ).
cnf(part_inheritance,axiom,
( has_parts(X1,times(X2,X3),X4)
| ~ has_parts(X1,X2,X5)
| ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',part_inheritance) ).
cnf(john_is_a_boy,hypothesis,
in(john,boy),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',john_is_a_boy) ).
cnf(prove_john_has_2_hands,negated_conjecture,
~ has_parts(john,times(n2,n1),hand),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_john_has_2_hands) ).
cnf(c_0_7,hypothesis,
( has_parts(X1,n1,hand)
| ~ in(X1,arm) ),
arms_have_one_hand ).
cnf(c_0_8,axiom,
( in(object_in(X1,X2,X3,X4,X5),X2)
| has_parts(X1,times(X4,X5),X3)
| ~ has_parts(X1,X4,X2) ),
not_part_inheritance ).
cnf(c_0_9,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,human) ),
humans_have_two_arms ).
cnf(c_0_10,hypothesis,
( in(X1,human)
| ~ in(X1,boy) ),
in_boy_in_human ).
cnf(c_0_11,axiom,
( has_parts(X1,times(X2,X3),X4)
| ~ has_parts(X1,X2,X5)
| ~ has_parts(object_in(X1,X5,X4,X2,X3),X3,X4) ),
part_inheritance ).
cnf(c_0_12,hypothesis,
( has_parts(object_in(X1,arm,X2,X3,X4),n1,hand)
| has_parts(X1,times(X3,X4),X2)
| ~ has_parts(X1,X3,arm) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,hypothesis,
( has_parts(X1,n2,arm)
| ~ in(X1,boy) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,hypothesis,
in(john,boy),
john_is_a_boy ).
cnf(c_0_15,negated_conjecture,
~ has_parts(john,times(n2,n1),hand),
prove_john_has_2_hands ).
cnf(c_0_16,hypothesis,
( has_parts(X1,times(X2,n1),hand)
| ~ has_parts(X1,X2,arm) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,hypothesis,
has_parts(john,n2,arm),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MSC003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Aug 24 14:01:47 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.58 % Total time : 0.004000 s
% 0.20/0.58 % SZS output end Proof
% 0.20/0.58 % Total time : 0.006000 s
%------------------------------------------------------------------------------