TSTP Solution File: KRS002-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS002-1 : TPTP v8.1.0. Released v2.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 : Sun Jul 17 03:29:26 EDT 2022
% Result : Unsatisfiable 0.84s 1.04s
% Output : Refutation 0.84s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS002-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 07:54:05 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox2 on n018.cluster.edu,
% 0.11/0.34 Tue Jun 7 07:54:05 2022
% 0.11/0.34 The command was "./sos". The process ID is 21380.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.11/0.39
% 0.11/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.39
% 0.11/0.39 Stopped by limit on number of solutions
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 -------------- Softie stats --------------
% 0.11/0.39
% 0.11/0.39 UPDATE_STOP: 300
% 0.11/0.39 SFINDER_TIME_LIMIT: 2
% 0.11/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.39 number of clauses in intial UL: 17
% 0.11/0.39 number of clauses initially in problem: 20
% 0.11/0.39 percentage of clauses intially in UL: 85
% 0.11/0.39 percentage of distinct symbols occuring in initial UL: 93
% 0.11/0.39 percent of all initial clauses that are short: 100
% 0.11/0.39 absolute distinct symbol count: 15
% 0.11/0.39 distinct predicate count: 8
% 0.11/0.39 distinct function count: 6
% 0.11/0.39 distinct constant count: 1
% 0.11/0.39
% 0.11/0.39 ---------- no more Softie stats ----------
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39
% 0.11/0.39 =========== start of search ===========
% 0.84/1.04
% 0.84/1.04 -------- PROOF --------
% 0.84/1.04 % SZS status Unsatisfiable
% 0.84/1.04 % SZS output start Refutation
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 2 [ 1 1 133 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Model 3 [ 1 1 28469 ] (0.00 seconds, 84243 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 4 [ 4 0 79 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 5 [ 2 1 76 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 6 [ 2 0 76 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 7 [ 2 2 78471 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 8 [ 3 0 189 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 9 [ 8 0 171 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 10 [ 5 0 76 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 Stopped by limit on insertions
% 0.84/1.04
% 0.84/1.04 Model 11 [ 4 0 78 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 -----> EMPTY CLAUSE at 0.68 sec ----> 94 [hyper,80,3,45] {-} $F.
% 0.84/1.04
% 0.84/1.04 Length of proof is 8. Level of proof is 5.
% 0.84/1.04
% 0.84/1.04 ---------------- PROOF ----------------
% 0.84/1.04 % SZS status Unsatisfiable
% 0.84/1.04 % SZS output start Refutation
% 0.84/1.04
% 0.84/1.04 1 [] {+} s2least(A)| -c(A).
% 0.84/1.04 3 [] {+} -s2least(A)| -equalish(u1r2(A),u1r1(A)).
% 0.84/1.04 4 [] {+} s(A,u1r1(A))| -s2least(A).
% 0.84/1.04 5 [] {+} s(A,u1r2(A))| -s2least(A).
% 0.84/1.04 7 [] {+} s1most(A)| -d(A).
% 0.84/1.04 9 [] {+} equalish(A,B)| -s1most(C)| -s(C,A)| -s(C,B).
% 0.84/1.04 11 [] {+} r(A,u4r2(A))| -e(A).
% 0.84/1.04 12 [] {+} d(A)| -e(B)| -r(B,A).
% 0.84/1.04 13 [] {+} c(A)| -e(B)| -r(B,A).
% 0.84/1.04 18 [] {-} e(exist).
% 0.84/1.04 21 [hyper,18,11] {+} r(exist,u4r2(exist)).
% 0.84/1.04 30 [hyper,21,13,18] {+} c(u4r2(exist)).
% 0.84/1.04 31 [hyper,21,12,18] {+} d(u4r2(exist)).
% 0.84/1.04 38 [hyper,31,7] {+} s1most(u4r2(exist)).
% 0.84/1.04 45 [hyper,30,1] {+} s2least(u4r2(exist)).
% 0.84/1.04 54 [hyper,45,5] {+} s(u4r2(exist),u1r2(u4r2(exist))).
% 0.84/1.04 55 [hyper,45,4] {+} s(u4r2(exist),u1r1(u4r2(exist))).
% 0.84/1.04 80 [hyper,55,9,38,54] {-} equalish(u1r2(u4r2(exist)),u1r1(u4r2(exist))).
% 0.84/1.04 94 [hyper,80,3,45] {-} $F.
% 0.84/1.04
% 0.84/1.04 % SZS output end Refutation
% 0.84/1.04 ------------ end of proof -------------
% 0.84/1.04
% 0.84/1.04
% 0.84/1.04 Search stopped by max_proofs option.
% 0.84/1.04
% 0.84/1.04
% 0.84/1.04 Search stopped by max_proofs option.
% 0.84/1.04
% 0.84/1.04 ============ end of search ============
% 0.84/1.04
% 0.84/1.04 ----------- soft-scott stats ----------
% 0.84/1.04
% 0.84/1.04 true clauses given 5 (27.8%)
% 0.84/1.04 false clauses given 13
% 0.84/1.04
% 0.84/1.04 FALSE TRUE
% 0.84/1.04 9 0 1
% 0.84/1.04 11 0 17
% 0.84/1.04 12 0 6
% 0.84/1.04 14 0 27
% 0.84/1.04 18 0 4
% 0.84/1.04 22 0 2
% 0.84/1.04 tot: 0 57 (100.0% true)
% 0.84/1.04
% 0.84/1.04
% 0.84/1.04 Model 11 [ 4 0 78 ] (0.00 seconds, 250000 Inserts)
% 0.84/1.04
% 0.84/1.04 That finishes the proof of the theorem.
% 0.84/1.04
% 0.84/1.04 Process 21380 finished Tue Jun 7 07:54:06 2022
%------------------------------------------------------------------------------