TSTP Solution File: SET916+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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:31 EDT 2022
% Result : Timeout 299.87s 300.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET916+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 10:57:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.77/1.97 ----- Otter 3.3f, August 2004 -----
% 1.77/1.97 The process was started by sandbox on n008.cluster.edu,
% 1.77/1.97 Wed Jul 27 10:57:53 2022
% 1.77/1.97 The command was "./otter". The process ID is 20865.
% 1.77/1.97
% 1.77/1.97 set(prolog_style_variables).
% 1.77/1.97 set(auto).
% 1.77/1.97 dependent: set(auto1).
% 1.77/1.97 dependent: set(process_input).
% 1.77/1.97 dependent: clear(print_kept).
% 1.77/1.97 dependent: clear(print_new_demod).
% 1.77/1.97 dependent: clear(print_back_demod).
% 1.77/1.97 dependent: clear(print_back_sub).
% 1.77/1.97 dependent: set(control_memory).
% 1.77/1.97 dependent: assign(max_mem, 12000).
% 1.77/1.97 dependent: assign(pick_given_ratio, 4).
% 1.77/1.97 dependent: assign(stats_level, 1).
% 1.77/1.97 dependent: assign(max_seconds, 10800).
% 1.77/1.97 clear(print_given).
% 1.77/1.97
% 1.77/1.97 formula_list(usable).
% 1.77/1.97 all A (A=A).
% 1.77/1.97 all A B (in(A,B)-> -in(B,A)).
% 1.77/1.97 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.77/1.97 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.77/1.97 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 1.77/1.97 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.77/1.97 all A B (set_intersection2(A,A)=A).
% 1.77/1.97 exists A empty(A).
% 1.77/1.97 exists A (-empty(A)).
% 1.77/1.97 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.77/1.97 all A B (-(-disjoint(A,B)& (all C (-in(C,set_intersection2(A,B)))))& -((exists C in(C,set_intersection2(A,B)))&disjoint(A,B))).
% 1.77/1.97 -(all A B C (-(-in(A,B)& -in(C,B)& -disjoint(unordered_pair(A,C),B)))).
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 -------> usable clausifies to:
% 1.77/1.97
% 1.77/1.97 list(usable).
% 1.77/1.97 0 [] A=A.
% 1.77/1.97 0 [] -in(A,B)| -in(B,A).
% 1.77/1.97 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.77/1.97 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.77/1.97 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 1.77/1.97 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 1.77/1.97 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 1.77/1.97 0 [] C=unordered_pair(A,B)|in($f1(A,B,C),C)|$f1(A,B,C)=A|$f1(A,B,C)=B.
% 1.77/1.97 0 [] C=unordered_pair(A,B)| -in($f1(A,B,C),C)|$f1(A,B,C)!=A.
% 1.77/1.97 0 [] C=unordered_pair(A,B)| -in($f1(A,B,C),C)|$f1(A,B,C)!=B.
% 1.77/1.97 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.77/1.97 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.77/1.97 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.77/1.97 0 [] C=set_intersection2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A).
% 1.77/1.97 0 [] C=set_intersection2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),B).
% 1.77/1.97 0 [] C=set_intersection2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A)| -in($f2(A,B,C),B).
% 1.77/1.97 0 [] set_intersection2(A,A)=A.
% 1.77/1.97 0 [] empty($c1).
% 1.77/1.97 0 [] -empty($c2).
% 1.77/1.97 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.77/1.97 0 [] disjoint(A,B)|in($f3(A,B),set_intersection2(A,B)).
% 1.77/1.97 0 [] -in(C,set_intersection2(A,B))| -disjoint(A,B).
% 1.77/1.97 0 [] -in($c5,$c4).
% 1.77/1.97 0 [] -in($c3,$c4).
% 1.77/1.97 0 [] -disjoint(unordered_pair($c5,$c3),$c4).
% 1.77/1.97 end_of_list.
% 1.77/1.97
% 1.77/1.97 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.77/1.97
% 1.77/1.97 This ia a non-Horn set with equality. The strategy will be
% 1.77/1.97 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.77/1.97 deletion, with positive clauses in sos and nonpositive
% 1.77/1.97 clauses in usable.
% 1.77/1.97
% 1.77/1.97 dependent: set(knuth_bendix).
% 1.77/1.97 dependent: set(anl_eq).
% 1.77/1.97 dependent: set(para_from).
% 1.77/1.97 dependent: set(para_into).
% 1.77/1.97 dependent: clear(para_from_right).
% 1.77/1.97 dependent: clear(para_into_right).
% 1.77/1.97 dependent: set(para_from_vars).
% 1.77/1.97 dependent: set(eq_units_both_ways).
% 1.77/1.97 dependent: set(dynamic_demod_all).
% 1.77/1.97 dependent: set(dynamic_demod).
% 1.77/1.97 dependent: set(order_eq).
% 1.77/1.97 dependent: set(back_demod).
% 1.77/1.97 dependent: set(lrpo).
% 1.77/1.97 dependent: set(hyper_res).
% 1.77/1.97 dependent: set(unit_deletion).
% 1.77/1.97 dependent: set(factor).
% 1.77/1.97
% 1.77/1.97 ------------> process usable:
% 1.77/1.97 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.77/1.97 ** KEPT (pick-wt=14): 2 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 1.77/1.97 ** KEPT (pick-wt=11): 3 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 1.77/1.97 ** KEPT (pick-wt=11): 4 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 1.77/1.97 ** KEPT (pick-wt=17): 5 [] A=unordered_pair(B,C)| -in($f1(B,C,A),A)|$f1(B,C,A)!=B.
% 1.77/1.97 ** KEPT (pick-wt=17): 6 [] A=unordered_pair(B,C)| -in($f1(B,C,A),A)|$f1(B,C,A)!=C.
% 1.77/1.97 ** KEPT (pick-wt=11): 7 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.77/1.97 ** KEPT (pick-wt=11): 8 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.77/1.97 ** KEPT (pick-wt=14): 9 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.77/1.97 ** KEPT (pick-wt=23): 10 [] A=set_intersection2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B)| -in($f2(B,C,A),C).
% 1.77/1.97 ** KEPT (pick-wt=2): 11 [] -empty($c2).
% 1.77/1.97 ** KEPT (pick-wt=6): 12 [] -disjoint(A,Alarm clock
% 299.87/300.02 Otter interrupted
% 299.87/300.02 PROOF NOT FOUND
%------------------------------------------------------------------------------