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