TSTP Solution File: LCL764-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL764-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:32:44 EDT 2022
% Result : Unsatisfiable 0.20s 0.39s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL764-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 14:01:25 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.39 ----- Otter 3.2, August 2001 -----
% 0.20/0.39 The process was started by sandbox2 on n029.cluster.edu,
% 0.20/0.39 Sun Jul 3 14:01:26 2022
% 0.20/0.39 The command was "./sos". The process ID is 534.
% 0.20/0.39
% 0.20/0.39 set(prolog_style_variables).
% 0.20/0.39 set(auto).
% 0.20/0.39 dependent: set(auto1).
% 0.20/0.39 dependent: set(process_input).
% 0.20/0.39 dependent: clear(print_kept).
% 0.20/0.39 dependent: clear(print_new_demod).
% 0.20/0.39 dependent: clear(print_back_demod).
% 0.20/0.39 dependent: clear(print_back_sub).
% 0.20/0.39 dependent: set(control_memory).
% 0.20/0.39 dependent: assign(max_mem, 12000).
% 0.20/0.39 dependent: assign(pick_given_ratio, 4).
% 0.20/0.39 dependent: assign(stats_level, 1).
% 0.20/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.39 dependent: assign(sos_limit, 5000).
% 0.20/0.39 dependent: assign(max_weight, 60).
% 0.20/0.39 clear(print_given).
% 0.20/0.39
% 0.20/0.39 list(usable).
% 0.20/0.39
% 0.20/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.39
% 0.20/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.39 clauses in usable.
% 0.20/0.39
% 0.20/0.39 dependent: set(knuth_bendix).
% 0.20/0.39 dependent: set(para_from).
% 0.20/0.39 dependent: set(para_into).
% 0.20/0.39 dependent: clear(para_from_right).
% 0.20/0.39 dependent: clear(para_into_right).
% 0.20/0.39 dependent: set(para_from_vars).
% 0.20/0.39 dependent: set(eq_units_both_ways).
% 0.20/0.39 dependent: set(dynamic_demod_all).
% 0.20/0.39 dependent: set(dynamic_demod).
% 0.20/0.39 dependent: set(order_eq).
% 0.20/0.39 dependent: set(back_demod).
% 0.20/0.39 dependent: set(lrpo).
% 0.20/0.39 dependent: set(hyper_res).
% 0.20/0.39 dependent: set(unit_deletion).
% 0.20/0.39 dependent: set(factor).
% 0.20/0.39
% 0.20/0.39 ------------> process usable:
% 0.20/0.39 Following clause subsumed by 2 during input processing: 0 [] {-} c_Suc(A)!=A.
% 0.20/0.39 Following clause subsumed by 3 during input processing: 0 [] {-} c_Suc(A)!=c_Suc(B)|A=B.
% 0.20/0.39 Following clause subsumed by 60 during input processing: 0 [flip.1] {-} c_List_Olist_OCons(B,A,C)!=A.
% 0.20/0.39 Following clause subsumed by 73 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=B|A=c_List_Olist_ONil(C).
% 0.20/0.39 Following clause subsumed by 75 during input processing: 0 [] {-} c_List_Oappend(A,B,C)!=A|B=c_List_Olist_ONil(C).
% 0.20/0.39 Following clause subsumed by 95 during input processing: 0 [] {-} c_List_Olist__all2(A,c_List_Olist_OCons(B,C,D),c_List_Olist_OCons(E,F,G),D,G)| -c_List_Olist__all2(A,C,F,D,G)| -hBOOL(hAPP(hAPP(A,B),E)).
% 0.20/0.39 Following clause subsumed by 95 during input processing: 0 [] {-} c_List_Olist__all2(A,c_List_Olist_OCons(B,C,D),c_List_Olist_OCons(E,F,G),D,G)| -c_List_Olist__all2(A,C,F,D,G)| -hBOOL(hAPP(hAPP(A,B),E)).
% 0.20/0.39 Following clause subsumed by 137 during input processing: 0 [] {-} -hBOOL(hAPP(A,c_List_Olist_Olist__case(B,C,c_List_Olist_OCons(D,E,t_b),t_a,t_b)))|hBOOL(hAPP(A,hAPP(hAPP(C,D),E))).
% 0.20/0.39 Following clause subsumed by 199 during input processing: 0 [] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.39 50 back subsumes 43.
% 0.20/0.39 Following clause subsumed by 199 during input processing: 0 [copy,156,flip.1] {-} c_List_Olist_OCons(A,B,C)!=c_List_Olist_ONil(C).
% 0.20/0.39 Following clause subsumed by 156 during input processing: 0 [copy,199,flip.1] {-} c_List_Olist_ONil(A)!=c_List_Olist_OCons(B,C,A).
% 0.20/0.39
% 0.20/0.39 ------------> process sos:
% 0.20/0.39 Following clause subsumed by 282 during input processing: 0 [demod,280] {-} c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E)=c_List_Omap(A,c_List_Olist_OCons(B,C,D),D,E).
% 0.20/0.39 Following clause subsumed by 277 during input processing: 0 [demod,275] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.20/0.39 Following clause subsumed by 277 during input processing: 0 [demod,275] {-} c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D)=c_List_Oappend(c_List_Olist_OCons(A,B,D),C,D).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,317] {-} A=A.
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,293] {-} c_List_Olist_OCons(B,C,A)=c_List_Olist_OCons(B,C,A).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,363] {-} c_List_Oappend(A,c_List_Oappend(B,C,D),D)=c_List_Oappend(A,c_List_Oappend(B,C,D),D).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,363] {-} c_List_Oappend(A,c_List_Oappend(B,D,C),C)=c_List_Oappend(A,c_List_Oappend(B,D,C),
% 0.20/0.39 -------- PROOF --------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39 C).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,363] {-} c_List_Oappend(A,c_List_Oappend(B,C,D),D)=c_List_Oappend(A,c_List_Oappend(B,C,D),D).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,310] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,382] {-} B=B.
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,382] {-} A=A.
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,385] {-} A=A.
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,403] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,403] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,385] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.39 Following clause subsumed by 319 during input processing: 0 [demod,307] {-} c_List_Olist_ONil(A)=c_List_Olist_ONil(A).
% 0.20/0.39
% 0.20/0.39 ----> UNIT CONFLICT at 0.01 sec ----> 417 [binary,416.1,225.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 Length of proof is 0. Level of proof is 0.
% 0.20/0.39
% 0.20/0.39 ---------------- PROOF ----------------
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39 % SZS output start Refutation
% 0.20/0.39
% 0.20/0.39 225 [] {-} -c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB).
% 0.20/0.39 416 [] {-} c_List_Olistsp(A,c_List_Olist_ONil(B),B).
% 0.20/0.39 417 [binary,416.1,225.1] {-} $F.
% 0.20/0.39
% 0.20/0.39 % SZS output end Refutation
% 0.20/0.39 ------------ end of proof -------------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Search stopped by max_proofs option.
% 0.20/0.39
% 0.20/0.39 ============ end of search ============
% 0.20/0.39
% 0.20/0.39 That finishes the proof of the theorem.
% 0.20/0.39
% 0.20/0.39 Process 534 finished Sun Jul 3 14:01:26 2022
%------------------------------------------------------------------------------