TSTP Solution File: PUZ130+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:11:39 EDT 2022
% Result : Theorem 1.62s 1.84s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of clauses : 17 ( 13 unt; 0 nHn; 17 RR)
% Number of literals : 25 ( 3 equ; 9 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ dog(A)
| pet(A) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ cat(A)
| pet(A) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ cat(A)
| ~ dog(B)
| ~ chased(B,A)
| hates(owner_of(A),owner_of(B)) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ human(A)
| ~ pet(B)
| ~ owner(A,B)
| A = owner_of(B) ),
file('PUZ130+1.p',unknown),
[] ).
cnf(11,axiom,
~ hates(jon,jon),
file('PUZ130+1.p',unknown),
[] ).
cnf(14,axiom,
cat(garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(16,axiom,
dog(odie),
file('PUZ130+1.p',unknown),
[] ).
cnf(19,axiom,
human(jon),
file('PUZ130+1.p',unknown),
[] ).
cnf(20,axiom,
owner(jon,odie),
file('PUZ130+1.p',unknown),
[] ).
cnf(21,axiom,
owner(jon,garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(24,axiom,
chased(odie,garfield),
file('PUZ130+1.p',unknown),
[] ).
cnf(28,plain,
pet(garfield),
inference(hyper,[status(thm)],[14,2]),
[iquote('hyper,14,2')] ).
cnf(34,plain,
pet(odie),
inference(hyper,[status(thm)],[16,1]),
[iquote('hyper,16,1')] ).
cnf(62,plain,
owner_of(odie) = jon,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[34,9,19,20])]),
[iquote('hyper,34,9,19,20,flip.1')] ).
cnf(67,plain,
owner_of(garfield) = jon,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[21,9,19,28])]),
[iquote('hyper,21,9,19,28,flip.1')] ).
cnf(72,plain,
hates(jon,jon),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[24,8,14,16]),67,62]),
[iquote('hyper,24,8,14,16,demod,67,62')] ).
cnf(73,plain,
$false,
inference(binary,[status(thm)],[72,11]),
[iquote('binary,72.1,11.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ130+1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n019.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 : Wed Jul 27 01:51:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.62/1.83 ----- Otter 3.3f, August 2004 -----
% 1.62/1.83 The process was started by sandbox2 on n019.cluster.edu,
% 1.62/1.83 Wed Jul 27 01:51:07 2022
% 1.62/1.83 The command was "./otter". The process ID is 21034.
% 1.62/1.83
% 1.62/1.83 set(prolog_style_variables).
% 1.62/1.83 set(auto).
% 1.62/1.83 dependent: set(auto1).
% 1.62/1.83 dependent: set(process_input).
% 1.62/1.83 dependent: clear(print_kept).
% 1.62/1.83 dependent: clear(print_new_demod).
% 1.62/1.83 dependent: clear(print_back_demod).
% 1.62/1.83 dependent: clear(print_back_sub).
% 1.62/1.83 dependent: set(control_memory).
% 1.62/1.83 dependent: assign(max_mem, 12000).
% 1.62/1.83 dependent: assign(pick_given_ratio, 4).
% 1.62/1.83 dependent: assign(stats_level, 1).
% 1.62/1.83 dependent: assign(max_seconds, 10800).
% 1.62/1.83 clear(print_given).
% 1.62/1.83
% 1.62/1.83 formula_list(usable).
% 1.62/1.83 all A (A=A).
% 1.62/1.83 exists A cat(A).
% 1.62/1.83 cat(garfield).
% 1.62/1.83 exists A dog(A).
% 1.62/1.83 dog(odie).
% 1.62/1.83 exists A pet(A).
% 1.62/1.83 all A (dog(A)->pet(A)).
% 1.62/1.83 all A (cat(A)->pet(A)).
% 1.62/1.83 exists A human(A).
% 1.62/1.83 human(jon).
% 1.62/1.83 all A (pet(A)->human(owner_of(A))).
% 1.62/1.83 all X (pet(X)-> (exists Y (human(Y)&owner(X,Y)))).
% 1.62/1.83 owner(jon,odie).
% 1.62/1.83 owner(jon,garfield).
% 1.62/1.83 all X ((all X (cat(X)->owner(jon,X)))->X=garfield).
% 1.62/1.83 all X ((all X (dog(X)->owner(jon,X)))->X=odie).
% 1.62/1.83 all X Y (cat(X)&dog(Y)-> (chased(Y,X)->hates(owner_of(X),owner_of(Y)))).
% 1.62/1.83 all X Y (human(X)&pet(Y)-> (owner(X,Y)<->X=owner_of(Y))).
% 1.62/1.83 chased(odie,garfield).
% 1.62/1.83 -hates(jon,jon).
% 1.62/1.83 end_of_list.
% 1.62/1.83
% 1.62/1.83 -------> usable clausifies to:
% 1.62/1.83
% 1.62/1.83 list(usable).
% 1.62/1.83 0 [] A=A.
% 1.62/1.83 0 [] cat($c1).
% 1.62/1.83 0 [] cat(garfield).
% 1.62/1.83 0 [] dog($c2).
% 1.62/1.83 0 [] dog(odie).
% 1.62/1.83 0 [] pet($c3).
% 1.62/1.83 0 [] -dog(A)|pet(A).
% 1.62/1.83 0 [] -cat(A)|pet(A).
% 1.62/1.83 0 [] human($c4).
% 1.62/1.83 0 [] human(jon).
% 1.62/1.83 0 [] -pet(A)|human(owner_of(A)).
% 1.62/1.83 0 [] -pet(X)|human($f1(X)).
% 1.62/1.83 0 [] -pet(X)|owner(X,$f1(X)).
% 1.62/1.83 0 [] owner(jon,odie).
% 1.62/1.83 0 [] owner(jon,garfield).
% 1.62/1.83 0 [] cat($f2(X))|X=garfield.
% 1.62/1.83 0 [] -owner(jon,$f2(X))|X=garfield.
% 1.62/1.83 0 [] dog($f3(X))|X=odie.
% 1.62/1.83 0 [] -owner(jon,$f3(X))|X=odie.
% 1.62/1.83 0 [] -cat(X)| -dog(Y)| -chased(Y,X)|hates(owner_of(X),owner_of(Y)).
% 1.62/1.83 0 [] -human(X)| -pet(Y)| -owner(X,Y)|X=owner_of(Y).
% 1.62/1.83 0 [] -human(X)| -pet(Y)|owner(X,Y)|X!=owner_of(Y).
% 1.62/1.83 0 [] chased(odie,garfield).
% 1.62/1.83 0 [] -hates(jon,jon).
% 1.62/1.83 end_of_list.
% 1.62/1.83
% 1.62/1.83 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.62/1.83
% 1.62/1.83 This ia a non-Horn set with equality. The strategy will be
% 1.62/1.84 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.62/1.84 deletion, with positive clauses in sos and nonpositive
% 1.62/1.84 clauses in usable.
% 1.62/1.84
% 1.62/1.84 dependent: set(knuth_bendix).
% 1.62/1.84 dependent: set(anl_eq).
% 1.62/1.84 dependent: set(para_from).
% 1.62/1.84 dependent: set(para_into).
% 1.62/1.84 dependent: clear(para_from_right).
% 1.62/1.84 dependent: clear(para_into_right).
% 1.62/1.84 dependent: set(para_from_vars).
% 1.62/1.84 dependent: set(eq_units_both_ways).
% 1.62/1.84 dependent: set(dynamic_demod_all).
% 1.62/1.84 dependent: set(dynamic_demod).
% 1.62/1.84 dependent: set(order_eq).
% 1.62/1.84 dependent: set(back_demod).
% 1.62/1.84 dependent: set(lrpo).
% 1.62/1.84 dependent: set(hyper_res).
% 1.62/1.84 dependent: set(unit_deletion).
% 1.62/1.84 dependent: set(factor).
% 1.62/1.84
% 1.62/1.84 ------------> process usable:
% 1.62/1.84 ** KEPT (pick-wt=4): 1 [] -dog(A)|pet(A).
% 1.62/1.84 ** KEPT (pick-wt=4): 2 [] -cat(A)|pet(A).
% 1.62/1.84 ** KEPT (pick-wt=5): 3 [] -pet(A)|human(owner_of(A)).
% 1.62/1.84 ** KEPT (pick-wt=5): 4 [] -pet(A)|human($f1(A)).
% 1.62/1.84 ** KEPT (pick-wt=6): 5 [] -pet(A)|owner(A,$f1(A)).
% 1.62/1.84 ** KEPT (pick-wt=7): 6 [] -owner(jon,$f2(A))|A=garfield.
% 1.62/1.84 ** KEPT (pick-wt=7): 7 [] -owner(jon,$f3(A))|A=odie.
% 1.62/1.84 ** KEPT (pick-wt=12): 8 [] -cat(A)| -dog(B)| -chased(B,A)|hates(owner_of(A),owner_of(B)).
% 1.62/1.84 ** KEPT (pick-wt=11): 9 [] -human(A)| -pet(B)| -owner(A,B)|A=owner_of(B).
% 1.62/1.84 ** KEPT (pick-wt=11): 10 [] -human(A)| -pet(B)|owner(A,B)|A!=owner_of(B).
% 1.62/1.84 ** KEPT (pick-wt=3): 11 [] -hates(jon,jon).
% 1.62/1.84
% 1.62/1.84 ------------> process sos:
% 1.62/1.84 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.62/1.84 ** KEPT (pick-wt=2): 13 [] cat($c1).
% 1.62/1.84 ** KEPT (pick-wt=2): 14 [] cat(garfield).
% 1.62/1.84 ** KEPT (pick-wt=2): 15 [] dog($c2).
% 1.62/1.84 ** KEPT (pick-wt=2): 16 [] dog(odie).
% 1.62/1.84 ** KEPT (pick-wt=2): 17 [] pet($c3).
% 1.62/1.84 ** KEPT (pick-wt=2): 18 [] human($c4).
% 1.62/1.84 ** KEPT (pick-wt=2): 19 [] human(jon).
% 1.62/1.84 ** KEPT (pick-wt=3): 20 [] owner(jon,odie).
% 1.62/1.84 ** KEPT (pick-wt=3): 21 [] owner(jon,garfield).
% 1.62/1.84 ** KEPT (pick-wt=6): 22 [] cat($f2(A))|A=garfield.
% 1.62/1.84 ** KEPT (pick-wt=6): 23 [] dog($f3(A))|A=odie.
% 1.62/1.84 ** KEPT (pick-wt=3): 24 [] chased(odie,garfield).
% 1.62/1.84 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.62/1.84
% 1.62/1.84 ======= end of input processing =======
% 1.62/1.84
% 1.62/1.84 =========== start of search ===========
% 1.62/1.84
% 1.62/1.84 -------- PROOF --------
% 1.62/1.84
% 1.62/1.84 ----> UNIT CONFLICT at 0.00 sec ----> 73 [binary,72.1,11.1] $F.
% 1.62/1.84
% 1.62/1.84 Length of proof is 5. Level of proof is 3.
% 1.62/1.84
% 1.62/1.84 ---------------- PROOF ----------------
% 1.62/1.84 % SZS status Theorem
% 1.62/1.84 % SZS output start Refutation
% See solution above
% 1.62/1.84 ------------ end of proof -------------
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84
% 1.62/1.84 Search stopped by max_proofs option.
% 1.62/1.84
% 1.62/1.84 ============ end of search ============
% 1.62/1.84
% 1.62/1.84 -------------- statistics -------------
% 1.62/1.84 clauses given 15
% 1.62/1.84 clauses generated 67
% 1.62/1.84 clauses kept 70
% 1.62/1.84 clauses forward subsumed 23
% 1.62/1.84 clauses back subsumed 0
% 1.62/1.84 Kbytes malloced 976
% 1.62/1.84
% 1.62/1.84 ----------- times (seconds) -----------
% 1.62/1.84 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.84 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.62/1.84
% 1.62/1.84 That finishes the proof of the theorem.
% 1.62/1.84
% 1.62/1.84 Process 21034 finished Wed Jul 27 01:51:08 2022
% 1.62/1.84 Otter interrupted
% 1.62/1.84 PROOF FOUND
%------------------------------------------------------------------------------