TSTP Solution File: KRS003-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS003-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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.55s 0.76s
% Output : Refutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS003-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 : Tue Jun 7 18:18:02 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n017.cluster.edu,
% 0.20/0.36 Tue Jun 7 18:18:02 2022
% 0.20/0.36 The command was "./sos". The process ID is 3596.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36
% 0.20/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: 14
% 0.20/0.39 number of clauses initially in problem: 18
% 0.20/0.39 percentage of clauses intially in UL: 77
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 92
% 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: 8
% 0.20/0.39 distinct function count: 4
% 0.20/0.39 distinct constant count: 1
% 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 ===========
% 0.55/0.76
% 0.55/0.76 -------- PROOF --------
% 0.55/0.76 % SZS status Unsatisfiable
% 0.55/0.76 % SZS output start Refutation
% 0.55/0.76
% 0.55/0.76 Model 2 (0.00 seconds, 0 Inserts)
% 0.55/0.76
% 0.55/0.76 Stopped by limit on number of solutions
% 0.55/0.76
% 0.55/0.76 Model 3 [ 1 0 61 ] (0.00 seconds, 43979 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 4 [ 1 1 61 ] (0.00 seconds, 12155 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 5 [ 2 0 61 ] (0.00 seconds, 7429 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 6 [ 2 1 63 ] (0.00 seconds, 50554 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 7 [ 2 1 84 ] (0.00 seconds, 36702 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 8 [ 2 0 83 ] (0.00 seconds, 15997 Inserts)
% 0.55/0.76
% 0.55/0.76 Model 9 [ 2 0 124 ] (0.00 seconds, 67712 Inserts)
% 0.55/0.76
% 0.55/0.76 Stopped by limit on insertions
% 0.55/0.76
% 0.55/0.76 Model 10 [ 4 0 61 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.76
% 0.55/0.76 Stopped by limit on insertions
% 0.55/0.76
% 0.55/0.76 Model 11 [ 5 1 25618 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.76
% 0.55/0.76 -----> EMPTY CLAUSE at 0.37 sec ----> 57 [hyper,50,3,25] {-} $F.
% 0.55/0.76
% 0.55/0.76 Length of proof is 7. Level of proof is 4.
% 0.55/0.76
% 0.55/0.76 ---------------- PROOF ----------------
% 0.55/0.76 % SZS status Unsatisfiable
% 0.55/0.76 % SZS output start Refutation
% 0.55/0.76
% 0.55/0.76 1 [] {+} s2least(A)| -c(A).
% 0.55/0.76 3 [] {+} -s2least(A)| -equalish(u1r2(A),u1r1(A)).
% 0.55/0.76 4 [] {+} s(A,u1r1(A))| -s2least(A).
% 0.55/0.76 5 [] {+} s(A,u1r2(A))| -s2least(A).
% 0.55/0.76 7 [] {+} s1most(A)| -d(A).
% 0.55/0.76 9 [] {+} equalish(A,B)| -s1most(C)| -s(C,A)| -s(C,B).
% 0.55/0.76 11 [] {+} c(A)| -e(A).
% 0.55/0.76 12 [] {+} d(A)| -f(A).
% 0.55/0.76 15 [] {+} e(exist).
% 0.55/0.76 16 [] {+} f(exist).
% 0.55/0.76 19 [hyper,15,11] {+} c(exist).
% 0.55/0.76 22 [hyper,16,12] {+} d(exist).
% 0.55/0.76 25 [hyper,19,1] {+} s2least(exist).
% 0.55/0.76 28 [hyper,22,7] {+} s1most(exist).
% 0.55/0.76 31 [hyper,25,5] {+} s(exist,u1r2(exist)).
% 0.55/0.76 32 [hyper,25,4] {+} s(exist,u1r1(exist)).
% 0.55/0.76 50 [hyper,31,9,28,32,flip.1] {+} equalish(u1r2(exist),u1r1(exist)).
% 0.55/0.76 57 [hyper,50,3,25] {-} $F.
% 0.55/0.76
% 0.55/0.76 % SZS output end Refutation
% 0.55/0.76 ------------ end of proof -------------
% 0.55/0.76
% 0.55/0.76
% 0.55/0.76 Search stopped by max_proofs option.
% 0.55/0.76
% 0.55/0.76
% 0.55/0.76 Search stopped by max_proofs option.
% 0.55/0.76
% 0.55/0.76 ============ end of search ============
% 0.55/0.76
% 0.55/0.76 ----------- soft-scott stats ----------
% 0.55/0.76
% 0.55/0.76 true clauses given 3 (23.1%)
% 0.55/0.76 false clauses given 10
% 0.55/0.76
% 0.55/0.76 FALSE TRUE
% 0.55/0.76 5 0 1
% 0.55/0.76 6 1 1
% 0.55/0.76 8 0 1
% 0.55/0.76 9 0 1
% 0.55/0.76 10 0 11
% 0.55/0.76 12 1 5
% 0.55/0.76 14 0 4
% 0.55/0.76 18 0 2
% 0.55/0.76 tot: 2 26 (92.9% true)
% 0.55/0.76
% 0.55/0.76
% 0.55/0.76 Model 11 [ 5 1 25618 ] (0.00 seconds, 250000 Inserts)
% 0.55/0.76
% 0.55/0.76 That finishes the proof of the theorem.
% 0.55/0.76
% 0.55/0.76 Process 3596 finished Tue Jun 7 18:18:03 2022
%------------------------------------------------------------------------------