TSTP Solution File: SET860-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET860-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:25 EDT 2022
% Result : Unknown 10.96s 11.16s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET860-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:35:59 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.81/1.99 ----- Otter 3.3f, August 2004 -----
% 1.81/1.99 The process was started by sandbox on n029.cluster.edu,
% 1.81/1.99 Wed Jul 27 10:35:59 2022
% 1.81/1.99 The command was "./otter". The process ID is 32176.
% 1.81/1.99
% 1.81/1.99 set(prolog_style_variables).
% 1.81/1.99 set(auto).
% 1.81/1.99 dependent: set(auto1).
% 1.81/1.99 dependent: set(process_input).
% 1.81/1.99 dependent: clear(print_kept).
% 1.81/1.99 dependent: clear(print_new_demod).
% 1.81/1.99 dependent: clear(print_back_demod).
% 1.81/1.99 dependent: clear(print_back_sub).
% 1.81/1.99 dependent: set(control_memory).
% 1.81/1.99 dependent: assign(max_mem, 12000).
% 1.81/1.99 dependent: assign(pick_given_ratio, 4).
% 1.81/1.99 dependent: assign(stats_level, 1).
% 1.81/1.99 dependent: assign(max_seconds, 10800).
% 1.81/1.99 clear(print_given).
% 1.81/1.99
% 1.81/1.99 list(usable).
% 1.81/1.99 0 [] A=A.
% 1.81/1.99 0 [] -c_lesse_quals(c_Union(v_C,t_a),v_A,tc_set(t_a)).
% 1.81/1.99 0 [] -c_lesse_quals(v_B,c_Union(v_C,t_a),tc_set(t_a)).
% 1.81/1.99 0 [] c_lesse_quals(v_B,V_U,tc_set(t_a))|c_lesse_quals(V_U,v_A,tc_set(t_a))| -c_in(V_U,v_C,tc_set(t_a)).
% 1.81/1.99 0 [] -c_in(V_c,V_A,T_a)| -c_in(V_c,c_uminus(V_A,tc_set(T_a)),T_a).
% 1.81/1.99 0 [] c_in(V_c,V_A,T_a)|c_in(V_c,c_uminus(V_A,tc_set(T_a)),T_a).
% 1.81/1.99 0 [] -c_lesse_quals(c_uminus(V_A,tc_set(T_a)),c_uminus(V_B,tc_set(T_a)),tc_set(T_a))|c_lesse_quals(V_B,V_A,tc_set(T_a)).
% 1.81/1.99 0 [] -c_lesse_quals(V_B,V_A,tc_set(T_a))|c_lesse_quals(c_uminus(V_A,tc_set(T_a)),c_uminus(V_B,tc_set(T_a)),tc_set(T_a)).
% 1.81/1.99 0 [] -c_in(V_c,c_inter(V_A,V_B,T_a),T_a)|c_in(V_c,V_B,T_a).
% 1.81/1.99 0 [] -c_in(V_c,c_inter(V_A,V_B,T_a),T_a)|c_in(V_c,V_A,T_a).
% 1.81/1.99 0 [] -c_in(V_c,V_B,T_a)| -c_in(V_c,V_A,T_a)|c_in(V_c,c_inter(V_A,V_B,T_a),T_a).
% 1.81/1.99 0 [] c_in(V_x,c_UNIV,T_a).
% 1.81/1.99 0 [] -c_in(V_c,V_B,T_a)|c_in(V_c,c_union(V_A,V_B,T_a),T_a).
% 1.81/1.99 0 [] -c_in(V_c,c_union(V_A,V_B,T_a),T_a)|c_in(V_c,V_B,T_a)|c_in(V_c,V_A,T_a).
% 1.81/1.99 0 [] -c_in(V_A,c_Union(V_C,T_a),T_a)|c_in(c_Main_OUnionE__1(V_A,V_C,T_a),V_C,tc_set(T_a)).
% 1.81/1.99 0 [] -c_in(V_A,c_Union(V_C,T_a),T_a)|c_in(V_A,c_Main_OUnionE__1(V_A,V_C,T_a),T_a).
% 1.81/1.99 0 [] -c_in(V_A,V_X,T_a)| -c_in(V_X,V_C,tc_set(T_a))|c_in(V_A,c_Union(V_C,T_a),T_a).
% 1.81/1.99 0 [] -c_in(V_a,c_emptyset,T_a).
% 1.81/1.99 0 [] -c_in(V_a,V_B,T_a)|c_in(V_a,c_insert(V_b,V_B,T_a),T_a).
% 1.81/1.99 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a).
% 1.81/1.99 0 [] -c_in(V_a,c_insert(V_b,V_A,T_a),T_a)|c_in(V_a,V_A,T_a)|V_a=V_b.
% 1.81/1.99 0 [] -c_in(V_c,V_A,T_a)| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_in(V_c,V_B,T_a).
% 1.81/1.99 0 [] c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.81/1.99 0 [] -c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.81/1.99 0 [] -c_lesse_quals(V_B,V_A,tc_set(T_a))| -c_lesse_quals(V_A,V_B,tc_set(T_a))|V_A=V_B.
% 1.81/1.99 end_of_list.
% 1.81/1.99
% 1.81/1.99 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.81/1.99
% 1.81/1.99 This ia a non-Horn set with equality. The strategy will be
% 1.81/1.99 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.81/1.99 deletion, with positive clauses in sos and nonpositive
% 1.81/1.99 clauses in usable.
% 1.81/1.99
% 1.81/1.99 dependent: set(knuth_bendix).
% 1.81/1.99 dependent: set(anl_eq).
% 1.81/1.99 dependent: set(para_from).
% 1.81/1.99 dependent: set(para_into).
% 1.81/1.99 dependent: clear(para_from_right).
% 1.81/1.99 dependent: clear(para_into_right).
% 1.81/1.99 dependent: set(para_from_vars).
% 1.81/1.99 dependent: set(eq_units_both_ways).
% 1.81/1.99 dependent: set(dynamic_demod_all).
% 1.81/1.99 dependent: set(dynamic_demod).
% 1.81/1.99 dependent: set(order_eq).
% 1.81/1.99 dependent: set(back_demod).
% 1.81/1.99 dependent: set(lrpo).
% 1.81/1.99 dependent: set(hyper_res).
% 1.81/1.99 dependent: set(unit_deletion).
% 1.81/1.99 dependent: set(factor).
% 1.81/1.99
% 1.81/1.99 ------------> process usable:
% 1.81/1.99 ** KEPT (pick-wt=7): 1 [] -c_lesse_quals(c_Union(v_C,t_a),v_A,tc_set(t_a)).
% 1.81/1.99 ** KEPT (pick-wt=7): 2 [] -c_lesse_quals(v_B,c_Union(v_C,t_a),tc_set(t_a)).
% 1.81/1.99 ** KEPT (pick-wt=15): 3 [] c_lesse_quals(v_B,A,tc_set(t_a))|c_lesse_quals(A,v_A,tc_set(t_a))| -c_in(A,v_C,tc_set(t_a)).
% 1.81/1.99 ** KEPT (pick-wt=11): 4 [] -c_in(A,B,C)| -c_in(A,c_uminus(B,tc_set(C)),C).
% 1.81/1.99 ** KEPT (pick-wt=16): 5 [] -c_lesse_quals(c_uminus(A,tc_set(B)),c_uminus(C,tc_set(B)),tc_set(B))|c_lesse_quals(C,A,tc_set(B)).
% 1.81/1.99 ** KEPT (pick-wt=16): 6 [] -c_lesse_quals(A,B,tc_set(C))|c_lesse_quals(c_uminus(B,tc_set(C)),c_uminus(A,tc_set(C)),tc_set(C)).
% 1.81/1.99 ** KEPT (pick-wt=11): 7 [] -c_in(A,c_inter(B,C,D),D)|c_in(A,C,D).
% 1.81/1.99 ** KEPT (pick-wt=11): 8 [] -c_in(A,c_inter(B,C,D),D)|c_in(A,B,D).
% 1.81/1.99 ** KEPT (pick-wt=15): 9 [] -c_in(A,B,C)| -c_in(A,D,C)|c_in(A,c_inter(D,B,C),C).
% 1.81/1.99 ** KEPT (pick-wt=11): 10 [] -c_in(A,B,C)|c_in(A,c_union(D,B,C),C).
% 10.96/11.16 ** KEPT (pick-wt=15): 11 [] -c_in(A,c_union(B,C,D),D)|c_in(A,C,D)|c_in(A,B,D).
% 10.96/11.16 ** KEPT (pick-wt=14): 12 [] -c_in(A,c_Union(B,C),C)|c_in(c_Main_OUnionE__1(A,B,C),B,tc_set(C)).
% 10.96/11.16 ** KEPT (pick-wt=13): 13 [] -c_in(A,c_Union(B,C),C)|c_in(A,c_Main_OUnionE__1(A,B,C),C).
% 10.96/11.16 ** KEPT (pick-wt=15): 14 [] -c_in(A,B,C)| -c_in(B,D,tc_set(C))|c_in(A,c_Union(D,C),C).
% 10.96/11.16 ** KEPT (pick-wt=4): 15 [] -c_in(A,c_emptyset,B).
% 10.96/11.16 ** KEPT (pick-wt=11): 16 [] -c_in(A,B,C)|c_in(A,c_insert(D,B,C),C).
% 10.96/11.16 ** KEPT (pick-wt=14): 17 [] -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 10.96/11.16 ** KEPT (pick-wt=13): 18 [] -c_in(A,B,C)| -c_lesse_quals(B,D,tc_set(C))|c_in(A,D,C).
% 10.96/11.16 ** KEPT (pick-wt=12): 19 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 10.96/11.16 ** KEPT (pick-wt=13): 20 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(B,A,tc_set(C))|B=A.
% 10.96/11.16
% 10.96/11.16 ------------> process sos:
% 10.96/11.16 ** KEPT (pick-wt=3): 24 [] A=A.
% 10.96/11.16 ** KEPT (pick-wt=11): 25 [] c_in(A,B,C)|c_in(A,c_uminus(B,tc_set(C)),C).
% 10.96/11.16 ** KEPT (pick-wt=4): 26 [] c_in(A,c_UNIV,B).
% 10.96/11.16 ** KEPT (pick-wt=7): 27 [] c_in(A,c_insert(A,B,C),C).
% 10.96/11.16 ** KEPT (pick-wt=12): 28 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 10.96/11.16 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] A=A.
% 10.96/11.16 24 back subsumes 23.
% 10.96/11.16
% 10.96/11.16 ======= end of input processing =======
% 10.96/11.16
% 10.96/11.16 =========== start of search ===========
% 10.96/11.16
% 10.96/11.16
% 10.96/11.16 Resetting weight limit to 11.
% 10.96/11.16
% 10.96/11.16
% 10.96/11.16 Resetting weight limit to 11.
% 10.96/11.16
% 10.96/11.16 sos_size=492
% 10.96/11.16
% 10.96/11.16 Search stopped because sos empty.
% 10.96/11.16
% 10.96/11.16
% 10.96/11.16 Search stopped because sos empty.
% 10.96/11.16
% 10.96/11.16 ============ end of search ============
% 10.96/11.16
% 10.96/11.16 -------------- statistics -------------
% 10.96/11.16 clauses given 598
% 10.96/11.16 clauses generated 789253
% 10.96/11.16 clauses kept 845
% 10.96/11.16 clauses forward subsumed 5337
% 10.96/11.16 clauses back subsumed 26
% 10.96/11.16 Kbytes malloced 7812
% 10.96/11.16
% 10.96/11.16 ----------- times (seconds) -----------
% 10.96/11.16 user CPU time 9.16 (0 hr, 0 min, 9 sec)
% 10.96/11.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 10.96/11.16 wall-clock time 11 (0 hr, 0 min, 11 sec)
% 10.96/11.16
% 10.96/11.16 Process 32176 finished Wed Jul 27 10:36:10 2022
% 10.96/11.16 Otter interrupted
% 10.96/11.16 PROOF NOT FOUND
%------------------------------------------------------------------------------