TSTP Solution File: KRS082+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:43 EDT 2022
% Result : Unsatisfiable 2.04s 2.22s
% Output : Refutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS082+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 7 18:38:16 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n026.cluster.edu,
% 0.13/0.37 Tue Jun 7 18:38:16 2022
% 0.13/0.37 The command was "./sos". The process ID is 9430.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 0.13/0.37
% 0.13/0.37 This is a non-Horn set without equality. The strategy
% 0.13/0.37 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 23 back subsumes 13.
% 0.13/0.37 23 back subsumes 10.
% 0.13/0.37 23 back subsumes 8.
% 0.13/0.37 23 back subsumes 5.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.43
% 0.20/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 -------------- Softie stats --------------
% 0.20/0.43
% 0.20/0.43 UPDATE_STOP: 300
% 0.20/0.43 SFINDER_TIME_LIMIT: 2
% 0.20/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.43 number of clauses in intial UL: 18
% 0.20/0.43 number of clauses initially in problem: 25
% 0.20/0.43 percentage of clauses intially in UL: 72
% 0.20/0.43 percentage of distinct symbols occuring in initial UL: 77
% 0.20/0.43 percent of all initial clauses that are short: 100
% 0.20/0.43 absolute distinct symbol count: 22
% 0.20/0.43 distinct predicate count: 13
% 0.20/0.43 distinct function count: 8
% 0.20/0.43 distinct constant count: 1
% 0.20/0.43
% 0.20/0.43 ---------- no more Softie stats ----------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 Stopped by limit on number of solutions
% 0.20/0.43
% 0.20/0.43 =========== start of search ===========
% 2.04/2.22
% 2.04/2.22 -------- PROOF --------
% 2.04/2.22 % SZS status Theorem
% 2.04/2.22 % SZS output start Refutation
% 2.04/2.22
% 2.04/2.22 Model 3 [ 1 1 11602 ] (0.00 seconds, 105872 Inserts)
% 2.04/2.22
% 2.04/2.22 Model 4 [ 1 2 10826 ] (0.00 seconds, 208574 Inserts)
% 2.04/2.22
% 2.04/2.22 Model 5 [ 1 1 8379 ] (0.00 seconds, 29926 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 6 [ 2 1 7719 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 7 [ 1 1 7167 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 8 [ 2 0 318 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 9 [ 5 1 10144 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 10 [ 2 1 13839 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 11 [ 2 11 130681 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 12 [ 3 1 5097 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 13 [ 8 1 16316 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 14 [ 5 1 13964 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 Model 15 [ 4 21 196725 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 Stopped by limit on insertions
% 2.04/2.22
% 2.04/2.22 -----> EMPTY CLAUSE at 1.83 sec ----> 47 [hyper,42,15,43,37,34,30] {-} $F.
% 2.04/2.22
% 2.04/2.22 Length of proof is 8. Level of proof is 3.
% 2.04/2.22
% 2.04/2.22 ---------------- PROOF ----------------
% 2.04/2.22 % SZS status Theorem
% 2.04/2.22 % SZS output start Refutation
% 2.04/2.22
% 2.04/2.22 3 [] {+} -cUnsatisfiable(A)|rs(A,$f5(A)).
% 2.04/2.22 4 [] {+} -cUnsatisfiable(A)|rp($f5(A),$f1(A)).
% 2.04/2.22 7 [] {+} -cUnsatisfiable(A)| -rp($f5(A),B)|rr(B,$f2(A,B)).
% 2.04/2.22 11 [] {+} -cUnsatisfiable(A)| -rp($f5(A),B)| -rr(B,C)|cc(C).
% 2.04/2.22 14 [] {+} -cUnsatisfiable(A)|ca(A).
% 2.04/2.22 15 [] {+} -cc(A)| -rinvR(A,B)| -rinvP(B,C)| -rinvS(C,D)| -ca(D).
% 2.04/2.22 17 [] {+} rinvP(A,B)| -rp(B,A).
% 2.04/2.22 19 [] {+} rinvR(A,B)| -rr(B,A).
% 2.04/2.22 21 [] {+} rinvS(A,B)| -rs(B,A).
% 2.04/2.22 29 [] {-} cUnsatisfiable(i2003_11_14_17_19_28752).
% 2.04/2.22 30 [hyper,29,14] {+} ca(i2003_11_14_17_19_28752).
% 2.04/2.22 32 [hyper,29,4] {+} rp($f5(i2003_11_14_17_19_28752),$f1(i2003_11_14_17_19_28752)).
% 2.04/2.22 33 [hyper,29,3] {+} rs(i2003_11_14_17_19_28752,$f5(i2003_11_14_17_19_28752)).
% 2.04/2.22 34 [hyper,33,21] {+} rinvS($f5(i2003_11_14_17_19_28752),i2003_11_14_17_19_28752).
% 2.04/2.22 37 [hyper,32,17] {+} rinvP($f1(i2003_11_14_17_19_28752),$f5(i2003_11_14_17_19_28752)).
% 2.04/2.22 39 [hyper,32,7,29] {+} rr($f1(i2003_11_14_17_19_28752),$f2(i2003_11_14_17_19_28752,$f1(i2003_11_14_17_19_28752))).
% 2.04/2.22 42 [hyper,39,19] {+} rinvR($f2(i2003_11_14_17_19_28752,$f1(i2003_11_14_17_19_28752)),$f1(i2003_11_14_17_19_28752)).
% 2.04/2.22 43 [hyper,39,11,29,32] {-} cc($f2(i2003_11_14_17_19_28752,$f1(i2003_11_14_17_19_28752))).
% 2.04/2.22 47 [hyper,42,15,43,37,34,30] {-} $F.
% 2.04/2.22
% 2.04/2.22 % SZS output end Refutation
% 2.04/2.22 ------------ end of proof -------------
% 2.04/2.22
% 2.04/2.22
% 2.04/2.22 Search stopped by max_proofs option.
% 2.04/2.22
% 2.04/2.22
% 2.04/2.22 Search stopped by max_proofs option.
% 2.04/2.22
% 2.04/2.22 ============ end of search ============
% 2.04/2.22
% 2.04/2.22 ----------- soft-scott stats ----------
% 2.04/2.22
% 2.04/2.22 true clauses given 5 (23.8%)
% 2.04/2.22 false clauses given 16
% 2.04/2.22
% 2.04/2.22 FALSE TRUE
% 2.04/2.22 7 0 1
% 2.04/2.22 11 0 2
% 2.04/2.22 tot: 0 3 (100.0% true)
% 2.04/2.22
% 2.04/2.22
% 2.04/2.22 Model 15 [ 4 -2 196725 ] (0.00 seconds, 250000 Inserts)
% 2.04/2.22
% 2.04/2.22 That finishes the proof of the theorem.
% 2.04/2.22
% 2.04/2.22 Process 9430 finished Tue Jun 7 18:38:18 2022
%------------------------------------------------------------------------------