TSTP Solution File: SET980+1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n010.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:37 EDT 2022

% Result   : Timeout 299.85s 300.02s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET980+1 : TPTP v8.1.0. Bugfixed v4.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.13/0.33  % Computer : n010.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:37:24 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 1.59/1.81  ----- Otter 3.3f, August 2004 -----
% 1.59/1.81  The process was started by sandbox2 on n010.cluster.edu,
% 1.59/1.81  Wed Jul 27 10:37:25 2022
% 1.59/1.81  The command was "./otter".  The process ID is 994.
% 1.59/1.81  
% 1.59/1.81  set(prolog_style_variables).
% 1.59/1.81  set(auto).
% 1.59/1.81     dependent: set(auto1).
% 1.59/1.81     dependent: set(process_input).
% 1.59/1.81     dependent: clear(print_kept).
% 1.59/1.81     dependent: clear(print_new_demod).
% 1.59/1.81     dependent: clear(print_back_demod).
% 1.59/1.81     dependent: clear(print_back_sub).
% 1.59/1.81     dependent: set(control_memory).
% 1.59/1.81     dependent: assign(max_mem, 12000).
% 1.59/1.81     dependent: assign(pick_given_ratio, 4).
% 1.59/1.81     dependent: assign(stats_level, 1).
% 1.59/1.81     dependent: assign(max_seconds, 10800).
% 1.59/1.81  clear(print_given).
% 1.59/1.81  
% 1.59/1.81  formula_list(usable).
% 1.59/1.81  all A (A=A).
% 1.59/1.81  all A B (in(A,B)-> -in(B,A)).
% 1.59/1.81  all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.59/1.81  all A (A=empty_set<-> (all B (-in(B,A)))).
% 1.59/1.81  all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.59/1.81  empty(empty_set).
% 1.59/1.81  all A B (-empty(ordered_pair(A,B))).
% 1.59/1.81  all A B C D (in(ordered_pair(A,B),cartesian_product2(C,D))<->in(A,C)&in(B,D)).
% 1.59/1.81  exists A empty(A).
% 1.59/1.81  exists A (-empty(A)).
% 1.59/1.81  all A B (cartesian_product2(A,B)=empty_set<->A=empty_set|B=empty_set).
% 1.59/1.81  -(all A B C D (cartesian_product2(A,B)=cartesian_product2(C,D)->A=empty_set|B=empty_set|A=C&B=D)).
% 1.59/1.81  all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 1.59/1.81  end_of_list.
% 1.59/1.81  
% 1.59/1.81  -------> usable clausifies to:
% 1.59/1.81  
% 1.59/1.81  list(usable).
% 1.59/1.81  0 [] A=A.
% 1.59/1.81  0 [] -in(A,B)| -in(B,A).
% 1.59/1.81  0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.59/1.81  0 [] A!=empty_set| -in(B,A).
% 1.59/1.81  0 [] A=empty_set|in($f1(A),A).
% 1.59/1.81  0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.59/1.81  0 [] empty(empty_set).
% 1.59/1.81  0 [] -empty(ordered_pair(A,B)).
% 1.59/1.81  0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.59/1.81  0 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.59/1.81  0 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.59/1.81  0 [] empty($c1).
% 1.59/1.81  0 [] -empty($c2).
% 1.59/1.81  0 [] cartesian_product2(A,B)!=empty_set|A=empty_set|B=empty_set.
% 1.59/1.81  0 [] cartesian_product2(A,B)=empty_set|A!=empty_set.
% 1.59/1.81  0 [] cartesian_product2(A,B)=empty_set|B!=empty_set.
% 1.59/1.81  0 [] cartesian_product2($c6,$c5)=cartesian_product2($c4,$c3).
% 1.59/1.81  0 [] $c6!=empty_set.
% 1.59/1.81  0 [] $c5!=empty_set.
% 1.59/1.81  0 [] $c6!=$c4|$c5!=$c3.
% 1.59/1.81  0 [] in($f2(A,B),A)|in($f2(A,B),B)|A=B.
% 1.59/1.81  0 [] -in($f2(A,B),A)| -in($f2(A,B),B)|A=B.
% 1.59/1.81  end_of_list.
% 1.59/1.81  
% 1.59/1.81  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.59/1.81  
% 1.59/1.81  This ia a non-Horn set with equality.  The strategy will be
% 1.59/1.81  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.59/1.81  deletion, with positive clauses in sos and nonpositive
% 1.59/1.81  clauses in usable.
% 1.59/1.81  
% 1.59/1.81     dependent: set(knuth_bendix).
% 1.59/1.81     dependent: set(anl_eq).
% 1.59/1.81     dependent: set(para_from).
% 1.59/1.81     dependent: set(para_into).
% 1.59/1.81     dependent: clear(para_from_right).
% 1.59/1.81     dependent: clear(para_into_right).
% 1.59/1.81     dependent: set(para_from_vars).
% 1.59/1.81     dependent: set(eq_units_both_ways).
% 1.59/1.81     dependent: set(dynamic_demod_all).
% 1.59/1.81     dependent: set(dynamic_demod).
% 1.59/1.81     dependent: set(order_eq).
% 1.59/1.81     dependent: set(back_demod).
% 1.59/1.81     dependent: set(lrpo).
% 1.59/1.81     dependent: set(hyper_res).
% 1.59/1.81     dependent: set(unit_deletion).
% 1.59/1.81     dependent: set(factor).
% 1.59/1.81  
% 1.59/1.81  ------------> process usable:
% 1.59/1.81  ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.59/1.81  ** KEPT (pick-wt=6): 2 [] A!=empty_set| -in(B,A).
% 1.59/1.81  ** KEPT (pick-wt=4): 3 [] -empty(ordered_pair(A,B)).
% 1.59/1.81  ** KEPT (pick-wt=10): 4 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 1.59/1.81  ** KEPT (pick-wt=10): 5 [] -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 1.59/1.81  ** KEPT (pick-wt=13): 6 [] in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 1.59/1.81  ** KEPT (pick-wt=2): 7 [] -empty($c2).
% 1.59/1.81  ** KEPT (pick-wt=11): 8 [] cartesian_product2(A,B)!=empty_set|A=empty_set|B=empty_set.
% 1.59/1.81  ** KEPT (pick-wt=8): 9 [] cartesian_product2(A,B)=empty_set|A!=empty_set.
% 1.59/1.81  ** KEPT (pick-wt=8): 10 [] cartesian_product2(A,B)=empty_set|B!=empty_set.
% 1.59/1.81  ** KEPT (pick-wt=3): 12 [copy,11,flip.1] empty_set!=$c6.
% 1.59/1.81  ** KEPT (pick-wt=3): 14 [copy,13,flip.1] empty_set!=$c5.
% 1.59/1.81  ** KEPT (pick-wt=6): 15 [] $c6!=$c4|$c5!=$c3.
% 1.59/1.81  ** KEPT (pick-wt=13): 16 [] -in($f2(A,B),A)| -in($f2(A,B),B)|A=B.
% 1.59/1.81  
% 1.59/1.81  ------------> process sos:
% 1.59/1.81  ** KEPT (pick-wt=3): 21 [] A=A.
% 1.59/1.81  ** KEPT (pick-wt=7): 22 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.59/1.81  ** KEPT (pick-wt=7): 23 [] A=empty_set|in(Alarm clock 
% 299.85/300.02  Otter interrupted
% 299.85/300.02  PROOF NOT FOUND
%------------------------------------------------------------------------------