%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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.60s 0.80s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : KRS078+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n027.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 13:59:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox2 on n027.cluster.edu,
% 0.19/0.35 Tue Jun 7 13:59:25 2022
% 0.19/0.35 The command was "./sos". The process ID is 11479.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 formula_list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.19/0.35
% 0.19/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.35 clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: set(unit_deletion).
% 0.19/0.35 dependent: set(factor).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35 14 back subsumes 2.
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 32 back subsumes 3.
% 0.19/0.35 Following clause subsumed by 35 during input processing: 0 [copy,35,flip.1] {-} A=A.
% 0.19/0.35 35 back subsumes 31.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 28
% 0.19/0.38 number of clauses initially in problem: 32
% 0.19/0.38 percentage of clauses intially in UL: 87
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 88
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 18
% 0.19/0.38 distinct predicate count: 11
% 0.19/0.38 distinct function count: 6
% 0.19/0.38 distinct constant count: 1
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.60/0.80
% 0.60/0.80 -------- PROOF --------
% 0.60/0.80 % SZS status Theorem
% 0.60/0.80 % SZS output start Refutation
% 0.60/0.80
% 0.60/0.80 Stopped by limit on insertions
% 0.60/0.80
% 0.60/0.80 Stopped by limit on insertions
% 0.60/0.80
% 0.60/0.80 Model 2 [ 1 0 1242 ] (0.00 seconds, 2890 Inserts)
% 0.60/0.80
% 0.60/0.80 Stopped by limit on insertions
% 0.60/0.80
% 0.60/0.80 Model 3 [ 1 1 912 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.80
% 0.60/0.80 -----> EMPTY CLAUSE at 0.42 sec ----> 69 [hyper,59,22,34] {-} $F.
% 0.60/0.80
% 0.60/0.80 Length of proof is 7. Level of proof is 5.
% 0.60/0.80
% 0.60/0.80 ---------------- PROOF ----------------
% 0.60/0.80 % SZS status Theorem
% 0.60/0.80 % SZS output start Refutation
% 0.60/0.80
% 0.60/0.80 16 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.60/0.80 17 [] {+} -cUnsatisfiable(A)|rinvR($f2(A),$f1(A)).
% 0.60/0.80 18 [] {+} -cUnsatisfiable(A)| -rs($f1(A),B)|cp(B).
% 0.60/0.80 19 [] {+} -cUnsatisfiable(A)| -rinvR($f2(A),B)| -rinvR($f2(A),C)|B=C.
% 0.60/0.80 20 [] {+} -cUnsatisfiable(A)|rs(A,$f3(A)).
% 0.60/0.80 22 [] {+} -cUnsatisfiable(A)| -cp($f3(A)).
% 0.60/0.80 30 [] {+} rinvR(A,B)| -rr(B,A).
% 0.60/0.80 34 [] {-} cUnsatisfiable(i2003_11_14_17_19_13721).
% 0.60/0.80 36 [hyper,34,20] {+} rs(i2003_11_14_17_19_13721,$f3(i2003_11_14_17_19_13721)).
% 0.60/0.80 37 [hyper,34,17] {+} rinvR($f2(i2003_11_14_17_19_13721),$f1(i2003_11_14_17_19_13721)).
% 0.60/0.80 38 [hyper,34,16] {+} rr(i2003_11_14_17_19_13721,$f2(i2003_11_14_17_19_13721)).
% 0.60/0.80 48 [hyper,38,30] {+} rinvR($f2(i2003_11_14_17_19_13721),i2003_11_14_17_19_13721).
% 0.60/0.80 52 [hyper,48,19,34,37] {+} $f1(i2003_11_14_17_19_13721)=i2003_11_14_17_19_13721.
% 0.60/0.80 58 [para_from,52.1.1,18.2.1,unit_del,34] {-} -rs(i2003_11_14_17_19_13721,A)|cp(A).
% 0.60/0.80 59 [hyper,58,36] {+} cp($f3(i2003_11_14_17_19_13721)).
% 0.60/0.80 69 [hyper,59,22,34] {-} $F.
% 0.60/0.80
% 0.60/0.80 % SZS output end Refutation
% 0.60/0.80 ------------ end of proof -------------
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 Search stopped by max_proofs option.
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 Search stopped by max_proofs option.
% 0.60/0.80
% 0.60/0.80 ============ end of search ============
% 0.60/0.80
% 0.60/0.80 ----------- soft-scott stats ----------
% 0.60/0.80
% 0.60/0.80 true clauses given 8 (66.7%)
% 0.60/0.80 false clauses given 4
% 0.60/0.80
% 0.60/0.80 FALSE TRUE
% 0.60/0.80 5 0 1
% 0.60/0.80 7 0 2
% 0.60/0.80 9 0 1
% 0.60/0.80 14 0 10
% 0.60/0.80 15 0 5
% 0.60/0.80 16 0 2
% 0.60/0.80 17 0 1
% 0.60/0.80 20 0 2
% 0.60/0.80 22 0 3
% 0.60/0.80 tot: 0 27 (100.0% true)
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 Model 3 [ 1 1 912 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.80
% 0.60/0.80 That finishes the proof of the theorem.
% 0.60/0.80
% 0.60/0.80 Process 11479 finished Tue Jun 7 13:59:26 2022
%------------------------------------------------------------------------------