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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : SEU406+1 : TPTP v8.1.0. Released v3.4.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:16:08 EDT 2022

% Result   : Timeout 299.89s 300.09s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SEU406+1 : TPTP v8.1.0. Released v3.4.0.
% 0.00/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 07:50:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.76/1.96  ----- Otter 3.3f, August 2004 -----
% 1.76/1.96  The process was started by sandbox on n019.cluster.edu,
% 1.76/1.96  Wed Jul 27 07:50:37 2022
% 1.76/1.96  The command was "./otter".  The process ID is 19101.
% 1.76/1.96  
% 1.76/1.96  set(prolog_style_variables).
% 1.76/1.96  set(auto).
% 1.76/1.96     dependent: set(auto1).
% 1.76/1.96     dependent: set(process_input).
% 1.76/1.96     dependent: clear(print_kept).
% 1.76/1.96     dependent: clear(print_new_demod).
% 1.76/1.96     dependent: clear(print_back_demod).
% 1.76/1.96     dependent: clear(print_back_sub).
% 1.76/1.96     dependent: set(control_memory).
% 1.76/1.96     dependent: assign(max_mem, 12000).
% 1.76/1.96     dependent: assign(pick_given_ratio, 4).
% 1.76/1.96     dependent: assign(stats_level, 1).
% 1.76/1.96     dependent: assign(max_seconds, 10800).
% 1.76/1.96  clear(print_given).
% 1.76/1.96  
% 1.76/1.96  formula_list(usable).
% 1.76/1.96  all A (A=A).
% 1.76/1.96  -(all A B C D (-(r2_hidden(A,k2_xboole_0(C,D))&r2_hidden(B,k2_xboole_0(C,D))& -(r2_hidden(A,k4_xboole_0(C,D))&r2_hidden(B,k4_xboole_0(C,D)))& -(r2_hidden(A,D)&r2_hidden(B,D))& -(r2_hidden(A,k4_xboole_0(C,D))&r2_hidden(B,D))& -(r2_hidden(A,D)&r2_hidden(B,k4_xboole_0(C,D)))))).
% 1.76/1.96  all A B (r2_hidden(A,B)-> -r2_hidden(B,A)).
% 1.76/1.96  all A B (k2_xboole_0(A,B)=k2_xboole_0(B,A)).
% 1.76/1.96  all A B C (C=k2_xboole_0(A,B)<-> (all D (r2_hidden(D,C)<->r2_hidden(D,A)|r2_hidden(D,B)))).
% 1.76/1.96  $T.
% 1.76/1.96  $T.
% 1.76/1.96  $T.
% 1.76/1.96  $T.
% 1.76/1.96  all A exists B m1_subset_1(B,A).
% 1.76/1.96  v1_xboole_0(k1_xboole_0).
% 1.76/1.96  all A B (-v1_xboole_0(A)-> -v1_xboole_0(k2_xboole_0(A,B))).
% 1.76/1.96  all A B (-v1_xboole_0(A)-> -v1_xboole_0(k2_xboole_0(B,A))).
% 1.76/1.96  all A B (k2_xboole_0(A,A)=A).
% 1.76/1.96  exists A v1_xboole_0(A).
% 1.76/1.96  exists A (-v1_xboole_0(A)).
% 1.76/1.96  all A (k2_xboole_0(A,k1_xboole_0)=A).
% 1.76/1.96  all A B (r2_hidden(A,B)->m1_subset_1(A,B)).
% 1.76/1.96  all A B (m1_subset_1(A,B)->v1_xboole_0(B)|r2_hidden(A,B)).
% 1.76/1.96  all A B (k2_xboole_0(A,k4_xboole_0(B,A))=k2_xboole_0(A,B)).
% 1.76/1.96  all A (k4_xboole_0(A,k1_xboole_0)=A).
% 1.76/1.96  all A (k4_xboole_0(k1_xboole_0,A)=k1_xboole_0).
% 1.76/1.96  all A (v1_xboole_0(A)->A=k1_xboole_0).
% 1.76/1.96  all A B (-(r2_hidden(A,B)&v1_xboole_0(B))).
% 1.76/1.96  all A B (-(v1_xboole_0(A)&A!=B&v1_xboole_0(B))).
% 1.76/1.96  end_of_list.
% 1.76/1.96  
% 1.76/1.96  -------> usable clausifies to:
% 1.76/1.96  
% 1.76/1.96  list(usable).
% 1.76/1.96  0 [] A=A.
% 1.76/1.96  0 [] r2_hidden($c4,k2_xboole_0($c2,$c1)).
% 1.76/1.96  0 [] r2_hidden($c3,k2_xboole_0($c2,$c1)).
% 1.76/1.96  0 [] -r2_hidden($c4,k4_xboole_0($c2,$c1))| -r2_hidden($c3,k4_xboole_0($c2,$c1)).
% 1.76/1.96  0 [] -r2_hidden($c4,$c1)| -r2_hidden($c3,$c1).
% 1.76/1.96  0 [] -r2_hidden($c4,k4_xboole_0($c2,$c1))| -r2_hidden($c3,$c1).
% 1.76/1.96  0 [] -r2_hidden($c4,$c1)| -r2_hidden($c3,k4_xboole_0($c2,$c1)).
% 1.76/1.96  0 [] -r2_hidden(A,B)| -r2_hidden(B,A).
% 1.76/1.96  0 [] k2_xboole_0(A,B)=k2_xboole_0(B,A).
% 1.76/1.96  0 [] C!=k2_xboole_0(A,B)| -r2_hidden(D,C)|r2_hidden(D,A)|r2_hidden(D,B).
% 1.76/1.96  0 [] C!=k2_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,A).
% 1.76/1.96  0 [] C!=k2_xboole_0(A,B)|r2_hidden(D,C)| -r2_hidden(D,B).
% 1.76/1.96  0 [] C=k2_xboole_0(A,B)|r2_hidden($f1(A,B,C),C)|r2_hidden($f1(A,B,C),A)|r2_hidden($f1(A,B,C),B).
% 1.76/1.96  0 [] C=k2_xboole_0(A,B)| -r2_hidden($f1(A,B,C),C)| -r2_hidden($f1(A,B,C),A).
% 1.76/1.96  0 [] C=k2_xboole_0(A,B)| -r2_hidden($f1(A,B,C),C)| -r2_hidden($f1(A,B,C),B).
% 1.76/1.96  0 [] $T.
% 1.76/1.96  0 [] $T.
% 1.76/1.96  0 [] $T.
% 1.76/1.96  0 [] $T.
% 1.76/1.96  0 [] m1_subset_1($f2(A),A).
% 1.76/1.96  0 [] v1_xboole_0(k1_xboole_0).
% 1.76/1.96  0 [] v1_xboole_0(A)| -v1_xboole_0(k2_xboole_0(A,B)).
% 1.76/1.96  0 [] v1_xboole_0(A)| -v1_xboole_0(k2_xboole_0(B,A)).
% 1.76/1.96  0 [] k2_xboole_0(A,A)=A.
% 1.76/1.96  0 [] v1_xboole_0($c5).
% 1.76/1.96  0 [] -v1_xboole_0($c6).
% 1.76/1.96  0 [] k2_xboole_0(A,k1_xboole_0)=A.
% 1.76/1.96  0 [] -r2_hidden(A,B)|m1_subset_1(A,B).
% 1.76/1.96  0 [] -m1_subset_1(A,B)|v1_xboole_0(B)|r2_hidden(A,B).
% 1.76/1.96  0 [] k2_xboole_0(A,k4_xboole_0(B,A))=k2_xboole_0(A,B).
% 1.76/1.96  0 [] k4_xboole_0(A,k1_xboole_0)=A.
% 1.76/1.96  0 [] k4_xboole_0(k1_xboole_0,A)=k1_xboole_0.
% 1.76/1.96  0 [] -v1_xboole_0(A)|A=k1_xboole_0.
% 1.76/1.96  0 [] -r2_hidden(A,B)| -v1_xboole_0(B).
% 1.76/1.96  0 [] -v1_xboole_0(A)|A=B| -v1_xboole_0(B).
% 1.76/1.96  end_of_list.
% 1.76/1.96  
% 1.76/1.96  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.76/1.96  
% 1.76/1.96  This ia a non-Horn set with equality.  The strategy will be
% 1.76/1.96  Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.76/1.96  deletion, with positive clauses in sos and nonpositive
% 1.76/1.96  clauses in usable.
% 1.76/1.96  
% 1.76/1.96     dependent: set(knuth_bendix).
% 1.76/1.96     dependent: set(anl_eq).
% 1.76/1.96     dependent: set(para_from).
% 1.76/1.96     dependent: set(para_into).
% 1.76/1.96     dependent: clear(para_from_right).
% 1.76/1.96     dependent: clear(para_into_right).
% 1.76/1.96     dependent: set(para_from_vars).
% 1.76/1.96     dependent: set(eq_units_both_ways).
% 1.76/1.96     dependent: set(dynamic_demod_all).
% 1.76/1.96     dependent: set(dynamic_demod).
% 1.76/1.96     dependent: set(order_eq).
% 1.76/1.96     dependent: set(back_demod).
% 1.76/1.96     dependent: set(lAlarm clock 
% 299.89/300.09  Otter interrupted
% 299.89/300.09  PROOF NOT FOUND
%------------------------------------------------------------------------------