TSTP Solution File: LCL844-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL844-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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 14:33:25 EDT 2022
% Result : Unsatisfiable 0.16s 0.41s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : LCL844-1 : TPTP v8.1.0. Released v4.1.0.
% 0.04/0.12 % Command : sos-script %s
% 0.12/0.31 % Computer : n011.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 600
% 0.12/0.31 % DateTime : Sun Jul 3 13:21:50 EDT 2022
% 0.16/0.31 % CPUTime :
% 0.16/0.33 ----- Otter 3.2, August 2001 -----
% 0.16/0.33 The process was started by sandbox2 on n011.cluster.edu,
% 0.16/0.33 Sun Jul 3 13:21:50 2022
% 0.16/0.33 The command was "./sos". The process ID is 2774.
% 0.16/0.33
% 0.16/0.33 set(prolog_style_variables).
% 0.16/0.33 set(auto).
% 0.16/0.33 dependent: set(auto1).
% 0.16/0.33 dependent: set(process_input).
% 0.16/0.33 dependent: clear(print_kept).
% 0.16/0.33 dependent: clear(print_new_demod).
% 0.16/0.33 dependent: clear(print_back_demod).
% 0.16/0.33 dependent: clear(print_back_sub).
% 0.16/0.33 dependent: set(control_memory).
% 0.16/0.33 dependent: assign(max_mem, 12000).
% 0.16/0.33 dependent: assign(pick_given_ratio, 4).
% 0.16/0.33 dependent: assign(stats_level, 1).
% 0.16/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.33 dependent: assign(sos_limit, 5000).
% 0.16/0.33 dependent: assign(max_weight, 60).
% 0.16/0.33 clear(print_given).
% 0.16/0.33
% 0.16/0.33 list(usable).
% 0.16/0.33
% 0.16/0.33 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.16/0.33
% 0.16/0.33 This ia a non-Horn set with equality. The strategy will be
% 0.16/0.33 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.33 unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.33 clauses in usable.
% 0.16/0.33
% 0.16/0.33 dependent: set(knuth_bendix).
% 0.16/0.33 dependent: set(para_from).
% 0.16/0.33 dependent: set(para_into).
% 0.16/0.33 dependent: clear(para_from_right).
% 0.16/0.33 dependent: clear(para_into_right).
% 0.16/0.33 dependent: set(para_from_vars).
% 0.16/0.33 dependent: set(eq_units_both_ways).
% 0.16/0.33 dependent: set(dynamic_demod_all).
% 0.16/0.33 dependent: set(dynamic_demod).
% 0.16/0.33 dependent: set(order_eq).
% 0.16/0.33 dependent: set(back_demod).
% 0.16/0.33 dependent: set(lrpo).
% 0.16/0.33 dependent: set(hyper_res).
% 0.16/0.33 dependent: set(unit_deletion).
% 0.16/0.33 dependent: set(factor).
% 0.16/0.33
% 0.16/0.33 ------------> process usable:
% 0.16/0.33 Following clause subsumed by 6 during input processing: 0 [] {-} -class_Orderings_Opreorder(A)| -c_HOL_Oord__class_Oless(B,C,A)| -c_HOL_Oord__class_Oless(C,B,A).
% 0.16/0.33 Following clause subsumed by 13 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|C=B|c_HOL_Oord__class_Oless(C,B,A).
% 0.16/0.33 Following clause subsumed by 13 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|c_HOL_Oord__class_Oless(B,C,A)|c_HOL_Oord__class_Oless(C,B,A)|C=B.
% 0.16/0.33 Following clause subsumed by 13 during input processing: 0 [] {-} -class_Orderings_Olinorder(A)|B=C|c_HOL_Oord__class_Oless(C,B,A)|c_HOL_Oord__class_Oless(B,C,A).
% 0.16/0.33 Following clause subsumed by 18 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,A,tc_nat).
% 0.16/0.33 Following clause subsumed by 22 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat).
% 0.16/0.33 18 back subsumes 10.
% 0.16/0.33 Following clause subsumed by 31 during input processing: 0 [copy,23,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OApp(B,C).
% 0.16/0.33 Following clause subsumed by 23 during input processing: 0 [copy,31,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OVar(C).
% 0.16/0.33 Following clause subsumed by 43 during input processing: 0 [copy,38,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OAbs(B).
% 0.16/0.33 Following clause subsumed by 40 during input processing: 0 [copy,39,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OApp(B,C).
% 0.16/0.33 Following clause subsumed by 39 during input processing: 0 [copy,40,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OAbs(C).
% 0.16/0.33 Following clause subsumed by 38 during input processing: 0 [copy,43,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OVar(B).
% 0.16/0.33
% 0.16/0.33 ------------> process sos:
% 0.16/0.33 Following clause subsumed by 55 during input processing: 0 [] {-} c_HOL_Oord__class_Oless(A,B,tc_nat)|c_HOL_Oord__class_Oless(B,A,tc_nat)|B=A.
% 0.16/0.33 Following clause subsumed by 58 during input processing: 0 [] {-} A=A.
% 0.16/0.33 Following clause subsumed by 58 during input processing: 0 [copy,58,flip.1] {-} A=A.
% 0.16/0.33 58 back subsumes 48.
% 0.16/0.33 58 back subsumes 47.
% 0.16/0.33
% 0.16/0.33 ======= end of input processing =======
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 Failed to model usable list: disabling FINDER
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 -------------- Softie stats --------------
% 0.16/0.40
% 0.16/0.40 UPDATE_STOP: 300
% 0.16/0.40 SFINDER_TIME_LIMIT: 2
% 0.16/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.40 number of clauses in intial UL: 44
% 0.16/0.40 number of clauses initially in problem: 65
% 0.16/0.40 percentage of clauses intially in UL: 67
% 0.16/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.16/0.40 percent of all initial clauses that are short: 100
% 0.16/0.40 absolute distinct symbol count: 21
% 0.16/0.40 distinct predicate count: 11
% 0.16/0.40 distinct function count: 8
% 0.16/0.40 distinct constant count: 2
% 0.16/0.40
% 0.16/0.40 ---------- no more Softie stats ----------
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40
% 0.16/0.40 =========== start of search ===========
% 0.16/0.41
% 0.16/0.41 -------- PROOF --------
% 0.16/0.41 % SZS status Unsatisfiable
% 0.16/0.41 % SZS output start Refutation
% 0.16/0.41
% 0.16/0.41 ----> UNIT CONFLICT at 0.05 sec ----> 104 [binary,103.1,46.1] {-} $F.
% 0.16/0.41
% 0.16/0.41 Length of proof is 1. Level of proof is 1.
% 0.16/0.41
% 0.16/0.41 ---------------- PROOF ----------------
% 0.16/0.41 % SZS status Unsatisfiable
% 0.16/0.41 % SZS output start Refutation
% 0.16/0.41
% 0.16/0.41 44 [] {+} c_InductTermi_OIT(c_Lambda_OdB_OAbs(A))| -c_InductTermi_OIT(A).
% 0.16/0.41 46 [] {+} -c_InductTermi_OIT(c_Lambda_OdB_OAbs(v_ta______)).
% 0.16/0.41 64 [] {-} c_InductTermi_OIT(v_ta______).
% 0.16/0.41 103 [hyper,64,44] {-} c_InductTermi_OIT(c_Lambda_OdB_OAbs(v_ta______)).
% 0.16/0.41 104 [binary,103.1,46.1] {-} $F.
% 0.16/0.41
% 0.16/0.41 % SZS output end Refutation
% 0.16/0.41 ------------ end of proof -------------
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 Search stopped by max_proofs option.
% 0.16/0.41
% 0.16/0.41
% 0.16/0.41 Search stopped by max_proofs option.
% 0.16/0.41
% 0.16/0.41 ============ end of search ============
% 0.16/0.41
% 0.16/0.41 That finishes the proof of the theorem.
% 0.16/0.41
% 0.16/0.41 Process 2774 finished Sun Jul 3 13:21:50 2022
%------------------------------------------------------------------------------