%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:47 EDT 2022
% Result : Unsatisfiable 1.03s 1.22s
% Output : Refutation 1.03s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.12 % Problem : KRS112+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n021.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:50:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n021.cluster.edu,
% 0.20/0.36 Tue Jun 7 09:50:21 2022
% 0.20/0.36 The command was "./sos". The process ID is 15650.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 formula_list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36 24 back subsumes 4.
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 55 back subsumes 39.
% 0.20/0.36 55 back subsumes 5.
% 0.20/0.36 Following clause subsumed by 59 during input processing: 0 [copy,59,flip.1] {-} A=A.
% 0.20/0.36 59 back subsumes 54.
% 0.20/0.36 59 back subsumes 53.
% 0.20/0.36 59 back subsumes 52.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 48
% 0.20/0.40 number of clauses initially in problem: 53
% 0.20/0.40 percentage of clauses intially in UL: 90
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 91
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 24
% 0.20/0.40 distinct predicate count: 17
% 0.20/0.40 distinct function count: 6
% 0.20/0.40 distinct constant count: 1
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 1.03/1.22
% 1.03/1.22 -------- PROOF --------
% 1.03/1.22 % SZS status Theorem
% 1.03/1.22 % SZS output start Refutation
% 1.03/1.22
% 1.03/1.22 Model 3 [ 1 1 428 ] (0.00 seconds, 28328 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 4 [ 2 1 278 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 5 [ 2 0 498 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 6 [ 2 1 509 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 7 [ 3 0 304 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 8 [ 3 0 427 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 9 [ 2 0 258 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 10 [ 3 0 434 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 11 [ 2 0 714 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 12 [ 3 0 596 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 13 [ 3 1 507 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 14 [ 4 0 8007 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 Stopped by limit on insertions
% 1.03/1.22
% 1.03/1.22 Model 15 [ 2 1 855 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 -----> EMPTY CLAUSE at 0.84 sec ----> 227 [hyper,190,31,90] {-} $F.
% 1.03/1.22
% 1.03/1.22 Length of proof is 15. Level of proof is 9.
% 1.03/1.22
% 1.03/1.22 ---------------- PROOF ----------------
% 1.03/1.22 % SZS status Theorem
% 1.03/1.22 % SZS output start Refutation
% 1.03/1.22
% 1.03/1.22 26 [] {+} -cUnsatisfiable(A)|rf1(A,$f1(A)).
% 1.03/1.22 27 [] {+} -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 1.03/1.22 28 [] {+} -cUnsatisfiable(A)|rf(A,$f2(A)).
% 1.03/1.22 29 [] {+} -cUnsatisfiable(A)|cp($f2(A)).
% 1.03/1.22 31 [] {+} -cp(A)| -ra_Px1(A,B).
% 1.03/1.22 32 [] {+} -cpxcomp(A)|ra_Px1(A,$f4(A)).
% 1.03/1.22 34 [] {+} -ca_Ax2(A)|cpxcomp(A).
% 1.03/1.22 35 [] {+} -ca_Ax2(A)| -rinvF1(A,B)|ca_Vx3(B).
% 1.03/1.22 38 [] {+} -ca_Vx3(A)|rs(A,$f6(A)).
% 1.03/1.22 41 [] {+} -rf(A,B)| -rf(A,C)|B=C.
% 1.03/1.22 42 [] {+} -rf1(A,B)| -rf1(A,C)|B=C.
% 1.03/1.22 46 [] {+} rinvF1(A,B)| -rf1(B,A).
% 1.03/1.22 50 [] {+} -rs(A,B)|rf(A,B).
% 1.03/1.22 51 [] {+} -rs(A,B)|rf1(A,B).
% 1.03/1.22 58 [] {-} cUnsatisfiable(i2003_11_14_17_21_19256).
% 1.03/1.22 60 [hyper,58,29] {+} cp($f2(i2003_11_14_17_21_19256)).
% 1.03/1.22 61 [hyper,58,28] {+} rf(i2003_11_14_17_21_19256,$f2(i2003_11_14_17_21_19256)).
% 1.03/1.22 62 [hyper,58,27] {+} ca_Ax2($f1(i2003_11_14_17_21_19256)).
% 1.03/1.22 63 [hyper,58,26] {+} rf1(i2003_11_14_17_21_19256,$f1(i2003_11_14_17_21_19256)).
% 1.03/1.22 67 [hyper,62,34] {+} cpxcomp($f1(i2003_11_14_17_21_19256)).
% 1.03/1.22 74 [hyper,63,46] {+} rinvF1($f1(i2003_11_14_17_21_19256),i2003_11_14_17_21_19256).
% 1.03/1.22 90 [hyper,67,32] {-} ra_Px1($f1(i2003_11_14_17_21_19256),$f4($f1(i2003_11_14_17_21_19256))).
% 1.03/1.22 97 [hyper,74,35,62] {+} ca_Vx3(i2003_11_14_17_21_19256).
% 1.03/1.22 107 [hyper,97,38] {+} rs(i2003_11_14_17_21_19256,$f6(i2003_11_14_17_21_19256)).
% 1.03/1.22 133 [hyper,107,51] {+} rf1(i2003_11_14_17_21_19256,$f6(i2003_11_14_17_21_19256)).
% 1.03/1.22 134 [hyper,107,50] {+} rf(i2003_11_14_17_21_19256,$f6(i2003_11_14_17_21_19256)).
% 1.03/1.22 153,152 [hyper,133,42,63,flip.1] {-} $f6(i2003_11_14_17_21_19256)=$f1(i2003_11_14_17_21_19256).
% 1.03/1.22 161 [back_demod,134,demod,153] {+} rf(i2003_11_14_17_21_19256,$f1(i2003_11_14_17_21_19256)).
% 1.03/1.22 174,173 [hyper,161,41,61] {+} $f2(i2003_11_14_17_21_19256)=$f1(i2003_11_14_17_21_19256).
% 1.03/1.22 190 [back_demod,60,demod,174] {+} cp($f1(i2003_11_14_17_21_19256)).
% 1.03/1.22 227 [hyper,190,31,90] {-} $F.
% 1.03/1.22
% 1.03/1.22 % SZS output end Refutation
% 1.03/1.22 ------------ end of proof -------------
% 1.03/1.22
% 1.03/1.22
% 1.03/1.22 Search stopped by max_proofs option.
% 1.03/1.22
% 1.03/1.22
% 1.03/1.22 Search stopped by max_proofs option.
% 1.03/1.22
% 1.03/1.22 ============ end of search ============
% 1.03/1.22
% 1.03/1.22 ----------- soft-scott stats ----------
% 1.03/1.22
% 1.03/1.22 true clauses given 5 (20.0%)
% 1.03/1.22 false clauses given 20
% 1.03/1.22
% 1.03/1.22 FALSE TRUE
% 1.03/1.22 4 0 10
% 1.03/1.22 5 0 2
% 1.03/1.22 6 0 4
% 1.03/1.22 7 0 2
% 1.03/1.22 8 0 3
% 1.03/1.22 9 6 14
% 1.03/1.22 10 0 78
% 1.03/1.22 11 0 3
% 1.03/1.22 12 1 19
% 1.03/1.22 14 0 9
% 1.03/1.22 15 0 6
% 1.03/1.22 tot: 7 150 (95.5% true)
% 1.03/1.22
% 1.03/1.22
% 1.03/1.22 Model 15 [ 2 1 855 ] (0.00 seconds, 250000 Inserts)
% 1.03/1.22
% 1.03/1.22 That finishes the proof of the theorem.
% 1.03/1.22
% 1.03/1.22 Process 15650 finished Tue Jun 7 09:50:22 2022
%------------------------------------------------------------------------------