TSTP Solution File: COM023+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM023+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:34 EDT 2022
% Result : Theorem 3.55s 3.79s
% Output : Refutation 3.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COM023+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n009.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 16 18:44:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n009.cluster.edu,
% 0.12/0.36 Thu Jun 16 18:44:37 2022
% 0.12/0.36 The command was "./sos". The process ID is 2410.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 89 during input processing: 0 [copy,89,flip.1] {-} A=A.
% 0.12/0.36 89 back subsumes 50.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.45/0.63
% 0.45/0.63 Model 1 (0.00 seconds, 0 Inserts)
% 0.45/0.63
% 0.45/0.63 Stopped by limit on number of solutions
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 -------------- Softie stats --------------
% 0.45/0.63
% 0.45/0.63 UPDATE_STOP: 300
% 0.45/0.63 SFINDER_TIME_LIMIT: 2
% 0.45/0.63 SHORT_CLAUSE_CUTOFF: 4
% 0.45/0.63 number of clauses in intial UL: 84
% 0.45/0.63 number of clauses initially in problem: 88
% 0.45/0.63 percentage of clauses intially in UL: 95
% 0.45/0.63 percentage of distinct symbols occuring in initial UL: 100
% 0.45/0.63 percent of all initial clauses that are short: 100
% 0.45/0.63 absolute distinct symbol count: 26
% 0.45/0.63 distinct predicate count: 11
% 0.45/0.63 distinct function count: 14
% 0.45/0.63 distinct constant count: 1
% 0.45/0.63
% 0.45/0.63 ---------- no more Softie stats ----------
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63
% 0.45/0.63 Stopped by limit on insertions
% 0.45/0.63
% 0.45/0.63 =========== start of search ===========
% 3.55/3.79
% 3.55/3.79 -------- PROOF --------
% 3.55/3.79 % SZS status Theorem
% 3.55/3.79 % SZS output start Refutation
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 2 [ 1 1 760 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 3 [ 1 2 13349 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 4 [ 1 1 2748 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 5 [ 1 0 443 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 6 [ 3 0 445 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 7 [ 1 5 51699 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 8 [ 1 0 3492 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 9 [ 4 0 511 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 10 [ 7 2 10491 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 11 [ 5 1 2067 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Stopped by limit on insertions
% 3.55/3.79
% 3.55/3.79 Model 12 [ 1 1 4731 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 ----> UNIT CONFLICT at 3.41 sec ----> 1021 [binary,1020.1,43.1] {-} $F.
% 3.55/3.79
% 3.55/3.79 Length of proof is 9. Level of proof is 3.
% 3.55/3.79
% 3.55/3.79 ---------------- PROOF ----------------
% 3.55/3.79 % SZS status Theorem
% 3.55/3.79 % SZS output start Refutation
% 3.55/3.79
% 3.55/3.79 15 [] {+} -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f5(A)).
% 3.55/3.79 16 [] {+} -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f4(A)).
% 3.55/3.79 17 [] {+} -aRewritingSystem0(A)|isConfluent0(A)|aElement0($f3(A)).
% 3.55/3.79 18 [] {+} -aRewritingSystem0(A)|isConfluent0(A)|sdtmndtasgtdt0($f5(A),A,$f4(A)).
% 3.55/3.79 19 [] {+} -aRewritingSystem0(A)|isConfluent0(A)|sdtmndtasgtdt0($f5(A),A,$f3(A)).
% 3.55/3.79 20 [] {+} -aRewritingSystem0(A)|isConfluent0(A)| -aElement0(B)| -sdtmndtasgtdt0($f4(A),A,B)| -sdtmndtasgtdt0($f3(A),A,B).
% 3.55/3.79 40 [] {+} -aElement0(A)| -aElement0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,xR,B)| -sdtmndtasgtdt0(A,xR,C)|aElement0($f14(A,B,C)).
% 3.55/3.79 41 [] {+} -aElement0(A)| -aElement0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,xR,B)| -sdtmndtasgtdt0(A,xR,C)|sdtmndtasgtdt0(B,xR,$f14(A,B,C)).
% 3.55/3.79 42 [] {+} -aElement0(A)| -aElement0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,xR,B)| -sdtmndtasgtdt0(A,xR,C)|sdtmndtasgtdt0(C,xR,$f14(A,B,C)).
% 3.55/3.79 43 [] {+} -isConfluent0(xR).
% 3.55/3.79 86 [] {-} aRewritingSystem0(xR).
% 3.55/3.79 90 [hyper,86,19,unit_del,43] {+} sdtmndtasgtdt0($f5(xR),xR,$f3(xR)).
% 3.55/3.79 91 [hyper,86,18,unit_del,43] {+} sdtmndtasgtdt0($f5(xR),xR,$f4(xR)).
% 3.55/3.79 92 [hyper,86,17,unit_del,43] {+} aElement0($f3(xR)).
% 3.55/3.79 93 [hyper,86,16,unit_del,43] {+} aElement0($f4(xR)).
% 3.55/3.79 94 [hyper,86,15,unit_del,43] {+} aElement0($f5(xR)).
% 3.55/3.79 118 [hyper,91,42,94,92,93,90] {+} sdtmndtasgtdt0($f4(xR),xR,$f14($f5(xR),$f3(xR),$f4(xR))).
% 3.55/3.79 120 [hyper,91,41,94,92,93,90] {+} sdtmndtasgtdt0($f3(xR),xR,$f14($f5(xR),$f3(xR),$f4(xR))).
% 3.55/3.79 122 [hyper,91,40,94,92,93,90] {+} aElement0($f14($f5(xR),$f3(xR),$f4(xR))).
% 3.55/3.79 1020 [hyper,120,20,86,122,118] {-} isConfluent0(xR).
% 3.55/3.79 1021 [binary,1020.1,43.1] {-} $F.
% 3.55/3.79
% 3.55/3.79 % SZS output end Refutation
% 3.55/3.79 ------------ end of proof -------------
% 3.55/3.79
% 3.55/3.79
% 3.55/3.79 Search stopped by max_proofs option.
% 3.55/3.79
% 3.55/3.79
% 3.55/3.79 Search stopped by max_proofs option.
% 3.55/3.79
% 3.55/3.79 ============ end of search ============
% 3.55/3.79
% 3.55/3.79 ----------- soft-scott stats ----------
% 3.55/3.79
% 3.55/3.79 true clauses given 57 (74.0%)
% 3.55/3.79 false clauses given 20
% 3.55/3.79
% 3.55/3.79 FALSE TRUE
% 3.55/3.79 11 0 17
% 3.55/3.79 12 0 17
% 3.55/3.79 13 0 31
% 3.55/3.79 14 0 15
% 3.55/3.79 15 0 35
% 3.55/3.79 16 0 44
% 3.55/3.79 17 0 20
% 3.55/3.79 18 0 22
% 3.55/3.79 19 0 17
% 3.55/3.79 20 0 45
% 3.55/3.79 21 0 61
% 3.55/3.79 22 0 91
% 3.55/3.79 23 0 88
% 3.55/3.79 24 0 122
% 3.55/3.79 25 0 54
% 3.55/3.79 26 0 21
% 3.55/3.79 27 0 6
% 3.55/3.79 28 0 7
% 3.55/3.79 29 0 31
% 3.55/3.79 30 0 23
% 3.55/3.79 31 0 28
% 3.55/3.79 32 0 18
% 3.55/3.79 33 0 8
% 3.55/3.79 34 0 6
% 3.55/3.79 36 0 2
% 3.55/3.79 40 0 1
% 3.55/3.79 tot: 0 830 (100.0% true)
% 3.55/3.79
% 3.55/3.79
% 3.55/3.79 Model 12 [ 1 1 4731 ] (0.00 seconds, 250000 Inserts)
% 3.55/3.79
% 3.55/3.79 That finishes the proof of the theorem.
% 3.55/3.79
% 3.55/3.79 Process 2410 finished Thu Jun 16 18:44:41 2022
%------------------------------------------------------------------------------