TSTP Solution File: KRS120+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS120+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:49 EDT 2022
% Result : Unsatisfiable 1.02s 1.22s
% Output : Refutation 1.02s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS120+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 17:14:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n025.cluster.edu,
% 0.12/0.35 Tue Jun 7 17:14:04 2022
% 0.12/0.35 The command was "./sos". The process ID is 3206.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 20 back subsumes 4.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 42 back subsumes 5.
% 0.12/0.35 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.12/0.35 46 back subsumes 41.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 38
% 0.12/0.39 number of clauses initially in problem: 43
% 0.12/0.39 percentage of clauses intially in UL: 88
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 21
% 0.12/0.39 distinct predicate count: 15
% 0.12/0.39 distinct function count: 5
% 0.12/0.39 distinct constant count: 1
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 1.02/1.22
% 1.02/1.22 -------- PROOF --------
% 1.02/1.22 % SZS status Theorem
% 1.02/1.22 % SZS output start Refutation
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 3 [ 1 1 382 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Model 4 [ 1 0 131 ] (0.00 seconds, 214741 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 5 [ 1 0 652 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 6 [ 3 1 571 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 7 [ 2 1 198 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 8 [ 2 0 140 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 9 [ 3 1 348 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 Stopped by limit on insertions
% 1.02/1.22
% 1.02/1.22 Model 10 [ 5 1 140 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 -----> EMPTY CLAUSE at 0.85 sec ----> 662 [hyper,584,25,54] {-} $F.
% 1.02/1.22
% 1.02/1.22 Length of proof is 10. Level of proof is 5.
% 1.02/1.22
% 1.02/1.22 ---------------- PROOF ----------------
% 1.02/1.22 % SZS status Theorem
% 1.02/1.22 % SZS output start Refutation
% 1.02/1.22
% 1.02/1.22 23 [] {+} -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 1.02/1.22 25 [] {+} -cp1(A)| -ra_Px1(A,B).
% 1.02/1.22 26 [] {+} -cp1xcomp(A)|ra_Px1(A,$f3(A)).
% 1.02/1.22 28 [] {+} -ca_Ax2(A)|rinvF(A,$f4(A)).
% 1.02/1.22 29 [] {+} -ca_Ax2(A)|ca_Vx3($f4(A)).
% 1.02/1.22 30 [] {+} -ca_Ax2(A)|cp1(A).
% 1.02/1.22 32 [] {+} -ca_Vx3(A)|rf(A,$f5(A)).
% 1.02/1.22 33 [] {+} -ca_Vx3(A)|cp1xcomp($f5(A)).
% 1.02/1.22 35 [] {+} -cowlThing(A)| -rf(A,B)| -rf(A,C)|B=C.
% 1.02/1.22 36 [] {+} -rinvF(A,B)|rf(B,A).
% 1.02/1.22 42 [] {+} cowlThing(A).
% 1.02/1.22 45 [] {+} cUnsatisfiable(i2003_11_14_17_21_48796).
% 1.02/1.22 47 [hyper,45,23] {+} ca_Ax2($f1(i2003_11_14_17_21_48796)).
% 1.02/1.22 54 [hyper,47,30] {+} cp1($f1(i2003_11_14_17_21_48796)).
% 1.02/1.22 55 [hyper,47,29] {+} ca_Vx3($f4($f1(i2003_11_14_17_21_48796))).
% 1.02/1.22 56 [hyper,47,28] {+} rinvF($f1(i2003_11_14_17_21_48796),$f4($f1(i2003_11_14_17_21_48796))).
% 1.02/1.22 94 [hyper,55,33] {+} cp1xcomp($f5($f4($f1(i2003_11_14_17_21_48796)))).
% 1.02/1.22 95 [hyper,55,32] {+} rf($f4($f1(i2003_11_14_17_21_48796)),$f5($f4($f1(i2003_11_14_17_21_48796)))).
% 1.02/1.22 191 [hyper,56,36] {+} rf($f4($f1(i2003_11_14_17_21_48796)),$f1(i2003_11_14_17_21_48796)).
% 1.02/1.22 220 [hyper,94,26] {-} ra_Px1($f5($f4($f1(i2003_11_14_17_21_48796))),$f3($f5($f4($f1(i2003_11_14_17_21_48796))))).
% 1.02/1.22 581,580 [hyper,95,35,42,191,flip.1] {-} $f5($f4($f1(i2003_11_14_17_21_48796)))=$f1(i2003_11_14_17_21_48796).
% 1.02/1.22 584 [back_demod,220,demod,581,581] {-} ra_Px1($f1(i2003_11_14_17_21_48796),$f3($f1(i2003_11_14_17_21_48796))).
% 1.02/1.22 662 [hyper,584,25,54] {-} $F.
% 1.02/1.22
% 1.02/1.22 % SZS output end Refutation
% 1.02/1.22 ------------ end of proof -------------
% 1.02/1.22
% 1.02/1.22
% 1.02/1.22 Search stopped by max_proofs option.
% 1.02/1.22
% 1.02/1.22
% 1.02/1.22 Search stopped by max_proofs option.
% 1.02/1.22
% 1.02/1.22 ============ end of search ============
% 1.02/1.22
% 1.02/1.22 ----------- soft-scott stats ----------
% 1.02/1.22
% 1.02/1.22 true clauses given 28 (35.4%)
% 1.02/1.22 false clauses given 51
% 1.02/1.22
% 1.02/1.22 FALSE TRUE
% 1.02/1.22 4 0 2
% 1.02/1.22 5 0 2
% 1.02/1.22 6 1 10
% 1.02/1.22 7 1 4
% 1.02/1.22 8 1 6
% 1.02/1.22 9 6 1
% 1.02/1.22 10 6 7
% 1.02/1.22 11 9 8
% 1.02/1.22 12 5 9
% 1.02/1.22 13 1 15
% 1.02/1.22 14 1 22
% 1.02/1.22 15 17 33
% 1.02/1.22 16 12 28
% 1.02/1.22 17 31 34
% 1.02/1.22 18 43 41
% 1.02/1.22 19 24 19
% 1.02/1.22 20 26 23
% 1.02/1.22 21 10 15
% 1.02/1.22 22 5 2
% 1.02/1.22 23 3 0
% 1.02/1.22 24 1 22
% 1.02/1.22 25 0 2
% 1.02/1.22 27 1 2
% 1.02/1.22 30 1 0
% 1.02/1.22 tot: 205 307 (60.0% true)
% 1.02/1.22
% 1.02/1.22
% 1.02/1.22 Model 10 [ 5 1 140 ] (0.00 seconds, 250000 Inserts)
% 1.02/1.22
% 1.02/1.22 That finishes the proof of the theorem.
% 1.02/1.22
% 1.02/1.22 Process 3206 finished Tue Jun 7 17:14:05 2022
%------------------------------------------------------------------------------