TSTP Solution File: COM012+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:28 EDT 2022
% Result : Theorem 1.10s 1.27s
% Output : Refutation 1.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COM012+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Thu Jun 16 19:41:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n018.cluster.edu,
% 0.12/0.36 Thu Jun 16 19:41:46 2022
% 0.12/0.36 The command was "./sos". The process ID is 28072.
% 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=7.
% 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 48 during input processing: 0 [copy,48,flip.1] {-} A=A.
% 0.12/0.36 48 back subsumes 23.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 23
% 0.20/0.39 number of clauses initially in problem: 38
% 0.20/0.39 percentage of clauses intially in UL: 60
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 76
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 13
% 0.20/0.39 distinct predicate count: 6
% 0.20/0.39 distinct function count: 1
% 0.20/0.39 distinct constant count: 6
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 1.10/1.27
% 1.10/1.27 -------- PROOF --------
% 1.10/1.27 % SZS status Theorem
% 1.10/1.27 % SZS output start Refutation
% 1.10/1.27
% 1.10/1.27 Model 2 (0.00 seconds, 0 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on number of solutions
% 1.10/1.27
% 1.10/1.27 Model 3 (0.00 seconds, 0 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on number of solutions
% 1.10/1.27
% 1.10/1.27 Model 4 (0.00 seconds, 0 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on number of solutions
% 1.10/1.27
% 1.10/1.27 Model 5 (0.00 seconds, 0 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on number of solutions
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 6 [ 1 1 525 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 7 [ 1 0 492 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 8 [ 2 1 938 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 9 [ 1 3 62573 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 10 [ 4 0 136 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 11 [ 2 1 742 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 12 [ 2 0 1000 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 Stopped by limit on insertions
% 1.10/1.27
% 1.10/1.27 Model 13 [ 4 1 162 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 ----> UNIT CONFLICT at 0.88 sec ----> 133 [binary,132.1,15.1] {-} $F.
% 1.10/1.27
% 1.10/1.27 Length of proof is 5. Level of proof is 4.
% 1.10/1.27
% 1.10/1.27 ---------------- PROOF ----------------
% 1.10/1.27 % SZS status Theorem
% 1.10/1.27 % SZS output start Refutation
% 1.10/1.27
% 1.10/1.27 7 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtplgtdt0(A,B,C)| -sdtmndtplgtdt0(C,B,D)|sdtmndtplgtdt0(A,B,D).
% 1.10/1.27 15 [] {+} -sdtmndtplgtdt0(xx,xR,xz).
% 1.10/1.27 16 [] {+} -sdtmndtasgtdt0(xx,xR,xz).
% 1.10/1.27 26 [] {+} aElement0(xx).
% 1.10/1.27 27 [] {+} aRewritingSystem0(xR).
% 1.10/1.27 28 [] {+} aElement0(xy).
% 1.10/1.27 29 [] {+} aElement0(xz).
% 1.10/1.27 36 [] {-} xx=xy|sdtmndtplgtdt0(xx,xR,xy).
% 1.10/1.27 37 [copy,36,flip.1] {+} xy=xx|sdtmndtplgtdt0(xx,xR,xy).
% 1.10/1.27 38 [] {+} sdtmndtasgtdt0(xx,xR,xy).
% 1.10/1.27 45 [] {-} xy=xz|sdtmndtplgtdt0(xy,xR,xz).
% 1.10/1.27 46 [copy,45,flip.1] {-} xz=xy|sdtmndtplgtdt0(xy,xR,xz).
% 1.10/1.27 94 [para_from,46.1.1,16.1.3,unit_del,38] {+} sdtmndtplgtdt0(xy,xR,xz).
% 1.10/1.27 115 [para_from,37.1.1,94.1.1,unit_del,15] {+} sdtmndtplgtdt0(xx,xR,xy).
% 1.10/1.27 132 [hyper,115,7,26,27,28,29,94] {-} sdtmndtplgtdt0(xx,xR,xz).
% 1.10/1.27 133 [binary,132.1,15.1] {-} $F.
% 1.10/1.27
% 1.10/1.27 % SZS output end Refutation
% 1.10/1.27 ------------ end of proof -------------
% 1.10/1.27
% 1.10/1.27
% 1.10/1.27 Search stopped by max_proofs option.
% 1.10/1.27
% 1.10/1.27
% 1.10/1.27 Search stopped by max_proofs option.
% 1.10/1.27
% 1.10/1.27 ============ end of search ============
% 1.10/1.27
% 1.10/1.27 ----------- soft-scott stats ----------
% 1.10/1.27
% 1.10/1.27 true clauses given 8 (36.4%)
% 1.10/1.27 false clauses given 14
% 1.10/1.27
% 1.10/1.27 FALSE TRUE
% 1.10/1.27 4 1 1
% 1.10/1.27 6 1 0
% 1.10/1.27 8 0 1
% 1.10/1.27 9 1 0
% 1.10/1.27 11 2 3
% 1.10/1.27 16 2 13
% 1.10/1.27 18 2 5
% 1.10/1.27 19 0 3
% 1.10/1.27 21 0 3
% 1.10/1.27 23 1 3
% 1.10/1.27 25 0 3
% 1.10/1.27 tot: 10 35 (77.8% true)
% 1.10/1.27
% 1.10/1.27
% 1.10/1.27 Model 13 [ 4 1 162 ] (0.00 seconds, 250000 Inserts)
% 1.10/1.27
% 1.10/1.27 That finishes the proof of the theorem.
% 1.10/1.27
% 1.10/1.27 Process 28072 finished Thu Jun 16 19:41:47 2022
%------------------------------------------------------------------------------