TSTP Solution File: PUZ001+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:00 EDT 2022
% Result : Theorem 1.79s 1.97s
% Output : Refutation 1.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 13 unt; 5 nHn; 20 RR)
% Number of literals : 35 ( 12 equ; 14 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ lives(A)
| A = agatha
| A = butler
| A = charles ),
file('PUZ001+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ killed(A,B)
| hates(A,B) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ killed(A,B)
| ~ richer(A,B) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ hates(agatha,A)
| ~ hates(charles,A) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ hates(agatha,A)
| hates(butler,A) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(6,axiom,
~ hates(A,dollar_f1(A)),
file('PUZ001+1.p',unknown),
[] ).
cnf(7,axiom,
agatha != butler,
file('PUZ001+1.p',unknown),
[] ).
cnf(8,plain,
butler != agatha,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(9,axiom,
~ killed(agatha,agatha),
file('PUZ001+1.p',unknown),
[] ).
cnf(11,axiom,
lives(dollar_c1),
file('PUZ001+1.p',unknown),
[] ).
cnf(12,axiom,
killed(dollar_c1,agatha),
file('PUZ001+1.p',unknown),
[] ).
cnf(16,axiom,
( A = butler
| hates(agatha,A) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(17,axiom,
( richer(A,agatha)
| hates(butler,A) ),
file('PUZ001+1.p',unknown),
[] ).
cnf(19,plain,
hates(dollar_c1,agatha),
inference(hyper,[status(thm)],[12,2]),
[iquote('hyper,12,2')] ).
cnf(22,plain,
( butler = dollar_c1
| charles = dollar_c1 ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[12,1]),9,11])])]),
[iquote('para_into,12.1.1,1.2.1,unit_del,9,11,flip.1,flip.2')] ).
cnf(27,plain,
( A = butler
| hates(butler,A) ),
inference(hyper,[status(thm)],[16,5]),
[iquote('hyper,16,5')] ).
cnf(40,plain,
hates(butler,dollar_c1),
inference(hyper,[status(thm)],[17,3,12]),
[iquote('hyper,17,3,12')] ).
cnf(52,plain,
dollar_f1(butler) = butler,
inference(hyper,[status(thm)],[27,6]),
[iquote('hyper,27,6')] ).
cnf(66,plain,
~ hates(butler,butler),
inference(para_from,[status(thm),theory(equality)],[52,6]),
[iquote('para_from,52.1.1,6.1.2')] ).
cnf(87,plain,
charles = dollar_c1,
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[66,22]),40]),
[iquote('para_into,66.1.2,22.1.1,unit_del,40')] ).
cnf(92,plain,
( ~ hates(agatha,A)
| ~ hates(dollar_c1,A) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[4]),87]),
[iquote('back_demod,4,demod,87')] ).
cnf(104,plain,
butler = agatha,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[92,16,19])]),
[iquote('hyper,92,16,19,flip.1')] ).
cnf(106,plain,
$false,
inference(binary,[status(thm)],[104,8]),
[iquote('binary,104.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PUZ001+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 01:43:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.79/1.97 ----- Otter 3.3f, August 2004 -----
% 1.79/1.97 The process was started by sandbox2 on n021.cluster.edu,
% 1.79/1.97 Wed Jul 27 01:43:53 2022
% 1.79/1.97 The command was "./otter". The process ID is 32122.
% 1.79/1.97
% 1.79/1.97 set(prolog_style_variables).
% 1.79/1.97 set(auto).
% 1.79/1.97 dependent: set(auto1).
% 1.79/1.97 dependent: set(process_input).
% 1.79/1.97 dependent: clear(print_kept).
% 1.79/1.97 dependent: clear(print_new_demod).
% 1.79/1.97 dependent: clear(print_back_demod).
% 1.79/1.97 dependent: clear(print_back_sub).
% 1.79/1.97 dependent: set(control_memory).
% 1.79/1.97 dependent: assign(max_mem, 12000).
% 1.79/1.97 dependent: assign(pick_given_ratio, 4).
% 1.79/1.97 dependent: assign(stats_level, 1).
% 1.79/1.97 dependent: assign(max_seconds, 10800).
% 1.79/1.97 clear(print_given).
% 1.79/1.97
% 1.79/1.97 formula_list(usable).
% 1.79/1.97 all A (A=A).
% 1.79/1.97 exists X (lives(X)&killed(X,agatha)).
% 1.79/1.97 lives(agatha).
% 1.79/1.97 lives(butler).
% 1.79/1.97 lives(charles).
% 1.79/1.97 all X (lives(X)->X=agatha|X=butler|X=charles).
% 1.79/1.97 all X Y (killed(X,Y)->hates(X,Y)).
% 1.79/1.97 all X Y (killed(X,Y)-> -richer(X,Y)).
% 1.79/1.97 all X (hates(agatha,X)-> -hates(charles,X)).
% 1.79/1.97 all X (X!=butler->hates(agatha,X)).
% 1.79/1.97 all X (-richer(X,agatha)->hates(butler,X)).
% 1.79/1.97 all X (hates(agatha,X)->hates(butler,X)).
% 1.79/1.97 all X exists Y (-hates(X,Y)).
% 1.79/1.97 agatha!=butler.
% 1.79/1.97 -killed(agatha,agatha).
% 1.79/1.97 end_of_list.
% 1.79/1.97
% 1.79/1.97 -------> usable clausifies to:
% 1.79/1.97
% 1.79/1.97 list(usable).
% 1.79/1.97 0 [] A=A.
% 1.79/1.97 0 [] lives($c1).
% 1.79/1.97 0 [] killed($c1,agatha).
% 1.79/1.97 0 [] lives(agatha).
% 1.79/1.97 0 [] lives(butler).
% 1.79/1.97 0 [] lives(charles).
% 1.79/1.97 0 [] -lives(X)|X=agatha|X=butler|X=charles.
% 1.79/1.97 0 [] -killed(X,Y)|hates(X,Y).
% 1.79/1.97 0 [] -killed(X,Y)| -richer(X,Y).
% 1.79/1.97 0 [] -hates(agatha,X)| -hates(charles,X).
% 1.79/1.97 0 [] X=butler|hates(agatha,X).
% 1.79/1.97 0 [] richer(X,agatha)|hates(butler,X).
% 1.79/1.97 0 [] -hates(agatha,X)|hates(butler,X).
% 1.79/1.97 0 [] -hates(X,$f1(X)).
% 1.79/1.97 0 [] agatha!=butler.
% 1.79/1.97 0 [] -killed(agatha,agatha).
% 1.79/1.97 end_of_list.
% 1.79/1.97
% 1.79/1.97 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.79/1.97
% 1.79/1.97 This ia a non-Horn set with equality. The strategy will be
% 1.79/1.97 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.79/1.97 deletion, with positive clauses in sos and nonpositive
% 1.79/1.97 clauses in usable.
% 1.79/1.97
% 1.79/1.97 dependent: set(knuth_bendix).
% 1.79/1.97 dependent: set(anl_eq).
% 1.79/1.97 dependent: set(para_from).
% 1.79/1.97 dependent: set(para_into).
% 1.79/1.97 dependent: clear(para_from_right).
% 1.79/1.97 dependent: clear(para_into_right).
% 1.79/1.97 dependent: set(para_from_vars).
% 1.79/1.97 dependent: set(eq_units_both_ways).
% 1.79/1.97 dependent: set(dynamic_demod_all).
% 1.79/1.97 dependent: set(dynamic_demod).
% 1.79/1.97 dependent: set(order_eq).
% 1.79/1.97 dependent: set(back_demod).
% 1.79/1.97 dependent: set(lrpo).
% 1.79/1.97 dependent: set(hyper_res).
% 1.79/1.97 dependent: set(unit_deletion).
% 1.79/1.97 dependent: set(factor).
% 1.79/1.97
% 1.79/1.97 ------------> process usable:
% 1.79/1.97 ** KEPT (pick-wt=11): 1 [] -lives(A)|A=agatha|A=butler|A=charles.
% 1.79/1.97 ** KEPT (pick-wt=6): 2 [] -killed(A,B)|hates(A,B).
% 1.79/1.97 ** KEPT (pick-wt=6): 3 [] -killed(A,B)| -richer(A,B).
% 1.79/1.97 ** KEPT (pick-wt=6): 4 [] -hates(agatha,A)| -hates(charles,A).
% 1.79/1.97 ** KEPT (pick-wt=6): 5 [] -hates(agatha,A)|hates(butler,A).
% 1.79/1.97 ** KEPT (pick-wt=4): 6 [] -hates(A,$f1(A)).
% 1.79/1.97 ** KEPT (pick-wt=3): 8 [copy,7,flip.1] butler!=agatha.
% 1.79/1.97 ** KEPT (pick-wt=3): 9 [] -killed(agatha,agatha).
% 1.79/1.97
% 1.79/1.97 ------------> process sos:
% 1.79/1.97 ** KEPT (pick-wt=3): 10 [] A=A.
% 1.79/1.97 ** KEPT (pick-wt=2): 11 [] lives($c1).
% 1.79/1.97 ** KEPT (pick-wt=3): 12 [] killed($c1,agatha).
% 1.79/1.97 ** KEPT (pick-wt=2): 13 [] lives(agatha).
% 1.79/1.97 ** KEPT (pick-wt=2): 14 [] lives(butler).
% 1.79/1.97 ** KEPT (pick-wt=2): 15 [] lives(charles).
% 1.79/1.97 ** KEPT (pick-wt=6): 16 [] A=butler|hates(agatha,A).
% 1.79/1.97 ** KEPT (pick-wt=6): 17 [] richer(A,agatha)|hates(butler,A).
% 1.79/1.97 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] A=A.
% 1.79/1.97
% 1.79/1.97 ======= end of input processing =======
% 1.79/1.97
% 1.79/1.97 =========== start of search ===========
% 1.79/1.97
% 1.79/1.97 -------- PROOF --------
% 1.79/1.97
% 1.79/1.97 ----> UNIT CONFLICT at 0.00 sec ----> 106 [binary,104.1,8.1] $F.
% 1.79/1.97
% 1.79/1.97 Length of proof is 10. Level of proof is 6.
% 1.79/1.97
% 1.79/1.97 ---------------- PROOF ----------------
% 1.79/1.97 % SZS status Theorem
% 1.79/1.97 % SZS output start Refutation
% See solution above
% 1.79/1.97 ------------ end of proof -------------
% 1.79/1.97
% 1.79/1.97
% 1.79/1.97 Search stopped by max_proofs option.
% 1.79/1.97
% 1.79/1.97
% 1.79/1.97 Search stopped by max_proofs option.
% 1.79/1.97
% 1.79/1.97 ============ end of search ============
% 1.79/1.97
% 1.79/1.97 -------------- statistics -------------
% 1.79/1.97 clauses given 32
% 1.79/1.97 clauses generated 335
% 1.79/1.97 clauses kept 100
% 1.79/1.97 clauses forward subsumed 281
% 1.79/1.97 clauses back subsumed 22
% 1.79/1.97 Kbytes malloced 976
% 1.79/1.97
% 1.79/1.97 ----------- times (seconds) -----------
% 1.79/1.97 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/1.97 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.79/1.97 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.79/1.97
% 1.79/1.97 That finishes the proof of the theorem.
% 1.79/1.97
% 1.79/1.97 Process 32122 finished Wed Jul 27 01:43:54 2022
% 1.79/1.97 Otter interrupted
% 1.79/1.97 PROOF FOUND
%------------------------------------------------------------------------------