TSTP Solution File: LAT274-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT274-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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 : 600s
% DateTime : Sun Jul 17 06:46:37 EDT 2022
% Result : Unsatisfiable 0.72s 0.92s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT274-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n013.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 : 600
% 0.12/0.33 % DateTime : Thu Jun 30 05:35:14 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n013.cluster.edu,
% 0.19/0.35 Thu Jun 30 05:35:14 2022
% 0.19/0.35 The command was "./sos". The process ID is 25652.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.46/0.66
% 0.46/0.66 Stopped by limit on insertions
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Failed to model usable list: disabling FINDER
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 -------------- Softie stats --------------
% 0.46/0.66
% 0.46/0.66 UPDATE_STOP: 300
% 0.46/0.66 SFINDER_TIME_LIMIT: 2
% 0.46/0.66 SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.66 number of clauses in intial UL: 13
% 0.46/0.66 number of clauses initially in problem: 17
% 0.46/0.66 percentage of clauses intially in UL: 76
% 0.46/0.66 percentage of distinct symbols occuring in initial UL: 100
% 0.46/0.66 percent of all initial clauses that are short: 94
% 0.46/0.66 absolute distinct symbol count: 20
% 0.46/0.66 distinct predicate count: 4
% 0.46/0.66 distinct function count: 7
% 0.46/0.66 distinct constant count: 9
% 0.46/0.66
% 0.46/0.66 ---------- no more Softie stats ----------
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 =========== start of search ===========
% 0.72/0.92
% 0.72/0.92 -------- PROOF --------
% 0.72/0.92 % SZS status Unsatisfiable
% 0.72/0.92 % SZS output start Refutation
% 0.72/0.92
% 0.72/0.92 ----> UNIT CONFLICT at 0.54 sec ----> 1548 [binary,1547.1,12.1] {-} $F.
% 0.72/0.92
% 0.72/0.92 Length of proof is 17. Level of proof is 16.
% 0.72/0.92
% 0.72/0.92 ---------------- PROOF ----------------
% 0.72/0.92 % SZS status Unsatisfiable
% 0.72/0.92 % SZS output start Refutation
% 0.72/0.92
% 0.72/0.92 1 [] {+} -c_lessequals(A,B,tc_set(t_a))|c_in(c_Pair(C,D,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mj(A,C,v_r),A,t_a)|c_in(v_sko__4mk(D,A,v_r),A,t_a)|A=c_emptyset.
% 0.72/0.92 2 [] {+} -c_in(c_Pair(v_sko__4mk(A,B,v_r),A,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_lessequals(B,C,tc_set(t_a))|c_in(c_Pair(D,A,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mj(B,D,v_r),B,t_a)|B=c_emptyset.
% 0.72/0.92 3 [] {+} -c_in(c_Pair(A,v_sko__4mj(B,A,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_lessequals(B,C,tc_set(t_a))|c_in(c_Pair(A,D,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mk(D,B,v_r),B,t_a)|B=c_emptyset.
% 0.72/0.92 4 [] {+} -c_in(c_Pair(A,v_sko__4mj(B,A,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_in(c_Pair(v_sko__4mk(C,B,v_r),C,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_lessequals(B,D,tc_set(t_a))|c_in(c_Pair(A,C,t_a,t_a),v_r,tc_prod(t_a,t_a))|B=c_emptyset.
% 0.72/0.92 5 [] {+} -c_in(A,B,C)| -c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))|c_in(c_Pair(E,A,C,C),D,tc_prod(C,C)).
% 0.72/0.92 6 [] {+} -c_in(A,B,C)| -c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C))|c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)).
% 0.72/0.92 7 [] {+} -c_in(c_Pair(A,B,C,C),D,tc_prod(C,C))| -c_in(c_Pair(E,A,C,C),D,tc_prod(C,C))|c_in(A,c_Tarski_Ointerval(D,E,B,C),C).
% 0.72/0.92 8 [] {+} -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,A,t_a)|c_in(c_Pair(C,B,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 9 [] {+} -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(A,v_r,C),A,t_a).
% 0.72/0.92 10 [] {+} -c_Tarski_OisLub(A,v_cl,B,t_a)| -c_in(C,v_A,t_a)| -c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 11 [] {+} v_S!=c_emptyset.
% 0.72/0.92 12 [] {+} -c_in(v_L,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),t_a).
% 0.72/0.92 14 [] {-} c_in(v_b,v_A,t_a).
% 0.72/0.92 15 [] {-} c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)).
% 0.72/0.92 16 [] {-} c_Tarski_OisLub(v_S,v_cl,v_L,t_a).
% 0.72/0.92 30 [hyper,16,9,14] {-} c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a).
% 0.72/0.92 47 [hyper,15,1,unit_del,11] {-} c_in(c_Pair(A,B,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mj(v_S,A,v_r),v_S,t_a)|c_in(v_sko__4mk(B,v_S,v_r),v_S,t_a).
% 0.72/0.92 80 [hyper,30,6,15] {-} c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(c_Pair(v_sko__4mi(v_S,v_r,v_b),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 274 [hyper,80,10,16,14,factor_simp] {-} c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 320 [hyper,47,7,274] {-} c_in(v_sko__4mj(v_S,A,v_r),v_S,t_a)|c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a)|c_in(v_L,c_Tarski_Ointerval(v_r,A,v_b,t_a),t_a).
% 0.72/0.92 434 [hyper,320,12] {-} c_in(v_sko__4mj(v_S,v_a,v_r),v_S,t_a)|c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a).
% 0.72/0.92 479 [hyper,434,5,15] {-} c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a)|c_in(c_Pair(v_a,v_sko__4mj(v_S,v_a,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 730 [hyper,479,3,15,unit_del,11] {-} c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a)|c_in(c_Pair(v_a,A,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mk(A,v_S,v_r),v_S,t_a).
% 0.72/0.92 731 [factor,730.1.3] {-} c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a)|c_in(c_Pair(v_a,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 794 [hyper,731,7,274,unit_del,12] {-} c_in(v_sko__4mk(v_L,v_S,v_r),v_S,t_a).
% 0.72/0.92 795 [hyper,794,8,16] {-} c_in(c_Pair(v_sko__4mk(v_L,v_S,v_r),v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 824 [hyper,795,2,15,unit_del,11] {-} c_in(c_Pair(A,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mj(v_S,A,v_r),v_S,t_a).
% 0.72/0.92 1130 [hyper,824,7,274] {-} c_in(v_sko__4mj(v_S,A,v_r),v_S,t_a)|c_in(v_L,c_Tarski_Ointerval(v_r,A,v_b,t_a),t_a).
% 0.72/0.92 1250 [hyper,1130,12] {-} c_in(v_sko__4mj(v_S,v_a,v_r),v_S,t_a).
% 0.72/0.92 1291 [hyper,1250,5,15] {-} c_in(c_Pair(v_a,v_sko__4mj(v_S,v_a,v_r),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 1483 [hyper,1291,4,795,15,unit_del,11] {-} c_in(c_Pair(v_a,v_L,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.72/0.92 1547 [hyper,1483,7,274] {-} c_in(v_L,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),t_a).
% 0.72/0.92 1548 [binary,1547.1,12.1] {-} $F.
% 0.72/0.92
% 0.72/0.92 % SZS output end Refutation
% 0.72/0.92 ------------ end of proof -------------
% 0.72/0.92
% 0.72/0.92
% 0.72/0.92 Search stopped by max_proofs option.
% 0.72/0.92
% 0.72/0.92
% 0.72/0.92 Search stopped by max_proofs option.
% 0.72/0.92
% 0.72/0.92 ============ end of search ============
% 0.72/0.92
% 0.72/0.92 That finishes the proof of the theorem.
% 0.72/0.92
% 0.72/0.92 Process 25652 finished Thu Jun 30 05:35:15 2022
%------------------------------------------------------------------------------