TSTP Solution File: PHI012+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : PHI012+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:40 EDT 2022
% Result : Theorem 1.89s 2.11s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 16 ( 8 unt; 3 nHn; 16 RR)
% Number of literals : 35 ( 3 equ; 16 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| exemplifies_property(conceivable,A) ),
file('PHI012+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| ~ object(B)
| ~ exemplifies_relation(greater_than,B,A)
| ~ exemplifies_property(conceivable,B) ),
file('PHI012+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ object(A)
| ~ object(B)
| exemplifies_relation(greater_than,A,B)
| exemplifies_relation(greater_than,B,A)
| A = B ),
file('PHI012+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| object(dollar_f2(A)) ),
file('PHI012+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| exemplifies_property(none_greater,dollar_f2(A)) ),
file('PHI012+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ object(A)
| ~ exemplifies_property(none_greater,A)
| dollar_f2(A) != A ),
file('PHI012+1.p',unknown),
[] ).
cnf(13,axiom,
object(dollar_c1),
file('PHI012+1.p',unknown),
[] ).
cnf(14,axiom,
exemplifies_property(none_greater,dollar_c1),
file('PHI012+1.p',unknown),
[] ).
cnf(15,plain,
exemplifies_property(none_greater,dollar_f2(dollar_c1)),
inference(hyper,[status(thm)],[14,8,13]),
[iquote('hyper,14,8,13')] ).
cnf(16,plain,
object(dollar_f2(dollar_c1)),
inference(hyper,[status(thm)],[14,7,13]),
[iquote('hyper,14,7,13')] ).
cnf(17,plain,
exemplifies_property(conceivable,dollar_c1),
inference(hyper,[status(thm)],[14,1,13]),
[iquote('hyper,14,1,13')] ).
cnf(20,plain,
( exemplifies_relation(greater_than,dollar_c1,dollar_f2(dollar_c1))
| exemplifies_relation(greater_than,dollar_f2(dollar_c1),dollar_c1)
| dollar_f2(dollar_c1) = dollar_c1 ),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[16,6,13])]),
[iquote('hyper,16,6,13,flip.3')] ).
cnf(26,plain,
exemplifies_property(conceivable,dollar_f2(dollar_c1)),
inference(hyper,[status(thm)],[15,1,16]),
[iquote('hyper,15,1,16')] ).
cnf(133,plain,
( exemplifies_relation(greater_than,dollar_c1,dollar_f2(dollar_c1))
| exemplifies_relation(greater_than,dollar_f2(dollar_c1),dollar_c1) ),
inference(hyper,[status(thm)],[20,9,13,14]),
[iquote('hyper,20,9,13,14')] ).
cnf(195,plain,
exemplifies_relation(greater_than,dollar_f2(dollar_c1),dollar_c1),
inference(hyper,[status(thm)],[133,2,16,15,13,17]),
[iquote('hyper,133,2,16,15,13,17')] ).
cnf(197,plain,
$false,
inference(hyper,[status(thm)],[195,2,13,14,16,26]),
[iquote('hyper,195,2,13,14,16,26')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : PHI012+1 : TPTP v8.1.0. Released v7.2.0.
% 0.07/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:30:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n011.cluster.edu,
% 1.89/2.09 Wed Jul 27 02:30:10 2022
% 1.89/2.09 The command was "./otter". The process ID is 22820.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 formula_list(usable).
% 1.89/2.09 all A (A=A).
% 1.89/2.09 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.89/2.09 all X Y (object(X)&object(Y)->exemplifies_relation(greater_than,X,Y)|exemplifies_relation(greater_than,Y,X)|X=Y).
% 1.89/2.09 -((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.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 -------> usable clausifies to:
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] A=A.
% 1.89/2.09 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(conceivable,X).
% 1.89/2.09 0 [] -object(X)| -exemplifies_property(none_greater,X)| -object(Y)| -exemplifies_relation(greater_than,Y,X)| -exemplifies_property(conceivable,Y).
% 1.89/2.09 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|object($f1(X)).
% 1.89/2.09 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_relation(greater_than,$f1(X),X).
% 1.89/2.09 0 [] -object(X)|exemplifies_property(none_greater,X)| -exemplifies_property(conceivable,X)|exemplifies_property(conceivable,$f1(X)).
% 1.89/2.09 0 [] -object(X)| -object(Y)|exemplifies_relation(greater_than,X,Y)|exemplifies_relation(greater_than,Y,X)|X=Y.
% 1.89/2.09 0 [] object($c1).
% 1.89/2.09 0 [] exemplifies_property(none_greater,$c1).
% 1.89/2.09 0 [] -object(X)| -exemplifies_property(none_greater,X)|object($f2(X)).
% 1.89/2.09 0 [] -object(X)| -exemplifies_property(none_greater,X)|exemplifies_property(none_greater,$f2(X)).
% 1.89/2.09 0 [] -object(X)| -exemplifies_property(none_greater,X)|$f2(X)!=X.
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.89/2.09
% 1.89/2.09 This ia a non-Horn set with equality. The strategy will be
% 1.89/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.89/2.09 deletion, with positive clauses in sos and nonpositive
% 1.89/2.09 clauses in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(knuth_bendix).
% 1.89/2.09 dependent: set(anl_eq).
% 1.89/2.09 dependent: set(para_from).
% 1.89/2.09 dependent: set(para_into).
% 1.89/2.09 dependent: clear(para_from_right).
% 1.89/2.09 dependent: clear(para_into_right).
% 1.89/2.09 dependent: set(para_from_vars).
% 1.89/2.09 dependent: set(eq_units_both_ways).
% 1.89/2.09 dependent: set(dynamic_demod_all).
% 1.89/2.09 dependent: set(dynamic_demod).
% 1.89/2.09 dependent: set(order_eq).
% 1.89/2.09 dependent: set(back_demod).
% 1.89/2.09 dependent: set(lrpo).
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: set(unit_deletion).
% 1.89/2.09 dependent: set(factor).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=8): 1 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(conceivable,A).
% 1.89/2.09 ** KEPT (pick-wt=14): 2 [] -object(A)| -exemplifies_property(none_greater,A)| -object(B)| -exemplifies_relation(greater_than,B,A)| -exemplifies_property(conceivable,B).
% 1.89/2.09 ** KEPT (pick-wt=11): 3 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|object($f1(A)).
% 1.89/2.09 ** KEPT (pick-wt=13): 4 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_relation(greater_than,$f1(A),A).
% 1.89/2.09 ** KEPT (pick-wt=12): 5 [] -object(A)|exemplifies_property(none_greater,A)| -exemplifies_property(conceivable,A)|exemplifies_property(conceivable,$f1(A)).
% 1.89/2.09 ** KEPT (pick-wt=15): 6 [] -object(A)| -object(B)|exemplifies_relation(greater_than,A,B)|exemplifies_relation(greater_than,B,A)|A=B.
% 1.89/2.09 ** KEPT (pick-wt=8): 7 [] -object(A)| -exemplifies_property(none_greater,A)|object($f2(A)).
% 1.89/2.09 ** KEPT (pick-wt=9): 8 [] -object(A)| -exemplifies_property(none_greater,A)|exemplifies_property(none_greater,$f2(A)).
% 1.89/2.11 ** KEPT (pick-wt=9): 9 [] -object(A)| -exemplifies_property(none_greater,A)|$f2(A)!=A.
% 1.89/2.11
% 1.89/2.11 ------------> process sos:
% 1.89/2.11 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.89/2.11 ** KEPT (pick-wt=2): 13 [] object($c1).
% 1.89/2.11 ** KEPT (pick-wt=3): 14 [] exemplifies_property(none_greater,$c1).
% 1.89/2.11 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.89/2.11 12 back subsumes 11.
% 1.89/2.11
% 1.89/2.11 ======= end of input processing =======
% 1.89/2.11
% 1.89/2.11 =========== start of search ===========
% 1.89/2.11
% 1.89/2.11 -------- PROOF --------
% 1.89/2.11
% 1.89/2.11 -----> EMPTY CLAUSE at 0.01 sec ----> 197 [hyper,195,2,13,14,16,26] $F.
% 1.89/2.11
% 1.89/2.11 Length of proof is 7. Level of proof is 4.
% 1.89/2.11
% 1.89/2.11 ---------------- PROOF ----------------
% 1.89/2.11 % SZS status Theorem
% 1.89/2.11 % SZS output start Refutation
% See solution above
% 1.89/2.11 ------------ end of proof -------------
% 1.89/2.11
% 1.89/2.11
% 1.89/2.11 Search stopped by max_proofs option.
% 1.89/2.11
% 1.89/2.11
% 1.89/2.11 Search stopped by max_proofs option.
% 1.89/2.11
% 1.89/2.11 ============ end of search ============
% 1.89/2.11
% 1.89/2.11 -------------- statistics -------------
% 1.89/2.11 clauses given 29
% 1.89/2.11 clauses generated 511
% 1.89/2.11 clauses kept 196
% 1.89/2.11 clauses forward subsumed 318
% 1.89/2.11 clauses back subsumed 3
% 1.89/2.11 Kbytes malloced 976
% 1.89/2.11
% 1.89/2.11 ----------- times (seconds) -----------
% 1.89/2.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.89/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.11
% 1.89/2.11 That finishes the proof of the theorem.
% 1.89/2.11
% 1.89/2.11 Process 22820 finished Wed Jul 27 02:30:12 2022
% 1.89/2.11 Otter interrupted
% 1.89/2.11 PROOF FOUND
%------------------------------------------------------------------------------