TSTP Solution File: PHI009+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:10:39 EDT 2022
% Result : Theorem 2.01s 2.22s
% Output : Refutation 2.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 7 unt; 9 nHn; 21 RR)
% Number of literals : 75 ( 6 equ; 46 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-4 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ property(A)
| ~ property(B)
| ~ object(C)
| is_the(C,A)
| ~ object(D)
| ~ exemplifies_property(A,D)
| object(dollar_f2(A,B,C,D))
| ~ exemplifies_property(B,D) ),
file('PHI009+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ property(A)
| ~ property(B)
| ~ object(C)
| is_the(C,A)
| ~ object(D)
| ~ exemplifies_property(A,D)
| exemplifies_property(A,dollar_f2(A,B,C,D))
| ~ exemplifies_property(B,D) ),
file('PHI009+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ property(A)
| ~ property(B)
| ~ object(C)
| is_the(C,A)
| ~ object(D)
| ~ exemplifies_property(A,D)
| dollar_f2(A,B,C,D) != D
| ~ exemplifies_property(B,D) ),
file('PHI009+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ object(A)
| ~ exemplifies_property(dollar_c2,A)
| A = dollar_c1 ),
file('PHI009+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ object(A)
| ~ is_the(A,dollar_c2) ),
file('PHI009+1.p',unknown),
[] ).
cnf(18,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ object(C)
| ~ exemplifies_property(A,C)
| object(dollar_f2(A,A,B,C)) ),
inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[5])]),
[iquote('factor,5.1.2,factor_simp')] ).
cnf(20,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ object(C)
| ~ exemplifies_property(A,C)
| exemplifies_property(A,dollar_f2(A,A,B,C)) ),
inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[6])]),
[iquote('factor,6.1.2,factor_simp')] ).
cnf(22,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ object(C)
| ~ exemplifies_property(A,C)
| dollar_f2(A,A,B,C) != C ),
inference(factor_simp,[status(thm)],[inference(factor,[status(thm)],[7])]),
[iquote('factor,7.1.2,factor_simp')] ).
cnf(27,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ exemplifies_property(A,B)
| object(dollar_f2(A,A,B,B)) ),
inference(factor,[status(thm)],[18]),
[iquote('factor,18.2.4')] ).
cnf(28,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ exemplifies_property(A,B)
| exemplifies_property(A,dollar_f2(A,A,B,B)) ),
inference(factor,[status(thm)],[20]),
[iquote('factor,20.2.4')] ).
cnf(29,plain,
( ~ property(A)
| ~ object(B)
| is_the(B,A)
| ~ exemplifies_property(A,B)
| dollar_f2(A,A,B,B) != B ),
inference(factor,[status(thm)],[22]),
[iquote('factor,22.2.4')] ).
cnf(31,axiom,
property(dollar_c2),
file('PHI009+1.p',unknown),
[] ).
cnf(32,axiom,
object(dollar_c1),
file('PHI009+1.p',unknown),
[] ).
cnf(33,axiom,
exemplifies_property(dollar_c2,dollar_c1),
file('PHI009+1.p',unknown),
[] ).
cnf(39,plain,
( is_the(dollar_c1,dollar_c2)
| exemplifies_property(dollar_c2,dollar_f2(dollar_c2,dollar_c2,dollar_c1,dollar_c1)) ),
inference(hyper,[status(thm)],[33,28,31,32]),
[iquote('hyper,33,28,31,32')] ).
cnf(40,plain,
( is_the(dollar_c1,dollar_c2)
| object(dollar_f2(dollar_c2,dollar_c2,dollar_c1,dollar_c1)) ),
inference(hyper,[status(thm)],[33,27,31,32]),
[iquote('hyper,33,27,31,32')] ).
cnf(140,plain,
exemplifies_property(dollar_c2,dollar_f2(dollar_c2,dollar_c2,dollar_c1,dollar_c1)),
inference(hyper,[status(thm)],[39,12,32]),
[iquote('hyper,39,12,32')] ).
cnf(145,plain,
( dollar_f2(dollar_c2,dollar_c2,dollar_c1,dollar_c1) = dollar_c1
| is_the(dollar_c1,dollar_c2) ),
inference(hyper,[status(thm)],[140,11,40]),
[iquote('hyper,140,11,40')] ).
cnf(208,plain,
dollar_f2(dollar_c2,dollar_c2,dollar_c1,dollar_c1) = dollar_c1,
inference(hyper,[status(thm)],[145,12,32]),
[iquote('hyper,145,12,32')] ).
cnf(211,plain,
is_the(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[208,29,31,32,33]),
[iquote('hyper,208,29,31,32,33')] ).
cnf(233,plain,
$false,
inference(hyper,[status(thm)],[211,12,32]),
[iquote('hyper,211,12,32')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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 02:29:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.11 ----- Otter 3.3f, August 2004 -----
% 1.92/2.11 The process was started by sandbox on n011.cluster.edu,
% 1.92/2.11 Wed Jul 27 02:29:55 2022
% 1.92/2.11 The command was "./otter". The process ID is 21946.
% 1.92/2.11
% 1.92/2.11 set(prolog_style_variables).
% 1.92/2.11 set(auto).
% 1.92/2.11 dependent: set(auto1).
% 1.92/2.11 dependent: set(process_input).
% 1.92/2.11 dependent: clear(print_kept).
% 1.92/2.11 dependent: clear(print_new_demod).
% 1.92/2.11 dependent: clear(print_back_demod).
% 1.92/2.11 dependent: clear(print_back_sub).
% 1.92/2.11 dependent: set(control_memory).
% 1.92/2.11 dependent: assign(max_mem, 12000).
% 1.92/2.11 dependent: assign(pick_given_ratio, 4).
% 1.92/2.11 dependent: assign(stats_level, 1).
% 1.92/2.11 dependent: assign(max_seconds, 10800).
% 1.92/2.11 clear(print_given).
% 1.92/2.11
% 1.92/2.11 formula_list(usable).
% 1.92/2.11 all A (A=A).
% 1.92/2.11 all F G X (property(F)&property(G)&object(X)-> (is_the(X,F)&exemplifies_property(G,X)<-> (exists Y (object(Y)&exemplifies_property(F,Y)& (all Z (object(Z)-> (exemplifies_property(F,Z)->Z=Y)))&exemplifies_property(G,Y))))).
% 1.92/2.11 -(all F (property(F)-> ((exists Y (object(Y)&exemplifies_property(F,Y)& (all Z (object(Z)-> (exemplifies_property(F,Z)->Z=Y)))))-> (exists U (object(U)&is_the(U,F)))))).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 -------> usable clausifies to:
% 1.92/2.11
% 1.92/2.11 list(usable).
% 1.92/2.11 0 [] A=A.
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|object($f1(F,G,X)).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|exemplifies_property(F,$f1(F,G,X)).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)| -object(Z)| -exemplifies_property(F,Z)|Z=$f1(F,G,X).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|exemplifies_property(G,$f1(F,G,X)).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|object($f2(F,G,X,Y))| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f2(F,G,X,Y))| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|$f2(F,G,X,Y)!=Y| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|exemplifies_property(G,X)| -object(Y)| -exemplifies_property(F,Y)|object($f2(F,G,X,Y))| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|exemplifies_property(G,X)| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f2(F,G,X,Y))| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] -property(F)| -property(G)| -object(X)|exemplifies_property(G,X)| -object(Y)| -exemplifies_property(F,Y)|$f2(F,G,X,Y)!=Y| -exemplifies_property(G,Y).
% 1.92/2.11 0 [] property($c2).
% 1.92/2.11 0 [] object($c1).
% 1.92/2.11 0 [] exemplifies_property($c2,$c1).
% 1.92/2.11 0 [] -object(Z)| -exemplifies_property($c2,Z)|Z=$c1.
% 1.92/2.11 0 [] -object(U)| -is_the(U,$c2).
% 1.92/2.11 end_of_list.
% 1.92/2.11
% 1.92/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.92/2.11
% 1.92/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.92/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.92/2.11 deletion, with positive clauses in sos and nonpositive
% 1.92/2.11 clauses in usable.
% 1.92/2.11
% 1.92/2.11 dependent: set(knuth_bendix).
% 1.92/2.11 dependent: set(anl_eq).
% 1.92/2.11 dependent: set(para_from).
% 1.92/2.11 dependent: set(para_into).
% 1.92/2.11 dependent: clear(para_from_right).
% 1.92/2.11 dependent: clear(para_into_right).
% 1.92/2.11 dependent: set(para_from_vars).
% 1.92/2.11 dependent: set(eq_units_both_ways).
% 1.92/2.11 dependent: set(dynamic_demod_all).
% 1.92/2.11 dependent: set(dynamic_demod).
% 1.92/2.11 dependent: set(order_eq).
% 1.92/2.11 dependent: set(back_demod).
% 1.92/2.11 dependent: set(lrpo).
% 1.92/2.11 dependent: set(hyper_res).
% 1.92/2.11 dependent: set(unit_deletion).
% 1.92/2.11 dependent: set(factor).
% 1.92/2.11
% 1.92/2.11 ------------> process usable:
% 1.92/2.11 ** KEPT (pick-wt=17): 1 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|object($f1(A,B,C)).
% 1.92/2.11 ** KEPT (pick-wt=18): 2 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|exemplifies_property(A,$f1(A,B,C)).
% 1.92/2.11 ** KEPT (pick-wt=23): 3 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)| -object(D)| -exemplifies_property(A,D)|D=$f1(A,B,C).
% 1.92/2.11 ** KEPT (pick-wt=18): 4 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|exemplifies_property(B,$f1(A,B,C)).
% 2.01/2.22 ** KEPT (pick-wt=23): 5 [] -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|object($f2(A,B,C,D))| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=24): 6 [] -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|exemplifies_property(A,$f2(A,B,C,D))| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=24): 7 [] -property(A)| -property(B)| -object(C)|is_the(C,A)| -object(D)| -exemplifies_property(A,D)|$f2(A,B,C,D)!=D| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=23): 8 [] -property(A)| -property(B)| -object(C)|exemplifies_property(B,C)| -object(D)| -exemplifies_property(A,D)|object($f2(A,B,C,D))| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=24): 9 [] -property(A)| -property(B)| -object(C)|exemplifies_property(B,C)| -object(D)| -exemplifies_property(A,D)|exemplifies_property(A,$f2(A,B,C,D))| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=24): 10 [] -property(A)| -property(B)| -object(C)|exemplifies_property(B,C)| -object(D)| -exemplifies_property(A,D)|$f2(A,B,C,D)!=D| -exemplifies_property(B,D).
% 2.01/2.22 ** KEPT (pick-wt=8): 11 [] -object(A)| -exemplifies_property($c2,A)|A=$c1.
% 2.01/2.22 ** KEPT (pick-wt=5): 12 [] -object(A)| -is_the(A,$c2).
% 2.01/2.22
% 2.01/2.22 ------------> process sos:
% 2.01/2.22 ** KEPT (pick-wt=3): 30 [] A=A.
% 2.01/2.22 ** KEPT (pick-wt=2): 31 [] property($c2).
% 2.01/2.22 ** KEPT (pick-wt=2): 32 [] object($c1).
% 2.01/2.22 ** KEPT (pick-wt=3): 33 [] exemplifies_property($c2,$c1).
% 2.01/2.22 Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] A=A.
% 2.01/2.22
% 2.01/2.22 ======= end of input processing =======
% 2.01/2.22
% 2.01/2.22 =========== start of search ===========
% 2.01/2.22
% 2.01/2.22 -------- PROOF --------
% 2.01/2.22
% 2.01/2.22 -----> EMPTY CLAUSE at 0.11 sec ----> 233 [hyper,211,12,32] $F.
% 2.01/2.22
% 2.01/2.22 Length of proof is 12. Level of proof is 7.
% 2.01/2.22
% 2.01/2.22 ---------------- PROOF ----------------
% 2.01/2.22 % SZS status Theorem
% 2.01/2.22 % SZS output start Refutation
% See solution above
% 2.01/2.22 ------------ end of proof -------------
% 2.01/2.22
% 2.01/2.22
% 2.01/2.22 Search stopped by max_proofs option.
% 2.01/2.22
% 2.01/2.22
% 2.01/2.22 Search stopped by max_proofs option.
% 2.01/2.22
% 2.01/2.22 ============ end of search ============
% 2.01/2.22
% 2.01/2.22 -------------- statistics -------------
% 2.01/2.22 clauses given 14
% 2.01/2.22 clauses generated 879
% 2.01/2.22 clauses kept 230
% 2.01/2.22 clauses forward subsumed 688
% 2.01/2.22 clauses back subsumed 39
% 2.01/2.22 Kbytes malloced 1953
% 2.01/2.22
% 2.01/2.22 ----------- times (seconds) -----------
% 2.01/2.22 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 2.01/2.22 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.01/2.22 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.01/2.22
% 2.01/2.22 That finishes the proof of the theorem.
% 2.01/2.22
% 2.01/2.22 Process 21946 finished Wed Jul 27 02:29:57 2022
% 2.01/2.22 Otter interrupted
% 2.01/2.22 PROOF FOUND
%------------------------------------------------------------------------------