%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MSC003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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 : Wed Jul 27 13:06:17 EDT 2022
% Result : Unsatisfiable 1.64s 1.86s
% Output : Refutation 1.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 5 unt; 3 nHn; 9 RR)
% Number of literals : 21 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 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 : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( in(object_in(A,B,C,D,E),B)
| has_parts(A,times(D,E),C)
| ~ has_parts(A,D,B) ),
file('MSC003-1.p',unknown),
[] ).
cnf(2,axiom,
( has_parts(A,times(B,C),D)
| ~ has_parts(A,B,E)
| ~ has_parts(object_in(A,E,D,B,C),C,D) ),
file('MSC003-1.p',unknown),
[] ).
cnf(3,axiom,
( in(A,human)
| ~ in(A,boy) ),
file('MSC003-1.p',unknown),
[] ).
cnf(5,axiom,
( has_parts(A,n2,arm)
| ~ in(A,human) ),
file('MSC003-1.p',unknown),
[] ).
cnf(6,axiom,
( has_parts(A,n1,hand)
| ~ in(A,arm) ),
file('MSC003-1.p',unknown),
[] ).
cnf(7,axiom,
~ has_parts(john,times(n2,n1),hand),
file('MSC003-1.p',unknown),
[] ).
cnf(8,axiom,
in(john,boy),
file('MSC003-1.p',unknown),
[] ).
cnf(9,plain,
in(john,human),
inference(hyper,[status(thm)],[8,3]),
[iquote('hyper,8,3')] ).
cnf(10,plain,
has_parts(john,n2,arm),
inference(hyper,[status(thm)],[9,5]),
[iquote('hyper,9,5')] ).
cnf(11,plain,
( in(object_in(john,arm,A,n2,B),arm)
| has_parts(john,times(n2,B),A) ),
inference(hyper,[status(thm)],[10,1]),
[iquote('hyper,10,1')] ).
cnf(12,plain,
( has_parts(john,times(n2,A),B)
| has_parts(object_in(john,arm,B,n2,A),n1,hand) ),
inference(hyper,[status(thm)],[11,6]),
[iquote('hyper,11,6')] ).
cnf(15,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[12,2,10]),7,7]),
[iquote('hyper,12,2,10,unit_del,7,7')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : MSC003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 08:51:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.64/1.86 ----- Otter 3.3f, August 2004 -----
% 1.64/1.86 The process was started by sandbox on n010.cluster.edu,
% 1.64/1.86 Wed Jul 27 08:51:40 2022
% 1.64/1.86 The command was "./otter". The process ID is 18112.
% 1.64/1.86
% 1.64/1.86 set(prolog_style_variables).
% 1.64/1.86 set(auto).
% 1.64/1.86 dependent: set(auto1).
% 1.64/1.86 dependent: set(process_input).
% 1.64/1.86 dependent: clear(print_kept).
% 1.64/1.86 dependent: clear(print_new_demod).
% 1.64/1.86 dependent: clear(print_back_demod).
% 1.64/1.86 dependent: clear(print_back_sub).
% 1.64/1.86 dependent: set(control_memory).
% 1.64/1.86 dependent: assign(max_mem, 12000).
% 1.64/1.86 dependent: assign(pick_given_ratio, 4).
% 1.64/1.86 dependent: assign(stats_level, 1).
% 1.64/1.86 dependent: assign(max_seconds, 10800).
% 1.64/1.86 clear(print_given).
% 1.64/1.86
% 1.64/1.86 list(usable).
% 1.64/1.86 0 [] in(object_in(Big_part,Mid_part,Small_part,Number_of_mid_parts,Number_of_small_parts),Mid_part)|has_parts(Big_part,times(Number_of_mid_parts,Number_of_small_parts),Small_part)| -has_parts(Big_part,Number_of_mid_parts,Mid_part).
% 1.64/1.86 0 [] has_parts(Big_part,times(Number_of_mid_parts,Number_of_small_parts),Small_part)| -has_parts(Big_part,Number_of_mid_parts,Mid_part)| -has_parts(object_in(Big_part,Mid_part,Small_part,Number_of_mid_parts,Number_of_small_parts),Number_of_small_parts,Small_part).
% 1.64/1.86 0 [] in(john,boy).
% 1.64/1.86 0 [] in(X,human)| -in(X,boy).
% 1.64/1.86 0 [] has_parts(X,n5,fingers)| -in(X,hand).
% 1.64/1.86 0 [] has_parts(X,n2,arm)| -in(X,human).
% 1.64/1.86 0 [] has_parts(X,n1,hand)| -in(X,arm).
% 1.64/1.86 0 [] -has_parts(john,times(n2,n1),hand).
% 1.64/1.86 end_of_list.
% 1.64/1.86
% 1.64/1.86 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.64/1.86
% 1.64/1.86 This is a non-Horn set without equality. The strategy will
% 1.64/1.86 be ordered hyper_res, unit deletion, and factoring, with
% 1.64/1.86 satellites in sos and with nuclei in usable.
% 1.64/1.86
% 1.64/1.86 dependent: set(hyper_res).
% 1.64/1.86 dependent: set(factor).
% 1.64/1.86 dependent: set(unit_deletion).
% 1.64/1.86
% 1.64/1.86 ------------> process usable:
% 1.64/1.86 ** KEPT (pick-wt=18): 1 [] in(object_in(A,B,C,D,E),B)|has_parts(A,times(D,E),C)| -has_parts(A,D,B).
% 1.64/1.86 ** KEPT (pick-wt=19): 2 [] has_parts(A,times(B,C),D)| -has_parts(A,B,E)| -has_parts(object_in(A,E,D,B,C),C,D).
% 1.64/1.86 ** KEPT (pick-wt=6): 3 [] in(A,human)| -in(A,boy).
% 1.64/1.86 ** KEPT (pick-wt=7): 4 [] has_parts(A,n5,fingers)| -in(A,hand).
% 1.64/1.86 ** KEPT (pick-wt=7): 5 [] has_parts(A,n2,arm)| -in(A,human).
% 1.64/1.86 ** KEPT (pick-wt=7): 6 [] has_parts(A,n1,hand)| -in(A,arm).
% 1.64/1.86 ** KEPT (pick-wt=6): 7 [] -has_parts(john,times(n2,n1),hand).
% 1.64/1.86
% 1.64/1.86 ------------> process sos:
% 1.64/1.86 ** KEPT (pick-wt=3): 8 [] in(john,boy).
% 1.64/1.86
% 1.64/1.86 ======= end of input processing =======
% 1.64/1.86
% 1.64/1.86 =========== start of search ===========
% 1.64/1.86
% 1.64/1.86 -------- PROOF --------
% 1.64/1.86
% 1.64/1.86 -----> EMPTY CLAUSE at 0.00 sec ----> 15 [hyper,12,2,10,unit_del,7,7] $F.
% 1.64/1.86
% 1.64/1.86 Length of proof is 4. Level of proof is 4.
% 1.64/1.86
% 1.64/1.86 ---------------- PROOF ----------------
% 1.64/1.86 % SZS status Unsatisfiable
% 1.64/1.86 % SZS output start Refutation
% See solution above
% 1.64/1.86 ------------ end of proof -------------
% 1.64/1.86
% 1.64/1.86
% 1.64/1.86 Search stopped by max_proofs option.
% 1.64/1.86
% 1.64/1.86
% 1.64/1.86 Search stopped by max_proofs option.
% 1.64/1.86
% 1.64/1.86 ============ end of search ============
% 1.64/1.86
% 1.64/1.86 -------------- statistics -------------
% 1.64/1.86 clauses given 5
% 1.64/1.86 clauses generated 7
% 1.64/1.86 clauses kept 14
% 1.64/1.86 clauses forward subsumed 0
% 1.64/1.86 clauses back subsumed 0
% 1.64/1.86 Kbytes malloced 976
% 1.64/1.86
% 1.64/1.86 ----------- times (seconds) -----------
% 1.64/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.64/1.86 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.64/1.86
% 1.64/1.86 That finishes the proof of the theorem.
% 1.64/1.86
% 1.64/1.86 Process 18112 finished Wed Jul 27 08:51:41 2022
% 1.64/1.86 Otter interrupted
% 1.64/1.86 PROOF FOUND
%------------------------------------------------------------------------------