TSTP Solution File: COM016+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM016+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:30 EDT 2022
% Result : Theorem 2.19s 2.39s
% Output : Refutation 2.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COM016+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 19:28:36 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.18/0.36 ----- Otter 3.2, August 2001 -----
% 0.18/0.36 The process was started by sandbox2 on n027.cluster.edu,
% 0.18/0.36 Thu Jun 16 19:28:36 2022
% 0.18/0.36 The command was "./sos". The process ID is 24463.
% 0.18/0.36
% 0.18/0.36 set(prolog_style_variables).
% 0.18/0.36 set(auto).
% 0.18/0.36 dependent: set(auto1).
% 0.18/0.36 dependent: set(process_input).
% 0.18/0.36 dependent: clear(print_kept).
% 0.18/0.36 dependent: clear(print_new_demod).
% 0.18/0.36 dependent: clear(print_back_demod).
% 0.18/0.36 dependent: clear(print_back_sub).
% 0.18/0.36 dependent: set(control_memory).
% 0.18/0.36 dependent: assign(max_mem, 12000).
% 0.18/0.36 dependent: assign(pick_given_ratio, 4).
% 0.18/0.36 dependent: assign(stats_level, 1).
% 0.18/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.36 dependent: assign(sos_limit, 5000).
% 0.18/0.36 dependent: assign(max_weight, 60).
% 0.18/0.36 clear(print_given).
% 0.18/0.36
% 0.18/0.36 formula_list(usable).
% 0.18/0.36
% 0.18/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.18/0.36
% 0.18/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.36 clauses in usable.
% 0.18/0.36
% 0.18/0.36 dependent: set(knuth_bendix).
% 0.18/0.36 dependent: set(para_from).
% 0.18/0.36 dependent: set(para_into).
% 0.18/0.36 dependent: clear(para_from_right).
% 0.18/0.36 dependent: clear(para_into_right).
% 0.18/0.36 dependent: set(para_from_vars).
% 0.18/0.36 dependent: set(eq_units_both_ways).
% 0.18/0.36 dependent: set(dynamic_demod_all).
% 0.18/0.36 dependent: set(dynamic_demod).
% 0.18/0.36 dependent: set(order_eq).
% 0.18/0.36 dependent: set(back_demod).
% 0.18/0.36 dependent: set(lrpo).
% 0.18/0.36 dependent: set(hyper_res).
% 0.18/0.36 dependent: set(unit_deletion).
% 0.18/0.36 dependent: set(factor).
% 0.18/0.36
% 0.18/0.36 ------------> process usable:
% 0.18/0.36
% 0.18/0.36 ------------> process sos:
% 0.18/0.36 Following clause subsumed by 94 during input processing: 0 [copy,94,flip.1] {-} A=A.
% 0.18/0.36 94 back subsumes 50.
% 0.18/0.36
% 0.18/0.36 ======= end of input processing =======
% 0.18/0.41
% 0.18/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 -------------- Softie stats --------------
% 0.18/0.41
% 0.18/0.41 UPDATE_STOP: 300
% 0.18/0.41 SFINDER_TIME_LIMIT: 2
% 0.18/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.41 number of clauses in intial UL: 84
% 0.18/0.41 number of clauses initially in problem: 93
% 0.18/0.41 percentage of clauses intially in UL: 90
% 0.18/0.41 percentage of distinct symbols occuring in initial UL: 96
% 0.18/0.41 percent of all initial clauses that are short: 100
% 0.18/0.41 absolute distinct symbol count: 29
% 0.18/0.41 distinct predicate count: 11
% 0.18/0.41 distinct function count: 14
% 0.18/0.41 distinct constant count: 4
% 0.18/0.41
% 0.18/0.41 ---------- no more Softie stats ----------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 =========== start of search ===========
% 2.19/2.39
% 2.19/2.39 -------- PROOF --------
% 2.19/2.39 % SZS status Theorem
% 2.19/2.39 % SZS output start Refutation
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 3 (0.00 seconds, 0 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on number of solutions
% 2.19/2.39
% 2.19/2.39 Model 4 (0.00 seconds, 0 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on number of solutions
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 5 [ 2 1 7898 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 6 [ 2 1 1910 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 7 [ 3 1 3082 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 8 [ 4 3 34666 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 9 [ 5 1 11976 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 10 [ 4 0 3078 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 11 [ 2 2 12169 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 12 [ 5 1 4464 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 13 [ 6 6 65206 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 Stopped by limit on insertions
% 2.19/2.39
% 2.19/2.39 Model 14 [ 4 0 2223 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 -----> EMPTY CLAUSE at 2.02 sec ----> 350 [hyper,117,43,90,298] {-} $F.
% 2.19/2.39
% 2.19/2.39 Length of proof is 7. Level of proof is 3.
% 2.19/2.39
% 2.19/2.39 ---------------- PROOF ----------------
% 2.19/2.39 % SZS status Theorem
% 2.19/2.39 % SZS output start Refutation
% 2.19/2.39
% 2.19/2.39 2 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aElement0($f1(A,B,C)).
% 2.19/2.39 3 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|aReductOfIn0($f1(A,B,C),A,B).
% 2.19/2.39 4 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtplgtdt0(A,B,C)|aReductOfIn0(C,A,B)|sdtmndtplgtdt0($f1(A,B,C),B,C).
% 2.19/2.39 9 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)|A!=C.
% 2.19/2.39 10 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 2.19/2.39 43 [] {+} -aElement0(A)| -aReductOfIn0(A,xa,xR)| -sdtmndtasgtdt0(A,xR,xb).
% 2.19/2.39 51 [factor,9.1.3] {+} -aElement0(A)| -aRewritingSystem0(B)|sdtmndtasgtdt0(A,B,A)|A!=A.
% 2.19/2.39 86 [] {+} aRewritingSystem0(xR).
% 2.19/2.39 89 [] {-} aElement0(xa).
% 2.19/2.39 90 [] {+} aElement0(xb).
% 2.19/2.39 92 [] {-} sdtmndtplgtdt0(xa,xR,xb).
% 2.19/2.39 94 [] {+} A=A.
% 2.19/2.39 108 [hyper,92,4,89,86,90] {-} aReductOfIn0(xb,xa,xR)|sdtmndtplgtdt0($f1(xa,xR,xb),xR,xb).
% 2.19/2.39 109 [hyper,92,3,89,86,90] {-} aReductOfIn0(xb,xa,xR)|aReductOfIn0($f1(xa,xR,xb),xa,xR).
% 2.19/2.39 110 [hyper,92,2,89,86,90] {-} aReductOfIn0(xb,xa,xR)|aElement0($f1(xa,xR,xb)).
% 2.19/2.39 117 [hyper,94,51,90,86] {+} sdtmndtasgtdt0(xb,xR,xb).
% 2.19/2.39 227 [hyper,108,10,110,86,90,factor_simp] {-} aReductOfIn0(xb,xa,xR)|sdtmndtasgtdt0($f1(xa,xR,xb),xR,xb).
% 2.19/2.39 298 [hyper,227,43,110,109,factor_simp,factor_simp] {+} aReductOfIn0(xb,xa,xR).
% 2.19/2.39 350 [hyper,117,43,90,298] {-} $F.
% 2.19/2.39
% 2.19/2.39 % SZS output end Refutation
% 2.19/2.39 ------------ end of proof -------------
% 2.19/2.39
% 2.19/2.39
% 2.19/2.39 Search stopped by max_proofs option.
% 2.19/2.39
% 2.19/2.39
% 2.19/2.39 Search stopped by max_proofs option.
% 2.19/2.39
% 2.19/2.39 ============ end of search ============
% 2.19/2.39
% 2.19/2.39 ----------- soft-scott stats ----------
% 2.19/2.39
% 2.19/2.39 true clauses given 6 (21.4%)
% 2.19/2.39 false clauses given 22
% 2.19/2.39
% 2.19/2.39 FALSE TRUE
% 2.19/2.39 4 2 0
% 2.19/2.39 5 1 1
% 2.19/2.39 6 1 3
% 2.19/2.39 7 0 1
% 2.19/2.39 8 0 1
% 2.19/2.39 9 8 13
% 2.19/2.39 11 24 14
% 2.19/2.39 12 4 16
% 2.19/2.39 14 12 20
% 2.19/2.39 15 2 2
% 2.19/2.39 16 4 13
% 2.19/2.39 18 0 11
% 2.19/2.39 19 0 4
% 2.19/2.39 20 2 4
% 2.19/2.39 22 0 8
% 2.19/2.39 24 0 4
% 2.19/2.39 tot: 60 115 (65.7% true)
% 2.19/2.39
% 2.19/2.39
% 2.19/2.39 Model 14 [ 4 0 2223 ] (0.00 seconds, 250000 Inserts)
% 2.19/2.39
% 2.19/2.39 That finishes the proof of the theorem.
% 2.19/2.39
% 2.19/2.39 Process 24463 finished Thu Jun 16 19:28:38 2022
%------------------------------------------------------------------------------