TSTP Solution File: SEU229+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU229+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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:15:15 EDT 2022
% Result : Timeout 299.89s 300.04s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU229+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 08:17:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.03/2.22 ----- Otter 3.3f, August 2004 -----
% 2.03/2.22 The process was started by sandbox2 on n023.cluster.edu,
% 2.03/2.22 Wed Jul 27 08:17:03 2022
% 2.03/2.22 The command was "./otter". The process ID is 20037.
% 2.03/2.22
% 2.03/2.22 set(prolog_style_variables).
% 2.03/2.22 set(auto).
% 2.03/2.22 dependent: set(auto1).
% 2.03/2.22 dependent: set(process_input).
% 2.03/2.22 dependent: clear(print_kept).
% 2.03/2.22 dependent: clear(print_new_demod).
% 2.03/2.22 dependent: clear(print_back_demod).
% 2.03/2.22 dependent: clear(print_back_sub).
% 2.03/2.22 dependent: set(control_memory).
% 2.03/2.22 dependent: assign(max_mem, 12000).
% 2.03/2.22 dependent: assign(pick_given_ratio, 4).
% 2.03/2.22 dependent: assign(stats_level, 1).
% 2.03/2.22 dependent: assign(max_seconds, 10800).
% 2.03/2.22 clear(print_given).
% 2.03/2.22
% 2.03/2.22 formula_list(usable).
% 2.03/2.22 all A (A=A).
% 2.03/2.22 all A B (in(A,B)-> -in(B,A)).
% 2.03/2.22 all A (empty(A)->function(A)).
% 2.03/2.22 all A (empty(A)->relation(A)).
% 2.03/2.22 all A (relation(A)&empty(A)&function(A)->relation(A)&function(A)&one_to_one(A)).
% 2.03/2.22 all A B C D (D=unordered_triple(A,B,C)<-> (all E (in(E,D)<-> -(E!=A&E!=B&E!=C)))).
% 2.03/2.22 $T.
% 2.03/2.22 $T.
% 2.03/2.22 $T.
% 2.03/2.22 all A exists B element(B,A).
% 2.03/2.22 empty(empty_set).
% 2.03/2.22 relation(empty_set).
% 2.03/2.22 relation_empty_yielding(empty_set).
% 2.03/2.22 empty(empty_set).
% 2.03/2.22 empty(empty_set).
% 2.03/2.22 relation(empty_set).
% 2.03/2.22 exists A (relation(A)&function(A)).
% 2.03/2.22 exists A (empty(A)&relation(A)).
% 2.03/2.22 exists A empty(A).
% 2.03/2.22 exists A (relation(A)&empty(A)&function(A)).
% 2.03/2.22 exists A (-empty(A)&relation(A)).
% 2.03/2.22 exists A (-empty(A)).
% 2.03/2.22 exists A (relation(A)&function(A)&one_to_one(A)).
% 2.03/2.22 exists A (relation(A)&relation_empty_yielding(A)).
% 2.03/2.22 exists A (relation(A)&relation_empty_yielding(A)&function(A)).
% 2.03/2.22 all A B (in(A,B)->element(A,B)).
% 2.03/2.22 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.03/2.22 -(all A B C (-(in(A,B)&in(B,C)&in(C,A)))).
% 2.03/2.22 all A (empty(A)->A=empty_set).
% 2.03/2.22 all A B (-(in(A,B)&empty(B))).
% 2.03/2.22 all A B (-(in(A,B)& (all C (-(in(C,B)& (all D (-(in(D,B)&in(D,C))))))))).
% 2.03/2.22 all A B (-(empty(A)&A!=B&empty(B))).
% 2.03/2.22 end_of_list.
% 2.03/2.22
% 2.03/2.22 -------> usable clausifies to:
% 2.03/2.22
% 2.03/2.22 list(usable).
% 2.03/2.22 0 [] A=A.
% 2.03/2.22 0 [] -in(A,B)| -in(B,A).
% 2.03/2.22 0 [] -empty(A)|function(A).
% 2.03/2.22 0 [] -empty(A)|relation(A).
% 2.03/2.22 0 [] -relation(A)| -empty(A)| -function(A)|one_to_one(A).
% 2.03/2.22 0 [] D!=unordered_triple(A,B,C)| -in(E,D)|E=A|E=B|E=C.
% 2.03/2.22 0 [] D!=unordered_triple(A,B,C)|in(E,D)|E!=A.
% 2.03/2.22 0 [] D!=unordered_triple(A,B,C)|in(E,D)|E!=B.
% 2.03/2.22 0 [] D!=unordered_triple(A,B,C)|in(E,D)|E!=C.
% 2.03/2.22 0 [] D=unordered_triple(A,B,C)|in($f1(A,B,C,D),D)|$f1(A,B,C,D)=A|$f1(A,B,C,D)=B|$f1(A,B,C,D)=C.
% 2.03/2.22 0 [] D=unordered_triple(A,B,C)| -in($f1(A,B,C,D),D)|$f1(A,B,C,D)!=A.
% 2.03/2.22 0 [] D=unordered_triple(A,B,C)| -in($f1(A,B,C,D),D)|$f1(A,B,C,D)!=B.
% 2.03/2.22 0 [] D=unordered_triple(A,B,C)| -in($f1(A,B,C,D),D)|$f1(A,B,C,D)!=C.
% 2.03/2.22 0 [] $T.
% 2.03/2.22 0 [] $T.
% 2.03/2.22 0 [] $T.
% 2.03/2.22 0 [] element($f2(A),A).
% 2.03/2.22 0 [] empty(empty_set).
% 2.03/2.22 0 [] relation(empty_set).
% 2.03/2.22 0 [] relation_empty_yielding(empty_set).
% 2.03/2.22 0 [] empty(empty_set).
% 2.03/2.22 0 [] empty(empty_set).
% 2.03/2.22 0 [] relation(empty_set).
% 2.03/2.22 0 [] relation($c1).
% 2.03/2.22 0 [] function($c1).
% 2.03/2.22 0 [] empty($c2).
% 2.03/2.22 0 [] relation($c2).
% 2.03/2.22 0 [] empty($c3).
% 2.03/2.22 0 [] relation($c4).
% 2.03/2.22 0 [] empty($c4).
% 2.03/2.22 0 [] function($c4).
% 2.03/2.22 0 [] -empty($c5).
% 2.03/2.22 0 [] relation($c5).
% 2.03/2.22 0 [] -empty($c6).
% 2.03/2.22 0 [] relation($c7).
% 2.03/2.22 0 [] function($c7).
% 2.03/2.22 0 [] one_to_one($c7).
% 2.03/2.22 0 [] relation($c8).
% 2.03/2.22 0 [] relation_empty_yielding($c8).
% 2.03/2.22 0 [] relation($c9).
% 2.03/2.22 0 [] relation_empty_yielding($c9).
% 2.03/2.22 0 [] function($c9).
% 2.03/2.22 0 [] -in(A,B)|element(A,B).
% 2.03/2.22 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.03/2.22 0 [] in($c12,$c11).
% 2.03/2.22 0 [] in($c11,$c10).
% 2.03/2.22 0 [] in($c10,$c12).
% 2.03/2.22 0 [] -empty(A)|A=empty_set.
% 2.03/2.22 0 [] -in(A,B)| -empty(B).
% 2.03/2.22 0 [] -in(A,B)|in($f3(A,B),B).
% 2.03/2.22 0 [] -in(A,B)| -in(D,B)| -in(D,$f3(A,B)).
% 2.03/2.22 0 [] -empty(A)|A=B| -empty(B).
% 2.03/2.22 end_of_list.
% 2.03/2.22
% 2.03/2.22 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 2.03/2.22
% 2.03/2.22 This ia a non-Horn set with equality. The strategy will be
% 2.03/2.22 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.03/2.22 deletion, with positive clauses in sos and nonpositive
% 2.03/2.22 clauses in usable.
% 2.03/2.22
% 2.03/2.22 dependent: set(knuth_bendix).
% 2.03/2.22 dependent: set(anl_eq).
% 2.03/2.22 dependent: set(para_from).
% 2.03/2.22 dependent: set(para_into).
% 2.03/2.22 dependent: clear(para_from_right).
% 2.03/2.22 dependent: clear(para_into_right).
% 2.03/2.22 dependent: set(para_from_vars).
% 2.03/2.22 dependent: set(eq_units_both_ways).
% 2.03/2.22 dependent: set(dynamic_demod_all).
% 2.03/2.22 dependent: set(dynamic_demod).
% 2.03/2.22 dependent: set(order_eq).
% 2.03/2.22 dependent: set(back_demod).
% 2.03/2.22 dependent: set(lrpo).
% 2.03/2.22 dependent: set(hyper_res).
% 2.03/2.22 dependent: set(unit_deletiAlarm clock
% 299.89/300.04 Otter interrupted
% 299.89/300.04 PROOF NOT FOUND
%------------------------------------------------------------------------------