TSTP Solution File: KRS010-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:27 EDT 2022
% Result : Unsatisfiable 30.22s 30.42s
% Output : Refutation 30.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS010-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n022.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 07:16:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n022.cluster.edu,
% 0.13/0.36 Tue Jun 7 07:16:05 2022
% 0.13/0.36 The command was "./sos". The process ID is 27640.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 33
% 0.19/0.43 number of clauses initially in problem: 34
% 0.19/0.43 percentage of clauses intially in UL: 97
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 17
% 0.19/0.43 distinct predicate count: 8
% 0.19/0.43 distinct function count: 8
% 0.19/0.43 distinct constant count: 1
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 30.22/30.42
% 30.22/30.42 -- HEY sandbox2, WE HAVE A PROOF!! --
% 30.22/30.42
% 30.22/30.42 Model 2 [ 1 1 191 ] (0.00 seconds, 66869 Inserts)
% 30.22/30.42
% 30.22/30.42 Stopped by limit on insertions
% 30.22/30.42
% 30.22/30.42 Model 3 [ 1 0 502 ] (0.00 seconds, 250000 Inserts)
% 30.22/30.42
% 30.22/30.42 Stopped by limit on insertions
% 30.22/30.42
% 30.22/30.42 Model 4 [ 1 5 147922 ] (0.00 seconds, 250000 Inserts)
% 30.22/30.42
% 30.22/30.42 Stopped by limit on insertions
% 30.22/30.42
% 30.22/30.42 Model 5 [ 2 1 197 ] (0.00 seconds, 250000 Inserts)
% 30.22/30.42
% 30.22/30.42 Stopped by limit on insertions
% 30.22/30.42
% 30.22/30.42 Model 6 [ 2 0 509 ] (0.00 seconds, 250000 Inserts)
% 30.22/30.42
% 30.22/30.42 -----> EMPTY CLAUSE at 30.03 sec ----> 3672 [hyper,3232,20,35] {-} $F.
% 30.22/30.42
% 30.22/30.42 Length of proof is 27. Level of proof is 12.
% 30.22/30.42
% 30.22/30.42 ---------------- PROOF ----------------
% 30.22/30.42 % SZS status Unsatisfiable
% 30.22/30.42 % SZS output start Refutation
% 30.22/30.42
% 30.22/30.42 1 [] {+} -f(exist).
% 30.22/30.42 2 [] {+} c(A)|d(A)| -a(A).
% 30.22/30.42 5 [] {+} equalish(A,B)| -e(C)| -r(C,A)| -r(C,B)| -c(A)| -c(B).
% 30.22/30.42 6 [] {+} r3least(A)| -e(A).
% 30.22/30.42 7 [] {+} a(A)| -e(B)| -r(B,A).
% 30.22/30.42 18 [] {+} -r3least(A)| -equalish(u2r2(A),u2r1(A)).
% 30.22/30.42 19 [] {+} -r3least(A)| -equalish(u2r3(A),u2r1(A)).
% 30.22/30.42 20 [] {+} -r3least(A)| -equalish(u2r3(A),u2r2(A)).
% 30.22/30.42 21 [] {+} r(A,u2r1(A))| -r3least(A).
% 30.22/30.42 22 [] {+} r(A,u2r2(A))| -r3least(A).
% 30.22/30.42 23 [] {+} r(A,u2r3(A))| -r3least(A).
% 30.22/30.42 30 [] {+} f(A)|equalish(B,C)| -r(A,B)| -r(A,C)| -d(B)| -d(C).
% 30.22/30.42 31 [factor,5.3.4,factor_simp] {+} equalish(A,A)| -e(B)| -r(B,A)| -c(A).
% 30.22/30.42 33 [factor,30.3.4,factor_simp] {+} f(A)|equalish(B,B)| -r(A,B)| -d(B).
% 30.22/30.42 34 [] {-} e(exist).
% 30.22/30.42 35 [hyper,34,6] {+} r3least(exist).
% 30.22/30.42 41 [hyper,35,23] {+} r(exist,u2r3(exist)).
% 30.22/30.42 42 [hyper,35,22] {+} r(exist,u2r2(exist)).
% 30.22/30.42 43 [hyper,35,21] {+} r(exist,u2r1(exist)).
% 30.22/30.42 52 [hyper,41,7,34] {+} a(u2r3(exist)).
% 30.22/30.42 68 [hyper,52,2] {+} c(u2r3(exist))|d(u2r3(exist)).
% 30.22/30.42 77 [hyper,42,7,34] {+} a(u2r2(exist)).
% 30.22/30.42 106 [hyper,77,2] {+} c(u2r2(exist))|d(u2r2(exist)).
% 30.22/30.42 115 [hyper,43,7,34] {+} a(u2r1(exist)).
% 30.22/30.42 131 [hyper,115,2] {+} c(u2r1(exist))|d(u2r1(exist)).
% 30.22/30.42 286 [hyper,106,33,42,unit_del,1] {+} c(u2r2(exist))|equalish(u2r2(exist),u2r2(exist)).
% 30.22/30.42 287 [hyper,106,30,41,42,68,unit_del,1] {+} c(u2r2(exist))|equalish(u2r3(exist),u2r2(exist))|c(u2r3(exist)).
% 30.22/30.42 308 [hyper,131,33,43,unit_del,1] {+} c(u2r1(exist))|equalish(u2r1(exist),u2r1(exist)).
% 30.22/30.42 309 [hyper,131,30,42,43,106,unit_del,1] {+} c(u2r1(exist))|equalish(u2r2(exist),u2r1(exist))|c(u2r2(exist)).
% 30.22/30.42 310 [hyper,131,30,41,43,68,unit_del,1] {+} c(u2r1(exist))|equalish(u2r3(exist),u2r1(exist))|c(u2r3(exist)).
% 30.22/30.42 388 [hyper,286,31,34,42,factor_simp] {+} equalish(u2r2(exist),u2r2(exist)).
% 30.22/30.42 389 [hyper,308,31,34,43,factor_simp] {+} equalish(u2r1(exist),u2r1(exist)).
% 30.22/30.42 561 [para_from,287.2.1,20.2.1,unit_del,35,388] {+} c(u2r2(exist))|c(u2r3(exist)).
% 30.22/30.42 662 [para_from,309.2.1,18.2.1,unit_del,35,389] {+} c(u2r1(exist))|c(u2r2(exist)).
% 30.22/30.42 663 [hyper,662,5,34,41,43,561,factor_simp] {+} c(u2r2(exist))|equalish(u2r3(exist),u2r1(exist)).
% 30.22/30.42 758 [para_from,663.2.1,19.2.1,unit_del,35,389] {+} c(u2r2(exist)).
% 30.22/30.42 835 [para_from,310.2.1,19.2.1,unit_del,35,389] {+} c(u2r1(exist))|c(u2r3(exist)).
% 30.22/30.42 1154 [hyper,835,5,34,42,43,758] {+} c(u2r3(exist))|equalish(u2r2(exist),u2r1(exist)).
% 30.22/30.42 1633 [para_from,1154.2.1,18.2.1,unit_del,35,389] {+} c(u2r3(exist)).
% 30.22/30.42 3232 [hyper,1633,5,34,42,41,758,flip.1] {+} equalish(u2r3(exist),u2r2(exist)).
% 30.22/30.42 3672 [hyper,3232,20,35] {-} $F.
% 30.22/30.42
% 30.22/30.42 % SZS output end Refutation
% 30.22/30.42 ------------ end of proof -------------
% 30.22/30.42
% 30.22/30.42
% 30.22/30.42 Search stopped by max_proofs option.
% 30.22/30.42
% 30.22/30.42
% 30.22/30.42 Search stopped by max_proofs option.
% 30.22/30.42
% 30.22/30.42 ============ end of search ============
% 30.22/30.42
% 30.22/30.42 ----------- soft-scott stats ----------
% 30.22/30.42
% 30.22/30.42 true clauses given 30 (61.2%)
% 30.22/30.42 false clauses given 19
% 30.22/30.42
% 30.22/30.42 FALSE TRUE
% 30.22/30.42 8 0 1
% 30.22/30.42 10 0 1
% 30.22/30.42 14 0 1
% 30.22/30.42 15 0 8
% 30.22/30.42 16 0 17
% 30.22/30.42 17 0 23
% 30.22/30.42 18 0 41
% 30.22/30.42 19 1 40
% 30.22/30.42 20 26 83
% 30.22/30.42 21 9 85
% 30.22/30.42 22 2 96
% 30.22/30.42 23 5 110
% 30.22/30.42 24 10 79
% 30.22/30.42 25 8 100
% 30.22/30.42 26 4 134
% 30.22/30.42 27 1 198
% 30.22/30.42 28 2 311
% 30.22/30.42 29 19 197
% 30.22/30.42 30 60 271
% 30.22/30.42 31 29 260
% 30.22/30.42 32 58 113
% 30.22/30.42 33 50 283
% 30.22/30.42 34 26 111
% 30.22/30.42 35 63 76
% 30.22/30.42 36 13 81
% 30.22/30.42 37 6 31
% 30.22/30.42 38 0 6
% 30.22/30.42 tot: 392 2757 (87.6% true)
% 30.22/30.42
% 30.22/30.42
% 30.22/30.42 Model 6 [ 2 0 509 ] (0.00 seconds, 250000 Inserts)
% 30.22/30.42
% 30.22/30.42 That finishes the proof of the theorem.
% 30.22/30.42
% 30.22/30.42 Process 27640 finished Tue Jun 7 07:16:35 2022
%------------------------------------------------------------------------------