TSTP Solution File: PHI013+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI013+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:40 EDT 2022
% Result : Theorem 1.81s 1.98s
% Output : Refutation 1.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 27 ( 16 unt; 3 nHn; 27 RR)
% Number of literals : 58 ( 5 equ; 30 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-1 aty)
% Number of variables : 18 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( ~ property(A)
| ~ object(B)
| ~ is_the(B,A)
| ~ object(C)
| ~ is_the(C,A)
| exemplifies_property(A,C) ),
file('PHI013+1.p',unknown),
[] ).
cnf(8,plain,
( ~ property(A)
| ~ object(B)
| ~ is_the(B,A)
| exemplifies_property(A,B) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[7])])]),
[iquote('copy,7,factor_simp,factor_simp')] ).
cnf(9,axiom,
( ~ is_the(A,B)
| property(B) ),
file('PHI013+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ is_the(A,B)
| object(A) ),
file('PHI013+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| ~ object(B)
| ~ exemplifies_relation(greater_than,B,A)
| ~ exemplifies_property(conceivable,B) ),
file('PHI013+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| ~ object(B)
| ~ exemplifies_property(none_greater,B)
| B = dollar_c2 ),
file('PHI013+1.p',unknown),
[] ).
cnf(19,plain,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| A = dollar_c2 ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(copy,[status(thm)],[18])])]),
[iquote('copy,18,factor_simp,factor_simp')] ).
cnf(20,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| object(dollar_f4(A)) ),
file('PHI013+1.p',unknown),
[] ).
cnf(21,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_relation(greater_than,dollar_f4(A),A) ),
file('PHI013+1.p',unknown),
[] ).
cnf(22,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_property(conceivable,dollar_f4(A)) ),
file('PHI013+1.p',unknown),
[] ).
cnf(23,axiom,
~ exemplifies_property(existence,god),
file('PHI013+1.p',unknown),
[] ).
cnf(26,axiom,
object(dollar_c1),
file('PHI013+1.p',unknown),
[] ).
cnf(27,axiom,
exemplifies_property(none_greater,dollar_c1),
file('PHI013+1.p',unknown),
[] ).
cnf(28,axiom,
is_the(god,none_greater),
file('PHI013+1.p',unknown),
[] ).
cnf(31,plain,
dollar_c2 = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[27,19,26])]),
[iquote('hyper,27,19,26,flip.1')] ).
cnf(33,plain,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| A = dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),31]),
[iquote('back_demod,19,demod,31')] ).
cnf(34,plain,
object(god),
inference(hyper,[status(thm)],[28,10]),
[iquote('hyper,28,10')] ).
cnf(35,plain,
property(none_greater),
inference(hyper,[status(thm)],[28,9]),
[iquote('hyper,28,9')] ).
cnf(36,plain,
exemplifies_property(conceivable,dollar_f4(god)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[34,22,28]),23]),
[iquote('hyper,34,22,28,unit_del,23')] ).
cnf(37,plain,
exemplifies_relation(greater_than,dollar_f4(god),god),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[34,21,28]),23]),
[iquote('hyper,34,21,28,unit_del,23')] ).
cnf(38,plain,
object(dollar_f4(god)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[34,20,28]),23]),
[iquote('hyper,34,20,28,unit_del,23')] ).
cnf(39,plain,
exemplifies_property(none_greater,god),
inference(hyper,[status(thm)],[35,8,34,28]),
[iquote('hyper,35,8,34,28')] ).
cnf(45,plain,
object(dollar_f4(dollar_c1)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[33,38]),34,39]),
[iquote('para_from,33.3.1,38.1.1.1,unit_del,34,39')] ).
cnf(109,plain,
god = dollar_c1,
inference(hyper,[status(thm)],[39,33,34]),
[iquote('hyper,39,33,34')] ).
cnf(112,plain,
exemplifies_relation(greater_than,dollar_f4(dollar_c1),dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[37]),109,109]),
[iquote('back_demod,37,demod,109,109')] ).
cnf(113,plain,
exemplifies_property(conceivable,dollar_f4(dollar_c1)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[36]),109]),
[iquote('back_demod,36,demod,109')] ).
cnf(122,plain,
$false,
inference(hyper,[status(thm)],[112,12,26,27,45,113]),
[iquote('hyper,112,12,26,27,45,113')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PHI013+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n016.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 02:55:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.78/1.97 ----- Otter 3.3f, August 2004 -----
% 1.78/1.97 The process was started by sandbox on n016.cluster.edu,
% 1.78/1.97 Wed Jul 27 02:55:37 2022
% 1.78/1.97 The command was "./otter". The process ID is 31032.
% 1.78/1.97
% 1.78/1.97 set(prolog_style_variables).
% 1.78/1.97 set(auto).
% 1.78/1.97 dependent: set(auto1).
% 1.78/1.97 dependent: set(process_input).
% 1.78/1.97 dependent: clear(print_kept).
% 1.78/1.97 dependent: clear(print_new_demod).
% 1.78/1.97 dependent: clear(print_back_demod).
% 1.78/1.97 dependent: clear(print_back_sub).
% 1.78/1.97 dependent: set(control_memory).
% 1.78/1.97 dependent: assign(max_mem, 12000).
% 1.78/1.97 dependent: assign(pick_given_ratio, 4).
% 1.78/1.97 dependent: assign(stats_level, 1).
% 1.78/1.97 dependent: assign(max_seconds, 10800).
% 1.78/1.97 clear(print_given).
% 1.78/1.97
% 1.78/1.97 formula_list(usable).
% 1.78/1.97 all A (A=A).
% 1.78/1.97 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.78/1.97 all F (property(F)-> ((exists Y (object(Y)&is_the(Y,F)))-> (all Z (object(Z)-> (is_the(Z,F)->exemplifies_property(F,Z)))))).
% 1.78/1.97 all X F (is_the(X,F)->property(F)&object(X)).
% 1.78/1.97 all X (object(X)-> (exemplifies_property(none_greater,X)<->exemplifies_property(conceivable,X)& -(exists Y (object(Y)&exemplifies_relation(greater_than,Y,X)&exemplifies_property(conceivable,Y))))).
% 1.78/1.97 exists X (object(X)&exemplifies_property(none_greater,X)).
% 1.78/1.97 (exists X (object(X)&exemplifies_property(none_greater,X)))-> (exists X (object(X)&exemplifies_property(none_greater,X)& (all Y (object(Y)-> (exemplifies_property(none_greater,Y)->Y=X))))).
% 1.78/1.97 all X (object(X)-> (is_the(X,none_greater)& -exemplifies_property(existence,X)-> (exists Y (object(Y)&exemplifies_relation(greater_than,Y,X)&exemplifies_property(conceivable,Y))))).
% 1.78/1.97 is_the(god,none_greater).
% 1.78/1.97 -exemplifies_property(existence,god).
% 1.78/1.97 end_of_list.
% 1.78/1.97
% 1.78/1.97 -------> usable clausifies to:
% 1.78/1.97
% 1.78/1.97 list(usable).
% 1.78/1.97 0 [] A=A.
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|object($f1(F,Y))|object($f2(F)).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|object($f1(F,Y))|is_the($f2(F),F).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f1(F,Y))|object($f2(F)).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f1(F,Y))|is_the($f2(F),F).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|$f1(F,Y)!=Y|object($f2(F)).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -exemplifies_property(F,Y)|$f1(F,Y)!=Y|is_the($f2(F),F).
% 1.78/1.97 0 [] -property(F)| -object(Y)| -is_the(Y,F)| -object(Z)| -is_the(Z,F)|exemplifies_property(F,Z).
% 1.78/1.97 0 [] -is_the(X,F)|property(F).
% 1.78/1.97 0 [] -is_the(X,F)|object(X).
% 1.78/1.97 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(conceivable,X).
% 1.78/1.97 0 [] -object(X)| -exemplifies_property(none_greater,X)| -object(Y)| -exemplifies_relation(greater_than,Y,X)| -exemplifies_property(conceivable,Y).
% 1.78/1.97 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|object($f3(X)).
% 1.78/1.97 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_relation(greater_than,$f3(X),X).
% 1.78/1.97 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_property(conceivable,$f3(X)).
% 1.78/1.97 0 [] object($c1).
% 1.78/1.97 0 [] exemplifies_property(none_greater,$c1).
% 1.78/1.97 0 [] -object(X)| -exemplifies_property(none_greater,X)|object($c2).
% 1.78/1.97 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(none_greater,$c2).
% 1.78/1.97 0 [] -object(X)| -exemplifies_property(none_greater,X)| -object(Y)| -exemplifies_property(none_greater,Y)|Y=$c2.
% 1.78/1.97 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|object($f4(X)).
% 1.78/1.97 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_relation(greater_than,$f4(X),X).
% 1.78/1.97 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_property(conceivable,$f4(X)).
% 1.78/1.97 0 [] is_the(god,none_greater).
% 1.78/1.97 0 [] -exemplifies_property(existence,god).
% 1.78/1.97 end_of_list.
% 1.78/1.97
% 1.78/1.97 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.78/1.97
% 1.78/1.97 This ia a non-Horn set with equality. The strategy will be
% 1.78/1.97 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.78/1.97 deletion, with positive clauses in sos and nonpositive
% 1.81/1.98 clauses in usable.
% 1.81/1.98
% 1.81/1.98 dependent: set(knuth_bendix).
% 1.81/1.98 dependent: set(anl_eq).
% 1.81/1.98 dependent: set(para_from).
% 1.81/1.98 dependent: set(para_into).
% 1.81/1.98 dependent: clear(para_from_right).
% 1.81/1.98 dependent: clear(para_into_right).
% 1.81/1.98 dependent: set(para_from_vars).
% 1.81/1.98 dependent: set(eq_units_both_ways).
% 1.81/1.98 dependent: set(dynamic_demod_all).
% 1.81/1.98 dependent: set(dynamic_demod).
% 1.81/1.98 dependent: set(order_eq).
% 1.81/1.98 dependent: set(back_demod).
% 1.81/1.98 dependent: set(lrpo).
% 1.81/1.98 dependent: set(hyper_res).
% 1.81/1.98 dependent: set(unit_deletion).
% 1.81/1.98 dependent: set(factor).
% 1.81/1.98
% 1.81/1.98 ------------> process usable:
% 1.81/1.98 ** KEPT (pick-wt=14): 1 [] -property(A)| -object(B)| -exemplifies_property(A,B)|object($f1(A,B))|object($f2(A)).
% 1.81/1.98 ** KEPT (pick-wt=15): 2 [] -property(A)| -object(B)| -exemplifies_property(A,B)|object($f1(A,B))|is_the($f2(A),A).
% 1.81/1.98 ** KEPT (pick-wt=15): 3 [] -property(A)| -object(B)| -exemplifies_property(A,B)|exemplifies_property(A,$f1(A,B))|object($f2(A)).
% 1.81/1.98 ** KEPT (pick-wt=16): 4 [] -property(A)| -object(B)| -exemplifies_property(A,B)|exemplifies_property(A,$f1(A,B))|is_the($f2(A),A).
% 1.81/1.98 ** KEPT (pick-wt=15): 5 [] -property(A)| -object(B)| -exemplifies_property(A,B)|$f1(A,B)!=B|object($f2(A)).
% 1.81/1.98 ** KEPT (pick-wt=16): 6 [] -property(A)| -object(B)| -exemplifies_property(A,B)|$f1(A,B)!=B|is_the($f2(A),A).
% 1.81/1.98 ** KEPT (pick-wt=10): 8 [copy,7,factor_simp,factor_simp] -property(A)| -object(B)| -is_the(B,A)|exemplifies_property(A,B).
% 1.81/1.98 ** KEPT (pick-wt=5): 9 [] -is_the(A,B)|property(B).
% 1.81/1.98 ** KEPT (pick-wt=5): 10 [] -is_the(A,B)|object(A).
% 1.81/1.98 ** KEPT (pick-wt=8): 11 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(conceivable,A).
% 1.81/1.98 ** KEPT (pick-wt=14): 12 [] -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 1.81/1.98 ** KEPT (pick-wt=11): 13 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|object($f3(A)).
% 1.81/1.98 ** KEPT (pick-wt=13): 14 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_relation(greater_than,$f3(A),A).
% 1.81/1.98 ** KEPT (pick-wt=12): 15 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_property(conceivable,$f3(A)).
% 1.81/1.98 ** KEPT (pick-wt=7): 16 [] -object(A)| -exemplifies_property(none_greater,A)|object($c2).
% 1.81/1.98 ** KEPT (pick-wt=8): 17 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(none_greater,$c2).
% 1.81/1.98 ** KEPT (pick-wt=8): 19 [copy,18,factor_simp,factor_simp] -object(A)| -exemplifies_property(none_greater,A)|A=$c2.
% 1.81/1.98 ** KEPT (pick-wt=11): 20 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|object($f4(A)).
% 1.81/1.98 ** KEPT (pick-wt=13): 21 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_relation(greater_than,$f4(A),A).
% 1.81/1.98 ** KEPT (pick-wt=12): 22 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_property(conceivable,$f4(A)).
% 1.81/1.98 ** KEPT (pick-wt=3): 23 [] -exemplifies_property(existence,god).
% 1.81/1.98
% 1.81/1.98 ------------> process sos:
% 1.81/1.98 ** KEPT (pick-wt=3): 25 [] A=A.
% 1.81/1.98 ** KEPT (pick-wt=2): 26 [] object($c1).
% 1.81/1.98 ** KEPT (pick-wt=3): 27 [] exemplifies_property(none_greater,$c1).
% 1.81/1.98 ** KEPT (pick-wt=3): 28 [] is_the(god,none_greater).
% 1.81/1.98 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] A=A.
% 1.81/1.98
% 1.81/1.98 ======= end of input processing =======
% 1.81/1.98
% 1.81/1.98 =========== start of search ===========
% 1.81/1.98
% 1.81/1.98 -------- PROOF --------
% 1.81/1.98
% 1.81/1.98 -----> EMPTY CLAUSE at 0.01 sec ----> 122 [hyper,112,12,26,27,45,113] $F.
% 1.81/1.98
% 1.81/1.98 Length of proof is 14. Level of proof is 5.
% 1.81/1.98
% 1.81/1.98 ---------------- PROOF ----------------
% 1.81/1.98 % SZS status Theorem
% 1.81/1.98 % SZS output start Refutation
% See solution above
% 1.81/1.98 ------------ end of proof -------------
% 1.81/1.98
% 1.81/1.98
% 1.81/1.98 Search stopped by max_proofs option.
% 1.81/1.98
% 1.81/1.98
% 1.81/1.98 Search stopped by max_proofs option.
% 1.81/1.98
% 1.81/1.98 ============ end of search ============
% 1.81/1.98
% 1.81/1.98 -------------- statistics -------------
% 1.81/1.98 clauses given 19
% 1.81/1.98 clauses generated 169
% 1.81/1.98 clauses kept 117
% 1.81/1.98 clauses forward subsumed 84
% 1.81/1.98 clauses back subsumed 1
% 1.81/1.98 Kbytes malloced 976
% 1.81/1.98
% 1.81/1.98 ----------- times (seconds) -----------
% 1.81/1.98 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.81/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.81/1.98 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.81/1.98
% 1.81/1.98 That finishes the proof of the theorem.
% 1.81/1.98
% 1.81/1.98 Process 31032 finished Wed Jul 27 02:55:38 2022
% 1.81/1.98 Otter interrupted
% 1.81/1.98 PROOF FOUND
%------------------------------------------------------------------------------