TSTP Solution File: KRS001-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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.36s 0.56s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : KRS001-1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n021.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jun 7 15:45:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n021.cluster.edu,
% 0.11/0.34 Tue Jun 7 15:45:06 2022
% 0.11/0.34 The command was "./sos". The process ID is 31240.
% 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.38
% 0.11/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.38
% 0.11/0.38 Stopped by limit on number of solutions
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 -------------- Softie stats --------------
% 0.11/0.38
% 0.11/0.38 UPDATE_STOP: 300
% 0.11/0.38 SFINDER_TIME_LIMIT: 2
% 0.11/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.38 number of clauses in intial UL: 15
% 0.11/0.38 number of clauses initially in problem: 18
% 0.11/0.38 percentage of clauses intially in UL: 83
% 0.11/0.38 percentage of distinct symbols occuring in initial UL: 91
% 0.11/0.38 percent of all initial clauses that are short: 100
% 0.11/0.38 absolute distinct symbol count: 12
% 0.11/0.38 distinct predicate count: 7
% 0.11/0.38 distinct function count: 4
% 0.11/0.38 distinct constant count: 1
% 0.11/0.38
% 0.11/0.38 ---------- no more Softie stats ----------
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38
% 0.11/0.38 =========== start of search ===========
% 0.36/0.56
% 0.36/0.56 -------- PROOF --------
% 0.36/0.56 % SZS status Unsatisfiable
% 0.36/0.56 % SZS output start Refutation
% 0.36/0.56
% 0.36/0.56 Model 2 [ 1 0 57 ] (0.00 seconds, 9080 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 3 [ 2 0 76 ] (0.00 seconds, 2102 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 4 [ 2 0 59 ] (0.00 seconds, 16534 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 5 [ 3 1 63 ] (0.00 seconds, 3365 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 6 [ 3 1 113 ] (0.00 seconds, 2993 Inserts)
% 0.36/0.56
% 0.36/0.56 Stopped by limit on insertions
% 0.36/0.56
% 0.36/0.56 Model 7 [ 4 1 109 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 8 [ 3 1 93 ] (0.00 seconds, 23489 Inserts)
% 0.36/0.56
% 0.36/0.56 Model 9 [ 3 1 214 ] (0.00 seconds, 23365 Inserts)
% 0.36/0.56
% 0.36/0.56 -----> EMPTY CLAUSE at 0.19 sec ----> 60 [hyper,50,3,23] {-} $F.
% 0.36/0.56
% 0.36/0.56 Length of proof is 7. Level of proof is 4.
% 0.36/0.56
% 0.36/0.56 ---------------- PROOF ----------------
% 0.36/0.56 % SZS status Unsatisfiable
% 0.36/0.56 % SZS output start Refutation
% 0.36/0.56
% 0.36/0.56 1 [] {+} r2least(A)| -c(A).
% 0.36/0.56 3 [] {+} -r2least(A)| -equalish(u1r2(A),u1r1(A)).
% 0.36/0.56 4 [] {+} r(A,u1r1(A))| -r2least(A).
% 0.36/0.56 5 [] {+} r(A,u1r2(A))| -r2least(A).
% 0.36/0.56 7 [] {+} r1most(A)| -d(A).
% 0.36/0.56 9 [] {+} equalish(A,B)| -r1most(C)| -r(C,A)| -r(C,B).
% 0.36/0.56 11 [] {+} d(A)| -e(A).
% 0.36/0.56 12 [] {+} c(A)| -e(A).
% 0.36/0.56 16 [] {-} e(exist).
% 0.36/0.56 19 [hyper,16,12] {+} c(exist).
% 0.36/0.56 20 [hyper,16,11] {+} d(exist).
% 0.36/0.56 23 [hyper,19,1] {+} r2least(exist).
% 0.36/0.56 26 [hyper,20,7] {+} r1most(exist).
% 0.36/0.56 29 [hyper,23,5] {+} r(exist,u1r2(exist)).
% 0.36/0.56 30 [hyper,23,4] {+} r(exist,u1r1(exist)).
% 0.36/0.56 50 [hyper,30,9,26,29] {-} equalish(u1r2(exist),u1r1(exist)).
% 0.36/0.56 60 [hyper,50,3,23] {-} $F.
% 0.36/0.56
% 0.36/0.56 % SZS output end Refutation
% 0.36/0.56 ------------ end of proof -------------
% 0.36/0.56
% 0.36/0.56
% 0.36/0.56 Search stopped by max_proofs option.
% 0.36/0.56
% 0.36/0.56
% 0.36/0.56 Search stopped by max_proofs option.
% 0.36/0.56
% 0.36/0.56 ============ end of search ============
% 0.36/0.56
% 0.36/0.56 ----------- soft-scott stats ----------
% 0.36/0.56
% 0.36/0.56 true clauses given 2 (15.4%)
% 0.36/0.56 false clauses given 11
% 0.36/0.56
% 0.36/0.56 FALSE TRUE
% 0.36/0.56 6 0 2
% 0.36/0.56 8 0 1
% 0.36/0.56 10 0 9
% 0.36/0.56 12 0 12
% 0.36/0.56 14 0 4
% 0.36/0.56 18 0 2
% 0.36/0.56 tot: 0 30 (100.0% true)
% 0.36/0.56
% 0.36/0.56
% 0.36/0.56 Model 9 [ 3 1 214 ] (0.00 seconds, 23365 Inserts)
% 0.36/0.56
% 0.36/0.56 That finishes the proof of the theorem.
% 0.36/0.56
% 0.36/0.56 Process 31240 finished Tue Jun 7 15:45:06 2022
%------------------------------------------------------------------------------