TSTP Solution File: SET969+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET969+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:36 EDT 2022
% Result : Timeout 299.97s 300.10s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET969+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:52:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.13 ----- Otter 3.3f, August 2004 -----
% 1.95/2.13 The process was started by sandbox on n026.cluster.edu,
% 1.95/2.13 Wed Jul 27 10:52:09 2022
% 1.95/2.13 The command was "./otter". The process ID is 6859.
% 1.95/2.13
% 1.95/2.13 set(prolog_style_variables).
% 1.95/2.13 set(auto).
% 1.95/2.13 dependent: set(auto1).
% 1.95/2.13 dependent: set(process_input).
% 1.95/2.13 dependent: clear(print_kept).
% 1.95/2.13 dependent: clear(print_new_demod).
% 1.95/2.13 dependent: clear(print_back_demod).
% 1.95/2.13 dependent: clear(print_back_sub).
% 1.95/2.13 dependent: set(control_memory).
% 1.95/2.13 dependent: assign(max_mem, 12000).
% 1.95/2.13 dependent: assign(pick_given_ratio, 4).
% 1.95/2.13 dependent: assign(stats_level, 1).
% 1.95/2.13 dependent: assign(max_seconds, 10800).
% 1.95/2.13 clear(print_given).
% 1.95/2.13
% 1.95/2.13 formula_list(usable).
% 1.95/2.13 all A (A=A).
% 1.95/2.13 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.13 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.95/2.13 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.95/2.13 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.95/2.13 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.95/2.13 all A B (-empty(ordered_pair(A,B))).
% 1.95/2.13 all A B (set_intersection2(A,A)=A).
% 1.95/2.13 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.95/2.13 exists A empty(A).
% 1.95/2.13 exists A (-empty(A)).
% 1.95/2.13 all A B subset(A,A).
% 1.95/2.13 all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))->in(ordered_pair(B,A),cartesian_product2(D,C))).
% 1.95/2.13 all A B C D E F (subset(A,cartesian_product2(B,C))&subset(D,cartesian_product2(E,F))& (all G H (in(ordered_pair(G,H),A)<->in(ordered_pair(G,H),D)))->A=D).
% 1.95/2.13 -(all A B C (cartesian_product2(set_intersection2(A,B),C)=set_intersection2(cartesian_product2(A,C),cartesian_product2(B,C))&cartesian_product2(C,set_intersection2(A,B))=set_intersection2(cartesian_product2(C,A),cartesian_product2(C,B)))).
% 1.95/2.13 all A B subset(set_intersection2(A,B),A).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 -------> usable clausifies to:
% 1.95/2.13
% 1.95/2.13 list(usable).
% 1.95/2.13 0 [] A=A.
% 1.95/2.13 0 [] -in(A,B)| -in(B,A).
% 1.95/2.13 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.95/2.13 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.95/2.13 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.95/2.13 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.95/2.13 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.95/2.13 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A).
% 1.95/2.13 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),B).
% 1.95/2.13 0 [] C=set_intersection2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A)| -in($f1(A,B,C),B).
% 1.95/2.13 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.95/2.13 0 [] -empty(ordered_pair(A,B)).
% 1.95/2.13 0 [] set_intersection2(A,A)=A.
% 1.95/2.13 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.95/2.13 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.95/2.13 0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.95/2.13 0 [] empty($c1).
% 1.95/2.13 0 [] -empty($c2).
% 1.95/2.13 0 [] subset(A,A).
% 1.95/2.13 0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(ordered_pair(B,A),cartesian_product2(D,C)).
% 1.95/2.13 0 [] -subset(A,cartesian_product2(B,C))| -subset(D,cartesian_product2(E,F))|in(ordered_pair($f3(A,B,C,D,E,F),$f2(A,B,C,D,E,F)),A)|in(ordered_pair($f3(A,B,C,D,E,F),$f2(A,B,C,D,E,F)),D)|A=D.
% 1.95/2.13 0 [] -subset(A,cartesian_product2(B,C))| -subset(D,cartesian_product2(E,F))| -in(ordered_pair($f3(A,B,C,D,E,F),$f2(A,B,C,D,E,F)),A)| -in(ordered_pair($f3(A,B,C,D,E,F),$f2(A,B,C,D,E,F)),D)|A=D.
% 1.95/2.13 0 [] cartesian_product2(set_intersection2($c5,$c4),$c3)!=set_intersection2(cartesian_product2($c5,$c3),cartesian_product2($c4,$c3))|cartesian_product2($c3,set_intersection2($c5,$c4))!=set_intersection2(cartesian_product2($c3,$c5),cartesian_product2($c3,$c4)).
% 1.95/2.13 0 [] subset(set_intersection2(A,B),A).
% 1.95/2.13 end_of_list.
% 1.95/2.13
% 1.95/2.13 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.95/2.13
% 1.95/2.13 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.13 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.13 deletion, with positive clauses in sos and nonpositive
% 1.95/2.13 clauses in usable.
% 1.95/2.13
% 1.95/2.13 dependent: set(knuth_bendix).
% 1.95/2.13 dependent: set(anl_eq).
% 1.95/2.13 dependent: set(para_from).
% 1.95/2.13 dependent: set(para_into).
% 1.95/2.13 dependent: clear(para_from_right).
% 1.95/2.13 dependent: clear(para_into_right).
% 1.95/2.13 dependent: set(para_from_vars).
% 1.95/2.13 dependent: set(eq_units_both_ways).
% 1.95/2.13 dependent: set(dynamic_demod_all).
% 1.95/2.13 dependent: set(dynamic_demod).
% 1.95/2.13 dependent: set(order_eq).
% 1.95/2.13 Alarm clock
% 299.97/300.10 Otter interrupted
% 299.97/300.10 PROOF NOT FOUND
%------------------------------------------------------------------------------