%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG074+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 18:01:00 EDT 2022
% Result : Theorem 1.35s 1.62s
% Output : Refutation 1.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : ALG074+1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 : Thu Jun 9 04:18:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.18/0.35 Thu Jun 9 04:18:21 2022
% 0.18/0.35 The command was "./sos". The process ID is 12650.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 15
% 0.18/0.38 number of clauses initially in problem: 20
% 0.18/0.38 percentage of clauses intially in UL: 75
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 9
% 0.18/0.38 distinct predicate count: 3
% 0.18/0.38 distinct function count: 4
% 0.18/0.38 distinct constant count: 2
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 1.35/1.62
% 1.35/1.62 -------- PROOF --------
% 1.35/1.62 % SZS status Theorem
% 1.35/1.62 % SZS output start Refutation
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 2 (0.00 seconds, 0 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on number of solutions
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 3 [ 1 1 93 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Model 4 (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on number of solutions
% 1.35/1.62
% 1.35/1.62 Model 5 (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on number of solutions
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 6 [ 1 0 172 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Model 7 (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on number of solutions
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 8 [ 7 0 58 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 9 [ 3 0 54 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 10 [ 3 1 52 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 11 [ 4 1 49 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 12 [ 4 1 55 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 Stopped by limit on insertions
% 1.35/1.62
% 1.35/1.62 Model 13 [ 1 1 9999 ] (0.00 seconds, 250000 Inserts)
% 1.35/1.62
% 1.35/1.62 ----> UNIT CONFLICT at 1.25 sec ----> 1534 [binary,1532.1,5.1] {-} $F.
% 1.35/1.62
% 1.35/1.62 Length of proof is 14. Level of proof is 4.
% 1.35/1.62
% 1.35/1.62 ---------------- PROOF ----------------
% 1.35/1.62 % SZS status Theorem
% 1.35/1.62 % SZS output start Refutation
% 1.35/1.62
% 1.35/1.62 1 [] {+} -sorti1(A)| -sorti1(B)|sorti1(op1(A,B)).
% 1.35/1.62 2 [] {+} -sorti2(A)| -sorti2(B)|sorti2(op2(A,B)).
% 1.35/1.62 3 [] {-} op1($c1,$c2)!=op1($c2,$c1).
% 1.35/1.62 4 [copy,3,flip.1] {+} op1($c2,$c1)!=op1($c1,$c2).
% 1.35/1.62 5 [] {+} op1(op1($c2,$c1),$c2)!=$c1.
% 1.35/1.62 6 [] {+} -sorti2(A)| -sorti2(B)|op2(B,A)=op2(A,B)|op2(op2(A,B),B)!=A|op2(op2(A,B),A)=B.
% 1.35/1.62 7 [] {+} -sorti1(A)|sorti2(h(A)).
% 1.44/1.62 9 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 1.44/1.62 10 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 1.44/1.62 12 [] {+} -sorti1(A)|j(h(A))=A.
% 1.44/1.62 17 [] {+} sorti1($c2).
% 1.44/1.62 18 [] {-} sorti1($c1).
% 1.44/1.62 19 [] {-} op1(op1($c2,$c1),$c1)=$c2.
% 1.44/1.62 21 [] {+} A=A.
% 1.44/1.62 26,25 [hyper,17,12] {+} j(h($c2))=$c2.
% 1.44/1.62 27 [hyper,17,7] {+} sorti2(h($c2)).
% 1.44/1.62 32,31 [hyper,18,12] {+} j(h($c1))=$c1.
% 1.44/1.62 34,33 [hyper,18,9,17] {+} h(op1($c2,$c1))=op2(h($c2),h($c1)).
% 1.44/1.62 37 [hyper,18,7] {+} sorti2(h($c1)).
% 1.44/1.62 38 [hyper,18,1,17] {+} sorti1(op1($c2,$c1)).
% 1.44/1.62 46 [hyper,27,10,37,demod,32,26] {-} j(op2(h($c1),h($c2)))=op1($c1,$c2).
% 1.44/1.62 49,48 [hyper,27,10,37,demod,26,32] {-} j(op2(h($c2),h($c1)))=op1($c2,$c1).
% 1.44/1.62 51 [hyper,27,2,37] {-} sorti2(op2(h($c2),h($c1))).
% 1.44/1.62 53,52 [para_from,19.1.1,9.3.1.1,demod,34,unit_del,38,18,flip.1] {+} op2(op2(h($c2),h($c1)),h($c1))=h($c2).
% 1.44/1.62 317 [hyper,51,10,27,demod,49,26] {+} j(op2(op2(h($c2),h($c1)),h($c2)))=op1(op1($c2,$c1),$c2).
% 1.44/1.62 1531,1530 [para_into,46.1.1.1,6.3.1,demod,49,53,unit_del,4,27,37,21] {-} op2(op2(h($c2),h($c1)),h($c2))=h($c1).
% 1.44/1.62 1532 [back_demod,317,demod,1531,32,flip.1] {-} op1(op1($c2,$c1),$c2)=$c1.
% 1.44/1.62 1534 [binary,1532.1,5.1] {-} $F.
% 1.44/1.62
% 1.44/1.62 % SZS output end Refutation
% 1.44/1.62 ------------ end of proof -------------
% 1.44/1.62
% 1.44/1.62
% 1.44/1.62 Search stopped by max_proofs option.
% 1.44/1.62
% 1.44/1.62
% 1.44/1.62 Search stopped by max_proofs option.
% 1.44/1.62
% 1.44/1.62 ============ end of search ============
% 1.44/1.62
% 1.44/1.62 ----------- soft-scott stats ----------
% 1.44/1.62
% 1.44/1.62 true clauses given 9 (22.0%)
% 1.44/1.62 false clauses given 32
% 1.44/1.62
% 1.44/1.62 FALSE TRUE
% 1.44/1.62 6 0 5
% 1.44/1.62 8 0 52
% 1.44/1.62 9 2 9
% 1.44/1.62 10 2 95
% 1.44/1.62 11 0 1
% 1.44/1.62 12 22 144
% 1.44/1.62 14 9 71
% 1.44/1.62 15 30 32
% 1.44/1.62 16 0 16
% 1.44/1.62 18 0 16
% 1.44/1.62 20 54 36
% 1.44/1.62 25 91 37
% 1.44/1.62 30 101 47
% 1.44/1.62 35 47 33
% 1.44/1.62 40 11 5
% 1.44/1.62 tot: 369 599 (61.9% true)
% 1.44/1.62
% 1.44/1.62
% 1.44/1.62 Model 13 [ 1 1 9999 ] (0.00 seconds, 250000 Inserts)
% 1.44/1.62
% 1.44/1.62 That finishes the proof of the theorem.
% 1.44/1.62
% 1.44/1.62 Process 12650 finished Thu Jun 9 04:18:22 2022
%------------------------------------------------------------------------------