TSTP Solution File: MSC017+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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 : Sun Jul 17 22:59:21 EDT 2022
% Result : Theorem 0.76s 0.93s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : MSC017+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Fri Jul 1 16:27:57 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox on n016.cluster.edu,
% 0.20/0.35 Fri Jul 1 16:27:57 2022
% 0.20/0.35 The command was "./sos". The process ID is 895.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 formula_list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.35
% 0.20/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.35 clauses in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(knuth_bendix).
% 0.20/0.35 dependent: set(para_from).
% 0.20/0.35 dependent: set(para_into).
% 0.20/0.35 dependent: clear(para_from_right).
% 0.20/0.35 dependent: clear(para_into_right).
% 0.20/0.35 dependent: set(para_from_vars).
% 0.20/0.35 dependent: set(eq_units_both_ways).
% 0.20/0.35 dependent: set(dynamic_demod_all).
% 0.20/0.35 dependent: set(dynamic_demod).
% 0.20/0.35 dependent: set(order_eq).
% 0.20/0.35 dependent: set(back_demod).
% 0.20/0.35 dependent: set(lrpo).
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: set(unit_deletion).
% 0.20/0.35 dependent: set(factor).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35 9 back subsumes 3.
% 0.20/0.35 10 back subsumes 4.
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 7
% 0.20/0.40 number of clauses initially in problem: 12
% 0.20/0.40 percentage of clauses intially in UL: 58
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 86
% 0.20/0.40 percent of all initial clauses that are short: 91
% 0.20/0.40 absolute distinct symbol count: 15
% 0.20/0.40 distinct predicate count: 5
% 0.20/0.40 distinct function count: 4
% 0.20/0.40 distinct constant count: 6
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.76/0.93
% 0.76/0.93 -------- PROOF --------
% 0.76/0.93 % SZS status Theorem
% 0.76/0.93 % SZS output start Refutation
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 Stopped by limit on insertions
% 0.76/0.93
% 0.76/0.93 -----> EMPTY CLAUSE at 0.54 sec ----> 29 [hyper,27,10,12] {-} $F.
% 0.76/0.93
% 0.76/0.93 Length of proof is 5. Level of proof is 5.
% 0.76/0.93
% 0.76/0.93 ---------------- PROOF ----------------
% 0.76/0.93 % SZS status Theorem
% 0.76/0.93 % SZS output start Refutation
% 0.76/0.93
% 0.76/0.93 5 [] {+} -dive(A)|greater(depth(A),depth_limit)|greater(time(A),time_limit)| -greater(nitrogen(A),nitrogen_limit).
% 0.76/0.93 7 [] {+} -dive(A)|greater(nitrogen(A),nitrogen_limit)| -outcome(A,dci).
% 0.76/0.93 8 [] {+} -dive(A)| -outcome(A,B)| -bad(B)|B=dci.
% 0.76/0.93 9 [] {+} -dive(A)| -greater(depth(A),depth_limit).
% 0.76/0.93 10 [] {+} -dive(A)| -greater(time(A),time_limit).
% 0.76/0.93 12 [] {-} dive($c2).
% 0.76/0.93 13 [] {-} outcome($c2,$c1).
% 0.76/0.93 14 [] {-} bad($c1).
% 0.76/0.93 20,19 [hyper,13,8,12,14,flip.1] {-} dci=$c1.
% 0.76/0.93 23 [back_demod,7,demod,20] {-} -dive(A)|greater(nitrogen(A),nitrogen_limit)| -outcome(A,$c1).
% 0.76/0.93 25 [hyper,23,12,13] {+} greater(nitrogen($c2),nitrogen_limit).
% 0.76/0.93 26 [hyper,25,5,12] {-} greater(depth($c2),depth_limit)|greater(time($c2),time_limit).
% 0.76/0.93 27 [hyper,26,9,12] {-} greater(time($c2),time_limit).
% 0.76/0.93 29 [hyper,27,10,12] {-} $F.
% 0.76/0.93
% 0.76/0.93 % SZS output end Refutation
% 0.76/0.93 ------------ end of proof -------------
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Search stopped by max_proofs option.
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Search stopped by max_proofs option.
% 0.76/0.93
% 0.76/0.93 ============ end of search ============
% 0.76/0.93
% 0.76/0.93 ----------- soft-scott stats ----------
% 0.76/0.93
% 0.76/0.93 true clauses given 2 (20.0%)
% 0.76/0.93 false clauses given 8
% 0.76/0.93
% 0.76/0.93 FALSE TRUE
% 0.76/0.93 4 1 0
% 0.76/0.93 8 0 1
% 0.76/0.93 9 0 3
% 0.76/0.93 10 0 1
% 0.76/0.93 tot: 1 5 (83.3% true)
% 0.76/0.93
% 0.76/0.93
% 0.76/0.93 Model 2 (0.00 seconds, 0 Inserts)
% 0.76/0.93
% 0.76/0.93 That finishes the proof of the theorem.
% 0.76/0.93
% 0.76/0.93 Process 895 finished Fri Jul 1 16:27:58 2022
%------------------------------------------------------------------------------