TSTP Solution File: KRS071+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS071+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:41 EDT 2022
% Result : Unsatisfiable 0.54s 0.77s
% Output : Refutation 0.54s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS071+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/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 12:52:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n027.cluster.edu,
% 0.12/0.34 Tue Jun 7 12:52:10 2022
% 0.12/0.34 The command was "./sos". The process ID is 3278.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 formula_list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.34
% 0.12/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.34 clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34 15 back subsumes 2.
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 43 back subsumes 3.
% 0.12/0.34 Following clause subsumed by 46 during input processing: 0 [copy,46,flip.1] {-} A=A.
% 0.12/0.34 46 back subsumes 42.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 39
% 0.12/0.38 number of clauses initially in problem: 43
% 0.12/0.38 percentage of clauses intially in UL: 90
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 20
% 0.12/0.38 distinct predicate count: 13
% 0.12/0.38 distinct function count: 6
% 0.12/0.38 distinct constant count: 1
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.54/0.77
% 0.54/0.77 -------- PROOF --------
% 0.54/0.77 % SZS status Theorem
% 0.54/0.77 % SZS output start Refutation
% 0.54/0.77
% 0.54/0.77 Model 3 [ 1 0 485 ] (0.00 seconds, 723 Inserts)
% 0.54/0.77
% 0.54/0.77 Stopped by limit on insertions
% 0.54/0.77
% 0.54/0.77 Model 4 [ 2 1 285 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.77
% 0.54/0.77 Stopped by limit on insertions
% 0.54/0.77
% 0.54/0.77 Model 5 [ 3 0 246 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.77
% 0.54/0.77 Stopped by limit on insertions
% 0.54/0.77
% 0.54/0.77 Model 6 [ 2 0 382 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.77
% 0.54/0.77 Stopped by limit on insertions
% 0.54/0.77
% 0.54/0.77 Model 7 [ 2 1 95 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.77
% 0.54/0.77 Stopped by limit on insertions
% 0.54/0.77
% 0.54/0.77 Model 8 [ 3 0 457 ] (0.00 seconds, 250000 Inserts)
% 0.54/0.77
% 0.54/0.77 -----> EMPTY CLAUSE at 0.40 sec ----> 356 [hyper,353,31,51] {-} $F.
% 0.54/0.77
% 0.54/0.77 Length of proof is 12. Level of proof is 7.
% 0.54/0.77
% 0.54/0.77 ---------------- PROOF ----------------
% 0.54/0.77 % SZS status Theorem
% 0.54/0.77 % SZS output start Refutation
% 0.54/0.77
% 0.54/0.77 6 [] {+} A!=B| -cp3(A)|cp3(B).
% 0.54/0.77 17 [] {+} -cUnsatisfiable(A)|rr(A,$f1(A)).
% 0.54/0.77 18 [] {+} -cUnsatisfiable(A)|cp1($f1(A)).
% 0.54/0.77 19 [] {+} -cUnsatisfiable(A)|rr(A,$f2(A)).
% 0.54/0.77 20 [] {+} -cUnsatisfiable(A)|cp2($f2(A)).
% 0.54/0.77 21 [] {+} -cUnsatisfiable(A)|rr(A,$f3(A)).
% 0.54/0.77 22 [] {+} -cUnsatisfiable(A)|cp3($f3(A)).
% 0.54/0.77 23 [] {+} -cUnsatisfiable(A)| -rr(A,B)| -rr(A,C)| -rr(A,D)|B=C|B=D|C=D.
% 0.54/0.77 31 [] {+} -cp1(A)| -cp2(A).
% 0.54/0.77 32 [] {+} -cp1(A)| -cp3(A).
% 0.54/0.77 35 [] {+} -cp2(A)| -cp3(A).
% 0.54/0.77 45 [] {-} cUnsatisfiable(i2003_11_14_17_18_39380).
% 0.54/0.77 47 [hyper,45,22] {+} cp3($f3(i2003_11_14_17_18_39380)).
% 0.54/0.77 48 [hyper,45,21] {+} rr(i2003_11_14_17_18_39380,$f3(i2003_11_14_17_18_39380)).
% 0.54/0.77 49 [hyper,45,20] {+} cp2($f2(i2003_11_14_17_18_39380)).
% 0.54/0.77 50 [hyper,45,19] {+} rr(i2003_11_14_17_18_39380,$f2(i2003_11_14_17_18_39380)).
% 0.54/0.77 51 [hyper,45,18] {+} cp1($f1(i2003_11_14_17_18_39380)).
% 0.54/0.77 52 [hyper,45,17] {+} rr(i2003_11_14_17_18_39380,$f1(i2003_11_14_17_18_39380)).
% 0.54/0.77 95 [hyper,52,23,45,50,48,flip.1] {+} $f3(i2003_11_14_17_18_39380)=$f2(i2003_11_14_17_18_39380)|$f2(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380)|$f3(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380).
% 0.54/0.77 202 [hyper,95,6,47] {+} $f3(i2003_11_14_17_18_39380)=$f2(i2003_11_14_17_18_39380)|$f2(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380)|cp3($f1(i2003_11_14_17_18_39380)).
% 0.54/0.77 303 [hyper,202,32,51] {+} $f3(i2003_11_14_17_18_39380)=$f2(i2003_11_14_17_18_39380)|$f2(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380).
% 0.54/0.77 305 [hyper,303,6,47] {+} $f2(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380)|cp3($f2(i2003_11_14_17_18_39380)).
% 0.54/0.77 336,335 [hyper,305,35,49] {-} $f2(i2003_11_14_17_18_39380)=$f1(i2003_11_14_17_18_39380).
% 0.54/0.77 353 [back_demod,49,demod,336] {-} cp2($f1(i2003_11_14_17_18_39380)).
% 0.54/0.77 356 [hyper,353,31,51] {-} $F.
% 0.54/0.77
% 0.54/0.77 % SZS output end Refutation
% 0.54/0.77 ------------ end of proof -------------
% 0.54/0.77
% 0.54/0.77
% 0.54/0.77 Search stopped by max_proofs option.
% 0.54/0.77
% 300.04/300.21 Wow, sos-wrapper got a signal XCPU
%------------------------------------------------------------------------------