TSTP Solution File: SEU194+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU194+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:07 EDT 2022
% Result : Timeout 299.85s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU194+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 08:22:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.01/2.21 ----- Otter 3.3f, August 2004 -----
% 2.01/2.21 The process was started by sandbox2 on n023.cluster.edu,
% 2.01/2.21 Wed Jul 27 08:22:18 2022
% 2.01/2.21 The command was "./otter". The process ID is 22758.
% 2.01/2.21
% 2.01/2.21 set(prolog_style_variables).
% 2.01/2.21 set(auto).
% 2.01/2.21 dependent: set(auto1).
% 2.01/2.21 dependent: set(process_input).
% 2.01/2.21 dependent: clear(print_kept).
% 2.01/2.21 dependent: clear(print_new_demod).
% 2.01/2.21 dependent: clear(print_back_demod).
% 2.01/2.21 dependent: clear(print_back_sub).
% 2.01/2.21 dependent: set(control_memory).
% 2.01/2.21 dependent: assign(max_mem, 12000).
% 2.01/2.21 dependent: assign(pick_given_ratio, 4).
% 2.01/2.21 dependent: assign(stats_level, 1).
% 2.01/2.21 dependent: assign(max_seconds, 10800).
% 2.01/2.21 clear(print_given).
% 2.01/2.21
% 2.01/2.21 formula_list(usable).
% 2.01/2.21 all A (A=A).
% 2.01/2.21 all A B (in(A,B)-> -in(B,A)).
% 2.01/2.21 all A (empty(A)->relation(A)).
% 2.01/2.21 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 2.01/2.21 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 2.01/2.21 $T.
% 2.01/2.21 $T.
% 2.01/2.21 $T.
% 2.01/2.21 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 2.01/2.21 $T.
% 2.01/2.21 all A exists B element(B,A).
% 2.01/2.21 all A B (relation(A)&relation(B)->relation(set_intersection2(A,B))).
% 2.01/2.21 empty(empty_set).
% 2.01/2.21 empty(empty_set).
% 2.01/2.21 relation(empty_set).
% 2.01/2.21 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.01/2.21 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.01/2.21 all A B (set_intersection2(A,A)=A).
% 2.01/2.21 exists A (empty(A)&relation(A)).
% 2.01/2.21 exists A empty(A).
% 2.01/2.21 exists A (-empty(A)&relation(A)).
% 2.01/2.21 exists A (-empty(A)).
% 2.01/2.21 all A B (in(A,B)->element(A,B)).
% 2.01/2.21 all A (set_intersection2(A,empty_set)=empty_set).
% 2.01/2.21 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.01/2.21 all A B ((all C (in(C,A)<->in(C,B)))->A=B).
% 2.01/2.21 all A (empty(A)->A=empty_set).
% 2.01/2.21 all A B (-(in(A,B)&empty(B))).
% 2.01/2.21 all A B C (relation(C)-> (in(A,relation_dom(relation_dom_restriction(C,B)))<->in(A,B)&in(A,relation_dom(C)))).
% 2.01/2.21 all A B (-(empty(A)&A!=B&empty(B))).
% 2.01/2.21 -(all A B (relation(B)->relation_dom(relation_dom_restriction(B,A))=set_intersection2(relation_dom(B),A))).
% 2.01/2.21 end_of_list.
% 2.01/2.21
% 2.01/2.21 -------> usable clausifies to:
% 2.01/2.21
% 2.01/2.21 list(usable).
% 2.01/2.21 0 [] A=A.
% 2.01/2.21 0 [] -in(A,B)| -in(B,A).
% 2.01/2.21 0 [] -empty(A)|relation(A).
% 2.01/2.21 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 2.01/2.21 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 2.01/2.21 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 2.01/2.21 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 2.01/2.21 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),A).
% 2.01/2.21 0 [] C=set_intersection2(A,B)|in($f1(A,B,C),C)|in($f1(A,B,C),B).
% 2.01/2.21 0 [] C=set_intersection2(A,B)| -in($f1(A,B,C),C)| -in($f1(A,B,C),A)| -in($f1(A,B,C),B).
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.01/2.21 0 [] $T.
% 2.01/2.21 0 [] element($f2(A),A).
% 2.01/2.21 0 [] -relation(A)| -relation(B)|relation(set_intersection2(A,B)).
% 2.01/2.21 0 [] empty(empty_set).
% 2.01/2.21 0 [] empty(empty_set).
% 2.01/2.21 0 [] relation(empty_set).
% 2.01/2.21 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.01/2.21 0 [] -empty(A)|empty(relation_dom(A)).
% 2.01/2.21 0 [] -empty(A)|relation(relation_dom(A)).
% 2.01/2.21 0 [] set_intersection2(A,A)=A.
% 2.01/2.21 0 [] empty($c1).
% 2.01/2.21 0 [] relation($c1).
% 2.01/2.21 0 [] empty($c2).
% 2.01/2.21 0 [] -empty($c3).
% 2.01/2.21 0 [] relation($c3).
% 2.01/2.21 0 [] -empty($c4).
% 2.01/2.21 0 [] -in(A,B)|element(A,B).
% 2.01/2.21 0 [] set_intersection2(A,empty_set)=empty_set.
% 2.01/2.21 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.01/2.21 0 [] in($f3(A,B),A)|in($f3(A,B),B)|A=B.
% 2.01/2.21 0 [] -in($f3(A,B),A)| -in($f3(A,B),B)|A=B.
% 2.01/2.21 0 [] -empty(A)|A=empty_set.
% 2.01/2.21 0 [] -in(A,B)| -empty(B).
% 2.01/2.21 0 [] -relation(C)| -in(A,relation_dom(relation_dom_restriction(C,B)))|in(A,B).
% 2.01/2.21 0 [] -relation(C)| -in(A,relation_dom(relation_dom_restriction(C,B)))|in(A,relation_dom(C)).
% 2.01/2.21 0 [] -relation(C)|in(A,relation_dom(relation_dom_restriction(C,B)))| -in(A,B)| -in(A,relation_dom(C)).
% 2.01/2.21 0 [] -empty(A)|A=B| -empty(B).
% 2.01/2.21 0 [] relation($c5).
% 2.01/2.21 0 [] relation_dom(relation_dom_restriction($c5,$c6))!=set_intersection2(relation_dom($c5),$c6).
% 2.01/2.21 end_of_list.
% 2.01/2.21
% 2.01/2.21 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.01/2.21
% 2.01/2.21 This ia a non-Horn set with equality. The strategy will be
% 2.01/2.21 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.01/2.21 deletion, with positive clauses in sos and nonpositive
% 2.01/2.21 clauses in usable.
% 2.01/2.21
% 2.01/2.21 dependent: set(knuth_bendix).
% 2.01/2.21 dependent: set(anl_eq).
% 2.01/2.21 dependent: set(para_from).
% 2.01/2.21 dependent: set(para_into).
% 2.01/2.21 dependent: clear(para_from_right).
% 2.01/2.21 dependent: clear(para_into_right).
% 2.01/2.21 dependent: set(pAlarm clock
% 299.85/300.03 Otter interrupted
% 299.85/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------