%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG030+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 18:00:55 EDT 2022
% Result : Theorem 0.47s 0.71s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG030+1 : TPTP v8.1.0. Released v2.7.0.
% 0.13/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.35 % CPULimit : 300
% 0.20/0.35 % WCLimit : 600
% 0.20/0.35 % DateTime : Wed Jun 8 23:53:03 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox on n017.cluster.edu,
% 0.20/0.37 Wed Jun 8 23:53:03 2022
% 0.20/0.37 The command was "./sos". The process ID is 21995.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.20/0.37
% 0.20/0.37 This is a Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.20/0.37 sos and nonpositive clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: clear(order_hyper).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 10
% 0.20/0.39 number of clauses initially in problem: 13
% 0.20/0.39 percentage of clauses intially in UL: 76
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 9
% 0.20/0.39 distinct predicate count: 3
% 0.20/0.39 distinct function count: 4
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.47/0.71
% 0.47/0.71 -------- PROOF --------
% 0.47/0.71 % SZS status Theorem
% 0.47/0.71 % SZS output start Refutation
% 0.47/0.71
% 0.47/0.71 Model 2 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Model 3 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Model 4 (0.00 seconds, 0 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on number of solutions
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 5 [ 1 1 174 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 6 [ 1 0 98 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 Stopped by limit on insertions
% 0.47/0.71
% 0.47/0.71 Model 7 [ 1 0 64 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 ----> UNIT CONFLICT at 0.32 sec ----> 83 [binary,81.1,3.1] {-} $F.
% 0.47/0.71
% 0.47/0.71 Length of proof is 10. Level of proof is 3.
% 0.47/0.71
% 0.47/0.71 ---------------- PROOF ----------------
% 0.47/0.71 % SZS status Theorem
% 0.47/0.71 % SZS output start Refutation
% 0.47/0.71
% 0.47/0.71 1 [] {+} -sorti1(A)| -sorti1(B)|sorti1(op1(A,B)).
% 0.47/0.71 3 [] {+} op1($c2,$c1)!=op1($c1,$c2).
% 0.47/0.71 4 [] {+} -sorti2(A)| -sorti2(B)|op2(A,B)=op2(B,A).
% 0.47/0.71 5 [] {+} -sorti1(A)|sorti2(h(A)).
% 0.47/0.71 7 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 0.47/0.71 8 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.47/0.71 10 [] {+} -sorti1(A)|j(h(A))=A.
% 0.47/0.71 11 [] {+} sorti1($c2).
% 0.47/0.71 12 [] {+} sorti1($c1).
% 0.47/0.71 15,14 [hyper,11,10] {+} j(h($c2))=$c2.
% 0.47/0.71 18 [hyper,11,5] {+} sorti2(h($c2)).
% 0.47/0.71 21,20 [hyper,12,10] {+} j(h($c1))=$c1.
% 0.47/0.71 27,26 [hyper,12,7,11] {-} h(op1($c1,$c2))=op2(h($c1),h($c2)).
% 0.47/0.71 28 [hyper,12,5] {+} sorti2(h($c1)).
% 0.47/0.71 31 [hyper,12,1,11] {+} sorti1(op1($c1,$c2)).
% 0.47/0.71 36,35 [hyper,31,10,demod,27] {-} j(op2(h($c1),h($c2)))=op1($c1,$c2).
% 0.47/0.71 77 [hyper,28,8,18,demod,15,21] {-} j(op2(h($c2),h($c1)))=op1($c2,$c1).
% 0.47/0.71 80,79 [hyper,28,4,18] {-} op2(h($c2),h($c1))=op2(h($c1),h($c2)).
% 0.47/0.71 81 [back_demod,77,demod,80,36,flip.1] {-} op1($c2,$c1)=op1($c1,$c2).
% 0.47/0.71 83 [binary,81.1,3.1] {-} $F.
% 0.47/0.71
% 0.47/0.71 % SZS output end Refutation
% 0.47/0.71 ------------ end of proof -------------
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Search stopped by max_proofs option.
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Search stopped by max_proofs option.
% 0.47/0.71
% 0.47/0.71 ============ end of search ============
% 0.47/0.71
% 0.47/0.71 ----------- soft-scott stats ----------
% 0.47/0.71
% 0.47/0.71 true clauses given 3 (33.3%)
% 0.47/0.71 false clauses given 6
% 0.47/0.71
% 0.47/0.71 FALSE TRUE
% 0.47/0.71 4 2 0
% 0.47/0.71 6 3 8
% 0.47/0.71 8 0 4
% 0.47/0.71 10 4 3
% 0.47/0.71 15 4 4
% 0.47/0.71 20 1 3
% 0.47/0.71 tot: 14 22 (61.1% true)
% 0.47/0.71
% 0.47/0.71
% 0.47/0.71 Model 7 [ 1 0 64 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.71
% 0.47/0.71 That finishes the proof of the theorem.
% 0.47/0.71
% 0.47/0.71 Process 21995 finished Wed Jun 8 23:53:04 2022
%------------------------------------------------------------------------------