%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT002-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT002-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 19:31:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.13/0.36 Sun May 29 19:31:39 2022
% 0.13/0.36 The command was "./sos". The process ID is 8728.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36 Following clause subsumed by 3 during input processing: 0 [] {-} -there_exists(A)| -there_exists(B)|A!=B|equivalent(A,B).
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.13/0.36 35 back subsumes 19.
% 0.13/0.36 35 back subsumes 18.
% 0.13/0.36 35 back subsumes 17.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 14
% 0.13/0.38 number of clauses initially in problem: 27
% 0.13/0.38 percentage of clauses intially in UL: 51
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 11
% 0.13/0.38 distinct predicate count: 3
% 0.13/0.38 distinct function count: 4
% 0.13/0.38 distinct constant count: 4
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 ----> UNIT CONFLICT at 0.04 sec ----> 127 [binary,125.1,16.1] {+} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 5. Level of proof is 4.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Unsatisfiable
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 13 [] {+} compose(a,A)!=B|compose(a,C)!=B|A=C.
% 0.20/0.42 14 [] {+} compose(b,A)!=B|compose(b,C)!=B|A=C.
% 0.20/0.42 15 [] {-} g!=h.
% 0.20/0.42 16 [copy,15,flip.1] {+} h!=g.
% 0.20/0.42 20 [] {-} compose(A,compose(B,C))=compose(compose(A,B),C).
% 0.20/0.42 22,21 [copy,20,flip.1] {-} compose(compose(A,B),C)=compose(A,compose(B,C)).
% 0.20/0.42 32 [] {-} compose(compose(a,b),h)=compose(compose(a,b),g).
% 0.20/0.42 33 [copy,32,demod,22,22] {-} compose(a,compose(b,h))=compose(a,compose(b,g)).
% 0.20/0.42 35 [] {+} A=A.
% 0.20/0.42 121 [hyper,33,13,35,flip.1] {-} compose(b,h)=compose(b,g).
% 0.20/0.42 125 [hyper,121,14,35,flip.1] {-} h=g.
% 0.20/0.42 127 [binary,125.1,16.1] {+} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 1 (12.5%)
% 0.20/0.42 false clauses given 7
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 3 0 1
% 0.20/0.42 4 0 1
% 0.20/0.42 5 0 3
% 0.20/0.42 6 0 4
% 0.20/0.42 7 1 2
% 0.20/0.42 8 0 3
% 0.20/0.42 9 0 4
% 0.20/0.42 10 0 6
% 0.20/0.42 11 0 7
% 0.20/0.42 12 1 11
% 0.20/0.42 13 1 4
% 0.20/0.42 14 0 2
% 0.20/0.42 15 1 0
% 0.20/0.42 16 0 11
% 0.20/0.42 17 0 12
% 0.20/0.42 18 0 4
% 0.20/0.42 21 2 1
% 0.20/0.42 25 1 0
% 0.20/0.42 tot: 7 76 (91.6% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 5 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 8728 finished Sun May 29 19:31:39 2022
%------------------------------------------------------------------------------