TSTP Solution File: CAT015-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT015-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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 12:47:49 EDT 2022
% Result : Unknown 1.72s 1.94s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CAT015-3 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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 01:53:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.72/1.94 ----- Otter 3.3f, August 2004 -----
% 1.72/1.94 The process was started by sandbox2 on n005.cluster.edu,
% 1.72/1.94 Wed Jul 27 01:53:35 2022
% 1.72/1.94 The command was "./otter". The process ID is 20381.
% 1.72/1.94
% 1.72/1.94 set(prolog_style_variables).
% 1.72/1.94 set(auto).
% 1.72/1.94 dependent: set(auto1).
% 1.72/1.94 dependent: set(process_input).
% 1.72/1.94 dependent: clear(print_kept).
% 1.72/1.94 dependent: clear(print_new_demod).
% 1.72/1.94 dependent: clear(print_back_demod).
% 1.72/1.94 dependent: clear(print_back_sub).
% 1.72/1.94 dependent: set(control_memory).
% 1.72/1.94 dependent: assign(max_mem, 12000).
% 1.72/1.94 dependent: assign(pick_given_ratio, 4).
% 1.72/1.94 dependent: assign(stats_level, 1).
% 1.72/1.94 dependent: assign(max_seconds, 10800).
% 1.72/1.94 clear(print_given).
% 1.72/1.94
% 1.72/1.94 list(usable).
% 1.72/1.94 0 [] A=A.
% 1.72/1.94 0 [] -e_quivalent(X,Y)|there_exists(X).
% 1.72/1.94 0 [] -e_quivalent(X,Y)|X=Y.
% 1.72/1.94 0 [] -there_exists(X)|X!=Y|e_quivalent(X,Y).
% 1.72/1.94 0 [] -there_exists(domain(X))|there_exists(X).
% 1.72/1.94 0 [] -there_exists(codomain(X))|there_exists(X).
% 1.72/1.94 0 [] -there_exists(compose(X,Y))|there_exists(domain(X)).
% 1.72/1.94 0 [] -there_exists(compose(X,Y))|domain(X)=codomain(Y).
% 1.72/1.94 0 [] -there_exists(domain(X))|domain(X)!=codomain(Y)|there_exists(compose(X,Y)).
% 1.72/1.94 0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.72/1.94 0 [] compose(X,domain(X))=X.
% 1.72/1.94 0 [] compose(codomain(X),X)=X.
% 1.72/1.94 0 [] -e_quivalent(X,Y)|there_exists(Y).
% 1.72/1.94 0 [] -there_exists(X)| -there_exists(Y)|X!=Y|e_quivalent(X,Y).
% 1.72/1.94 0 [] -there_exists(compose(X,Y))|there_exists(codomain(X)).
% 1.72/1.94 0 [] there_exists(f1(X,Y))|X=Y.
% 1.72/1.94 0 [] X=f1(X,Y)|Y=f1(X,Y)|X=Y.
% 1.72/1.94 0 [] X!=f1(X,Y)|Y!=f1(X,Y)|X=Y.
% 1.72/1.94 0 [] X=Y|there_exists(X)|there_exists(Y).
% 1.72/1.94 0 [] -there_exists(X).
% 1.72/1.94 end_of_list.
% 1.72/1.94
% 1.72/1.94 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.72/1.94
% 1.72/1.94 This ia a non-Horn set with equality. The strategy will be
% 1.72/1.94 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.72/1.94 deletion, with positive clauses in sos and nonpositive
% 1.72/1.94 clauses in usable.
% 1.72/1.94
% 1.72/1.94 dependent: set(knuth_bendix).
% 1.72/1.94 dependent: set(anl_eq).
% 1.72/1.94 dependent: set(para_from).
% 1.72/1.94 dependent: set(para_into).
% 1.72/1.94 dependent: clear(para_from_right).
% 1.72/1.94 dependent: clear(para_into_right).
% 1.72/1.94 dependent: set(para_from_vars).
% 1.72/1.94 dependent: set(eq_units_both_ways).
% 1.72/1.94 dependent: set(dynamic_demod_all).
% 1.72/1.94 dependent: set(dynamic_demod).
% 1.72/1.94 dependent: set(order_eq).
% 1.72/1.94 dependent: set(back_demod).
% 1.72/1.94 dependent: set(lrpo).
% 1.72/1.94 dependent: set(hyper_res).
% 1.72/1.94 dependent: set(unit_deletion).
% 1.72/1.94 dependent: set(factor).
% 1.72/1.94
% 1.72/1.94 ------------> process usable:
% 1.72/1.94 ** KEPT (pick-wt=5): 1 [] -e_quivalent(A,B)|there_exists(A).
% 1.72/1.94 ** KEPT (pick-wt=6): 2 [] -e_quivalent(A,B)|A=B.
% 1.72/1.94 ** KEPT (pick-wt=8): 3 [] -there_exists(A)|A!=B|e_quivalent(A,B).
% 1.72/1.94 ** KEPT (pick-wt=5): 4 [] -there_exists(domain(A))|there_exists(A).
% 1.72/1.94 ** KEPT (pick-wt=5): 5 [] -there_exists(codomain(A))|there_exists(A).
% 1.72/1.94 ** KEPT (pick-wt=7): 6 [] -there_exists(compose(A,B))|there_exists(domain(A)).
% 1.72/1.94 ** KEPT (pick-wt=9): 7 [] -there_exists(compose(A,B))|domain(A)=codomain(B).
% 1.72/1.94 ** KEPT (pick-wt=12): 8 [] -there_exists(domain(A))|domain(A)!=codomain(B)|there_exists(compose(A,B)).
% 1.72/1.94 ** KEPT (pick-wt=5): 9 [] -e_quivalent(A,B)|there_exists(B).
% 1.72/1.94 Following clause subsumed by 3 during input processing: 0 [] -there_exists(A)| -there_exists(B)|A!=B|e_quivalent(A,B).
% 1.72/1.94 ** KEPT (pick-wt=7): 10 [] -there_exists(compose(A,B))|there_exists(codomain(A)).
% 1.72/1.94 ** KEPT (pick-wt=13): 12 [copy,11,flip.1,flip.2] f1(A,B)!=A|f1(A,B)!=B|A=B.
% 1.72/1.94 ** KEPT (pick-wt=2): 13 [] -there_exists(A).
% 1.72/1.94 13 back subsumes 10.
% 1.72/1.94 13 back subsumes 8.
% 1.72/1.94 13 back subsumes 7.
% 1.72/1.94 13 back subsumes 6.
% 1.72/1.94 13 back subsumes 5.
% 1.72/1.94 13 back subsumes 4.
% 1.72/1.94 13 back subsumes 3.
% 1.72/1.94
% 1.72/1.94 ------------> process sos:
% 1.72/1.94 ** KEPT (pick-wt=3): 15 [] A=A.
% 1.72/1.94 ** KEPT (pick-wt=11): 17 [copy,16,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.72/1.94 ---> New Demodulator: 18 [new_demod,17] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.72/1.94 ** KEPT (pick-wt=6): 19 [] compose(A,domain(A))=A.
% 1.72/1.94 ---> New Demodulator: 20 [new_demod,19] compose(A,domain(A))=A.
% 1.72/1.94 ** KEPT (pick-wt=6): 21 [] compose(codomain(A),A)=A.
% 1.72/1.94 ---> New Demodulator: 22 [new_demod,21] compose(codomain(A),A)=A.
% 1.72/1.94 ** KEPT (pick-wt=3): 24 [copy,23,unit_del,13] A=B.
% 1.72/1.94 Following clause subsumed by 24 during input processing: 0 [flip.1,flip.2] f1(A,B)=A|f1(A,B)=B|A=B.
% 1.72/1.94 Following clause subsumed by 24 during input processing: 0 [unit_del,13,13] A=B.
% 1.72/1.94 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] A=A.
% 1.72/1.94 15 back subsumes 14.
% 1.72/1.94 >>>> Starting back demodulation with 18.
% 1.72/1.94 >>>> Starting back demodulation with 20.
% 1.72/1.94 >>>> Starting back demodulation with 22.
% 1.72/1.94 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] A=B.
% 1.72/1.94 24 back subsumes 21.
% 1.72/1.94 24 back subsumes 19.
% 1.72/1.94 24 back subsumes 17.
% 1.72/1.94 24 back subsumes 15.
% 1.72/1.94 24 back subsumes 12.
% 1.72/1.94 24 back subsumes 2.
% 1.72/1.94
% 1.72/1.94 ======= end of input processing =======
% 1.72/1.94
% 1.72/1.94 =========== start of search ===========
% 1.72/1.94
% 1.72/1.94 Search stopped because sos empty.
% 1.72/1.94
% 1.72/1.94
% 1.72/1.94 Search stopped because sos empty.
% 1.72/1.94
% 1.72/1.94 ============ end of search ============
% 1.72/1.94
% 1.72/1.94 -------------- statistics -------------
% 1.72/1.94 clauses given 1
% 1.72/1.94 clauses generated 1
% 1.72/1.94 clauses kept 18
% 1.72/1.94 clauses forward subsumed 5
% 1.72/1.94 clauses back subsumed 14
% 1.72/1.94 Kbytes malloced 976
% 1.72/1.94
% 1.72/1.94 ----------- times (seconds) -----------
% 1.72/1.94 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.94 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.72/1.94
% 1.72/1.94 Process 20381 finished Wed Jul 27 01:53:37 2022
% 1.72/1.94 Otter interrupted
% 1.72/1.94 PROOF NOT FOUND
%------------------------------------------------------------------------------