%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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 : Fri Jul 15 00:42:11 EDT 2022
% Result : Unsatisfiable 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : COL075-2 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Tue May 31 12:27:58 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 sandbox2 on n025.cluster.edu,
% 0.12/0.35 Tue May 31 12:27:58 2022
% 0.12/0.35 The command was "./sos". The process ID is 17765.
% 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=1.
% 0.12/0.35
% 0.12/0.35 All clauses are units, and equality is present; the
% 0.12/0.35 strategy will be Knuth-Bendix with positive clauses in sos.
% 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
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} A=A.
% 0.12/0.35 Following clause subsumed by 4 during input processing: 0 [copy,6,flip.1] {-} apply(apply(apply(abstraction,A),B),C)=apply(apply(A,apply(k,C)),apply(B,C)).
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (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
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 1
% 0.19/0.39 number of clauses initially in problem: 6
% 0.19/0.39 percentage of clauses intially in UL: 16
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 6
% 0.19/0.39 distinct predicate count: 1
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 2
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 178 [binary,177.1,5.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 5. Level of proof is 4.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Unsatisfiable
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 1 [] {+} apply(apply(A,b(A)),c(A))!=apply(b(A),b(A)).
% 0.19/0.41 3,2 [] {-} apply(apply(k,A),B)=A.
% 0.19/0.41 4 [] {-} apply(apply(apply(abstraction,A),B),C)=apply(apply(A,apply(k,C)),apply(B,C)).
% 0.19/0.41 5 [] {+} A=A.
% 0.19/0.41 6 [copy,4,flip.1] {-} apply(apply(A,apply(k,B)),apply(C,B))=apply(apply(apply(abstraction,A),C),B).
% 0.19/0.41 12 [para_from,4.1.1,1.1.1.1] {+} apply(apply(apply(A,apply(k,b(apply(apply(abstraction,A),B)))),apply(B,b(apply(apply(abstraction,A),B)))),c(apply(apply(abstraction,A),B)))!=apply(b(apply(apply(abstraction,A),B)),b(apply(apply(abstraction,A),B))).
% 0.19/0.41 19 [para_into,6.1.1.2,2.1.1] {-} apply(apply(A,apply(k,B)),C)=apply(apply(apply(abstraction,A),apply(k,C)),B).
% 0.19/0.41 27 [copy,19,flip.1] {-} apply(apply(apply(abstraction,A),apply(k,B)),C)=apply(apply(A,apply(k,C)),B).
% 0.19/0.41 177 [para_into,12.1.1,27.1.1,demod,3] {-} apply(b(apply(apply(abstraction,abstraction),k)),b(apply(apply(abstraction,abstraction),k)))!=apply(b(apply(apply(abstraction,abstraction),k)),b(apply(apply(abstraction,abstraction),k))).
% 0.19/0.41 178 [binary,177.1,5.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 3 (14.3%)
% 0.19/0.41 false clauses given 18
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 15 1 0
% 0.19/0.41 17 2 0
% 0.19/0.41 19 11 1
% 0.19/0.41 20 0 1
% 0.19/0.41 21 2 0
% 0.19/0.41 23 6 0
% 0.19/0.41 25 18 0
% 0.19/0.41 26 0 1
% 0.19/0.41 27 20 0
% 0.19/0.41 28 5 0
% 0.19/0.41 29 6 2
% 0.19/0.41 32 0 2
% 0.19/0.41 34 1 0
% 0.19/0.41 35 0 1
% 0.19/0.41 36 3 1
% 0.19/0.41 38 4 2
% 0.19/0.41 39 0 1
% 0.19/0.41 40 5 0
% 0.19/0.41 41 0 2
% 0.19/0.41 42 1 0
% 0.19/0.41 43 0 2
% 0.19/0.41 45 0 4
% 0.19/0.41 46 1 0
% 0.19/0.41 48 3 1
% 0.19/0.41 49 1 0
% 0.19/0.41 50 0 1
% 0.19/0.41 52 2 0
% 0.19/0.41 54 1 0
% 0.19/0.41 57 0 1
% 0.19/0.41 60 1 0
% 0.19/0.41 tot: 94 23 (19.7% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 17765 finished Tue May 31 12:27:58 2022
%------------------------------------------------------------------------------