TSTP Solution File: KRS087+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:43 EDT 2022
% Result : Unsatisfiable 0.47s 0.66s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.11 % Command : sos-script %s
% 0.11/0.32 % Computer : n026.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Tue Jun 7 05:40:31 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n026.cluster.edu,
% 0.11/0.34 Tue Jun 7 05:40:31 2022
% 0.11/0.34 The command was "./sos". The process ID is 31431.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 formula_list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34 15 back subsumes 2.
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 35 back subsumes 3.
% 0.11/0.34 Following clause subsumed by 38 during input processing: 0 [copy,38,flip.1] {-} A=A.
% 0.11/0.34 38 back subsumes 34.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.18/0.36
% 0.18/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.36
% 0.18/0.36 Stopped by limit on number of solutions
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 -------------- Softie stats --------------
% 0.18/0.36
% 0.18/0.36 UPDATE_STOP: 300
% 0.18/0.36 SFINDER_TIME_LIMIT: 2
% 0.18/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.36 number of clauses in intial UL: 31
% 0.18/0.36 number of clauses initially in problem: 35
% 0.18/0.36 percentage of clauses intially in UL: 88
% 0.18/0.36 percentage of distinct symbols occuring in initial UL: 86
% 0.18/0.36 percent of all initial clauses that are short: 100
% 0.18/0.36 absolute distinct symbol count: 15
% 0.18/0.36 distinct predicate count: 11
% 0.18/0.36 distinct function count: 3
% 0.18/0.36 distinct constant count: 1
% 0.18/0.36
% 0.18/0.36 ---------- no more Softie stats ----------
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36
% 0.18/0.36 =========== start of search ===========
% 0.47/0.66
% 0.47/0.66 -------- PROOF --------
% 0.47/0.66 % SZS status Theorem
% 0.47/0.66 % SZS output start Refutation
% 0.47/0.66
% 0.47/0.66 Model 2 [ 1 1 532 ] (0.00 seconds, 94298 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 3 [ 1 0 531 ] (0.00 seconds, 2603 Inserts)
% 0.47/0.66
% 0.47/0.66 Stopped by limit on insertions
% 0.47/0.66
% 0.47/0.66 Model 4 [ 2 1 624 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 5 [ 1 0 474 ] (0.00 seconds, 2722 Inserts)
% 0.47/0.66
% 0.47/0.66 Model 6 [ 1 4 47451 ] (0.00 seconds, 47642 Inserts)
% 0.47/0.66
% 0.47/0.66 Stopped by limit on insertions
% 0.47/0.66
% 0.47/0.66 Model 7 [ 3 0 280 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.66
% 0.47/0.66 -----> EMPTY CLAUSE at 0.30 sec ----> 74 [hyper,70,20,37,42] {-} $F.
% 0.47/0.66
% 0.47/0.66 Length of proof is 5. Level of proof is 3.
% 0.47/0.66
% 0.47/0.66 ---------------- PROOF ----------------
% 0.47/0.66 % SZS status Theorem
% 0.47/0.66 % SZS output start Refutation
% 0.47/0.66
% 0.47/0.66 17 [] {+} -cUnsatisfiable(A)|cp1(A).
% 0.47/0.66 18 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.47/0.66 19 [] {+} -cUnsatisfiable(A)|rr($f2(A),$f1(A)).
% 0.47/0.66 20 [] {+} -cUnsatisfiable(A)| -rinvR($f1(A),B)| -cp1(B).
% 0.47/0.66 28 [] {+} rinvR(A,B)| -rr(B,A).
% 0.47/0.66 29 [] {+} -rr(A,B)| -rr(B,C)|rr(A,C).
% 0.47/0.66 37 [] {-} cUnsatisfiable(i2003_11_14_17_19_46763).
% 0.47/0.66 40 [hyper,37,19] {+} rr($f2(i2003_11_14_17_19_46763),$f1(i2003_11_14_17_19_46763)).
% 0.47/0.66 41 [hyper,37,18] {+} rr(i2003_11_14_17_19_46763,$f2(i2003_11_14_17_19_46763)).
% 0.47/0.66 42 [hyper,37,17] {+} cp1(i2003_11_14_17_19_46763).
% 0.47/0.66 55 [hyper,40,29,41] {+} rr(i2003_11_14_17_19_46763,$f1(i2003_11_14_17_19_46763)).
% 0.47/0.66 70 [hyper,55,28] {+} rinvR($f1(i2003_11_14_17_19_46763),i2003_11_14_17_19_46763).
% 0.47/0.66 74 [hyper,70,20,37,42] {-} $F.
% 0.47/0.66
% 0.47/0.66 % SZS output end Refutation
% 0.47/0.66 ------------ end of proof -------------
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Search stopped by max_proofs option.
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Search stopped by max_proofs option.
% 0.47/0.66
% 0.47/0.66 ============ end of search ============
% 0.47/0.66
% 0.47/0.66 ----------- soft-scott stats ----------
% 0.47/0.66
% 0.47/0.66 true clauses given 6 (46.2%)
% 0.47/0.66 false clauses given 7
% 0.47/0.66
% 0.47/0.66 FALSE TRUE
% 0.47/0.66 5 0 1
% 0.47/0.66 8 0 1
% 0.47/0.66 9 0 2
% 0.47/0.66 10 0 9
% 0.47/0.66 11 0 5
% 0.47/0.66 13 0 3
% 0.47/0.66 14 0 2
% 0.47/0.66 16 0 3
% 0.47/0.66 tot: 0 26 (100.0% true)
% 0.47/0.66
% 0.47/0.66
% 0.47/0.66 Model 7 [ 3 0 280 ] (0.00 seconds, 250000 Inserts)
% 0.47/0.66
% 0.47/0.66 That finishes the proof of the theorem.
% 0.47/0.66
% 0.47/0.66 Process 31431 finished Tue Jun 7 05:40:31 2022
%------------------------------------------------------------------------------