%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LAT277-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:39 EDT 2022
% Result : Unsatisfiable 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LAT277-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 30 00:32:27 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n021.cluster.edu,
% 0.20/0.36 Thu Jun 30 00:32:27 2022
% 0.20/0.36 The command was "./sos". The process ID is 13957.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.20/0.36
% 0.20/0.36 This is a Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.20/0.36 sos and nonpositive clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: clear(order_hyper).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.55
% 0.20/0.55 Stopped by limit on insertions
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Failed to model usable list: disabling FINDER
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 -------------- Softie stats --------------
% 0.20/0.55
% 0.20/0.55 UPDATE_STOP: 300
% 0.20/0.55 SFINDER_TIME_LIMIT: 2
% 0.20/0.55 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.55 number of clauses in intial UL: 3
% 0.20/0.55 number of clauses initially in problem: 10
% 0.20/0.55 percentage of clauses intially in UL: 30
% 0.20/0.55 percentage of distinct symbols occuring in initial UL: 80
% 0.20/0.55 percent of all initial clauses that are short: 100
% 0.20/0.55 absolute distinct symbol count: 15
% 0.20/0.55 distinct predicate count: 3
% 0.20/0.55 distinct function count: 5
% 0.20/0.55 distinct constant count: 7
% 0.20/0.55
% 0.20/0.55 ---------- no more Softie stats ----------
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 =========== start of search ===========
% 0.20/0.55
% 0.20/0.55 -------- PROOF --------
% 0.20/0.55 % SZS status Unsatisfiable
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 ----> UNIT CONFLICT at 0.17 sec ----> 16 [binary,15.1,1.1] {-} $F.
% 0.20/0.55
% 0.20/0.55 Length of proof is 4. Level of proof is 3.
% 0.20/0.55
% 0.20/0.55 ---------------- PROOF ----------------
% 0.20/0.55 % SZS status Unsatisfiable
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 1 [] {+} -c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.20/0.55 2 [] {+} -c_Relation_Orefl(A,B,C)| -c_in(D,A,C)|c_in(c_Pair(D,D,C,C),B,tc_prod(C,C)).
% 0.20/0.55 3 [] {+} -c_in(A,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(B,tc_Product__Type_Ounit))|c_Relation_Orefl(c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit),c_Tarski_Opotype_Oorder(A,B,tc_Product__Type_Ounit),B).
% 0.20/0.55 4 [] {-} c_in(v_x,v_A,t_a).
% 0.20/0.55 5 [] {-} v_A=c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit).
% 0.20/0.55 7,6 [copy,5,flip.1] {-} c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit)=v_A.
% 0.20/0.55 8 [] {-} c_in(v_cl,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)).
% 0.20/0.55 9 [] {-} v_r=c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit).
% 0.20/0.55 11,10 [copy,9,flip.1] {-} c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit)=v_r.
% 0.20/0.55 14 [hyper,8,3,demod,7,11] {-} c_Relation_Orefl(v_A,v_r,t_a).
% 0.20/0.55 15 [hyper,14,2,4] {-} c_in(c_Pair(v_x,v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)).
% 0.20/0.55 16 [binary,15.1,1.1] {-} $F.
% 0.20/0.55
% 0.20/0.55 % SZS output end Refutation
% 0.20/0.55 ------------ end of proof -------------
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55 ============ end of search ============
% 0.20/0.55
% 0.20/0.55 That finishes the proof of the theorem.
% 0.20/0.55
% 0.20/0.55 Process 13957 finished Thu Jun 30 00:32:27 2022
%------------------------------------------------------------------------------