TSTP Solution File: LAT276-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT276-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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:38 EDT 2022
% Result : Unsatisfiable 0.11s 0.38s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LAT276-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n015.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 29 15:28:41 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 ----- Otter 3.2, August 2001 -----
% 0.11/0.35 The process was started by sandbox on n015.cluster.edu,
% 0.11/0.35 Wed Jun 29 15:28:41 2022
% 0.11/0.35 The command was "./sos". The process ID is 889.
% 0.11/0.35
% 0.11/0.35 set(prolog_style_variables).
% 0.11/0.35 set(auto).
% 0.11/0.35 dependent: set(auto1).
% 0.11/0.35 dependent: set(process_input).
% 0.11/0.35 dependent: clear(print_kept).
% 0.11/0.35 dependent: clear(print_new_demod).
% 0.11/0.35 dependent: clear(print_back_demod).
% 0.11/0.35 dependent: clear(print_back_sub).
% 0.11/0.35 dependent: set(control_memory).
% 0.11/0.35 dependent: assign(max_mem, 12000).
% 0.11/0.35 dependent: assign(pick_given_ratio, 4).
% 0.11/0.35 dependent: assign(stats_level, 1).
% 0.11/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35 dependent: assign(sos_limit, 5000).
% 0.11/0.35 dependent: assign(max_weight, 60).
% 0.11/0.35 clear(print_given).
% 0.11/0.35
% 0.11/0.35 list(usable).
% 0.11/0.35
% 0.11/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.11/0.35
% 0.11/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.35 clauses in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(knuth_bendix).
% 0.11/0.35 dependent: set(para_from).
% 0.11/0.35 dependent: set(para_into).
% 0.11/0.35 dependent: clear(para_from_right).
% 0.11/0.35 dependent: clear(para_into_right).
% 0.11/0.35 dependent: set(para_from_vars).
% 0.11/0.35 dependent: set(eq_units_both_ways).
% 0.11/0.35 dependent: set(dynamic_demod_all).
% 0.11/0.35 dependent: set(dynamic_demod).
% 0.11/0.35 dependent: set(order_eq).
% 0.11/0.35 dependent: set(back_demod).
% 0.11/0.35 dependent: set(lrpo).
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: set(unit_deletion).
% 0.11/0.35 dependent: set(factor).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.11/0.37
% 0.11/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.37
% 0.11/0.37 Stopped by limit on number of solutions
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 -------------- Softie stats --------------
% 0.11/0.37
% 0.11/0.37 UPDATE_STOP: 300
% 0.11/0.37 SFINDER_TIME_LIMIT: 2
% 0.11/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.37 number of clauses in intial UL: 4
% 0.11/0.37 number of clauses initially in problem: 15
% 0.11/0.37 percentage of clauses intially in UL: 26
% 0.11/0.37 percentage of distinct symbols occuring in initial UL: 64
% 0.11/0.37 percent of all initial clauses that are short: 100
% 0.11/0.37 absolute distinct symbol count: 17
% 0.11/0.37 distinct predicate count: 3
% 0.11/0.37 distinct function count: 7
% 0.11/0.37 distinct constant count: 7
% 0.11/0.37
% 0.11/0.37 ---------- no more Softie stats ----------
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37
% 0.11/0.37 =========== start of search ===========
% 0.11/0.38
% 0.11/0.38 -------- PROOF --------
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % SZS output start Refutation
% 0.11/0.38
% 0.11/0.38 -----> EMPTY CLAUSE at 0.01 sec ----> 57 [hyper,53,20,41] {-} $F.
% 0.11/0.38
% 0.11/0.38 Length of proof is 17. Level of proof is 12.
% 0.11/0.38
% 0.11/0.38 ---------------- PROOF ----------------
% 0.11/0.38 % SZS status Unsatisfiable
% 0.11/0.38 % SZS output start Refutation
% 0.11/0.38
% 0.11/0.38 1 [] {-} c_in(c_Pair(A,v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))| -c_in(A,v_S,t_a)| -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)).
% 0.11/0.38 2 [] {-} -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))|c_in(v_xa,v_S,t_a).
% 0.11/0.38 3 [] {-} -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))| -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)).
% 0.11/0.38 4 [] {-} c_in(c_Pair(A,v_xa,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))| -c_in(A,v_S,t_a)|c_in(v_xa,v_S,t_a).
% 0.11/0.38 5 [] {+} -c_in(A,B,C)| -c_lessequals(B,D,tc_set(C))|c_in(A,D,C).
% 0.11/0.38 6 [] {+} -c_in(A,v_A,t_a)| -c_lessequals(B,v_A,tc_set(t_a))|c_in(c_Pair(c_Tarski_Olub(B,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mP(A,B,v_r),B,t_a).
% 0.11/0.38 7 [] {+} -c_in(A,v_A,t_a)| -c_in(c_Pair(v_sko__4mP(A,B,v_r),A,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_lessequals(B,v_A,tc_set(t_a))|c_in(c_Pair(c_Tarski_Olub(B,v_cl,t_a),A,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 8 [] {+} -c_in(A,B,t_a)| -c_lessequals(B,v_A,tc_set(t_a))|c_in(c_Pair(A,c_Tarski_Olub(B,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 9 [] {+} c_lessequals(v_S,v_A,tc_set(t_a)).
% 0.11/0.38 10 [] {-} c_in(v_xa,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),t_a)|c_in(v_xa,v_S,t_a).
% 0.11/0.38 11 [] {-} v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 0.11/0.38 13,12 [copy,11,flip.1] {-} c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 0.11/0.38 14 [] {-} v_r=c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit).
% 0.11/0.38 16,15 [copy,14,flip.1] {-} c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 0.11/0.38 18 [back_demod,10,demod,13] {+} c_in(v_xa,v_A,t_a)|c_in(v_xa,v_S,t_a).
% 0.11/0.38 19 [back_demod,4,demod,16] {+} c_in(c_Pair(A,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_in(A,v_S,t_a)|c_in(v_xa,v_S,t_a).
% 0.11/0.38 20 [back_demod,3,demod,16,16] {-} -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 21 [back_demod,2,demod,16] {+} -c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_xa,v_S,t_a).
% 0.11/0.38 22 [back_demod,1,demod,16,16] {-} c_in(c_Pair(A,v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))| -c_in(A,v_S,t_a)| -c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 25 [hyper,18,5,9,factor_simp] {+} c_in(v_xa,v_A,t_a).
% 0.11/0.38 26 [hyper,25,6,9] {+} c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a))|c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a).
% 0.11/0.38 27 [hyper,26,21] {+} c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a)|c_in(v_xa,v_S,t_a).
% 0.11/0.38 31 [hyper,27,19,factor_simp] {+} c_in(v_xa,v_S,t_a)|c_in(c_Pair(v_sko__4mP(v_xa,v_S,v_r),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 38 [hyper,31,7,25,9] {+} c_in(v_xa,v_S,t_a)|c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 40 [hyper,38,21,factor_simp] {+} c_in(v_xa,v_S,t_a).
% 0.11/0.38 41 [hyper,40,8,9] {+} c_in(c_Pair(v_xa,c_Tarski_Olub(v_S,v_cl,t_a),t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 45 [hyper,41,20,26] {-} c_in(v_sko__4mP(v_xa,v_S,v_r),v_S,t_a).
% 0.11/0.38 46 [hyper,45,22,41] {+} c_in(c_Pair(v_sko__4mP(v_xa,v_S,v_r),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 53 [hyper,46,7,25,9] {+} c_in(c_Pair(c_Tarski_Olub(v_S,v_cl,t_a),v_xa,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.11/0.38 57 [hyper,53,20,41] {-} $F.
% 0.11/0.38
% 0.11/0.38 % SZS output end Refutation
% 0.11/0.38 ------------ end of proof -------------
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Search stopped by max_proofs option.
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Search stopped by max_proofs option.
% 0.11/0.38
% 0.11/0.38 ============ end of search ============
% 0.11/0.38
% 0.11/0.38 ----------- soft-scott stats ----------
% 0.11/0.38
% 0.11/0.38 true clauses given 17 (58.6%)
% 0.11/0.38 false clauses given 12
% 0.11/0.38
% 0.11/0.38 FALSE TRUE
% 0.11/0.38 48 1 0
% 0.11/0.38 54 0 1
% 0.11/0.38 57 1 0
% 0.11/0.38 tot: 2 1 (33.3% true)
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.38
% 0.11/0.38 That finishes the proof of the theorem.
% 0.11/0.38
% 0.11/0.38 Process 889 finished Wed Jun 29 15:28:41 2022
%------------------------------------------------------------------------------