TSTP Solution File: SET888+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET888+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:28 EDT 2022
% Result : Timeout 299.82s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET888+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n024.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 10:49:10 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox on n024.cluster.edu,
% 1.72/1.93 Wed Jul 27 10:49:10 2022
% 1.72/1.93 The command was "./otter". The process ID is 11029.
% 1.72/1.93
% 1.72/1.93 set(prolog_style_variables).
% 1.72/1.93 set(auto).
% 1.72/1.93 dependent: set(auto1).
% 1.72/1.93 dependent: set(process_input).
% 1.72/1.93 dependent: clear(print_kept).
% 1.72/1.93 dependent: clear(print_new_demod).
% 1.72/1.93 dependent: clear(print_back_demod).
% 1.72/1.93 dependent: clear(print_back_sub).
% 1.72/1.93 dependent: set(control_memory).
% 1.72/1.93 dependent: assign(max_mem, 12000).
% 1.72/1.93 dependent: assign(pick_given_ratio, 4).
% 1.72/1.93 dependent: assign(stats_level, 1).
% 1.72/1.93 dependent: assign(max_seconds, 10800).
% 1.72/1.93 clear(print_given).
% 1.72/1.93
% 1.72/1.93 formula_list(usable).
% 1.72/1.93 all A (A=A).
% 1.72/1.93 all A B (in(A,B)-> -in(B,A)).
% 1.72/1.93 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.72/1.93 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.72/1.93 all A B (symmetric_difference(A,B)=symmetric_difference(B,A)).
% 1.72/1.93 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.72/1.93 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.72/1.93 all A B (symmetric_difference(A,B)=set_union2(set_difference(A,B),set_difference(B,A))).
% 1.72/1.93 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.72/1.93 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.72/1.93 all A B (set_union2(A,A)=A).
% 1.72/1.93 exists A empty(A).
% 1.72/1.93 exists A (-empty(A)).
% 1.72/1.93 all A B C (in(A,symmetric_difference(B,C))<-> -(in(A,B)<->in(A,C))).
% 1.72/1.93 -(all A B (A!=B->symmetric_difference(singleton(A),singleton(B))=unordered_pair(A,B))).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 -------> usable clausifies to:
% 1.72/1.93
% 1.72/1.93 list(usable).
% 1.72/1.93 0 [] A=A.
% 1.72/1.93 0 [] -in(A,B)| -in(B,A).
% 1.72/1.93 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.72/1.93 0 [] set_union2(A,B)=set_union2(B,A).
% 1.72/1.93 0 [] symmetric_difference(A,B)=symmetric_difference(B,A).
% 1.72/1.93 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.72/1.93 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.72/1.93 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.72/1.93 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.72/1.93 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.72/1.93 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.72/1.93 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.72/1.93 0 [] C=unordered_pair(A,B)|in($f2(A,B,C),C)|$f2(A,B,C)=A|$f2(A,B,C)=B.
% 1.72/1.93 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=A.
% 1.72/1.93 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=B.
% 1.72/1.93 0 [] symmetric_difference(A,B)=set_union2(set_difference(A,B),set_difference(B,A)).
% 1.72/1.93 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.72/1.93 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.72/1.93 0 [] set_union2(A,A)=A.
% 1.72/1.93 0 [] empty($c1).
% 1.72/1.93 0 [] -empty($c2).
% 1.72/1.93 0 [] -in(A,symmetric_difference(B,C))|in(A,B)|in(A,C).
% 1.72/1.93 0 [] -in(A,symmetric_difference(B,C))| -in(A,B)| -in(A,C).
% 1.72/1.93 0 [] in(A,symmetric_difference(B,C))| -in(A,B)|in(A,C).
% 1.72/1.93 0 [] in(A,symmetric_difference(B,C))|in(A,B)| -in(A,C).
% 1.72/1.93 0 [] $c4!=$c3.
% 1.72/1.93 0 [] symmetric_difference(singleton($c4),singleton($c3))!=unordered_pair($c4,$c3).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.72/1.93
% 1.72/1.93 This ia a non-Horn set with equality. The strategy will be
% 1.72/1.93 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.72/1.93 deletion, with positive clauses in sos and nonpositive
% 1.72/1.93 clauses in usable.
% 1.72/1.93
% 1.72/1.93 dependent: set(knuth_bendix).
% 1.72/1.93 dependent: set(anl_eq).
% 1.72/1.93 dependent: set(para_from).
% 1.72/1.93 dependent: set(para_into).
% 1.72/1.93 dependent: clear(para_from_right).
% 1.72/1.93 dependent: clear(para_into_right).
% 1.72/1.93 dependent: set(para_from_vars).
% 1.72/1.93 dependent: set(eq_units_both_ways).
% 1.72/1.93 dependent: set(dynamic_demod_all).
% 1.72/1.93 dependent: set(dynamic_demod).
% 1.72/1.93 dependent: set(order_eq).
% 1.72/1.93 dependent: set(back_demod).
% 1.72/1.93 dependent: set(lrpo).
% 1.72/1.93 dependent: set(hyper_res).
% 1.72/1.93 dependent: set(unit_deletion).
% 1.72/1.93 dependent: set(factor).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.72/1.93 ** KEPT (pick-wt=10): 2 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.72/1.93 ** KEPT (pick-wt=10): 3 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.72/1.93 ** KEPT (pick-wt=14): 4 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.72/1.93 ** KEPT (pick-wt=14): 5 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.72/1.93 ** KEPT (pick-wt=11): 6 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.72/1.93 ** KEPT (pick-wt=11): 7 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.72/1.93 ** KEPT (pick-wt=17): 8 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=B.
% 1.72/1.93 ** KEPT (pick-wt=17): 9 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=C.
% 1.72/1.93 ** KEPT (pick-wt=6): 1Alarm clock
% 299.82/300.03 Otter interrupted
% 299.82/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------