%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n019.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:46 EDT 2022
% Result : Unsatisfiable 0.15s 0.51s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS101+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.11/0.31 % Computer : n019.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Tue Jun 7 20:46:55 EDT 2022
% 0.15/0.31 % CPUTime :
% 0.15/0.33 ----- Otter 3.2, August 2001 -----
% 0.15/0.33 The process was started by sandbox2 on n019.cluster.edu,
% 0.15/0.33 Tue Jun 7 20:46:55 2022
% 0.15/0.33 The command was "./sos". The process ID is 28868.
% 0.15/0.33
% 0.15/0.33 set(prolog_style_variables).
% 0.15/0.33 set(auto).
% 0.15/0.33 dependent: set(auto1).
% 0.15/0.33 dependent: set(process_input).
% 0.15/0.33 dependent: clear(print_kept).
% 0.15/0.33 dependent: clear(print_new_demod).
% 0.15/0.33 dependent: clear(print_back_demod).
% 0.15/0.33 dependent: clear(print_back_sub).
% 0.15/0.33 dependent: set(control_memory).
% 0.15/0.33 dependent: assign(max_mem, 12000).
% 0.15/0.33 dependent: assign(pick_given_ratio, 4).
% 0.15/0.33 dependent: assign(stats_level, 1).
% 0.15/0.33 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.33 dependent: assign(sos_limit, 5000).
% 0.15/0.33 dependent: assign(max_weight, 60).
% 0.15/0.33 clear(print_given).
% 0.15/0.33
% 0.15/0.33 formula_list(usable).
% 0.15/0.33
% 0.15/0.33 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.15/0.33
% 0.15/0.33 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.33 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.33 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.33 clauses in usable.
% 0.15/0.33
% 0.15/0.33 dependent: set(knuth_bendix).
% 0.15/0.33 dependent: set(para_from).
% 0.15/0.33 dependent: set(para_into).
% 0.15/0.33 dependent: clear(para_from_right).
% 0.15/0.33 dependent: clear(para_into_right).
% 0.15/0.33 dependent: set(para_from_vars).
% 0.15/0.33 dependent: set(eq_units_both_ways).
% 0.15/0.33 dependent: set(dynamic_demod_all).
% 0.15/0.33 dependent: set(dynamic_demod).
% 0.15/0.33 dependent: set(order_eq).
% 0.15/0.33 dependent: set(back_demod).
% 0.15/0.33 dependent: set(lrpo).
% 0.15/0.33 dependent: set(hyper_res).
% 0.15/0.33 dependent: set(unit_deletion).
% 0.15/0.33 dependent: set(factor).
% 0.15/0.33
% 0.15/0.33 ------------> process usable:
% 0.15/0.33 12 back subsumes 4.
% 0.15/0.33
% 0.15/0.33 ------------> process sos:
% 0.15/0.33 42 back subsumes 5.
% 0.15/0.33 Following clause subsumed by 45 during input processing: 0 [copy,45,flip.1] {-} A=A.
% 0.15/0.33 45 back subsumes 41.
% 0.15/0.33 45 back subsumes 40.
% 0.15/0.33 45 back subsumes 39.
% 0.15/0.33 45 back subsumes 38.
% 0.15/0.33 45 back subsumes 37.
% 0.15/0.33 45 back subsumes 36.
% 0.15/0.33 45 back subsumes 35.
% 0.15/0.33 45 back subsumes 34.
% 0.15/0.33 45 back subsumes 33.
% 0.15/0.33 45 back subsumes 32.
% 0.15/0.33 45 back subsumes 31.
% 0.15/0.33
% 0.15/0.33 ======= end of input processing =======
% 0.15/0.36
% 0.15/0.36 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.36
% 0.15/0.36 Stopped by limit on number of solutions
% 0.15/0.36
% 0.15/0.36
% 0.15/0.36 -------------- Softie stats --------------
% 0.15/0.36
% 0.15/0.36 UPDATE_STOP: 300
% 0.15/0.36 SFINDER_TIME_LIMIT: 2
% 0.15/0.36 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.36 number of clauses in intial UL: 28
% 0.15/0.36 number of clauses initially in problem: 32
% 0.15/0.36 percentage of clauses intially in UL: 87
% 0.15/0.36 percentage of distinct symbols occuring in initial UL: 88
% 0.15/0.36 percent of all initial clauses that are short: 100
% 0.15/0.36 absolute distinct symbol count: 18
% 0.15/0.36 distinct predicate count: 10
% 0.15/0.36 distinct function count: 7
% 0.15/0.36 distinct constant count: 1
% 0.15/0.36
% 0.15/0.36 ---------- no more Softie stats ----------
% 0.15/0.36
% 0.15/0.36
% 0.15/0.36
% 0.15/0.36 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.36
% 0.15/0.36 Stopped by limit on number of solutions
% 0.15/0.36
% 0.15/0.36 =========== start of search ===========
% 0.15/0.51
% 0.15/0.51 -------- PROOF --------
% 0.15/0.51 % SZS status Theorem
% 0.15/0.51 % SZS output start Refutation
% 0.15/0.51
% 0.15/0.51 Model 3 [ 1 0 738 ] (0.00 seconds, 1373 Inserts)
% 0.15/0.51
% 0.15/0.51 Model 4 [ 1 1 1056 ] (0.00 seconds, 1542 Inserts)
% 0.15/0.51
% 0.15/0.51 Model 5 [ 1 0 500 ] (0.00 seconds, 1328 Inserts)
% 0.15/0.51
% 0.15/0.51 Model 6 [ 1 0 512 ] (0.00 seconds, 1325 Inserts)
% 0.15/0.51
% 0.15/0.51 Stopped by limit on insertions
% 0.15/0.51
% 0.15/0.51 Model 7 [ 2 1 618 ] (0.00 seconds, 250000 Inserts)
% 0.15/0.51
% 0.15/0.51 -----> EMPTY CLAUSE at 0.16 sec ----> 218 [hyper,217,30,70] {-} $F.
% 0.15/0.51
% 0.15/0.51 Length of proof is 6. Level of proof is 3.
% 0.15/0.51
% 0.15/0.51 ---------------- PROOF ----------------
% 0.15/0.51 % SZS status Theorem
% 0.15/0.51 % SZS output start Refutation
% 0.15/0.51
% 0.15/0.51 14 [] {+} -cUnsatisfiable(A)| -rr(A,B)|cd(B).
% 0.15/0.51 15 [] {+} -cUnsatisfiable(A)| -rr(A,B)| -rs(B,C)| -rs(B,D)|C=D|cc(B).
% 0.15/0.51 16 [] {+} -cUnsatisfiable(A)|rr(A,$f3(A)).
% 0.15/0.51 17 [] {+} -cUnsatisfiable(A)|rs($f3(A),$f2(A)).
% 0.15/0.51 18 [] {+} -cUnsatisfiable(A)|rs($f3(A),$f1(A)).
% 0.15/0.51 19 [] {+} -cUnsatisfiable(A)|$f2(A)!=$f1(A).
% 0.15/0.51 30 [] {+} -cc(A)| -cd(A).
% 0.15/0.51 44 [] {-} cUnsatisfiable(i2003_11_14_17_20_36582).
% 0.15/0.51 45 [] {+} A=A.
% 0.15/0.51 46 [hyper,44,18] {+} rs($f3(i2003_11_14_17_20_36582),$f1(i2003_11_14_17_20_36582)).
% 0.15/0.51 47 [hyper,44,17] {+} rs($f3(i2003_11_14_17_20_36582),$f2(i2003_11_14_17_20_36582)).
% 0.15/0.51 48 [hyper,44,16] {+} rr(i2003_11_14_17_20_36582,$f3(i2003_11_14_17_20_36582)).
% 0.15/0.51 70 [hyper,48,14,44] {+} cd($f3(i2003_11_14_17_20_36582)).
% 0.15/0.51 148 [hyper,47,15,44,48,46,flip.1] {+} $f2(i2003_11_14_17_20_36582)=$f1(i2003_11_14_17_20_36582)|cc($f3(i2003_11_14_17_20_36582)).
% 0.15/0.51 217 [para_from,148.1.1,19.2.1,unit_del,44,45] {-} cc($f3(i2003_11_14_17_20_36582)).
% 0.15/0.51 218 [hyper,217,30,70] {-} $F.
% 0.15/0.51
% 0.15/0.51 % SZS output end Refutation
% 0.15/0.51 ------------ end of proof -------------
% 0.15/0.51
% 0.15/0.51
% 0.15/0.51 Search stopped by max_proofs option.
% 0.15/0.51
% 0.15/0.51
% 0.15/0.51 Search stopped by max_proofs option.
% 0.15/0.51
% 0.15/0.51 ============ end of search ============
% 0.15/0.51
% 0.15/0.51 ----------- soft-scott stats ----------
% 0.15/0.51
% 0.15/0.51 true clauses given 3 (30.0%)
% 0.15/0.51 false clauses given 7
% 0.15/0.51
% 0.15/0.51 FALSE TRUE
% 0.15/0.51 5 0 1
% 0.15/0.51 7 0 2
% 0.15/0.51 13 0 1
% 0.15/0.51 15 0 1
% 0.15/0.51 16 0 2
% 0.15/0.51 17 0 5
% 0.15/0.51 18 0 12
% 0.15/0.51 19 0 9
% 0.15/0.51 20 0 10
% 0.15/0.51 21 0 11
% 0.15/0.51 22 0 25
% 0.15/0.51 23 0 34
% 0.15/0.51 24 0 41
% 0.15/0.51 25 0 24
% 0.15/0.51 tot: 0 178 (100.0% true)
% 0.15/0.51
% 0.15/0.51
% 0.15/0.51 Model 7 [ 2 1 618 ] (0.00 seconds, 250000 Inserts)
% 0.15/0.51
% 0.15/0.51 That finishes the proof of the theorem.
% 0.15/0.51
% 0.15/0.51 Process 28868 finished Tue Jun 7 20:46:55 2022
%------------------------------------------------------------------------------