%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT002-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:07:17 EDT 2022
% Result : Unsatisfiable 0.18s 0.40s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CAT002-4 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n017.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 : Sun May 29 16:43:24 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox2 on n017.cluster.edu,
% 0.11/0.34 Sun May 29 16:43:24 2022
% 0.11/0.34 The command was "./sos". The process ID is 19044.
% 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=1, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This is a Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.34 sos and nonpositive 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: clear(order_hyper).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.11/0.36
% 0.11/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.36
% 0.11/0.36 Stopped by limit on number of solutions
% 0.11/0.36
% 0.11/0.36
% 0.11/0.36 -------------- Softie stats --------------
% 0.11/0.36
% 0.11/0.36 UPDATE_STOP: 300
% 0.11/0.36 SFINDER_TIME_LIMIT: 2
% 0.11/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.36 number of clauses in intial UL: 11
% 0.11/0.36 number of clauses initially in problem: 22
% 0.11/0.36 percentage of clauses intially in UL: 50
% 0.11/0.36 percentage of distinct symbols occuring in initial UL: 100
% 0.11/0.36 percent of all initial clauses that are short: 100
% 0.11/0.36 absolute distinct symbol count: 10
% 0.11/0.36 distinct predicate count: 3
% 0.11/0.36 distinct function count: 3
% 0.11/0.36 distinct constant count: 4
% 0.11/0.36
% 0.11/0.36 ---------- no more Softie stats ----------
% 0.11/0.36
% 0.11/0.36
% 0.11/0.36
% 0.11/0.36 =========== start of search ===========
% 0.18/0.40
% 0.18/0.40 -------- PROOF --------
% 0.18/0.40 % SZS status Unsatisfiable
% 0.18/0.40 % SZS output start Refutation
% 0.18/0.40
% 0.18/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 Stopped by limit on number of solutions
% 0.18/0.40
% 0.18/0.40 ----> UNIT CONFLICT at 0.03 sec ----> 91 [binary,89.1,12.1] {+} $F.
% 0.18/0.40
% 0.18/0.40 Length of proof is 5. Level of proof is 4.
% 0.18/0.40
% 0.18/0.40 ---------------- PROOF ----------------
% 0.18/0.40 % SZS status Unsatisfiable
% 0.18/0.40 % SZS output start Refutation
% 0.18/0.40
% 0.18/0.40 9 [] {+} compose(a,A)!=B|compose(a,C)!=B|A=C.
% 0.18/0.40 10 [] {+} compose(b,A)!=B|compose(b,C)!=B|A=C.
% 0.18/0.40 11 [] {-} g!=h.
% 0.18/0.40 12 [copy,11,flip.1] {+} h!=g.
% 0.18/0.40 13 [] {-} compose(A,compose(B,C))=compose(compose(A,B),C).
% 0.18/0.40 15,14 [copy,13,flip.1] {-} compose(compose(A,B),C)=compose(A,compose(B,C)).
% 0.18/0.40 22 [] {-} compose(compose(a,b),h)=compose(compose(a,b),g).
% 0.18/0.40 23 [copy,22,demod,15,15] {-} compose(a,compose(b,h))=compose(a,compose(b,g)).
% 0.18/0.40 25 [] {+} A=A.
% 0.18/0.40 84 [hyper,23,9,25,flip.1] {-} compose(b,h)=compose(b,g).
% 0.18/0.40 89 [hyper,84,10,25,flip.1] {-} h=g.
% 0.18/0.40 91 [binary,89.1,12.1] {+} $F.
% 0.18/0.40
% 0.18/0.40 % SZS output end Refutation
% 0.18/0.40 ------------ end of proof -------------
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Search stopped by max_proofs option.
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Search stopped by max_proofs option.
% 0.18/0.40
% 0.18/0.40 ============ end of search ============
% 0.18/0.40
% 0.18/0.40 ----------- soft-scott stats ----------
% 0.18/0.40
% 0.18/0.40 true clauses given 2 (25.0%)
% 0.18/0.40 false clauses given 6
% 0.18/0.40
% 0.18/0.40 FALSE TRUE
% 0.18/0.40 3 0 2
% 0.18/0.40 5 0 3
% 0.18/0.40 6 0 2
% 0.18/0.40 7 0 5
% 0.18/0.40 8 0 3
% 0.18/0.40 9 0 4
% 0.18/0.40 10 0 3
% 0.18/0.40 11 0 2
% 0.18/0.40 12 1 12
% 0.18/0.40 13 0 2
% 0.18/0.40 14 0 7
% 0.18/0.40 16 0 5
% 0.18/0.40 18 0 2
% 0.18/0.40 21 0 2
% 0.18/0.40 tot: 1 54 (98.2% true)
% 0.18/0.40
% 0.18/0.40
% 0.18/0.40 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.40
% 0.18/0.40 That finishes the proof of the theorem.
% 0.18/0.40
% 0.18/0.40 Process 19044 finished Sun May 29 16:43:24 2022
%------------------------------------------------------------------------------