TSTP Solution File: COM012+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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 0.60s 0.84s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : COM012+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.11 % Command : sos-script %s
% 0.10/0.30 % Computer : n024.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Thu Jun 16 19:44:03 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.16/0.32 ----- Otter 3.2, August 2001 -----
% 0.16/0.32 The process was started by sandbox2 on n024.cluster.edu,
% 0.16/0.32 Thu Jun 16 19:44:03 2022
% 0.16/0.32 The command was "./sos". The process ID is 28109.
% 0.16/0.32
% 0.16/0.32 set(prolog_style_variables).
% 0.16/0.32 set(auto).
% 0.16/0.32 dependent: set(auto1).
% 0.16/0.32 dependent: set(process_input).
% 0.16/0.32 dependent: clear(print_kept).
% 0.16/0.32 dependent: clear(print_new_demod).
% 0.16/0.32 dependent: clear(print_back_demod).
% 0.16/0.32 dependent: clear(print_back_sub).
% 0.16/0.32 dependent: set(control_memory).
% 0.16/0.32 dependent: assign(max_mem, 12000).
% 0.16/0.32 dependent: assign(pick_given_ratio, 4).
% 0.16/0.32 dependent: assign(stats_level, 1).
% 0.16/0.32 dependent: assign(pick_semantic_ratio, 3).
% 0.16/0.32 dependent: assign(sos_limit, 5000).
% 0.16/0.32 dependent: assign(max_weight, 60).
% 0.16/0.32 clear(print_given).
% 0.16/0.32
% 0.16/0.32 formula_list(usable).
% 0.16/0.32
% 0.16/0.32 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.16/0.32
% 0.16/0.32 This ia a non-Horn set with equality. The strategy will be
% 0.16/0.32 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.16/0.32 unit deletion, with positive clauses in sos and nonpositive
% 0.16/0.32 clauses in usable.
% 0.16/0.32
% 0.16/0.32 dependent: set(knuth_bendix).
% 0.16/0.32 dependent: set(para_from).
% 0.16/0.32 dependent: set(para_into).
% 0.16/0.32 dependent: clear(para_from_right).
% 0.16/0.32 dependent: clear(para_into_right).
% 0.16/0.32 dependent: set(para_from_vars).
% 0.16/0.32 dependent: set(eq_units_both_ways).
% 0.16/0.32 dependent: set(dynamic_demod_all).
% 0.16/0.32 dependent: set(dynamic_demod).
% 0.16/0.32 dependent: set(order_eq).
% 0.16/0.32 dependent: set(back_demod).
% 0.16/0.32 dependent: set(lrpo).
% 0.16/0.32 dependent: set(hyper_res).
% 0.16/0.32 dependent: set(unit_deletion).
% 0.16/0.32 dependent: set(factor).
% 0.16/0.32
% 0.16/0.32 ------------> process usable:
% 0.16/0.32
% 0.16/0.32 ------------> process sos:
% 0.16/0.32 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} A=A.
% 0.16/0.32 27 back subsumes 18.
% 0.16/0.32
% 0.16/0.32 ======= end of input processing =======
% 0.16/0.34
% 0.16/0.34 Model 1 (0.00 seconds, 0 Inserts)
% 0.16/0.34
% 0.16/0.34 Stopped by limit on number of solutions
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 -------------- Softie stats --------------
% 0.16/0.34
% 0.16/0.34 UPDATE_STOP: 300
% 0.16/0.34 SFINDER_TIME_LIMIT: 2
% 0.16/0.34 SHORT_CLAUSE_CUTOFF: 4
% 0.16/0.34 number of clauses in intial UL: 19
% 0.16/0.34 number of clauses initially in problem: 26
% 0.16/0.34 percentage of clauses intially in UL: 73
% 0.16/0.34 percentage of distinct symbols occuring in initial UL: 90
% 0.16/0.34 percent of all initial clauses that are short: 100
% 0.16/0.34 absolute distinct symbol count: 11
% 0.16/0.34 distinct predicate count: 6
% 0.16/0.34 distinct function count: 1
% 0.16/0.34 distinct constant count: 4
% 0.16/0.34
% 0.16/0.34 ---------- no more Softie stats ----------
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34
% 0.16/0.34 =========== start of search ===========
% 0.60/0.84
% 0.60/0.84 -------- PROOF --------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 Model 2 (0.00 seconds, 0 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on number of solutions
% 0.60/0.84
% 0.60/0.84 Model 3 (0.00 seconds, 0 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on number of solutions
% 0.60/0.84
% 0.60/0.84 Model 4 (0.00 seconds, 0 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on number of solutions
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 5 [ 1 1 134 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 6 [ 1 1 136 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 7 [ 2 0 149 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 8 [ 1 1 134 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 Stopped by limit on insertions
% 0.60/0.84
% 0.60/0.84 Model 9 [ 3 1 134 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 ----> UNIT CONFLICT at 0.50 sec ----> 112 [binary,111.1,11.1] {+} $F.
% 0.60/0.84
% 0.60/0.84 Length of proof is 6. Level of proof is 4.
% 0.60/0.84
% 0.60/0.84 ---------------- PROOF ----------------
% 0.60/0.84 % SZS status Theorem
% 0.60/0.84 % SZS output start Refutation
% 0.60/0.84
% 0.60/0.84 7 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -aElement0(D)| -sdtmndtplgtdt0(A,B,C)| -sdtmndtplgtdt0(C,B,D)|sdtmndtplgtdt0(A,B,D).
% 0.60/0.84 8 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)| -sdtmndtasgtdt0(A,B,C)|A=C|sdtmndtplgtdt0(A,B,C).
% 0.60/0.84 10 [] {+} -aElement0(A)| -aRewritingSystem0(B)| -aElement0(C)|sdtmndtasgtdt0(A,B,C)| -sdtmndtplgtdt0(A,B,C).
% 0.60/0.84 11 [] {+} -sdtmndtasgtdt0(xx,xR,xz).
% 0.60/0.84 21 [] {+} aElement0(xx).
% 0.60/0.84 22 [] {+} aRewritingSystem0(xR).
% 0.60/0.84 23 [] {+} aElement0(xy).
% 0.60/0.84 24 [] {+} aElement0(xz).
% 0.60/0.84 25 [] {+} sdtmndtasgtdt0(xx,xR,xy).
% 0.60/0.84 26 [] {+} sdtmndtasgtdt0(xy,xR,xz).
% 0.60/0.84 32 [hyper,25,8,21,22,23,flip.1] {+} xy=xx|sdtmndtplgtdt0(xx,xR,xy).
% 0.60/0.84 39 [hyper,26,8,23,22,24,flip.1] {+} xz=xy|sdtmndtplgtdt0(xy,xR,xz).
% 0.60/0.84 58 [para_from,32.1.1,26.1.1,unit_del,11] {+} sdtmndtplgtdt0(xx,xR,xy).
% 0.60/0.84 103 [para_from,39.1.1,11.1.3,unit_del,25] {+} sdtmndtplgtdt0(xy,xR,xz).
% 0.60/0.84 104 [hyper,103,7,21,22,23,24,58] {+} sdtmndtplgtdt0(xx,xR,xz).
% 0.60/0.84 111 [hyper,104,10,21,22,24] {-} sdtmndtasgtdt0(xx,xR,xz).
% 0.60/0.84 112 [binary,111.1,11.1] {+} $F.
% 0.60/0.84
% 0.60/0.84 % SZS output end Refutation
% 0.60/0.84 ------------ end of proof -------------
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Search stopped by max_proofs option.
% 0.60/0.84
% 0.60/0.84 ============ end of search ============
% 0.60/0.84
% 0.60/0.84 ----------- soft-scott stats ----------
% 0.60/0.84
% 0.60/0.84 true clauses given 9 (47.4%)
% 0.60/0.84 false clauses given 10
% 0.60/0.84
% 0.60/0.84 FALSE TRUE
% 0.60/0.84 9 0 1
% 0.60/0.84 11 0 4
% 0.60/0.84 14 0 1
% 0.60/0.84 16 0 13
% 0.60/0.84 18 0 7
% 0.60/0.84 21 0 4
% 0.60/0.84 23 0 7
% 0.60/0.84 24 0 1
% 0.60/0.84 25 0 4
% 0.60/0.84 26 0 8
% 0.60/0.84 28 0 9
% 0.60/0.84 30 0 1
% 0.60/0.84 31 0 1
% 0.60/0.84 tot: 0 61 (100.0% true)
% 0.60/0.84
% 0.60/0.84
% 0.60/0.84 Model 9 [ 3 1 134 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.84
% 0.60/0.84 That finishes the proof of the theorem.
% 0.60/0.84
% 0.60/0.84 Process 28109 finished Thu Jun 16 19:44:03 2022
%------------------------------------------------------------------------------