TSTP Solution File: SEU166+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:15:01 EDT 2022
% Result : Unknown 160.18s 160.39s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU166+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 07:50:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.99/2.18 ----- Otter 3.3f, August 2004 -----
% 1.99/2.18 The process was started by sandbox on n013.cluster.edu,
% 1.99/2.18 Wed Jul 27 07:50:00 2022
% 1.99/2.18 The command was "./otter". The process ID is 22633.
% 1.99/2.18
% 1.99/2.18 set(prolog_style_variables).
% 1.99/2.18 set(auto).
% 1.99/2.18 dependent: set(auto1).
% 1.99/2.18 dependent: set(process_input).
% 1.99/2.18 dependent: clear(print_kept).
% 1.99/2.18 dependent: clear(print_new_demod).
% 1.99/2.18 dependent: clear(print_back_demod).
% 1.99/2.18 dependent: clear(print_back_sub).
% 1.99/2.18 dependent: set(control_memory).
% 1.99/2.18 dependent: assign(max_mem, 12000).
% 1.99/2.18 dependent: assign(pick_given_ratio, 4).
% 1.99/2.18 dependent: assign(stats_level, 1).
% 1.99/2.18 dependent: assign(max_seconds, 10800).
% 1.99/2.18 clear(print_given).
% 1.99/2.18
% 1.99/2.18 formula_list(usable).
% 1.99/2.18 all A (A=A).
% 1.99/2.18 all A B (in(A,B)-> -in(B,A)).
% 1.99/2.18 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.99/2.18 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.99/2.18 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.99/2.18 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.99/2.18 all A B (-empty(ordered_pair(A,B))).
% 1.99/2.18 exists A empty(A).
% 1.99/2.18 exists A (-empty(A)).
% 1.99/2.18 all A B subset(A,A).
% 1.99/2.18 -(all A B C (subset(A,B)->subset(cartesian_product2(A,C),cartesian_product2(B,C))&subset(cartesian_product2(C,A),cartesian_product2(C,B)))).
% 1.99/2.18 end_of_list.
% 1.99/2.18
% 1.99/2.18 -------> usable clausifies to:
% 1.99/2.18
% 1.99/2.18 list(usable).
% 1.99/2.18 0 [] A=A.
% 1.99/2.18 0 [] -in(A,B)| -in(B,A).
% 1.99/2.18 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.99/2.18 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f2(A,B,C,D),A).
% 1.99/2.18 0 [] C!=cartesian_product2(A,B)| -in(D,C)|in($f1(A,B,C,D),B).
% 1.99/2.18 0 [] C!=cartesian_product2(A,B)| -in(D,C)|D=ordered_pair($f2(A,B,C,D),$f1(A,B,C,D)).
% 1.99/2.18 0 [] C!=cartesian_product2(A,B)|in(D,C)| -in(E,A)| -in(F,B)|D!=ordered_pair(E,F).
% 1.99/2.18 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|in($f4(A,B,C),A).
% 1.99/2.18 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|in($f3(A,B,C),B).
% 1.99/2.18 0 [] C=cartesian_product2(A,B)|in($f5(A,B,C),C)|$f5(A,B,C)=ordered_pair($f4(A,B,C),$f3(A,B,C)).
% 1.99/2.18 0 [] C=cartesian_product2(A,B)| -in($f5(A,B,C),C)| -in(X1,A)| -in(X2,B)|$f5(A,B,C)!=ordered_pair(X1,X2).
% 1.99/2.18 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.99/2.18 0 [] subset(A,B)|in($f6(A,B),A).
% 1.99/2.18 0 [] subset(A,B)| -in($f6(A,B),B).
% 1.99/2.18 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.99/2.18 0 [] -empty(ordered_pair(A,B)).
% 1.99/2.18 0 [] empty($c1).
% 1.99/2.18 0 [] -empty($c2).
% 1.99/2.18 0 [] subset(A,A).
% 1.99/2.18 0 [] subset($c5,$c4).
% 1.99/2.18 0 [] -subset(cartesian_product2($c5,$c3),cartesian_product2($c4,$c3))| -subset(cartesian_product2($c3,$c5),cartesian_product2($c3,$c4)).
% 1.99/2.18 end_of_list.
% 1.99/2.18
% 1.99/2.18 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.99/2.18
% 1.99/2.18 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.18 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.18 deletion, with positive clauses in sos and nonpositive
% 1.99/2.18 clauses in usable.
% 1.99/2.18
% 1.99/2.18 dependent: set(knuth_bendix).
% 1.99/2.18 dependent: set(anl_eq).
% 1.99/2.18 dependent: set(para_from).
% 1.99/2.18 dependent: set(para_into).
% 1.99/2.18 dependent: clear(para_from_right).
% 1.99/2.18 dependent: clear(para_into_right).
% 1.99/2.18 dependent: set(para_from_vars).
% 1.99/2.18 dependent: set(eq_units_both_ways).
% 1.99/2.18 dependent: set(dynamic_demod_all).
% 1.99/2.18 dependent: set(dynamic_demod).
% 1.99/2.18 dependent: set(order_eq).
% 1.99/2.18 dependent: set(back_demod).
% 1.99/2.18 dependent: set(lrpo).
% 1.99/2.18 dependent: set(hyper_res).
% 1.99/2.18 dependent: set(unit_deletion).
% 1.99/2.18 dependent: set(factor).
% 1.99/2.18
% 1.99/2.18 ------------> process usable:
% 1.99/2.18 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.99/2.18 ** KEPT (pick-wt=15): 2 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f2(B,C,A,D),B).
% 1.99/2.18 ** KEPT (pick-wt=15): 3 [] A!=cartesian_product2(B,C)| -in(D,A)|in($f1(B,C,A,D),C).
% 1.99/2.18 ** KEPT (pick-wt=21): 5 [copy,4,flip.3] A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f2(B,C,A,D),$f1(B,C,A,D))=D.
% 1.99/2.18 ** KEPT (pick-wt=19): 6 [] A!=cartesian_product2(B,C)|in(D,A)| -in(E,B)| -in(F,C)|D!=ordered_pair(E,F).
% 1.99/2.18 ** KEPT (pick-wt=25): 7 [] A=cartesian_product2(B,C)| -in($f5(B,C,A),A)| -in(D,B)| -in(E,C)|$f5(B,C,A)!=ordered_pair(D,E).
% 1.99/2.18 ** KEPT (pick-wt=9): 8 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.99/2.18 ** KEPT (pick-wt=8): 9 [] subset(A,B)| -in($f6(A,B),B).
% 1.99/2.18 ** KEPT (pick-wt=4): 10 [] -empty(ordered_pair(A,B)).
% 1.99/2.18 ** KEPT (pick-wt=2): 11 [] -empty($c2).
% 1.99/2.18 ** KEPT (pick-wt=14): 12 [] -subset(cartesian_product2($c5,$c3),cartesian_product2($c4,$c3))| -subset(cartesian_product2($c3,$c5),cartesian_product2($c3,$c4)).
% 160.18/160.39
% 160.18/160.39 ------------> process sos:
% 160.18/160.39 ** KEPT (pick-wt=3): 19 [] A=A.
% 160.18/160.39 ** KEPT (pick-wt=7): 20 [] unordered_pair(A,B)=unordered_pair(B,A).
% 160.18/160.39 ** KEPT (pick-wt=17): 21 [] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|in($f4(B,C,A),B).
% 160.18/160.39 ** KEPT (pick-wt=17): 22 [] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|in($f3(B,C,A),C).
% 160.18/160.39 ** KEPT (pick-wt=25): 24 [copy,23,flip.3] A=cartesian_product2(B,C)|in($f5(B,C,A),A)|ordered_pair($f4(B,C,A),$f3(B,C,A))=$f5(B,C,A).
% 160.18/160.39 ** KEPT (pick-wt=8): 25 [] subset(A,B)|in($f6(A,B),A).
% 160.18/160.39 ** KEPT (pick-wt=10): 27 [copy,26,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 160.18/160.39 ---> New Demodulator: 28 [new_demod,27] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 160.18/160.39 ** KEPT (pick-wt=2): 29 [] empty($c1).
% 160.18/160.39 ** KEPT (pick-wt=3): 30 [] subset(A,A).
% 160.18/160.39 ** KEPT (pick-wt=3): 31 [] subset($c5,$c4).
% 160.18/160.39 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 160.18/160.39 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 160.18/160.39 >>>> Starting back demodulation with 28.
% 160.18/160.39
% 160.18/160.39 ======= end of input processing =======
% 160.18/160.39
% 160.18/160.39 =========== start of search ===========
% 160.18/160.39
% 160.18/160.39
% 160.18/160.39 Resetting weight limit to 17.
% 160.18/160.39
% 160.18/160.39
% 160.18/160.39 Resetting weight limit to 17.
% 160.18/160.39
% 160.18/160.39 sos_size=284
% 160.18/160.39
% 160.18/160.39 Search stopped because sos empty.
% 160.18/160.39
% 160.18/160.39
% 160.18/160.39 Search stopped because sos empty.
% 160.18/160.39
% 160.18/160.39 ============ end of search ============
% 160.18/160.39
% 160.18/160.39 -------------- statistics -------------
% 160.18/160.39 clauses given 315
% 160.18/160.39 clauses generated 535928
% 160.18/160.39 clauses kept 332
% 160.18/160.39 clauses forward subsumed 376
% 160.18/160.39 clauses back subsumed 0
% 160.18/160.39 Kbytes malloced 7812
% 160.18/160.39
% 160.18/160.39 ----------- times (seconds) -----------
% 160.18/160.39 user CPU time 158.21 (0 hr, 2 min, 38 sec)
% 160.18/160.39 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 160.18/160.39 wall-clock time 160 (0 hr, 2 min, 40 sec)
% 160.18/160.39
% 160.18/160.39 Process 22633 finished Wed Jul 27 07:52:40 2022
% 160.18/160.39 Otter interrupted
% 160.18/160.39 PROOF NOT FOUND
%------------------------------------------------------------------------------