TSTP Solution File: NUM382+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : NUM382+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:08:13 EDT 2022
% Result : Unknown 6.25s 6.47s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM382+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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 09:53:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.15/2.33 ----- Otter 3.3f, August 2004 -----
% 2.15/2.33 The process was started by sandbox on n015.cluster.edu,
% 2.15/2.33 Wed Jul 27 09:53:27 2022
% 2.15/2.33 The command was "./otter". The process ID is 17510.
% 2.15/2.33
% 2.15/2.33 set(prolog_style_variables).
% 2.15/2.33 set(auto).
% 2.15/2.33 dependent: set(auto1).
% 2.15/2.33 dependent: set(process_input).
% 2.15/2.33 dependent: clear(print_kept).
% 2.15/2.33 dependent: clear(print_new_demod).
% 2.15/2.33 dependent: clear(print_back_demod).
% 2.15/2.33 dependent: clear(print_back_sub).
% 2.15/2.33 dependent: set(control_memory).
% 2.15/2.33 dependent: assign(max_mem, 12000).
% 2.15/2.33 dependent: assign(pick_given_ratio, 4).
% 2.15/2.33 dependent: assign(stats_level, 1).
% 2.15/2.33 dependent: assign(max_seconds, 10800).
% 2.15/2.33 clear(print_given).
% 2.15/2.33
% 2.15/2.33 formula_list(usable).
% 2.15/2.33 all A (A=A).
% 2.15/2.33 all A B (in(A,B)-> -in(B,A)).
% 2.15/2.33 all A (empty(A)->function(A)).
% 2.15/2.33 all A (empty(A)->relation(A)).
% 2.15/2.33 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.15/2.33 all A B C D E F G (G=unordered_sextuple(A,B,C,D,E,F)<-> (all H (in(H,G)<-> -(H!=A&H!=B&H!=C&H!=D&H!=E&H!=F)))).
% 2.15/2.33 all A exists B element(B,A).
% 2.15/2.33 empty(empty_set).
% 2.15/2.33 relation(empty_set).
% 2.15/2.33 relation_empty_yielding(empty_set).
% 2.15/2.33 empty(empty_set).
% 2.15/2.33 empty(empty_set).
% 2.15/2.33 relation(empty_set).
% 2.15/2.33 exists A (relation(A)&function(A)).
% 2.15/2.33 exists A (empty(A)&relation(A)).
% 2.15/2.33 exists A empty(A).
% 2.15/2.33 exists A (relation(A)&empty(A)&function(A)).
% 2.15/2.33 exists A (-empty(A)&relation(A)).
% 2.15/2.33 exists A (-empty(A)).
% 2.15/2.33 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.15/2.33 exists A (relation(A)&relation_empty_yielding(A)).
% 2.15/2.33 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.15/2.33 exists A (relation(A)&relation_non_empty(A)&function(A)).
% 2.15/2.33 all A B (in(A,B)->element(A,B)).
% 2.15/2.33 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.15/2.33 all A (empty(A)->A=empty_set).
% 2.15/2.33 -(all A B C D E F (-(in(A,B)&in(B,C)&in(C,D)&in(D,E)&in(E,F)&in(F,A)))).
% 2.15/2.33 all A B (-(in(A,B)&empty(B))).
% 2.15/2.33 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 2.15/2.33 all A B (-(empty(A)&A!=B&empty(B))).
% 2.15/2.33 end_of_list.
% 2.15/2.33
% 2.15/2.33 -------> usable clausifies to:
% 2.15/2.33
% 2.15/2.33 list(usable).
% 2.15/2.33 0 [] A=A.
% 2.15/2.33 0 [] -in(A,B)| -in(B,A).
% 2.15/2.33 0 [] -empty(A)|function(A).
% 2.15/2.33 0 [] -empty(A)|relation(A).
% 2.15/2.33 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)| -in(H,G)|H=A|H=B|H=C|H=D|H=E|H=F.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=A.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=B.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=C.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=D.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=E.
% 2.15/2.33 0 [] G!=unordered_sextuple(A,B,C,D,E,F)|in(H,G)|H!=F.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)|in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)=A|$f1(A,B,C,D,E,F,G)=B|$f1(A,B,C,D,E,F,G)=C|$f1(A,B,C,D,E,F,G)=D|$f1(A,B,C,D,E,F,G)=E|$f1(A,B,C,D,E,F,G)=F.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=A.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=B.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=C.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=D.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=E.
% 2.15/2.33 0 [] G=unordered_sextuple(A,B,C,D,E,F)| -in($f1(A,B,C,D,E,F,G),G)|$f1(A,B,C,D,E,F,G)!=F.
% 2.15/2.33 0 [] element($f2(A),A).
% 2.15/2.33 0 [] empty(empty_set).
% 2.15/2.33 0 [] relation(empty_set).
% 2.15/2.33 0 [] relation_empty_yielding(empty_set).
% 2.15/2.33 0 [] empty(empty_set).
% 2.15/2.33 0 [] empty(empty_set).
% 2.15/2.33 0 [] relation(empty_set).
% 2.15/2.33 0 [] relation($c1).
% 2.15/2.33 0 [] function($c1).
% 2.15/2.33 0 [] empty($c2).
% 2.15/2.33 0 [] relation($c2).
% 2.15/2.33 0 [] empty($c3).
% 2.15/2.33 0 [] relation($c4).
% 2.15/2.33 0 [] empty($c4).
% 2.15/2.33 0 [] function($c4).
% 2.15/2.33 0 [] -empty($c5).
% 2.15/2.33 0 [] relation($c5).
% 2.15/2.33 0 [] -empty($c6).
% 2.15/2.33 0 [] relation($c7).
% 2.15/2.33 0 [] function($c7).
% 2.15/2.33 0 [] one_to_one($c7).
% 2.15/2.33 0 [] relation($c8).
% 2.15/2.33 0 [] relation_empty_yielding($c8).
% 2.15/2.33 0 [] relation($c9).
% 2.15/2.33 0 [] relation_empty_yielding($c9).
% 2.15/2.33 0 [] function($c9).
% 2.15/2.33 0 [] relation($c10).
% 2.15/2.33 0 [] relation_non_empty($c10).
% 2.15/2.33 0 [] function($c10).
% 2.15/2.33 0 [] -in(A,B)|element(A,B).
% 2.15/2.33 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.15/2.33 0 [] -empty(A)|A=empty_set.
% 2.15/2.33 0 [] in($c16,$c15).
% 2.15/2.33 0 [] in($c15,$c14).
% 2.15/2.33 0 [] in($c14,$c13).
% 2.15/2.33 0 [] in($c13,$c12).
% 2.15/2.33 0 [] in($c12,$c11).
% 2.15/2.33 0 [] in($c11,$c16).
% 2.15/2.33 0 [] -in(A,B)| -empty(B).
% 2.15/2.33 0 [] -in(A,B)|in($f3(A,B),B).
% 2.25/2.43 0 [] -in(A,B)| -in(D,B)| -in(D,$f3(A,B)).
% 2.25/2.43 0 [] -empty(A)|A=B| -empty(B).
% 2.25/2.43 end_of_list.
% 2.25/2.43
% 2.25/2.43 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 2.25/2.43
% 2.25/2.43 This ia a non-Horn set with equality. The strategy will be
% 2.25/2.43 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.25/2.43 deletion, with positive clauses in sos and nonpositive
% 2.25/2.43 clauses in usable.
% 2.25/2.43
% 2.25/2.43 dependent: set(knuth_bendix).
% 2.25/2.43 dependent: set(anl_eq).
% 2.25/2.43 dependent: set(para_from).
% 2.25/2.43 dependent: set(para_into).
% 2.25/2.43 dependent: clear(para_from_right).
% 2.25/2.43 dependent: clear(para_into_right).
% 2.25/2.43 dependent: set(para_from_vars).
% 2.25/2.43 dependent: set(eq_units_both_ways).
% 2.25/2.43 dependent: set(dynamic_demod_all).
% 2.25/2.43 dependent: set(dynamic_demod).
% 2.25/2.43 dependent: set(order_eq).
% 2.25/2.43 dependent: set(back_demod).
% 2.25/2.43 dependent: set(lrpo).
% 2.25/2.43 dependent: set(hyper_res).
% 2.25/2.43 dependent: set(unit_deletion).
% 2.25/2.43 dependent: set(factor).
% 2.25/2.43
% 2.25/2.43 ------------> process usable:
% 2.25/2.43 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.25/2.43 ** KEPT (pick-wt=4): 2 [] -empty(A)|function(A).
% 2.25/2.43 ** KEPT (pick-wt=4): 3 [] -empty(A)|relation(A).
% 2.25/2.43 ** KEPT (pick-wt=8): 4 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.25/2.43 ** KEPT (pick-wt=30): 5 [] A!=unordered_sextuple(B,C,D,E,F,G)| -in(H,A)|H=B|H=C|H=D|H=E|H=F|H=G.
% 2.25/2.43 ** KEPT (pick-wt=15): 6 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=B.
% 2.25/2.43 ** KEPT (pick-wt=15): 7 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=C.
% 2.25/2.43 ** KEPT (pick-wt=15): 8 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=D.
% 2.25/2.43 ** KEPT (pick-wt=15): 9 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=E.
% 2.25/2.43 ** KEPT (pick-wt=15): 10 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=F.
% 2.25/2.43 ** KEPT (pick-wt=15): 11 [] A!=unordered_sextuple(B,C,D,E,F,G)|in(H,A)|H!=G.
% 2.25/2.43 ** KEPT (pick-wt=29): 12 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=B.
% 2.25/2.43 ** KEPT (pick-wt=29): 13 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=C.
% 2.25/2.43 ** KEPT (pick-wt=29): 14 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=D.
% 2.25/2.43 ** KEPT (pick-wt=29): 15 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=E.
% 2.25/2.43 ** KEPT (pick-wt=29): 16 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=F.
% 2.25/2.43 ** KEPT (pick-wt=29): 17 [] A=unordered_sextuple(B,C,D,E,F,G)| -in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)!=G.
% 2.25/2.43 ** KEPT (pick-wt=2): 18 [] -empty($c5).
% 2.25/2.43 ** KEPT (pick-wt=2): 19 [] -empty($c6).
% 2.25/2.43 ** KEPT (pick-wt=6): 20 [] -in(A,B)|element(A,B).
% 2.25/2.43 ** KEPT (pick-wt=8): 21 [] -element(A,B)|empty(B)|in(A,B).
% 2.25/2.43 ** KEPT (pick-wt=5): 22 [] -empty(A)|A=empty_set.
% 2.25/2.43 ** KEPT (pick-wt=5): 23 [] -in(A,B)| -empty(B).
% 2.25/2.43 ** KEPT (pick-wt=8): 24 [] -in(A,B)|in($f3(A,B),B).
% 2.25/2.43 ** KEPT (pick-wt=11): 25 [] -in(A,B)| -in(C,B)| -in(C,$f3(A,B)).
% 2.25/2.43 ** KEPT (pick-wt=7): 26 [] -empty(A)|A=B| -empty(B).
% 2.25/2.43
% 2.25/2.43 ------------> process sos:
% 2.25/2.43 ** KEPT (pick-wt=3): 232 [] A=A.
% 2.25/2.43 ** KEPT (pick-wt=79): 233 [] A=unordered_sextuple(B,C,D,E,F,G)|in($f1(B,C,D,E,F,G,A),A)|$f1(B,C,D,E,F,G,A)=B|$f1(B,C,D,E,F,G,A)=C|$f1(B,C,D,E,F,G,A)=D|$f1(B,C,D,E,F,G,A)=E|$f1(B,C,D,E,F,G,A)=F|$f1(B,C,D,E,F,G,A)=G.
% 2.25/2.43 ** KEPT (pick-wt=4): 234 [] element($f2(A),A).
% 2.25/2.43 ** KEPT (pick-wt=2): 235 [] empty(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 236 [] relation(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 237 [] relation_empty_yielding(empty_set).
% 2.25/2.43 Following clause subsumed by 235 during input processing: 0 [] empty(empty_set).
% 2.25/2.43 Following clause subsumed by 235 during input processing: 0 [] empty(empty_set).
% 2.25/2.43 Following clause subsumed by 236 during input processing: 0 [] relation(empty_set).
% 2.25/2.43 ** KEPT (pick-wt=2): 238 [] relation($c1).
% 2.25/2.43 ** KEPT (pick-wt=2): 239 [] function($c1).
% 2.25/2.43 ** KEPT (pick-wt=2): 240 [] empty($c2).
% 2.25/2.43 ** KEPT (pick-wt=2): 241 [] relation($c2).
% 2.25/2.43 ** KEPT (pick-wt=2): 242 [] empty($c3).
% 2.25/2.43 ** KEPT (pick-wt=2): 243 [] relation($c4).
% 2.25/2.43 ** KEPT (pick-wt=2): 244 [] empty($c4).
% 2.25/2.43 ** KEPT (pick-wt=2): 245 [] function($c4).
% 2.25/2.43 ** KEPT (pick-wt=2): 246 [] relation($c5).
% 2.25/2.43 ** KEPT (pick-wt=2): 247 [] relation($c7).
% 2.25/2.43 ** KEPT (pick-wt=2): 248 [] function($c7).
% 2.25/2.43 ** KEPT (pick-wt=2): 249 [] one_to_one($c7).
% 2.25/2.43 ** KEPT (pick-wt=2): 250 [] relation($c8).
% 2.25/2.43 ** KEPT (pick-wt=2): 251 [] relation_empty_yielding($c8).
% 6.25/6.47 ** KEPT (pick-wt=2): 252 [] relation($c9).
% 6.25/6.47 ** KEPT (pick-wt=2): 253 [] relation_empty_yielding($c9).
% 6.25/6.47 ** KEPT (pick-wt=2): 254 [] function($c9).
% 6.25/6.47 ** KEPT (pick-wt=2): 255 [] relation($c10).
% 6.25/6.47 ** KEPT (pick-wt=2): 256 [] relation_non_empty($c10).
% 6.25/6.47 ** KEPT (pick-wt=2): 257 [] function($c10).
% 6.25/6.47 ** KEPT (pick-wt=3): 258 [] in($c16,$c15).
% 6.25/6.47 ** KEPT (pick-wt=3): 259 [] in($c15,$c14).
% 6.25/6.47 ** KEPT (pick-wt=3): 260 [] in($c14,$c13).
% 6.25/6.47 ** KEPT (pick-wt=3): 261 [] in($c13,$c12).
% 6.25/6.47 ** KEPT (pick-wt=3): 262 [] in($c12,$c11).
% 6.25/6.47 ** KEPT (pick-wt=3): 263 [] in($c11,$c16).
% 6.25/6.47 Following clause subsumed by 232 during input processing: 0 [copy,232,flip.1] A=A.
% 6.25/6.47 232 back subsumes 44.
% 6.25/6.47
% 6.25/6.47 ======= end of input processing =======
% 6.25/6.47
% 6.25/6.47 =========== start of search ===========
% 6.25/6.47
% 6.25/6.47 Search stopped in tp_alloc by max_mem option.
% 6.25/6.47
% 6.25/6.47 Search stopped in tp_alloc by max_mem option.
% 6.25/6.47
% 6.25/6.47 ============ end of search ============
% 6.25/6.47
% 6.25/6.47 -------------- statistics -------------
% 6.25/6.47 clauses given 6
% 6.25/6.47 clauses generated 13079
% 6.25/6.47 clauses kept 5435
% 6.25/6.47 clauses forward subsumed 7704
% 6.25/6.47 clauses back subsumed 1
% 6.25/6.47 Kbytes malloced 11718
% 6.25/6.47
% 6.25/6.47 ----------- times (seconds) -----------
% 6.25/6.47 user CPU time 4.23 (0 hr, 0 min, 4 sec)
% 6.25/6.47 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 6.25/6.47 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.25/6.47
% 6.25/6.47 Process 17510 finished Wed Jul 27 09:53:33 2022
% 6.25/6.47 Otter interrupted
% 6.25/6.47 PROOF NOT FOUND
%------------------------------------------------------------------------------