TSTP Solution File: LAT263-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:30 EDT 2022
% Result : Unsatisfiable 0.19s 0.39s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LAT263-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 05:46:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.12/0.35 Wed Jun 29 05:46:01 2022
% 0.12/0.35 The command was "./sos". The process ID is 26045.
% 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=4.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 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 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 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 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 2
% 0.19/0.37 number of clauses initially in problem: 12
% 0.19/0.37 percentage of clauses intially in UL: 16
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 87
% 0.19/0.37 percent of all initial clauses that are short: 91
% 0.19/0.37 absolute distinct symbol count: 16
% 0.19/0.37 distinct predicate count: 3
% 0.19/0.37 distinct function count: 6
% 0.19/0.37 distinct constant count: 7
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 0.19/0.39
% 0.19/0.39 -------- PROOF --------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 ----> UNIT CONFLICT at 0.02 sec ----> 20 [binary,19.1,1.1] {-} $F.
% 0.19/0.39
% 0.19/0.39 Length of proof is 5. Level of proof is 4.
% 0.19/0.39
% 0.19/0.39 ---------------- PROOF ----------------
% 0.19/0.39 % SZS status Unsatisfiable
% 0.19/0.39 % SZS output start Refutation
% 0.19/0.39
% 0.19/0.39 1 [] {+} -c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a).
% 0.19/0.39 2 [] {+} -c_in(A,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))| -c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))| -c_lessequals(C,c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),tc_set(B))|c_in(c_Tarski_Olub(C,A,B),c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),B).
% 0.19/0.39 3 [] {+} c_lessequals(v_S,v_A,tc_set(t_a)).
% 0.19/0.39 4 [] {-} v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 0.19/0.39 6,5 [copy,4,flip.1] {-} c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 0.19/0.39 7 [] {-} c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 0.19/0.39 8 [] {-} c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 0.19/0.39 9 [] {-} c_Tarski_Oglb(A,B,C)=c_Tarski_Olub(A,c_Tarski_Odual(B,C),C).
% 0.19/0.39 10 [copy,9,flip.1] {+} c_Tarski_Olub(A,c_Tarski_Odual(B,C),C)=c_Tarski_Oglb(A,B,C).
% 0.19/0.39 13,12 [] {-} 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.39 16 [para_from,10.1.1,2.4.1,demod,13,13] {+} -c_in(c_Tarski_Odual(A,B),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))| -c_in(c_Tarski_Odual(A,B),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))| -c_lessequals(C,c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),tc_set(B))|c_in(c_Tarski_Oglb(C,A,B),c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),B).
% 0.19/0.39 18 [para_into,16.3.2,5.1.1,demod,6] {+} -c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))| -c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit))| -c_lessequals(A,v_A,tc_set(t_a))|c_in(c_Tarski_Oglb(A,v_cl,t_a),v_A,t_a).
% 0.19/0.39 19 [hyper,18,7,8,3] {-} c_in(c_Tarski_Oglb(v_S,v_cl,t_a),v_A,t_a).
% 0.19/0.39 20 [binary,19.1,1.1] {-} $F.
% 0.19/0.39
% 0.19/0.39 % SZS output end Refutation
% 0.19/0.39 ------------ end of proof -------------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Search stopped by max_proofs option.
% 0.19/0.39
% 0.19/0.39 ============ end of search ============
% 0.19/0.39
% 0.19/0.39 ----------- soft-scott stats ----------
% 0.19/0.39
% 0.19/0.39 true clauses given 4 (40.0%)
% 0.19/0.39 false clauses given 6
% 0.19/0.39
% 0.19/0.39 FALSE TRUE
% 0.19/0.39 40 0 1
% 0.19/0.39 tot: 0 1 (100.0% true)
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 That finishes the proof of the theorem.
% 0.19/0.39
% 0.19/0.39 Process 26045 finished Wed Jun 29 05:46:01 2022
%------------------------------------------------------------------------------