TSTP Solution File: COM013+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM013+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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 36.43s 36.65s
% Output : Refutation 36.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM013+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.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:06:41 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n006.cluster.edu,
% 0.13/0.37 Thu Jun 16 17:06:41 2022
% 0.13/0.37 The command was "./sos". The process ID is 16844.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 98 during input processing: 0 [copy,98,flip.1] {-} A=A.
% 0.13/0.37 98 back subsumes 66.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 89
% 0.19/0.43 number of clauses initially in problem: 93
% 0.19/0.43 percentage of clauses intially in UL: 95
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 28
% 0.19/0.43 distinct predicate count: 11
% 0.19/0.43 distinct function count: 15
% 0.19/0.43 distinct constant count: 2
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 36.43/36.65
% 36.43/36.65 -- HEY sandbox2, WE HAVE A PROOF!! --
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Model 3 [ 1 2 2370 ] (0.00 seconds, 250000 Inserts)
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Model 4 [ 1 1 7012 ] (0.00 seconds, 250000 Inserts)
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Model 5 [ 2 2 7684 ] (0.00 seconds, 250000 Inserts)
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 Model 6 [ 5 0 690 ] (0.00 seconds, 250000 Inserts)
% 36.43/36.65
% 36.43/36.65 Stopped by limit on insertions
% 36.43/36.65
% 36.43/36.65 -----> EMPTY CLAUSE at 36.22 sec ----> 2884 [hyper,1164,52,336,353] {-} $F.
% 36.43/36.65
% 36.43/36.65 Length of proof is 9. Level of proof is 6.
% 36.43/36.65
% 36.43/36.65 ---------------- PROOF ----------------
% 36.43/36.65 % SZS status Theorem
% 36.43/36.65 % SZS output start Refutation
% 36.43/36.65
% 36.43/36.65 1 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aReductOfIn0(C,A,B)|aElement0(C).
% 36.43/36.65 5 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtplgtdt0(A,B,C)| -aReductOfIn0(C,A,B).
% 36.43/36.65 10 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 36.43/36.65 11 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtasgtdt0(A,B,C)| -sdtmndtasgtdt0(C,B,D)|sdtmndtasgtdt0(A,B,D).
% 36.43/36.65 39 [] {+} -aElement0(A)| -aElement0(B)| -aReductOfIn0(B,A,xR)|iLess0(B,A).
% 36.43/36.65 42 [] {+} -aElement0(A)| -iLess0(A,$c1)|aElement0($f14(A)).
% 36.43/36.65 51 [] {+} -aElement0(A)| -iLess0(A,$c1)|sdtmndtasgtdt0(A,xR,$f14(A)).
% 36.43/36.65 52 [] {+} -aElement0(A)| -iLess0(A,$c1)| -aReductOfIn0(B,$f14(A),xR).
% 36.43/36.65 54 [] {+} -aElement0(A)|$c1!=A|aReductOfIn0($f15(A),A,xR).
% 36.43/36.65 58 [] {+} -aElement0(A)| -sdtmndtasgtdt0($c1,xR,A)|aReductOfIn0($f15(A),A,xR).
% 36.43/36.65 95 [] {+} aRewritingSystem0(xR).
% 36.43/36.65 97 [] {+} aElement0($c1).
% 36.43/36.65 98 [] {+} A=A.
% 36.43/36.65 114 [hyper,98,54,97] {+} aReductOfIn0($f15($c1),$c1,xR).
% 36.43/36.65 336 [hyper,114,1,97,95] {-} aElement0($f15($c1)).
% 36.43/36.65 353 [hyper,336,39,97,114] {+} iLess0($f15($c1),$c1).
% 36.43/36.65 384 [hyper,336,5,97,95,114] {-} sdtmndtplgtdt0($c1,xR,$f15($c1)).
% 36.43/36.65 390 [hyper,384,10,97,95,336] {+} sdtmndtasgtdt0($c1,xR,$f15($c1)).
% 36.43/36.65 396 [hyper,353,51,336] {+} sdtmndtasgtdt0($f15($c1),xR,$f14($f15($c1))).
% 36.43/36.65 401 [hyper,353,42,336] {+} aElement0($f14($f15($c1))).
% 36.43/36.65 1079 [hyper,396,11,97,95,336,401,390] {+} sdtmndtasgtdt0($c1,xR,$f14($f15($c1))).
% 36.43/36.65 1164 [hyper,1079,58,401] {+} aReductOfIn0($f15($f14($f15($c1))),$f14($f15($c1)),xR).
% 36.43/36.65 2884 [hyper,1164,52,336,353] {-} $F.
% 36.43/36.65
% 36.43/36.65 % SZS output end Refutation
% 36.43/36.65 ------------ end of proof -------------
% 36.43/36.65
% 36.43/36.65
% 36.43/36.65 Search stopped by max_proofs option.
% 36.43/36.65
% 36.43/36.65
% 36.43/36.65 Search stopped by max_proofs option.
% 36.43/36.65
% 36.43/36.65 ============ end of search ============
% 36.43/36.65
% 36.43/36.65 ----------- soft-scott stats ----------
% 36.43/36.65
% 36.43/36.65 true clauses given 49 (36.8%)
% 36.43/36.65 false clauses given 84
% 36.43/36.65
% 36.43/36.65 FALSE TRUE
% 36.43/36.65 9 0 3
% 36.43/36.65 10 0 1
% 36.43/36.65 11 15 7
% 36.43/36.65 12 34 10
% 36.43/36.65 13 62 8
% 36.43/36.65 14 61 20
% 36.43/36.65 15 71 17
% 36.43/36.65 16 70 31
% 36.43/36.65 17 88 36
% 36.43/36.65 18 80 60
% 36.43/36.65 19 64 86
% 36.43/36.65 20 67 62
% 36.43/36.65 21 42 85
% 36.43/36.65 22 37 93
% 36.43/36.65 23 31 99
% 36.43/36.65 24 7 73
% 36.43/36.65 25 4 77
% 36.43/36.65 26 15 68
% 36.43/36.65 27 7 88
% 36.43/36.65 28 0 111
% 36.43/36.65 29 3 99
% 36.43/36.65 30 4 106
% 36.43/36.65 31 0 91
% 36.43/36.65 32 9 99
% 36.43/36.65 33 8 34
% 36.43/36.65 34 3 90
% 36.43/36.65 35 16 40
% 36.43/36.65 36 2 67
% 36.43/36.65 37 8 39
% 36.43/36.65 38 14 23
% 36.43/36.65 39 0 24
% 36.43/36.65 40 7 5
% 36.43/36.65 41 4 4
% 36.43/36.65 42 0 2
% 36.43/36.65 43 2 1
% 36.43/36.65 46 0 6
% 36.43/36.65 48 0 1
% 36.43/36.65 tot: 835 1766 (67.9% true)
% 36.43/36.65
% 36.43/36.65
% 36.43/36.65 Model 6 [ 5 -256 690 ] (0.00 seconds, 250000 Inserts)
% 36.43/36.65
% 36.43/36.65 That finishes the proof of the theorem.
% 36.43/36.65
% 36.43/36.65 Process 16844 finished Thu Jun 16 17:07:17 2022
%------------------------------------------------------------------------------