TSTP Solution File: KRS107+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:47 EDT 2022
% Result : Unsatisfiable 1.06s 1.32s
% Output : Refutation 1.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KRS107+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n025.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 10:00:33 EDT 2022
% 0.19/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n025.cluster.edu,
% 0.19/0.36 Tue Jun 7 10:00:33 2022
% 0.19/0.36 The command was "./sos". The process ID is 26551.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36 33 back subsumes 7.
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 68 back subsumes 8.
% 0.19/0.36 Following clause subsumed by 72 during input processing: 0 [copy,72,flip.1] {-} A=A.
% 0.19/0.36 72 back subsumes 67.
% 0.19/0.36 72 back subsumes 66.
% 0.19/0.36 72 back subsumes 65.
% 0.19/0.36 72 back subsumes 64.
% 0.19/0.36 72 back subsumes 63.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 60
% 0.19/0.40 number of clauses initially in problem: 65
% 0.19/0.40 percentage of clauses intially in UL: 92
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 89
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 28
% 0.19/0.40 distinct predicate count: 22
% 0.19/0.40 distinct function count: 5
% 0.19/0.40 distinct constant count: 1
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 1.06/1.32
% 1.06/1.32 -------- PROOF --------
% 1.06/1.32 % SZS status Theorem
% 1.06/1.32 % SZS output start Refutation
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 3 [ 1 1 416 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 4 [ 2 1 268 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Model 5 [ 1 1 350 ] (0.00 seconds, 40272 Inserts)
% 1.06/1.32
% 1.06/1.32 Model 6 [ 1 1 643 ] (0.00 seconds, 840 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 7 [ 4 0 290 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 8 [ 6 0 293 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 9 [ 4 1 27427 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 10 [ 3 2 157832 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 11 [ 4 0 288 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 12 [ 4 0 279 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 13 [ 6 1 376 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 14 [ 5 0 3775 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Model 15 [ 1 0 446 ] (0.00 seconds, 638 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 16 [ 6 0 1074 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 Stopped by limit on insertions
% 1.06/1.32
% 1.06/1.32 Model 17 [ 3 0 751 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 -----> EMPTY CLAUSE at 0.94 sec ----> 332 [hyper,316,49,130] {-} $F.
% 1.06/1.32
% 1.06/1.32 Length of proof is 13. Level of proof is 6.
% 1.06/1.32
% 1.06/1.32 ---------------- PROOF ----------------
% 1.06/1.32 % SZS status Theorem
% 1.06/1.32 % SZS output start Refutation
% 1.06/1.32
% 1.06/1.32 35 [] {+} -cUnsatisfiable(A)|rrx3(A,$f1(A)).
% 1.06/1.32 36 [] {+} -cUnsatisfiable(A)|cc1($f1(A)).
% 1.06/1.32 37 [] {+} -cUnsatisfiable(A)|rrx4(A,$f2(A)).
% 1.06/1.32 38 [] {+} -cUnsatisfiable(A)|cc2($f2(A)).
% 1.06/1.32 39 [] {+} -cUnsatisfiable(A)|ca_Cx1(A).
% 1.06/1.32 43 [] {+} ca_Ax2(A)| -cc2(A)| -cc1(A).
% 1.06/1.32 44 [] {+} -ca_Cx1(A)|ra_Px1(A,$f3(A)).
% 1.06/1.32 48 [] {+} ca_Cx1xcomp(A)| -rrx3(A,B)| -ca_Ax2(B).
% 1.06/1.32 49 [] {+} -ca_Cx1xcomp(A)| -ra_Px1(A,B).
% 1.06/1.32 50 [] {+} -rrx(A,B)| -rrx(A,C)|B=C.
% 1.06/1.32 59 [] {+} -rrx4(A,B)|rrx(A,B).
% 1.06/1.32 62 [] {+} -rrx3(A,B)|rrx(A,B).
% 1.06/1.32 70 [] {+} ca_Cx1xcomp(A)|ra_Px1(A,$f5(A)).
% 1.06/1.32 71 [] {-} cUnsatisfiable(i2003_11_14_17_21_01226).
% 1.06/1.32 73 [hyper,71,39] {+} ca_Cx1(i2003_11_14_17_21_01226).
% 1.06/1.32 74 [hyper,71,38] {+} cc2($f2(i2003_11_14_17_21_01226)).
% 1.06/1.32 75 [hyper,71,37] {+} rrx4(i2003_11_14_17_21_01226,$f2(i2003_11_14_17_21_01226)).
% 1.06/1.32 76 [hyper,71,36] {+} cc1($f1(i2003_11_14_17_21_01226)).
% 1.06/1.32 77 [hyper,71,35] {+} rrx3(i2003_11_14_17_21_01226,$f1(i2003_11_14_17_21_01226)).
% 1.06/1.32 83 [hyper,75,59] {+} rrx(i2003_11_14_17_21_01226,$f2(i2003_11_14_17_21_01226)).
% 1.06/1.32 100 [hyper,73,44] {+} ra_Px1(i2003_11_14_17_21_01226,$f3(i2003_11_14_17_21_01226)).
% 1.06/1.32 113 [hyper,77,62] {+} rrx(i2003_11_14_17_21_01226,$f1(i2003_11_14_17_21_01226)).
% 1.06/1.32 130 [hyper,100,49,70] {+} ra_Px1(i2003_11_14_17_21_01226,$f5(i2003_11_14_17_21_01226)).
% 1.06/1.32 212,211 [hyper,113,50,83] {-} $f2(i2003_11_14_17_21_01226)=$f1(i2003_11_14_17_21_01226).
% 1.06/1.32 250 [back_demod,74,demod,212] {-} cc2($f1(i2003_11_14_17_21_01226)).
% 1.06/1.32 261 [hyper,250,43,76] {+} ca_Ax2($f1(i2003_11_14_17_21_01226)).
% 1.06/1.32 316 [hyper,261,48,77] {-} ca_Cx1xcomp(i2003_11_14_17_21_01226).
% 1.06/1.32 332 [hyper,316,49,130] {-} $F.
% 1.06/1.32
% 1.06/1.32 % SZS output end Refutation
% 1.06/1.32 ------------ end of proof -------------
% 1.06/1.32
% 1.06/1.32
% 1.06/1.32 Search stopped by max_proofs option.
% 1.06/1.32
% 1.06/1.32
% 1.06/1.32 Search stopped by max_proofs option.
% 1.06/1.32
% 1.06/1.32 ============ end of search ============
% 1.06/1.32
% 1.06/1.32 ----------- soft-scott stats ----------
% 1.06/1.32
% 1.06/1.32 true clauses given 6 (22.2%)
% 1.06/1.32 false clauses given 21
% 1.06/1.32
% 1.06/1.32 FALSE TRUE
% 1.06/1.32 4 0 1
% 1.06/1.32 6 0 5
% 1.06/1.32 7 0 4
% 1.06/1.32 8 1 7
% 1.06/1.32 9 2 38
% 1.06/1.32 10 16 119
% 1.06/1.32 11 0 5
% 1.06/1.32 12 3 2
% 1.06/1.32 13 0 10
% 1.06/1.32 14 0 30
% 1.06/1.32 tot: 22 221 (90.9% true)
% 1.06/1.32
% 1.06/1.32
% 1.06/1.32 Model 17 [ 3 0 751 ] (0.00 seconds, 250000 Inserts)
% 1.06/1.32
% 1.06/1.32 That finishes the proof of the theorem.
% 1.06/1.32
% 1.06/1.32 Process 26551 finished Tue Jun 7 10:00:34 2022
%------------------------------------------------------------------------------