TSTP Solution File: SEU156+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU156+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:14:58 EDT 2022
% Result : Timeout 299.89s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU156+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 07:37:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.02/2.20 ----- Otter 3.3f, August 2004 -----
% 2.02/2.20 The process was started by sandbox2 on n020.cluster.edu,
% 2.02/2.20 Wed Jul 27 07:37:08 2022
% 2.02/2.20 The command was "./otter". The process ID is 16878.
% 2.02/2.20
% 2.02/2.20 set(prolog_style_variables).
% 2.02/2.20 set(auto).
% 2.02/2.20 dependent: set(auto1).
% 2.02/2.20 dependent: set(process_input).
% 2.02/2.20 dependent: clear(print_kept).
% 2.02/2.20 dependent: clear(print_new_demod).
% 2.02/2.20 dependent: clear(print_back_demod).
% 2.02/2.20 dependent: clear(print_back_sub).
% 2.02/2.20 dependent: set(control_memory).
% 2.02/2.20 dependent: assign(max_mem, 12000).
% 2.02/2.20 dependent: assign(pick_given_ratio, 4).
% 2.02/2.20 dependent: assign(stats_level, 1).
% 2.02/2.20 dependent: assign(max_seconds, 10800).
% 2.02/2.20 clear(print_given).
% 2.02/2.20
% 2.02/2.20 formula_list(usable).
% 2.02/2.20 all A (A=A).
% 2.02/2.20 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.02/2.20 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 2.02/2.20 all A B (-empty(ordered_pair(A,B))).
% 2.02/2.20 exists A empty(A).
% 2.02/2.20 exists A (-empty(A)).
% 2.02/2.20 all A B subset(A,A).
% 2.02/2.20 all A B C D (-(unordered_pair(A,B)=unordered_pair(C,D)&A!=C&A!=D)).
% 2.02/2.20 -(all A B C D (ordered_pair(A,B)=ordered_pair(C,D)->A=C&B=D)).
% 2.02/2.20 all A (unordered_pair(A,A)=singleton(A)).
% 2.02/2.20 all A B (subset(singleton(A),singleton(B))->A=B).
% 2.02/2.20 all A B C (singleton(A)=unordered_pair(B,C)->A=B).
% 2.02/2.20 all A B C (singleton(A)=unordered_pair(B,C)->B=C).
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 -------> usable clausifies to:
% 2.02/2.20
% 2.02/2.20 list(usable).
% 2.02/2.20 0 [] A=A.
% 2.02/2.20 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.02/2.20 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 2.02/2.20 0 [] -empty(ordered_pair(A,B)).
% 2.02/2.20 0 [] empty($c1).
% 2.02/2.20 0 [] -empty($c2).
% 2.02/2.20 0 [] subset(A,A).
% 2.02/2.20 0 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.02/2.20 0 [] ordered_pair($c6,$c5)=ordered_pair($c4,$c3).
% 2.02/2.20 0 [] $c6!=$c4|$c5!=$c3.
% 2.02/2.20 0 [] unordered_pair(A,A)=singleton(A).
% 2.02/2.20 0 [] -subset(singleton(A),singleton(B))|A=B.
% 2.02/2.20 0 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.02/2.20 0 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.02/2.20
% 2.02/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.20 deletion, with positive clauses in sos and nonpositive
% 2.02/2.20 clauses in usable.
% 2.02/2.20
% 2.02/2.20 dependent: set(knuth_bendix).
% 2.02/2.20 dependent: set(anl_eq).
% 2.02/2.20 dependent: set(para_from).
% 2.02/2.20 dependent: set(para_into).
% 2.02/2.20 dependent: clear(para_from_right).
% 2.02/2.20 dependent: clear(para_into_right).
% 2.02/2.20 dependent: set(para_from_vars).
% 2.02/2.20 dependent: set(eq_units_both_ways).
% 2.02/2.20 dependent: set(dynamic_demod_all).
% 2.02/2.20 dependent: set(dynamic_demod).
% 2.02/2.20 dependent: set(order_eq).
% 2.02/2.20 dependent: set(back_demod).
% 2.02/2.20 dependent: set(lrpo).
% 2.02/2.20 dependent: set(hyper_res).
% 2.02/2.20 dependent: set(unit_deletion).
% 2.02/2.20 dependent: set(factor).
% 2.02/2.20
% 2.02/2.20 ------------> process usable:
% 2.02/2.20 ** KEPT (pick-wt=4): 1 [] -empty(ordered_pair(A,B)).
% 2.02/2.20 ** KEPT (pick-wt=2): 2 [] -empty($c2).
% 2.02/2.20 ** KEPT (pick-wt=13): 3 [] unordered_pair(A,B)!=unordered_pair(C,D)|A=C|A=D.
% 2.02/2.20 ** KEPT (pick-wt=6): 4 [] $c6!=$c4|$c5!=$c3.
% 2.02/2.20 ** KEPT (pick-wt=8): 5 [] -subset(singleton(A),singleton(B))|A=B.
% 2.02/2.20 ** KEPT (pick-wt=9): 6 [] singleton(A)!=unordered_pair(B,C)|A=B.
% 2.02/2.20 ** KEPT (pick-wt=9): 7 [] singleton(A)!=unordered_pair(B,C)|B=C.
% 2.02/2.20
% 2.02/2.20 ------------> process sos:
% 2.02/2.20 ** KEPT (pick-wt=3): 9 [] A=A.
% 2.02/2.20 ** KEPT (pick-wt=7): 10 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.02/2.20 ** KEPT (pick-wt=10): 12 [copy,11,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.02/2.20 ---> New Demodulator: 13 [new_demod,12] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 2.02/2.20 ** KEPT (pick-wt=2): 14 [] empty($c1).
% 2.02/2.20 ** KEPT (pick-wt=3): 15 [] subset(A,A).
% 2.02/2.20 ** KEPT (pick-wt=7): 16 [] ordered_pair($c6,$c5)=ordered_pair($c4,$c3).
% 2.02/2.20 ---> New Demodulator: 17 [new_demod,16] ordered_pair($c6,$c5)=ordered_pair($c4,$c3).
% 2.02/2.20 ** KEPT (pick-wt=6): 19 [copy,18,flip.1] singleton(A)=unordered_pair(A,A).
% 2.02/2.20 ---> New Demodulator: 20 [new_demod,19] singleton(A)=unordered_pair(A,A).
% 2.02/2.20 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 2.02/2.20 Following clause subsumed by 10 during input processing: 0 [copy,10,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.02/2.20 >>>> Starting back demodulation with 13.
% 2.02/2.20 >>>> Starting back demodulation with 17.
% 2.02/2.20 >>>> Starting back demodulation with 20.
% 2.02/2.20 >> back demoduAlarm clock
% 299.89/300.03 Otter interrupted
% 299.89/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------