TSTP Solution File: LCL843-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL843-1 : TPTP v8.1.0. Released v4.1.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 14:33:24 EDT 2022
% Result : Unsatisfiable 0.11s 0.34s
% Output : Refutation 0.11s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : LCL843-1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n005.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jul 4 08:47:37 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34
% 0.11/0.34 -------- PROOF --------
% 0.11/0.34 % SZS status Unsatisfiable
% 0.11/0.34 % SZS output start Refutation
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n005.cluster.edu,
% 0.11/0.34 Mon Jul 4 08:47:37 2022
% 0.11/0.34 The command was "./sos". The process ID is 3901.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34 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.11/0.34 Following clause subsumed by 12 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.11/0.34 Following clause subsumed by 12 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.11/0.34 Following clause subsumed by 12 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.11/0.34 Following clause subsumed by 17 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,A,tc_nat).
% 0.11/0.34 Following clause subsumed by 20 during input processing: 0 [] {-} -c_HOL_Oord__class_Oless(A,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat).
% 0.11/0.34 17 back subsumes 9.
% 0.11/0.34 Following clause subsumed by 35 during input processing: 0 [copy,34,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OAbs(C).
% 0.11/0.34 Following clause subsumed by 34 during input processing: 0 [copy,35,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OApp(B,C).
% 0.11/0.34 Following clause subsumed by 42 during input processing: 0 [copy,36,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OAbs(B).
% 0.11/0.34 Following clause subsumed by 45 during input processing: 0 [copy,40,flip.1] {-} c_Lambda_OdB_OApp(A,B)!=c_Lambda_OdB_OVar(C).
% 0.11/0.34 Following clause subsumed by 36 during input processing: 0 [copy,42,flip.1] {-} c_Lambda_OdB_OAbs(A)!=c_Lambda_OdB_OVar(B).
% 0.11/0.34 Following clause subsumed by 40 during input processing: 0 [copy,45,flip.1] {-} c_Lambda_OdB_OVar(A)!=c_Lambda_OdB_OApp(B,C).
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 50 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.11/0.34
% 0.11/0.34 ----> UNIT CONFLICT at 0.00 sec ----> 68 [binary,67.1,46.1] {-} $F.
% 0.11/0.34
% 0.11/0.34 Length of proof is 0. Level of proof is 0.
% 0.11/0.34
% 0.11/0.34 ---------------- PROOF ----------------
% 0.11/0.34 % SZS status Unsatisfiable
% 0.11/0.34 % SZS output start Refutation
% 0.11/0.34
% 0.11/0.34 46 [] {-} -c_InductTermi_OIT(c_Lambda_OdB_OVar(v_x______)).
% 0.11/0.34 67 [] {-} c_InductTermi_OIT(c_Lambda_OdB_OVar(A)).
% 0.11/0.34 68 [binary,67.1,46.1] {-} $F.
% 0.11/0.34
% 0.11/0.34 % SZS output end Refutation
% 0.11/0.34 ------------ end of proof -------------
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 Search stopped by max_proofs option.
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 Search stopped by max_proofs option.
% 0.11/0.34
% 0.11/0.34 ============ end of search ============
% 0.11/0.34
% 0.11/0.34 That finishes the proof of the theorem.
% 0.11/0.34
% 0.11/0.34 Process 3901 finished Mon Jul 4 08:47:37 2022
%------------------------------------------------------------------------------