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

View Problem - Process Solution

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

% Computer : n019.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:35 EDT 2022

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

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