%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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 01:43:29 EDT 2022
% Result : Theorem 1.51s 1.68s
% Output : Refutation 1.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : COM013+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n019.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 : Thu Jun 16 17:09:09 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 n019.cluster.edu,
% 0.13/0.36 Thu Jun 16 17:09:09 2022
% 0.13/0.36 The command was "./sos". The process ID is 12529.
% 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 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 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
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 76 during input processing: 0 [copy,76,flip.1] {-} A=A.
% 0.13/0.36 76 back subsumes 47.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.42
% 0.19/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 -------------- Softie stats --------------
% 0.19/0.42
% 0.19/0.42 UPDATE_STOP: 300
% 0.19/0.42 SFINDER_TIME_LIMIT: 2
% 0.19/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42 number of clauses in intial UL: 71
% 0.19/0.42 number of clauses initially in problem: 75
% 0.19/0.42 percentage of clauses intially in UL: 94
% 0.19/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.42 percent of all initial clauses that are short: 100
% 0.19/0.42 absolute distinct symbol count: 26
% 0.19/0.42 distinct predicate count: 11
% 0.19/0.42 distinct function count: 13
% 0.19/0.42 distinct constant count: 2
% 0.19/0.42
% 0.19/0.42 ---------- no more Softie stats ----------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42 =========== start of search ===========
% 1.51/1.68
% 1.51/1.68 -------- PROOF --------
% 1.51/1.68 % SZS status Theorem
% 1.51/1.68 % SZS output start Refutation
% 1.51/1.68
% 1.51/1.68 Stopped by limit on insertions
% 1.51/1.68
% 1.51/1.68 Model 3 [ 1 1 919 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 Model 4 (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 Stopped by limit on number of solutions
% 1.51/1.68
% 1.51/1.68 Stopped by limit on insertions
% 1.51/1.68
% 1.51/1.68 Model 5 [ 1 1 4216 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 Stopped by limit on insertions
% 1.51/1.68
% 1.51/1.68 Model 6 [ 1 2 14503 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 Stopped by limit on insertions
% 1.51/1.68
% 1.51/1.68 Model 7 [ 1 2 19551 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 Stopped by limit on insertions
% 1.51/1.68
% 1.51/1.68 Model 8 [ 2 1 6468 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 -----> EMPTY CLAUSE at 1.30 sec ----> 495 [hyper,341,37,102,73,162] {-} $F.
% 1.51/1.68
% 1.51/1.68 Length of proof is 13. Level of proof is 10.
% 1.51/1.68
% 1.51/1.68 ---------------- PROOF ----------------
% 1.51/1.68 % SZS status Theorem
% 1.51/1.68 % SZS output start Refutation
% 1.51/1.68
% 1.51/1.68 1 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aReductOfIn0(C,A,B)|aElement0(C).
% 1.51/1.68 5 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aReductOfIn0(C,A,B).
% 1.51/1.68 9 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)|A!=C.
% 1.51/1.68 10 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 1.51/1.68 11 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(A,B,C)| -sdtmndtasgtdt0(C,B,D)|sdtmndtasgtdt0(A,B,D).
% 1.51/1.68 30 [] {+} -aRewritingSystem0(A)| -isTerminating0(A)| -aElement0(B)| -aElement0(C)| -sdtmndtplgtdt0(B,A,C)|iLess0(C,B).
% 1.51/1.68 35 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)|aElement0(C).
% 1.51/1.68 36 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)|sdtmndtasgtdt0(A,B,C).
% 1.51/1.68 37 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aNormalFormOfIn0(C,A,B)| -aReductOfIn0(D,C,B).
% 1.51/1.68 38 [] {+} -aElement0(A)| -aRewritingSystem0(B)|aNormalFormOfIn0(C,A,B)| -aElement0(C)| -sdtmndtasgtdt0(A,B,C)|aReductOfIn0($f12(A,B,C),C,B).
% 1.51/1.68 39 [] {+} -aElement0(A)| -iLess0(A,$c1)|aNormalFormOfIn0($f13(A),A,xR).
% 1.51/1.68 40 [] {+} -aNormalFormOfIn0(A,$c1,xR).
% 1.51/1.68 48 [factor,9.1.3] {+} -aElement0(A)| -aRewritingSystem0(B)|sdtmndtasgtdt0(A,B,A)|A!=A.
% 1.51/1.68 68 [factor,38.1.4] {+} -aElement0(A)| -aRewritingSystem0(B)|aNormalFormOfIn0(A,A,B)| -sdtmndtasgtdt0(A,B,A)|aReductOfIn0($f12(A,B,A),A,B).
% 1.51/1.68 73 [] {+} aRewritingSystem0(xR).
% 1.51/1.68 74 [] {+} isTerminating0(xR).
% 1.51/1.68 75 [] {+} aElement0($c1).
% 1.51/1.68 76 [] {+} A=A.
% 1.51/1.68 91 [hyper,76,48,75,73] {+} sdtmndtasgtdt0($c1,xR,$c1).
% 1.51/1.68 98 [hyper,91,68,75,73,unit_del,40] {+} aReductOfIn0($f12($c1,xR,$c1),$c1,xR).
% 1.51/1.68 102 [hyper,98,1,75,73] {+} aElement0($f12($c1,xR,$c1)).
% 1.51/1.68 142 [hyper,102,5,75,73,98] {+} sdtmndtplgtdt0($c1,xR,$f12($c1,xR,$c1)).
% 1.51/1.68 154 [hyper,142,30,73,74,75,102] {+} iLess0($f12($c1,xR,$c1),$c1).
% 1.51/1.68 155 [hyper,142,10,75,73,102] {+} sdtmndtasgtdt0($c1,xR,$f12($c1,xR,$c1)).
% 1.51/1.68 162 [hyper,154,39,102] {-} aNormalFormOfIn0($f13($f12($c1,xR,$c1)),$f12($c1,xR,$c1),xR).
% 1.51/1.68 168 [hyper,162,36,102,73] {-} sdtmndtasgtdt0($f12($c1,xR,$c1),xR,$f13($f12($c1,xR,$c1))).
% 1.51/1.68 169 [hyper,162,35,102,73] {-} aElement0($f13($f12($c1,xR,$c1))).
% 1.51/1.68 290 [hyper,155,11,75,73,102,169,168] {-} sdtmndtasgtdt0($c1,xR,$f13($f12($c1,xR,$c1))).
% 1.51/1.68 341 [hyper,290,38,75,73,169,unit_del,40] {-} aReductOfIn0($f12($c1,xR,$f13($f12($c1,xR,$c1))),$f13($f12($c1,xR,$c1)),xR).
% 1.51/1.68 495 [hyper,341,37,102,73,162] {-} $F.
% 1.51/1.68
% 1.51/1.68 % SZS output end Refutation
% 1.51/1.68 ------------ end of proof -------------
% 1.51/1.68
% 1.51/1.68
% 1.51/1.68 Search stopped by max_proofs option.
% 1.51/1.68
% 1.51/1.68
% 1.51/1.68 Search stopped by max_proofs option.
% 1.51/1.68
% 1.51/1.68 ============ end of search ============
% 1.51/1.68
% 1.51/1.68 ----------- soft-scott stats ----------
% 1.51/1.68
% 1.51/1.68 true clauses given 17 (42.5%)
% 1.51/1.68 false clauses given 23
% 1.51/1.68
% 1.51/1.68 FALSE TRUE
% 1.51/1.68 10 0 1
% 1.51/1.68 11 0 3
% 1.51/1.68 12 0 11
% 1.51/1.68 13 0 3
% 1.51/1.68 14 0 8
% 1.51/1.68 15 3 13
% 1.51/1.68 16 8 8
% 1.51/1.68 17 1 14
% 1.51/1.68 18 7 11
% 1.51/1.68 19 7 25
% 1.51/1.68 20 3 17
% 1.51/1.68 21 13 14
% 1.51/1.68 22 8 23
% 1.51/1.68 23 9 19
% 1.51/1.68 24 6 13
% 1.51/1.68 25 22 4
% 1.51/1.68 26 7 9
% 1.51/1.68 27 30 11
% 1.51/1.68 28 6 4
% 1.51/1.68 29 16 9
% 1.51/1.68 30 5 3
% 1.51/1.68 31 0 6
% 1.51/1.68 45 0 2
% 1.51/1.68 tot: 151 231 (60.5% true)
% 1.51/1.68
% 1.51/1.68
% 1.51/1.68 Model 8 [ 2 1 6468 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.68
% 1.51/1.68 That finishes the proof of the theorem.
% 1.51/1.68
% 1.51/1.68 Process 12529 finished Thu Jun 16 17:09:11 2022
%------------------------------------------------------------------------------