TSTP Solution File: KRS127+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS127+1 : TPTP v8.1.0. Released v3.1.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:50 EDT 2022
% Result : Unsatisfiable 0.42s 0.61s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS127+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 09:05:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n022.cluster.edu,
% 0.12/0.36 Tue Jun 7 09:05:05 2022
% 0.12/0.36 The command was "./sos". The process ID is 26720.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 13 back subsumes 5.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 31 back subsumes 6.
% 0.12/0.36 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.12/0.36 35 back subsumes 27.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 27
% 0.12/0.40 number of clauses initially in problem: 32
% 0.12/0.40 percentage of clauses intially in UL: 84
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 83
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 18
% 0.12/0.40 distinct predicate count: 11
% 0.12/0.40 distinct function count: 6
% 0.12/0.40 distinct constant count: 1
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.42/0.61
% 0.42/0.61 -------- PROOF --------
% 0.42/0.61 % SZS status Theorem
% 0.42/0.61 % SZS output start Refutation
% 0.42/0.61
% 0.42/0.61 Model 3 [ 1 1 237 ] (0.00 seconds, 523 Inserts)
% 0.42/0.61
% 0.42/0.61 Stopped by limit on insertions
% 0.42/0.61
% 0.42/0.61 Model 4 [ 2 1 254 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.61
% 0.42/0.61 Stopped by limit on insertions
% 0.42/0.61
% 0.42/0.61 Model 5 [ 2 0 288 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.61
% 0.42/0.61 Model 6 [ 1 1 256 ] (0.00 seconds, 3454 Inserts)
% 0.42/0.61
% 0.42/0.61 Model 7 [ 1 1 307 ] (0.00 seconds, 4110 Inserts)
% 0.42/0.61
% 0.42/0.61 Stopped by limit on insertions
% 0.42/0.61
% 0.42/0.61 Model 8 [ 2 0 292 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.61
% 0.42/0.61 -----> EMPTY CLAUSE at 0.22 sec ----> 63 [hyper,50,24,58] {-} $F.
% 0.42/0.61
% 0.42/0.61 Length of proof is 8. Level of proof is 3.
% 0.42/0.61
% 0.42/0.61 ---------------- PROOF ----------------
% 0.42/0.61 % SZS status Theorem
% 0.42/0.61 % SZS output start Refutation
% 0.42/0.61
% 0.42/0.61 15 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.42/0.61 16 [] {+} -cUnsatisfiable(A)|cc($f1(A)).
% 0.42/0.61 17 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.42/0.61 18 [] {+} -cUnsatisfiable(A)|cd($f2(A)).
% 0.42/0.61 19 [] {+} -cUnsatisfiable(A)| -rr(A,B)| -rr(A,C)|B=C.
% 0.42/0.61 23 [] {+} -cc(A)|cdxcomp(A).
% 0.42/0.61 24 [] {+} -cd(A)| -ra_Px1(A,B).
% 0.42/0.61 25 [] {+} -cdxcomp(A)|ra_Px1(A,$f6(A)).
% 0.42/0.61 34 [] {-} cUnsatisfiable(i2003_11_14_17_22_27794).
% 0.42/0.61 36 [hyper,34,18] {+} cd($f2(i2003_11_14_17_22_27794)).
% 0.42/0.61 37 [hyper,34,17] {+} rr(i2003_11_14_17_22_27794,$f2(i2003_11_14_17_22_27794)).
% 0.42/0.61 38 [hyper,34,16] {+} cc($f1(i2003_11_14_17_22_27794)).
% 0.42/0.61 39 [hyper,34,15] {+} rr(i2003_11_14_17_22_27794,$f1(i2003_11_14_17_22_27794)).
% 0.42/0.61 43 [hyper,38,23] {+} cdxcomp($f1(i2003_11_14_17_22_27794)).
% 0.42/0.61 50 [hyper,43,25] {+} ra_Px1($f1(i2003_11_14_17_22_27794),$f6($f1(i2003_11_14_17_22_27794))).
% 0.42/0.61 54,53 [hyper,39,19,34,37] {-} $f2(i2003_11_14_17_22_27794)=$f1(i2003_11_14_17_22_27794).
% 0.42/0.61 58 [back_demod,36,demod,54] {-} cd($f1(i2003_11_14_17_22_27794)).
% 0.42/0.61 63 [hyper,50,24,58] {-} $F.
% 0.42/0.61
% 0.42/0.61 % SZS output end Refutation
% 0.42/0.61 ------------ end of proof -------------
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 Search stopped by max_proofs option.
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 Search stopped by max_proofs option.
% 0.42/0.61
% 0.42/0.61 ============ end of search ============
% 0.42/0.61
% 0.42/0.61 ----------- soft-scott stats ----------
% 0.42/0.61
% 0.42/0.61 true clauses given 5 (35.7%)
% 0.42/0.61 false clauses given 9
% 0.42/0.61
% 0.42/0.61 FALSE TRUE
% 0.42/0.61 7 0 2
% 0.42/0.61 8 0 1
% 0.42/0.61 11 0 8
% 0.42/0.61 12 0 6
% 0.42/0.61 13 0 1
% 0.42/0.61 14 0 1
% 0.42/0.61 18 0 1
% 0.42/0.61 tot: 0 20 (100.0% true)
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 Model 8 [ 2 0 292 ] (0.00 seconds, 250000 Inserts)
% 0.42/0.61
% 0.42/0.61 That finishes the proof of the theorem.
% 0.42/0.61
% 0.42/0.61 Process 26720 finished Tue Jun 7 09:05:05 2022
%------------------------------------------------------------------------------