TSTP Solution File: PHI015+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.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:10:40 EDT 2022
% Result : Theorem 3.11s 3.34s
% Output : Refutation 3.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 25 ( 15 unt; 3 nHn; 24 RR)
% Number of literals : 62 ( 11 equ; 37 neg)
% Maximal clause size : 8 ( 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; 6 con; 0-3 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ exemplifies_property(A,B)
| property(A) ),
file('PHI015+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ is_the(A,B)
| object(A) ),
file('PHI015+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ property(A)
| ~ object(B)
| ~ object(C)
| ~ is_the(B,A)
| B != C
| ~ object(D)
| ~ exemplifies_property(A,D)
| D = dollar_f3(A,B,C) ),
file('PHI015+1.p',unknown),
[] ).
cnf(19,axiom,
( ~ property(A)
| ~ object(B)
| ~ object(C)
| ~ is_the(B,A)
| B != C
| dollar_f3(A,B,C) = C ),
file('PHI015+1.p',unknown),
[] ).
cnf(28,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| ~ object(B)
| ~ exemplifies_relation(greater_than,B,A)
| ~ exemplifies_property(conceivable,B) ),
file('PHI015+1.p',unknown),
[] ).
cnf(32,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| object(dollar_f6(A)) ),
file('PHI015+1.p',unknown),
[] ).
cnf(33,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_relation(greater_than,dollar_f6(A),A) ),
file('PHI015+1.p',unknown),
[] ).
cnf(34,axiom,
( ~ object(A)
| ~ is_the(A,none_greater)
| exemplifies_property(existence,A)
| exemplifies_property(conceivable,dollar_f6(A)) ),
file('PHI015+1.p',unknown),
[] ).
cnf(35,axiom,
~ exemplifies_property(existence,god),
file('PHI015+1.p',unknown),
[] ).
cnf(52,plain,
( ~ property(A)
| ~ object(B)
| ~ is_the(B,A)
| B != B
| ~ object(C)
| ~ exemplifies_property(A,C)
| C = dollar_f3(A,B,B) ),
inference(factor,[status(thm)],[18]),
[iquote('factor,18.2.3')] ).
cnf(54,plain,
( ~ property(A)
| ~ object(B)
| ~ is_the(B,A)
| B != B
| dollar_f3(A,B,B) = B ),
inference(factor,[status(thm)],[19]),
[iquote('factor,19.2.3')] ).
cnf(78,axiom,
A = A,
file('PHI015+1.p',unknown),
[] ).
cnf(79,axiom,
object(dollar_c1),
file('PHI015+1.p',unknown),
[] ).
cnf(80,axiom,
exemplifies_property(none_greater,dollar_c1),
file('PHI015+1.p',unknown),
[] ).
cnf(81,axiom,
is_the(god,none_greater),
file('PHI015+1.p',unknown),
[] ).
cnf(84,plain,
property(none_greater),
inference(hyper,[status(thm)],[80,2]),
[iquote('hyper,80,2')] ).
cnf(139,plain,
object(god),
inference(hyper,[status(thm)],[81,5]),
[iquote('hyper,81,5')] ).
cnf(223,plain,
dollar_f3(none_greater,god,god) = god,
inference(hyper,[status(thm)],[139,54,84,81,78]),
[iquote('hyper,139,54,84,81,78')] ).
cnf(225,plain,
god = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[139,52,84,81,78,79,80]),223])]),
[iquote('hyper,139,52,84,81,78,79,80,demod,223,flip.1')] ).
cnf(264,plain,
is_the(dollar_c1,none_greater),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[81]),225]),
[iquote('back_demod,81,demod,225')] ).
cnf(265,plain,
~ exemplifies_property(existence,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[35]),225]),
[iquote('back_demod,35,demod,225')] ).
cnf(651,plain,
exemplifies_property(conceivable,dollar_f6(dollar_c1)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[264,34,79]),265]),
[iquote('hyper,264,34,79,unit_del,265')] ).
cnf(652,plain,
exemplifies_relation(greater_than,dollar_f6(dollar_c1),dollar_c1),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[264,33,79]),265]),
[iquote('hyper,264,33,79,unit_del,265')] ).
cnf(653,plain,
object(dollar_f6(dollar_c1)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[264,32,79]),265]),
[iquote('hyper,264,32,79,unit_del,265')] ).
cnf(1036,plain,
$false,
inference(hyper,[status(thm)],[652,28,79,80,653,651]),
[iquote('hyper,652,28,79,80,653,651')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : PHI015+1 : TPTP v8.1.0. Released v7.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n021.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:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.76/2.00 ----- Otter 3.3f, August 2004 -----
% 1.76/2.00 The process was started by sandbox on n021.cluster.edu,
% 1.76/2.00 Wed Jul 27 02:29:53 2022
% 1.76/2.00 The command was "./otter". The process ID is 23209.
% 1.76/2.00
% 1.76/2.00 set(prolog_style_variables).
% 1.76/2.00 set(auto).
% 1.76/2.00 dependent: set(auto1).
% 1.76/2.00 dependent: set(process_input).
% 1.76/2.00 dependent: clear(print_kept).
% 1.76/2.00 dependent: clear(print_new_demod).
% 1.76/2.00 dependent: clear(print_back_demod).
% 1.76/2.00 dependent: clear(print_back_sub).
% 1.76/2.00 dependent: set(control_memory).
% 1.76/2.00 dependent: assign(max_mem, 12000).
% 1.76/2.00 dependent: assign(pick_given_ratio, 4).
% 1.76/2.00 dependent: assign(stats_level, 1).
% 1.76/2.00 dependent: assign(max_seconds, 10800).
% 1.76/2.00 clear(print_given).
% 1.76/2.00
% 1.76/2.00 formula_list(usable).
% 1.76/2.00 all A (A=A).
% 1.76/2.00 all X (object(X)-> -property(X)).
% 1.76/2.00 all X F (exemplifies_property(F,X)->property(F)&object(X)).
% 1.76/2.00 all X F (is_the(X,F)->property(F)&object(X)).
% 1.76/2.00 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.76/2.00 all F X W (property(F)&object(X)&object(W)-> (is_the(X,F)&X=W<-> (exists Y (object(Y)&exemplifies_property(F,Y)& (all Z (object(Z)-> (exemplifies_property(F,Z)->Z=Y)))&Y=W)))).
% 1.76/2.00 all X Y (object(X)&object(Y)->exemplifies_relation(greater_than,X,Y)|exemplifies_relation(greater_than,Y,X)|X=Y).
% 1.76/2.00 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.76/2.00 exists X (object(X)&exemplifies_property(none_greater,X)).
% 1.76/2.00 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.76/2.00 is_the(god,none_greater).
% 1.76/2.00 -exemplifies_property(existence,god).
% 1.76/2.00 end_of_list.
% 1.76/2.00
% 1.76/2.00 -------> usable clausifies to:
% 1.76/2.00
% 1.76/2.00 list(usable).
% 1.76/2.00 0 [] A=A.
% 1.76/2.00 0 [] -object(X)| -property(X).
% 1.76/2.00 0 [] -exemplifies_property(F,X)|property(F).
% 1.76/2.00 0 [] -exemplifies_property(F,X)|object(X).
% 1.76/2.00 0 [] -is_the(X,F)|property(F).
% 1.76/2.00 0 [] -is_the(X,F)|object(X).
% 1.76/2.00 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|object($f1(F,G,X)).
% 1.76/2.00 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|exemplifies_property(F,$f1(F,G,X)).
% 1.76/2.00 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.76/2.00 0 [] -property(F)| -property(G)| -object(X)| -is_the(X,F)| -exemplifies_property(G,X)|exemplifies_property(G,$f1(F,G,X)).
% 1.76/2.00 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.76/2.00 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.76/2.00 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.76/2.00 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.76/2.00 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.76/2.00 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.76/2.00 0 [] -property(F)| -object(X)| -object(W)| -is_the(X,F)|X!=W|object($f3(F,X,W)).
% 1.76/2.00 0 [] -property(F)| -object(X)| -object(W)| -is_the(X,F)|X!=W|exemplifies_property(F,$f3(F,X,W)).
% 1.76/2.00 0 [] -property(F)| -object(X)| -object(W)| -is_the(X,F)|X!=W| -object(Z)| -exemplifies_property(F,Z)|Z=$f3(F,X,W).
% 1.76/2.00 0 [] -property(F)| -object(X)| -object(W)| -is_the(X,F)|X!=W|$f3(F,X,W)=W.
% 1.76/2.00 0 [] -property(F)| -object(X)| -object(W)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|object($f4(F,X,W,Y))|Y!=W.
% 1.76/2.00 0 [] -property(F)| -object(X)| -object(W)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f4(F,X,W,Y))|Y!=W.
% 1.76/2.01 0 [] -property(F)| -object(X)| -object(W)|is_the(X,F)| -object(Y)| -exemplifies_property(F,Y)|$f4(F,X,W,Y)!=Y|Y!=W.
% 1.76/2.01 0 [] -property(F)| -object(X)| -object(W)|X=W| -object(Y)| -exemplifies_property(F,Y)|object($f4(F,X,W,Y))|Y!=W.
% 1.76/2.01 0 [] -property(F)| -object(X)| -object(W)|X=W| -object(Y)| -exemplifies_property(F,Y)|exemplifies_property(F,$f4(F,X,W,Y))|Y!=W.
% 1.76/2.01 0 [] -property(F)| -object(X)| -object(W)|X=W| -object(Y)| -exemplifies_property(F,Y)|$f4(F,X,W,Y)!=Y|Y!=W.
% 1.76/2.01 0 [] -object(X)| -object(Y)|exemplifies_relation(greater_than,X,Y)|exemplifies_relation(greater_than,Y,X)|X=Y.
% 1.76/2.01 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(conceivable,X).
% 1.76/2.01 0 [] -object(X)| -exemplifies_property(none_greater,X)| -object(Y)| -exemplifies_relation(greater_than,Y,X)| -exemplifies_property(conceivable,Y).
% 1.76/2.01 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|object($f5(X)).
% 1.76/2.01 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_relation(greater_than,$f5(X),X).
% 1.76/2.01 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_property(conceivable,$f5(X)).
% 1.76/2.01 0 [] object($c1).
% 1.76/2.01 0 [] exemplifies_property(none_greater,$c1).
% 1.76/2.01 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|object($f6(X)).
% 1.76/2.01 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_relation(greater_than,$f6(X),X).
% 1.76/2.01 0 [] -object(X)| -is_the(X,none_greater)|exemplifies_property(existence,X)|exemplifies_property(conceivable,$f6(X)).
% 1.76/2.01 0 [] is_the(god,none_greater).
% 1.76/2.01 0 [] -exemplifies_property(existence,god).
% 1.76/2.01 end_of_list.
% 1.76/2.01
% 1.76/2.01 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.76/2.01
% 1.76/2.01 This ia a non-Horn set with equality. The strategy will be
% 1.76/2.01 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.76/2.01 deletion, with positive clauses in sos and nonpositive
% 1.76/2.01 clauses in usable.
% 1.76/2.01
% 1.76/2.01 dependent: set(knuth_bendix).
% 1.76/2.01 dependent: set(anl_eq).
% 1.76/2.01 dependent: set(para_from).
% 1.76/2.01 dependent: set(para_into).
% 1.76/2.01 dependent: clear(para_from_right).
% 1.76/2.01 dependent: clear(para_into_right).
% 1.76/2.01 dependent: set(para_from_vars).
% 1.76/2.01 dependent: set(eq_units_both_ways).
% 1.76/2.01 dependent: set(dynamic_demod_all).
% 1.76/2.01 dependent: set(dynamic_demod).
% 1.76/2.01 dependent: set(order_eq).
% 1.76/2.01 dependent: set(back_demod).
% 1.76/2.01 dependent: set(lrpo).
% 1.76/2.01 dependent: set(hyper_res).
% 1.76/2.01 dependent: set(unit_deletion).
% 1.76/2.01 dependent: set(factor).
% 1.76/2.01
% 1.76/2.01 ------------> process usable:
% 1.76/2.01 ** KEPT (pick-wt=4): 1 [] -object(A)| -property(A).
% 1.76/2.01 ** KEPT (pick-wt=5): 2 [] -exemplifies_property(A,B)|property(A).
% 1.76/2.01 ** KEPT (pick-wt=5): 3 [] -exemplifies_property(A,B)|object(B).
% 1.76/2.01 ** KEPT (pick-wt=5): 4 [] -is_the(A,B)|property(B).
% 1.76/2.01 ** KEPT (pick-wt=5): 5 [] -is_the(A,B)|object(A).
% 1.76/2.01 ** KEPT (pick-wt=17): 6 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|object($f1(A,B,C)).
% 1.76/2.01 ** KEPT (pick-wt=18): 7 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|exemplifies_property(A,$f1(A,B,C)).
% 1.76/2.01 ** KEPT (pick-wt=23): 8 [] -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.76/2.01 ** KEPT (pick-wt=18): 9 [] -property(A)| -property(B)| -object(C)| -is_the(C,A)| -exemplifies_property(B,C)|exemplifies_property(B,$f1(A,B,C)).
% 1.76/2.01 ** KEPT (pick-wt=23): 10 [] -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).
% 1.76/2.01 ** KEPT (pick-wt=24): 11 [] -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).
% 1.76/2.01 ** KEPT (pick-wt=24): 12 [] -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).
% 1.76/2.01 ** KEPT (pick-wt=23): 13 [] -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).
% 1.76/2.01 ** KEPT (pick-wt=24): 14 [] -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).
% 3.11/3.34 ** KEPT (pick-wt=24): 15 [] -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).
% 3.11/3.34 ** KEPT (pick-wt=17): 16 [] -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C|object($f3(A,B,C)).
% 3.11/3.34 ** KEPT (pick-wt=18): 17 [] -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C|exemplifies_property(A,$f3(A,B,C)).
% 3.11/3.34 ** KEPT (pick-wt=23): 18 [] -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C| -object(D)| -exemplifies_property(A,D)|D=$f3(A,B,C).
% 3.11/3.34 ** KEPT (pick-wt=18): 19 [] -property(A)| -object(B)| -object(C)| -is_the(B,A)|B!=C|$f3(A,B,C)=C.
% 3.11/3.34 ** KEPT (pick-wt=23): 20 [] -property(A)| -object(B)| -object(C)|is_the(B,A)| -object(D)| -exemplifies_property(A,D)|object($f4(A,B,C,D))|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=24): 21 [] -property(A)| -object(B)| -object(C)|is_the(B,A)| -object(D)| -exemplifies_property(A,D)|exemplifies_property(A,$f4(A,B,C,D))|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=24): 22 [] -property(A)| -object(B)| -object(C)|is_the(B,A)| -object(D)| -exemplifies_property(A,D)|$f4(A,B,C,D)!=D|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=23): 23 [] -property(A)| -object(B)| -object(C)|B=C| -object(D)| -exemplifies_property(A,D)|object($f4(A,B,C,D))|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=24): 24 [] -property(A)| -object(B)| -object(C)|B=C| -object(D)| -exemplifies_property(A,D)|exemplifies_property(A,$f4(A,B,C,D))|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=24): 25 [] -property(A)| -object(B)| -object(C)|B=C| -object(D)| -exemplifies_property(A,D)|$f4(A,B,C,D)!=D|D!=C.
% 3.11/3.34 ** KEPT (pick-wt=15): 26 [] -object(A)| -object(B)|exemplifies_relation(greater_than,A,B)|exemplifies_relation(greater_than,B,A)|A=B.
% 3.11/3.34 ** KEPT (pick-wt=8): 27 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(conceivable,A).
% 3.11/3.34 ** KEPT (pick-wt=14): 28 [] -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 3.11/3.34 ** KEPT (pick-wt=11): 29 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|object($f5(A)).
% 3.11/3.34 ** KEPT (pick-wt=13): 30 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_relation(greater_than,$f5(A),A).
% 3.11/3.34 ** KEPT (pick-wt=12): 31 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_property(conceivable,$f5(A)).
% 3.11/3.34 ** KEPT (pick-wt=11): 32 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|object($f6(A)).
% 3.11/3.34 ** KEPT (pick-wt=13): 33 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_relation(greater_than,$f6(A),A).
% 3.11/3.34 ** KEPT (pick-wt=12): 34 [] -object(A)| -is_the(A,none_greater)|exemplifies_property(existence,A)|exemplifies_property(conceivable,$f6(A)).
% 3.11/3.34 ** KEPT (pick-wt=3): 35 [] -exemplifies_property(existence,god).
% 3.11/3.34
% 3.11/3.34 ------------> process sos:
% 3.11/3.34 ** KEPT (pick-wt=3): 78 [] A=A.
% 3.11/3.34 ** KEPT (pick-wt=2): 79 [] object($c1).
% 3.11/3.34 ** KEPT (pick-wt=3): 80 [] exemplifies_property(none_greater,$c1).
% 3.11/3.34 ** KEPT (pick-wt=3): 81 [] is_the(god,none_greater).
% 3.11/3.34 Following clause subsumed by 78 during input processing: 0 [copy,78,flip.1] A=A.
% 3.11/3.34 78 back subsumes 70.
% 3.11/3.34 78 back subsumes 68.
% 3.11/3.34 78 back subsumes 66.
% 3.11/3.34 78 back subsumes 64.
% 3.11/3.34
% 3.11/3.34 ======= end of input processing =======
% 3.11/3.34
% 3.11/3.34 =========== start of search ===========
% 3.11/3.34
% 3.11/3.34 -------- PROOF --------
% 3.11/3.34
% 3.11/3.34 -----> EMPTY CLAUSE at 1.34 sec ----> 1036 [hyper,652,28,79,80,653,651] $F.
% 3.11/3.34
% 3.11/3.34 Length of proof is 11. Level of proof is 5.
% 3.11/3.34
% 3.11/3.34 ---------------- PROOF ----------------
% 3.11/3.34 % SZS status Theorem
% 3.11/3.34 % SZS output start Refutation
% See solution above
% 3.11/3.34 ------------ end of proof -------------
% 3.11/3.34
% 3.11/3.34
% 3.11/3.34 Search stopped by max_proofs option.
% 3.11/3.34
% 3.11/3.34
% 3.11/3.34 Search stopped by max_proofs option.
% 3.11/3.34
% 3.11/3.34 ============ end of search ============
% 3.11/3.34
% 3.11/3.34 -------------- statistics -------------
% 3.11/3.34 clauses given 17
% 3.11/3.34 clauses generated 3509
% 3.11/3.34 clauses kept 1030
% 3.11/3.34 clauses forward subsumed 2441
% 3.11/3.34 clauses back subsumed 12
% 3.11/3.34 Kbytes malloced 2929
% 3.11/3.34
% 3.11/3.34 ----------- times (seconds) -----------
% 3.11/3.34 user CPU time 1.34 (0 hr, 0 min, 1 sec)
% 3.11/3.34 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.11/3.34 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.11/3.34
% 3.11/3.34 That finishes the proof of the theorem.
% 3.11/3.34
% 3.11/3.34 Process 23209 finished Wed Jul 27 02:29:56 2022
% 3.11/3.34 Otter interrupted
% 3.11/3.34 PROOF FOUND
%------------------------------------------------------------------------------