TSTP Solution File: SEU154+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:57 EDT 2022
% Result : Timeout 299.82s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU154+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 07:44:05 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.90/2.03 ----- Otter 3.3f, August 2004 -----
% 1.90/2.03 The process was started by sandbox on n022.cluster.edu,
% 1.90/2.03 Wed Jul 27 07:44:05 2022
% 1.90/2.03 The command was "./otter". The process ID is 29331.
% 1.90/2.03
% 1.90/2.03 set(prolog_style_variables).
% 1.90/2.03 set(auto).
% 1.90/2.03 dependent: set(auto1).
% 1.90/2.03 dependent: set(process_input).
% 1.90/2.03 dependent: clear(print_kept).
% 1.90/2.03 dependent: clear(print_new_demod).
% 1.90/2.03 dependent: clear(print_back_demod).
% 1.90/2.03 dependent: clear(print_back_sub).
% 1.90/2.03 dependent: set(control_memory).
% 1.90/2.03 dependent: assign(max_mem, 12000).
% 1.90/2.03 dependent: assign(pick_given_ratio, 4).
% 1.90/2.03 dependent: assign(stats_level, 1).
% 1.90/2.03 dependent: assign(max_seconds, 10800).
% 1.90/2.03 clear(print_given).
% 1.90/2.03
% 1.90/2.03 formula_list(usable).
% 1.90/2.03 all A (A=A).
% 1.90/2.03 all A B (in(A,B)-> -in(B,A)).
% 1.90/2.03 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.90/2.03 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.90/2.03 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 1.90/2.03 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.90/2.03 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.90/2.03 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.90/2.03 $T.
% 1.90/2.03 $T.
% 1.90/2.03 $T.
% 1.90/2.03 empty(empty_set).
% 1.90/2.03 all A B (set_intersection2(A,A)=A).
% 1.90/2.03 -(all A B (-in(A,B)->disjoint(singleton(A),B))).
% 1.90/2.03 exists A empty(A).
% 1.90/2.03 exists A (-empty(A)).
% 1.90/2.03 all A B subset(A,A).
% 1.90/2.03 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.90/2.03 all A subset(empty_set,A).
% 1.90/2.03 end_of_list.
% 1.90/2.03
% 1.90/2.03 -------> usable clausifies to:
% 1.90/2.03
% 1.90/2.03 list(usable).
% 1.90/2.03 0 [] A=A.
% 1.90/2.03 0 [] -in(A,B)| -in(B,A).
% 1.90/2.03 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.90/2.03 0 [] A!=B|subset(A,B).
% 1.90/2.03 0 [] A!=B|subset(B,A).
% 1.90/2.03 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.90/2.03 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 1.90/2.03 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 1.90/2.03 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 1.90/2.03 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 1.90/2.03 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.90/2.03 0 [] subset(A,B)|in($f2(A,B),A).
% 1.90/2.03 0 [] subset(A,B)| -in($f2(A,B),B).
% 1.90/2.03 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.90/2.03 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.90/2.03 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.90/2.03 0 [] C=set_intersection2(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),A).
% 1.90/2.03 0 [] C=set_intersection2(A,B)|in($f3(A,B,C),C)|in($f3(A,B,C),B).
% 1.90/2.03 0 [] C=set_intersection2(A,B)| -in($f3(A,B,C),C)| -in($f3(A,B,C),A)| -in($f3(A,B,C),B).
% 1.90/2.03 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.90/2.03 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.90/2.03 0 [] $T.
% 1.90/2.03 0 [] $T.
% 1.90/2.03 0 [] $T.
% 1.90/2.03 0 [] empty(empty_set).
% 1.90/2.03 0 [] set_intersection2(A,A)=A.
% 1.90/2.03 0 [] -in($c2,$c1).
% 1.90/2.03 0 [] -disjoint(singleton($c2),$c1).
% 1.90/2.03 0 [] empty($c3).
% 1.90/2.03 0 [] -empty($c4).
% 1.90/2.03 0 [] subset(A,A).
% 1.90/2.03 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.90/2.03 0 [] subset(empty_set,A).
% 1.90/2.03 end_of_list.
% 1.90/2.03
% 1.90/2.03 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.90/2.03
% 1.90/2.03 This ia a non-Horn set with equality. The strategy will be
% 1.90/2.03 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.90/2.03 deletion, with positive clauses in sos and nonpositive
% 1.90/2.03 clauses in usable.
% 1.90/2.03
% 1.90/2.03 dependent: set(knuth_bendix).
% 1.90/2.03 dependent: set(anl_eq).
% 1.90/2.03 dependent: set(para_from).
% 1.90/2.03 dependent: set(para_into).
% 1.90/2.03 dependent: clear(para_from_right).
% 1.90/2.03 dependent: clear(para_into_right).
% 1.90/2.03 dependent: set(para_from_vars).
% 1.90/2.03 dependent: set(eq_units_both_ways).
% 1.90/2.03 dependent: set(dynamic_demod_all).
% 1.90/2.03 dependent: set(dynamic_demod).
% 1.90/2.03 dependent: set(order_eq).
% 1.90/2.03 dependent: set(back_demod).
% 1.90/2.03 dependent: set(lrpo).
% 1.90/2.03 dependent: set(hyper_res).
% 1.90/2.03 dependent: set(unit_deletion).
% 1.90/2.03 dependent: set(factor).
% 1.90/2.03
% 1.90/2.03 ------------> process usable:
% 1.90/2.03 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.90/2.03 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 1.90/2.03 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 1.90/2.03 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 1.90/2.03 ** KEPT (pick-wt=10): 5 [] A!=singleton(B)| -in(C,A)|C=B.
% 1.90/2.03 ** KEPT (pick-wt=10): 6 [] A!=singleton(B)|in(C,A)|C!=B.
% 1.90/2.03 ** KEPT (pick-wt=14): 7 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 1.90/2.03 ** KEPT (pick-wt=9): 8 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.90/2.03 ** KEPT (pick-wt=8): 9 [] subset(A,B)| -in($f2(A,B),B).
% 1.90/2.03 ** KEPT (pick-wt=11): 10 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.90/2.03 ** KEPT (pick-wt=11): 11 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.90/2.03 ** KEPT (pick-wt=14): 12 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.90/2.03 ** KEPT (pick-wt=23): 13 [] A=seAlarm clock
% 299.82/300.03 Otter interrupted
% 299.82/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------