%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 0.58s 0.83s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : KRS110+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 7 06:57:51 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n020.cluster.edu,
% 0.14/0.38 Tue Jun 7 06:57:52 2022
% 0.14/0.38 The command was "./sos". The process ID is 27541.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 formula_list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.14/0.38
% 0.14/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38 clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38 23 back subsumes 3.
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 52 back subsumes 4.
% 0.14/0.38 Following clause subsumed by 56 during input processing: 0 [copy,56,flip.1] {-} A=A.
% 0.14/0.38 56 back subsumes 51.
% 0.14/0.38 56 back subsumes 50.
% 0.14/0.38 56 back subsumes 49.
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.14/0.42
% 0.14/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.42
% 0.14/0.42 Stopped by limit on number of solutions
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 -------------- Softie stats --------------
% 0.14/0.42
% 0.14/0.42 UPDATE_STOP: 300
% 0.14/0.42 SFINDER_TIME_LIMIT: 2
% 0.14/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.42 number of clauses in intial UL: 46
% 0.14/0.42 number of clauses initially in problem: 51
% 0.14/0.42 percentage of clauses intially in UL: 90
% 0.14/0.42 percentage of distinct symbols occuring in initial UL: 86
% 0.14/0.42 percent of all initial clauses that are short: 100
% 0.14/0.42 absolute distinct symbol count: 22
% 0.14/0.42 distinct predicate count: 16
% 0.14/0.42 distinct function count: 5
% 0.14/0.42 distinct constant count: 1
% 0.14/0.42
% 0.14/0.42 ---------- no more Softie stats ----------
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.42
% 0.14/0.42 Stopped by limit on number of solutions
% 0.14/0.42
% 0.14/0.42 =========== start of search ===========
% 0.58/0.83
% 0.58/0.83 -------- PROOF --------
% 0.58/0.83 % SZS status Theorem
% 0.58/0.83 % SZS output start Refutation
% 0.58/0.83
% 0.58/0.83 Model 3 [ 1 1 323 ] (0.00 seconds, 574 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 4 [ 2 1 277 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 5 [ 3 0 368 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 6 [ 3 0 206 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 7 [ 4 0 354 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 8 [ 2 0 203 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 Stopped by limit on insertions
% 0.58/0.83
% 0.58/0.83 Model 9 [ 3 0 207 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 -----> EMPTY CLAUSE at 0.42 sec ----> 106 [hyper,90,30,64] {-} $F.
% 0.58/0.83
% 0.58/0.83 Length of proof is 5. Level of proof is 3.
% 0.58/0.83
% 0.58/0.83 ---------------- PROOF ----------------
% 0.58/0.83 % SZS status Theorem
% 0.58/0.83 % SZS output start Refutation
% 0.58/0.83
% 0.58/0.83 25 [] {+} -cUnsatisfiable(A)|rs(A,$f1(A)).
% 0.58/0.83 26 [] {+} -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 0.58/0.83 27 [] {+} -cUnsatisfiable(A)| -rs(A,B)|cpxcomp(B).
% 0.58/0.83 30 [] {+} -cp(A)| -ra_Px1(A,B).
% 0.58/0.83 31 [] {+} -cpxcomp(A)|ra_Px1(A,$f4(A)).
% 0.58/0.83 33 [] {+} -ca_Ax2(A)|cp(A).
% 0.58/0.83 55 [] {-} cUnsatisfiable(i2003_11_14_17_21_12565).
% 0.58/0.83 57 [hyper,55,26] {+} ca_Ax2($f1(i2003_11_14_17_21_12565)).
% 0.58/0.83 58 [hyper,55,25] {+} rs(i2003_11_14_17_21_12565,$f1(i2003_11_14_17_21_12565)).
% 0.58/0.83 64 [hyper,57,33] {+} cp($f1(i2003_11_14_17_21_12565)).
% 0.58/0.83 74 [hyper,58,27,55] {+} cpxcomp($f1(i2003_11_14_17_21_12565)).
% 0.58/0.83 90 [hyper,74,31] {+} ra_Px1($f1(i2003_11_14_17_21_12565),$f4($f1(i2003_11_14_17_21_12565))).
% 0.58/0.83 106 [hyper,90,30,64] {-} $F.
% 0.58/0.83
% 0.58/0.83 % SZS output end Refutation
% 0.58/0.83 ------------ end of proof -------------
% 0.58/0.83
% 0.58/0.83
% 0.58/0.83 Search stopped by max_proofs option.
% 0.58/0.83
% 0.58/0.83
% 0.58/0.83 Search stopped by max_proofs option.
% 0.58/0.83
% 0.58/0.83 ============ end of search ============
% 0.58/0.83
% 0.58/0.83 ----------- soft-scott stats ----------
% 0.58/0.83
% 0.58/0.83 true clauses given 1 (10.0%)
% 0.58/0.83 false clauses given 9
% 0.58/0.83
% 0.58/0.83 FALSE TRUE
% 0.58/0.83 4 0 3
% 0.58/0.83 6 2 0
% 0.58/0.83 8 3 0
% 0.58/0.83 9 12 6
% 0.58/0.83 10 0 18
% 0.58/0.83 tot: 17 27 (61.4% true)
% 0.58/0.83
% 0.58/0.83
% 0.58/0.83 Model 9 [ 3 0 207 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.83
% 0.58/0.83 That finishes the proof of the theorem.
% 0.58/0.83
% 0.58/0.83 Process 27541 finished Tue Jun 7 06:57:52 2022
%------------------------------------------------------------------------------