TSTP Solution File: KRS076+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS076+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:42 EDT 2022
% Result : Unsatisfiable 0.18s 0.48s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS076+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 13:36:49 EDT 2022
% 0.17/0.32 % CPUTime :
% 0.17/0.34 ----- Otter 3.2, August 2001 -----
% 0.17/0.34 The process was started by sandbox on n025.cluster.edu,
% 0.17/0.34 Tue Jun 7 13:36:49 2022
% 0.17/0.34 The command was "./sos". The process ID is 9611.
% 0.17/0.34
% 0.17/0.34 set(prolog_style_variables).
% 0.17/0.34 set(auto).
% 0.17/0.34 dependent: set(auto1).
% 0.17/0.34 dependent: set(process_input).
% 0.17/0.34 dependent: clear(print_kept).
% 0.17/0.34 dependent: clear(print_new_demod).
% 0.17/0.34 dependent: clear(print_back_demod).
% 0.17/0.34 dependent: clear(print_back_sub).
% 0.17/0.34 dependent: set(control_memory).
% 0.17/0.34 dependent: assign(max_mem, 12000).
% 0.17/0.34 dependent: assign(pick_given_ratio, 4).
% 0.17/0.34 dependent: assign(stats_level, 1).
% 0.17/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.17/0.34 dependent: assign(sos_limit, 5000).
% 0.17/0.34 dependent: assign(max_weight, 60).
% 0.17/0.34 clear(print_given).
% 0.17/0.34
% 0.17/0.34 formula_list(usable).
% 0.17/0.34
% 0.17/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.17/0.34
% 0.17/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.17/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.17/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.17/0.34 clauses in usable.
% 0.17/0.34
% 0.17/0.34 dependent: set(knuth_bendix).
% 0.17/0.34 dependent: set(para_from).
% 0.17/0.34 dependent: set(para_into).
% 0.17/0.34 dependent: clear(para_from_right).
% 0.17/0.34 dependent: clear(para_into_right).
% 0.17/0.34 dependent: set(para_from_vars).
% 0.17/0.34 dependent: set(eq_units_both_ways).
% 0.17/0.34 dependent: set(dynamic_demod_all).
% 0.17/0.34 dependent: set(dynamic_demod).
% 0.17/0.34 dependent: set(order_eq).
% 0.17/0.34 dependent: set(back_demod).
% 0.17/0.34 dependent: set(lrpo).
% 0.17/0.34 dependent: set(hyper_res).
% 0.17/0.34 dependent: set(unit_deletion).
% 0.17/0.34 dependent: set(factor).
% 0.17/0.34
% 0.17/0.34 ------------> process usable:
% 0.17/0.34 19 back subsumes 2.
% 0.17/0.34
% 0.17/0.34 ------------> process sos:
% 0.17/0.34 43 back subsumes 26.
% 0.17/0.34 43 back subsumes 3.
% 0.17/0.34 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.17/0.34 46 back subsumes 42.
% 0.17/0.34 46 back subsumes 41.
% 0.17/0.34 46 back subsumes 40.
% 0.17/0.34
% 0.17/0.34 ======= end of input processing =======
% 0.17/0.37
% 0.17/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.17/0.37
% 0.17/0.37 Stopped by limit on number of solutions
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37 -------------- Softie stats --------------
% 0.17/0.37
% 0.17/0.37 UPDATE_STOP: 300
% 0.17/0.37 SFINDER_TIME_LIMIT: 2
% 0.17/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.17/0.37 number of clauses in intial UL: 36
% 0.17/0.37 number of clauses initially in problem: 40
% 0.17/0.37 percentage of clauses intially in UL: 90
% 0.17/0.37 percentage of distinct symbols occuring in initial UL: 94
% 0.17/0.37 percent of all initial clauses that are short: 100
% 0.17/0.37 absolute distinct symbol count: 18
% 0.17/0.37 distinct predicate count: 13
% 0.17/0.37 distinct function count: 4
% 0.17/0.37 distinct constant count: 1
% 0.17/0.37
% 0.17/0.37 ---------- no more Softie stats ----------
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37
% 0.17/0.37 =========== start of search ===========
% 0.18/0.48
% 0.18/0.48 -------- PROOF --------
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 % SZS output start Refutation
% 0.18/0.48
% 0.18/0.48 Model 2 [ 1 1 689 ] (0.00 seconds, 7646 Inserts)
% 0.18/0.48
% 0.18/0.48 Model 3 [ 1 0 580 ] (0.00 seconds, 5752 Inserts)
% 0.18/0.48
% 0.18/0.48 Model 4 [ 1 1 578 ] (0.00 seconds, 7798 Inserts)
% 0.18/0.48
% 0.18/0.48 Model 5 [ 1 1 699 ] (0.00 seconds, 10313 Inserts)
% 0.18/0.48
% 0.18/0.48 Model 6 [ 1 2 16870 ] (0.00 seconds, 31935 Inserts)
% 0.18/0.48
% 0.18/0.48 -----> EMPTY CLAUSE at 0.13 sec ----> 213 [para_from,151.1.1,24.2.1,unit_del,45,137] {-} $F.
% 0.18/0.48
% 0.18/0.48 Length of proof is 10. Level of proof is 6.
% 0.18/0.48
% 0.18/0.48 ---------------- PROOF ----------------
% 0.18/0.48 % SZS status Theorem
% 0.18/0.48 % SZS output start Refutation
% 0.18/0.48
% 0.18/0.48 21 [] {+} -cUnsatisfiable(A)|rf(A,$f1(A)).
% 0.18/0.48 22 [] {+} -cUnsatisfiable(A)|cp($f1(A)).
% 0.18/0.48 23 [] {+} -cUnsatisfiable(A)|rf1(A,$f3(A)).
% 0.18/0.48 24 [] {+} -cUnsatisfiable(A)| -cp($f3(A)).
% 0.18/0.48 25 [] {+} -cUnsatisfiable(A)| -rinvF1($f3(A),B)|rs(B,$f2(A,B)).
% 0.18/0.48 29 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 0.18/0.48 30 [] {+} -rf1(A,B)| -rf1(A,C)|B=C.
% 0.18/0.48 34 [] {+} rinvF1(A,B)| -rf1(B,A).
% 0.18/0.48 38 [] {+} -rs(A,B)|rf1(A,B).
% 0.18/0.48 39 [] {+} -rs(A,B)|rf(A,B).
% 0.18/0.48 45 [] {-} cUnsatisfiable(i2003_11_14_17_19_06193).
% 0.18/0.48 47 [hyper,45,23] {+} rf1(i2003_11_14_17_19_06193,$f3(i2003_11_14_17_19_06193)).
% 0.18/0.48 48 [hyper,45,22] {+} cp($f1(i2003_11_14_17_19_06193)).
% 0.18/0.48 49 [hyper,45,21] {+} rf(i2003_11_14_17_19_06193,$f1(i2003_11_14_17_19_06193)).
% 0.18/0.48 69 [hyper,47,34] {+} rinvF1($f3(i2003_11_14_17_19_06193),i2003_11_14_17_19_06193).
% 0.18/0.48 91 [hyper,69,25,45] {+} rs(i2003_11_14_17_19_06193,$f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)).
% 0.18/0.48 104 [hyper,91,39] {+} rf(i2003_11_14_17_19_06193,$f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)).
% 0.18/0.48 105 [hyper,91,38] {+} rf1(i2003_11_14_17_19_06193,$f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)).
% 0.18/0.48 121,120 [hyper,104,29,49] {+} $f1(i2003_11_14_17_19_06193)=$f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193).
% 0.18/0.48 137 [back_demod,48,demod,121] {+} cp($f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193)).
% 0.18/0.48 151 [hyper,105,30,47] {+} $f3(i2003_11_14_17_19_06193)=$f2(i2003_11_14_17_19_06193,i2003_11_14_17_19_06193).
% 0.18/0.48 213 [para_from,151.1.1,24.2.1,unit_del,45,137] {-} $F.
% 0.18/0.48
% 0.18/0.48 % SZS output end Refutation
% 0.18/0.48 ------------ end of proof -------------
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Search stopped by max_proofs option.
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Search stopped by max_proofs option.
% 0.18/0.48
% 0.18/0.48 ============ end of search ============
% 0.18/0.48
% 0.18/0.48 ----------- soft-scott stats ----------
% 0.18/0.48
% 0.18/0.48 true clauses given 16 (72.7%)
% 0.18/0.48 false clauses given 6
% 0.18/0.48
% 0.18/0.48 FALSE TRUE
% 0.18/0.48 9 0 5
% 0.18/0.48 10 0 45
% 0.18/0.48 11 0 72
% 0.18/0.48 12 0 5
% 0.18/0.48 14 0 9
% 0.18/0.48 15 0 6
% 0.18/0.48 tot: 0 142 (100.0% true)
% 0.18/0.48
% 0.18/0.48
% 0.18/0.48 Model 6 [ 1 2 16870 ] (0.00 seconds, 31935 Inserts)
% 0.18/0.48
% 0.18/0.48 That finishes the proof of the theorem.
% 0.18/0.48
% 0.18/0.48 Process 9611 finished Tue Jun 7 13:36:49 2022
%------------------------------------------------------------------------------