TSTP Solution File: LAT268-10 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT268-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:33 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT268-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.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 : Wed Jun 29 19:35:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.35 Wed Jun 29 19:35:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 15594.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 1
% 0.12/0.40 number of clauses initially in problem: 24
% 0.12/0.40 percentage of clauses intially in UL: 4
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 47
% 0.12/0.40 percent of all initial clauses that are short: 91
% 0.12/0.40 absolute distinct symbol count: 23
% 0.12/0.40 distinct predicate count: 1
% 0.12/0.40 distinct function count: 12
% 0.12/0.40 distinct constant count: 10
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.19/0.42
% 0.19/0.42 -------- PROOF --------
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output start Refutation
% 0.19/0.42
% 0.19/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42 ----> UNIT CONFLICT at 0.03 sec ----> 46 [binary,44.1,1.1] {-} $F.
% 0.19/0.42
% 0.19/0.42 Length of proof is 7. Level of proof is 4.
% 0.19/0.42
% 0.19/0.42 ---------------- PROOF ----------------
% 0.19/0.42 % SZS status Unsatisfiable
% 0.19/0.42 % SZS output start Refutation
% 0.19/0.42
% 0.19/0.42 1 [] {+} c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))!=true.
% 0.19/0.42 3,2 [] {+} ifeq(A,A,B,C)=B.
% 0.19/0.42 5,4 [] {-} c_lessequals(v_S,v_A,tc_set(t_a))=true.
% 0.19/0.42 6 [] {-} c_in(v_x,v_S,t_a)=true.
% 0.19/0.42 8 [] {-} v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 0.19/0.42 10,9 [copy,8,flip.1] {+} c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 0.19/0.42 11 [] {-} ifeq(c_lessequals(A,c_Tarski_Opotype_Opset(B,C,tc_Product__Type_Ounit),tc_set(C)),true,ifeq(c_in(B,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),true,ifeq(c_in(B,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),true,ifeq(c_in(D,A,C),true,c_in(c_Pair(D,c_Tarski_Olub(A,B,C),C,C),c_Tarski_Opotype_Oorder(B,C,tc_Product__Type_Ounit),tc_prod(C,C)),true),true),true),true)=true.
% 0.19/0.42 13 [] {-} ifeq(c_in(c_Pair(A,B,C,C),c_Tarski_Opotype_Oorder(c_Tarski_Odual(D,C),C,tc_Product__Type_Ounit),tc_prod(C,C)),true,c_in(c_Pair(B,A,C,C),c_Tarski_Opotype_Oorder(D,C,tc_Product__Type_Ounit),tc_prod(C,C)),true)=true.
% 0.19/0.42 15 [] {-} c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true.
% 0.19/0.42 18,17 [] {-} c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))=true.
% 0.19/0.42 19 [] {-} c_Tarski_Oglb(A,B,C)=c_Tarski_Olub(A,c_Tarski_Odual(B,C),C).
% 0.19/0.42 21,20 [copy,19,flip.1] {+} c_Tarski_Olub(A,c_Tarski_Odual(B,C),C)=c_Tarski_Oglb(A,B,C).
% 0.19/0.42 23,22 [] {-} c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit)=c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit).
% 0.19/0.42 24 [] {-} v_r=c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit).
% 0.19/0.42 25 [copy,24,flip.1] {-} c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 0.19/0.42 32 [para_into,11.1.1.3.1,15.1.1,demod,23,10,18,21,3,3] {-} ifeq(c_lessequals(A,v_A,tc_set(t_a)),true,ifeq(c_in(B,A,t_a),true,c_in(c_Pair(B,c_Tarski_Oglb(A,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true),true)=true.
% 0.19/0.42 36 [para_into,13.1.1.3.2,25.1.1] {-} ifeq(c_in(c_Pair(A,B,t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)),true,c_in(c_Pair(B,A,t_a,t_a),v_r,tc_prod(t_a,t_a)),true)=true.
% 0.19/0.42 40 [para_into,32.1.1.3.1,6.1.1,demod,5,3,3] {+} c_in(c_Pair(v_x,c_Tarski_Oglb(v_S,v_cl,t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a))=true.
% 0.19/0.42 44 [para_from,40.1.1,36.1.1.1,demod,3] {-} c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a))=true.
% 0.19/0.42 46 [binary,44.1,1.1] {-} $F.
% 0.19/0.42
% 0.19/0.42 % SZS output end Refutation
% 0.19/0.42 ------------ end of proof -------------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Search stopped by max_proofs option.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Search stopped by max_proofs option.
% 0.19/0.42
% 0.19/0.42 ============ end of search ============
% 0.19/0.42
% 0.19/0.42 ----------- soft-scott stats ----------
% 0.19/0.42
% 0.19/0.42 true clauses given 3 (17.6%)
% 0.19/0.42 false clauses given 14
% 0.19/0.42
% 0.19/0.42 FALSE TRUE
% 0.19/0.42 47 1 0
% 0.19/0.42 48 1 0
% 0.19/0.42 53 1 0
% 0.19/0.42 tot: 3 0 (0.0% true)
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 That finishes the proof of the theorem.
% 0.19/0.42
% 0.19/0.42 Process 15594 finished Wed Jun 29 19:35:53 2022
%------------------------------------------------------------------------------