TSTP Solution File: SET895+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET895+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:29 EDT 2022
% Result : Unknown 3.44s 3.65s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET895+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 10:40:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.75/1.92 ----- Otter 3.3f, August 2004 -----
% 1.75/1.92 The process was started by sandbox on n003.cluster.edu,
% 1.75/1.92 Wed Jul 27 10:40:11 2022
% 1.75/1.92 The command was "./otter". The process ID is 19272.
% 1.75/1.92
% 1.75/1.92 set(prolog_style_variables).
% 1.75/1.92 set(auto).
% 1.75/1.92 dependent: set(auto1).
% 1.75/1.92 dependent: set(process_input).
% 1.75/1.92 dependent: clear(print_kept).
% 1.75/1.92 dependent: clear(print_new_demod).
% 1.75/1.92 dependent: clear(print_back_demod).
% 1.75/1.92 dependent: clear(print_back_sub).
% 1.75/1.92 dependent: set(control_memory).
% 1.75/1.92 dependent: assign(max_mem, 12000).
% 1.75/1.92 dependent: assign(pick_given_ratio, 4).
% 1.75/1.92 dependent: assign(stats_level, 1).
% 1.75/1.92 dependent: assign(max_seconds, 10800).
% 1.75/1.92 clear(print_given).
% 1.75/1.92
% 1.75/1.92 formula_list(usable).
% 1.75/1.92 all A (A=A).
% 1.75/1.92 all A B (in(A,B)-> -in(B,A)).
% 1.75/1.92 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.75/1.92 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.75/1.92 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.75/1.92 all A B C (C=cartesian_product2(A,B)<-> (all D (in(D,C)<-> (exists E F (in(E,A)&in(F,B)&D=ordered_pair(E,F)))))).
% 1.75/1.92 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.75/1.92 all A B (-empty(ordered_pair(A,B))).
% 1.75/1.92 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.75/1.92 exists A empty(A).
% 1.75/1.92 exists A (-empty(A)).
% 1.75/1.92 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.75/1.92 -(all A B C (cartesian_product2(singleton(A),unordered_pair(B,C))=unordered_pair(ordered_pair(A,B),ordered_pair(A,C))&cartesian_product2(unordered_pair(A,B),singleton(C))=unordered_pair(ordered_pair(A,C),ordered_pair(B,C)))).
% 1.75/1.92 end_of_list.
% 1.75/1.92
% 1.75/1.92 -------> usable clausifies to:
% 1.75/1.92
% 1.75/1.92 list(usable).
% 1.75/1.92 0 [] A=A.
% 1.75/1.92 0 [] -in(A,B)| -in(B,A).
% 1.75/1.92 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.75/1.92 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.75/1.92 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.75/1.92 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.75/1.92 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.75/1.92 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.75/1.92 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.75/1.92 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.75/1.92 0 [] C=unordered_pair(A,B)|in($f2(A,B,C),C)|$f2(A,B,C)=A|$f2(A,B,C)=B.
% 1.75/1.92 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=A.
% 1.75/1.92 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=B.
% 1.75/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f4(A,B,C,D),A).
% 1.75/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f3(A,B,C,D),B).
% 1.75/1.92 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f4(A,B,C,D),$f3(A,B,C,D)).
% 1.75/1.92 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 1.75/1.92 0 [] C=cartesian_product2(A,B)|in($f7(A,B,C),C)|in($f6(A,B,C),A).
% 1.75/1.92 0 [] C=cartesian_product2(A,B)|in($f7(A,B,C),C)|in($f5(A,B,C),B).
% 1.75/1.92 0 [] C=cartesian_product2(A,B)|in($f7(A,B,C),C)|$f7(A,B,C)=ordered_pair($f6(A,B,C),$f5(A,B,C)).
% 1.75/1.92 0 [] C=cartesian_product2(A,B)| -in($f7(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f7(A,B,C)!=ordered_pair(X1,X2).
% 1.75/1.92 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.75/1.92 0 [] -empty(ordered_pair(A,B)).
% 1.75/1.92 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.75/1.92 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.75/1.92 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.75/1.92 0 [] empty($c1).
% 1.75/1.92 0 [] -empty($c2).
% 1.75/1.92 0 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 1.75/1.92 0 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 1.75/1.92 0 [] cartesian_product2(singleton($c5),unordered_pair($c4,$c3))!=unordered_pair(ordered_pair($c5,$c4),ordered_pair($c5,$c3))|cartesian_product2(unordered_pair($c5,$c4),singleton($c3))!=unordered_pair(ordered_pair($c5,$c3),ordered_pair($c4,$c3)).
% 1.75/1.92 end_of_list.
% 1.75/1.92
% 1.75/1.92 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.75/1.92
% 1.75/1.92 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.92 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.92 deletion, with positive clauses in sos and nonpositive
% 1.75/1.92 clauses in usable.
% 1.75/1.92
% 1.75/1.92 dependent: set(knuth_bendix).
% 1.75/1.92 dependent: set(anl_eq).
% 1.75/1.92 dependent: set(para_from).
% 1.75/1.92 dependent: set(para_into).
% 1.75/1.92 dependent: clear(para_from_right).
% 1.75/1.92 dependent: clear(para_into_right).
% 1.75/1.92 dependent: set(para_from_vars).
% 1.75/1.92 dependent: set(eq_units_both_ways).
% 1.75/1.92 dependent: set(dynamic_demod_all).
% 1.75/1.92 dependent: set(dynamic_demod).
% 1.75/1.92 dependent: set(order_eq).
% 1.75/1.92 dependent: set(back_demod).
% 1.75/1.92 dependent: set(lrpo).
% 3.44/3.65 dependent: set(hyper_res).
% 3.44/3.65 dependent: set(unit_deletion).
% 3.44/3.65 dependent: set(factor).
% 3.44/3.65
% 3.44/3.65 ------------> process usable:
% 3.44/3.65 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 3.44/3.65 ** KEPT (pick-wt=10): 2 [] A!=singleton(B)| -in(C,A)|C=B.
% 3.44/3.65 ** KEPT (pick-wt=10): 3 [] A!=singleton(B)|in(C,A)|C!=B.
% 3.44/3.65 ** KEPT (pick-wt=14): 4 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 3.44/3.65 ** KEPT (pick-wt=14): 5 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 3.44/3.65 ** KEPT (pick-wt=11): 6 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 3.44/3.65 ** KEPT (pick-wt=11): 7 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 3.44/3.65 ** KEPT (pick-wt=17): 8 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=B.
% 3.44/3.65 ** KEPT (pick-wt=17): 9 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=C.
% 3.44/3.65 ** KEPT (pick-wt=15): 10 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f4(B,C,A,D),B).
% 3.44/3.65 ** KEPT (pick-wt=15): 11 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f3(B,C,A,D),C).
% 3.44/3.65 ** KEPT (pick-wt=21): 13 [copy,12,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f4(B,C,A,D),$f3(B,C,A,D))=D.
% 3.44/3.65 ** KEPT (pick-wt=19): 14 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 3.44/3.65 ** KEPT (pick-wt=25): 15 [] A=cartesian_product2(B,C)| -in($f7(B,C,A),A)| -in(D,B)| -in(E,C)|$f7(B,C,A)!=ordered_pair(D,E).
% 3.44/3.65 ** KEPT (pick-wt=4): 16 [] -empty(ordered_pair(A,B)).
% 3.44/3.65 ** KEPT (pick-wt=10): 17 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 3.44/3.65 ** KEPT (pick-wt=10): 18 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 3.44/3.65 ** KEPT (pick-wt=13): 19 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 3.44/3.65 ** KEPT (pick-wt=2): 20 [] -empty($c2).
% 3.44/3.65 ** KEPT (pick-wt=13): 21 [] -in($f8(A,B),A)| -in($f8(A,B),B)|A=B.
% 3.44/3.65 ** KEPT (pick-wt=28): 22 [] cartesian_product2(singleton($c5),unordered_pair($c4,$c3))!=unordered_pair(ordered_pair($c5,$c4),ordered_pair($c5,$c3))|cartesian_product2(unordered_pair($c5,$c4),singleton($c3))!=unordered_pair(ordered_pair($c5,$c3),ordered_pair($c4,$c3)).
% 3.44/3.65
% 3.44/3.65 ------------> process sos:
% 3.44/3.65 ** KEPT (pick-wt=3): 32 [] A=A.
% 3.44/3.65 ** KEPT (pick-wt=7): 33 [] unordered_pair(A,B)=unordered_pair(B,A).
% 3.44/3.65 ** KEPT (pick-wt=14): 34 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 3.44/3.65 ** KEPT (pick-wt=23): 35 [] A=unordered_pair(B,C)|in($f2(B,C,A),A)|$f2(B,C,A)=B|$f2(B,C,A)=C.
% 3.44/3.65 ** KEPT (pick-wt=17): 36 [] A=cartesian_product2(B,C)|in($f7(B,C,A),A)|in($f6(B,C,A),B).
% 3.44/3.65 ** KEPT (pick-wt=17): 37 [] A=cartesian_product2(B,C)|in($f7(B,C,A),A)|in($f5(B,C,A),C).
% 3.44/3.65 ** KEPT (pick-wt=25): 39 [copy,38,flip.3] A=cartesian_product2(B,C)|in($f7(B,C,A),A)|ordered_pair($f6(B,C,A),$f5(B,C,A))=$f7(B,C,A).
% 3.44/3.65 ** KEPT (pick-wt=10): 41 [copy,40,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 3.44/3.65 ---> New Demodulator: 42 [new_demod,41] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 3.44/3.65 ** KEPT (pick-wt=2): 43 [] empty($c1).
% 3.44/3.65 ** KEPT (pick-wt=13): 44 [] in($f8(A,B),A)|in($f8(A,B),B)|A=B.
% 3.44/3.65 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] A=A.
% 3.44/3.65 32 back subsumes 30.
% 3.44/3.65 Following clause subsumed by 33 during input processing: 0 [copy,33,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 3.44/3.65 >>>> Starting back demodulation with 42.
% 3.44/3.65
% 3.44/3.65 ======= end of input processing =======
% 3.44/3.65
% 3.44/3.65 =========== start of search ===========
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 13.
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 13.
% 3.44/3.65
% 3.44/3.65 sos_size=398
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 11.
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 11.
% 3.44/3.65
% 3.44/3.65 sos_size=80
% 3.44/3.65
% 3.44/3.65 Search stopped because sos empty.
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Search stopped because sos empty.
% 3.44/3.65
% 3.44/3.65 ============ end of search ============
% 3.44/3.65
% 3.44/3.65 -------------- statistics -------------
% 3.44/3.65 clauses given 173
% 3.44/3.65 clauses generated 86015
% 3.44/3.65 clauses kept 499
% 3.44/3.65 clauses forward subsumed 1001
% 3.44/3.65 clauses back subsumed 8
% 3.44/3.65 Kbytes malloced 4882
% 3.44/3.65
% 3.44/3.65 ----------- times (seconds) -----------
% 3.44/3.65 user CPU time 1.73 (0 hr, 0 min, 1 sec)
% 3.44/3.65 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 3.44/3.65 wall-clock time 4 (0 hr, 0 min, 4 sec)
% 3.44/3.65
% 3.44/3.65 Process 19272 finished Wed Jul 27 10:40:15 2022
% 3.44/3.65 Otter interrupted
% 3.44/3.65 PROOF NOT FOUND
%------------------------------------------------------------------------------