%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.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:10:40 EDT 2022
% Result : Theorem 1.63s 1.85s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 9
% Syntax : Number of clauses : 17 ( 9 unt; 3 nHn; 17 RR)
% Number of literals : 40 ( 0 equ; 22 neg)
% Maximal clause size : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ property(A)
| ~ object(B)
| ~ is_the(B,A)
| ~ object(C)
| ~ is_the(C,A)
| exemplifies_property(A,C) ),
file('PHI014+1.p',unknown),
[] ).
cnf(2,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)],[1])])]),
[iquote('copy,1,factor_simp,factor_simp')] ).
cnf(3,axiom,
( ~ is_the(A,B)
| property(B) ),
file('PHI014+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ is_the(A,B)
| object(A) ),
file('PHI014+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| ~ object(B)
| ~ exemplifies_relation(greater_than,B,A)
| ~ exemplifies_property(conceivable,B) ),
file('PHI014+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| object(dollar_f2(A)) ),
file('PHI014+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_relation(greater_than,dollar_f2(A),A) ),
file('PHI014+1.p',unknown),
[] ).
cnf(12,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_property(conceivable,dollar_f2(A)) ),
file('PHI014+1.p',unknown),
[] ).
cnf(13,axiom,
~ exemplifies_property(existence,god),
file('PHI014+1.p',unknown),
[] ).
cnf(15,axiom,
is_the(god,none_greater),
file('PHI014+1.p',unknown),
[] ).
cnf(16,plain,
object(god),
inference(hyper,[status(thm)],[15,4]),
[iquote('hyper,15,4')] ).
cnf(17,plain,
property(none_greater),
inference(hyper,[status(thm)],[15,3]),
[iquote('hyper,15,3')] ).
cnf(18,plain,
exemplifies_property(conceivable,dollar_f2(god)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[16,12,15]),13]),
[iquote('hyper,16,12,15,unit_del,13')] ).
cnf(19,plain,
exemplifies_relation(greater_than,dollar_f2(god),god),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[16,11,15]),13]),
[iquote('hyper,16,11,15,unit_del,13')] ).
cnf(20,plain,
object(dollar_f2(god)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[16,10,15]),13]),
[iquote('hyper,16,10,15,unit_del,13')] ).
cnf(21,plain,
exemplifies_property(none_greater,god),
inference(hyper,[status(thm)],[17,2,16,15]),
[iquote('hyper,17,2,16,15')] ).
cnf(26,plain,
$false,
inference(hyper,[status(thm)],[19,6,16,21,20,18]),
[iquote('hyper,19,6,16,21,20,18')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : PHI014+1 : TPTP v8.1.0. Released v7.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n010.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 02:27:09 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.63/1.85 ----- Otter 3.3f, August 2004 -----
% 1.63/1.85 The process was started by sandbox on n010.cluster.edu,
% 1.63/1.85 Wed Jul 27 02:27:10 2022
% 1.63/1.85 The command was "./otter". The process ID is 25229.
% 1.63/1.85
% 1.63/1.85 set(prolog_style_variables).
% 1.63/1.85 set(auto).
% 1.63/1.85 dependent: set(auto1).
% 1.63/1.85 dependent: set(process_input).
% 1.63/1.85 dependent: clear(print_kept).
% 1.63/1.85 dependent: clear(print_new_demod).
% 1.63/1.85 dependent: clear(print_back_demod).
% 1.63/1.85 dependent: clear(print_back_sub).
% 1.63/1.85 dependent: set(control_memory).
% 1.63/1.85 dependent: assign(max_mem, 12000).
% 1.63/1.85 dependent: assign(pick_given_ratio, 4).
% 1.63/1.85 dependent: assign(stats_level, 1).
% 1.63/1.85 dependent: assign(max_seconds, 10800).
% 1.63/1.85 clear(print_given).
% 1.63/1.85
% 1.63/1.85 formula_list(usable).
% 1.63/1.85 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.63/1.85 all X F (is_the(X,F)->property(F)&object(X)).
% 1.63/1.85 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.63/1.85 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.63/1.85 is_the(god,none_greater).
% 1.63/1.85 -exemplifies_property(existence,god).
% 1.63/1.85 end_of_list.
% 1.63/1.85
% 1.63/1.85 -------> usable clausifies to:
% 1.63/1.85
% 1.63/1.85 list(usable).
% 1.63/1.85 0 [] -property(F)| -object(Y)| -is_the(Y,F)| -object(Z)| -is_the(Z,F)|exemplifies_property(F,Z).
% 1.63/1.85 0 [] -is_the(X,F)|property(F).
% 1.63/1.85 0 [] -is_the(X,F)|object(X).
% 1.63/1.85 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(conceivable,X).
% 1.63/1.85 0 [] -object(X)| -exemplifies_property(none_greater,X)| -object(Y)| -exemplifies_relation(greater_than,Y,X)| -exemplifies_property(conceivable,Y).
% 1.63/1.85 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|object($f1(X)).
% 1.63/1.85 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_relation(greater_than,$f1(X),X).
% 1.63/1.85 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_property(conceivable,$f1(X)).
% 1.63/1.85 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|object($f2(X)).
% 1.63/1.85 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_relation(greater_than,$f2(X),X).
% 1.63/1.85 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_property(conceivable,$f2(X)).
% 1.63/1.85 0 [] is_the(god,none_greater).
% 1.63/1.85 0 [] -exemplifies_property(existence,god).
% 1.63/1.85 end_of_list.
% 1.63/1.85
% 1.63/1.85 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.63/1.85
% 1.63/1.85 This is a non-Horn set without equality. The strategy will
% 1.63/1.85 be ordered hyper_res, unit deletion, and factoring, with
% 1.63/1.85 satellites in sos and with nuclei in usable.
% 1.63/1.85
% 1.63/1.85 dependent: set(hyper_res).
% 1.63/1.85 dependent: set(factor).
% 1.63/1.85 dependent: set(unit_deletion).
% 1.63/1.85
% 1.63/1.85 ------------> process usable:
% 1.63/1.85 ** KEPT (pick-wt=10): 2 [copy,1,factor_simp,factor_simp] -property(A)| -object(B)| -is_the(B,A)|exemplifies_property(A,B).
% 1.63/1.85 ** KEPT (pick-wt=5): 3 [] -is_the(A,B)|property(B).
% 1.63/1.85 ** KEPT (pick-wt=5): 4 [] -is_the(A,B)|object(A).
% 1.63/1.85 ** KEPT (pick-wt=8): 5 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(conceivable,A).
% 1.63/1.85 ** KEPT (pick-wt=14): 6 [] -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 1.63/1.85 ** KEPT (pick-wt=11): 7 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|object($f1(A)).
% 1.63/1.85 ** KEPT (pick-wt=13): 8 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_relation(greater_than,$f1(A),A).
% 1.63/1.85 ** KEPT (pick-wt=12): 9 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_property(conceivable,$f1(A)).
% 1.63/1.85 ** KEPT (pick-wt=11): 10 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|object($f2(A)).
% 1.63/1.85 ** KEPT (pick-wt=13): 11 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_relation(greater_than,$f2(A),A).
% 1.63/1.85 ** KEPT (pick-wt=12): 12 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_property(conceivable,$f2(A)).
% 1.63/1.85 ** KEPT (pick-wt=3): 13 [] -exemplifies_property(existence,god).
% 1.63/1.85
% 1.63/1.85 ------------> process sos:
% 1.63/1.85 ** KEPT (pick-wt=3): 15 [] is_the(god,none_greater).
% 1.63/1.85
% 1.63/1.85 ======= end of input processing =======
% 1.63/1.85
% 1.63/1.85 =========== start of search ===========
% 1.63/1.85
% 1.63/1.85 -------- PROOF --------
% 1.63/1.85
% 1.63/1.85 -----> EMPTY CLAUSE at 0.00 sec ----> 26 [hyper,19,6,16,21,20,18] $F.
% 1.63/1.85
% 1.63/1.85 Length of proof is 7. Level of proof is 2.
% 1.63/1.85
% 1.63/1.85 ---------------- PROOF ----------------
% 1.63/1.85 % SZS status Theorem
% 1.63/1.85 % SZS output start Refutation
% See solution above
% 1.63/1.85 ------------ end of proof -------------
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85
% 1.63/1.85 Search stopped by max_proofs option.
% 1.63/1.85
% 1.63/1.85 ============ end of search ============
% 1.63/1.85
% 1.63/1.85 -------------- statistics -------------
% 1.63/1.85 clauses given 8
% 1.63/1.85 clauses generated 15
% 1.63/1.85 clauses kept 24
% 1.63/1.85 clauses forward subsumed 3
% 1.63/1.85 clauses back subsumed 0
% 1.63/1.85 Kbytes malloced 976
% 1.63/1.85
% 1.63/1.85 ----------- times (seconds) -----------
% 1.63/1.85 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.85 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.63/1.85
% 1.63/1.85 That finishes the proof of the theorem.
% 1.63/1.85
% 1.63/1.85 Process 25229 finished Wed Jul 27 02:27:11 2022
% 1.63/1.85 Otter interrupted
% 1.63/1.85 PROOF FOUND
%------------------------------------------------------------------------------