TSTP Solution File: KRS116+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : KRS116+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:48 EDT 2022
% Result : Unsatisfiable 0.79s 1.00s
% Output : Refutation 0.79s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : KRS116+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n029.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 17:44:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox2 on n029.cluster.edu,
% 0.20/0.36 Tue Jun 7 17:44:05 2022
% 0.20/0.36 The command was "./sos". The process ID is 17181.
% 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=0, symmetry=0, max_lits=9.
% 0.20/0.36
% 0.20/0.36 This is a non-Horn set without equality. The strategy
% 0.20/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 70 back subsumes 39.
% 0.20/0.36 70 back subsumes 36.
% 0.20/0.36 70 back subsumes 17.
% 0.20/0.36 70 back subsumes 15.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 65
% 0.20/0.41 number of clauses initially in problem: 73
% 0.20/0.41 percentage of clauses intially in UL: 89
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 94
% 0.20/0.41 percent of all initial clauses that are short: 98
% 0.20/0.41 absolute distinct symbol count: 37
% 0.20/0.41 distinct predicate count: 21
% 0.20/0.41 distinct function count: 15
% 0.20/0.41 distinct constant count: 1
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.79/1.00
% 0.79/1.00 -------- PROOF --------
% 0.79/1.00 % SZS status Theorem
% 0.79/1.00 % SZS output start Refutation
% 0.79/1.00
% 0.79/1.00 Model 3 [ 1 1 1083 ] (0.00 seconds, 2187 Inserts)
% 0.79/1.00
% 0.79/1.00 Model 4 [ 1 1 1247 ] (0.00 seconds, 8140 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 5 [ 5 1 902 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 6 [ 3 0 1104 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 7 [ 3 1 1031 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 8 [ 5 0 977 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Stopped by limit on insertions
% 0.79/1.00
% 0.79/1.00 Model 9 [ 3 1 1813 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 -----> EMPTY CLAUSE at 0.62 sec ----> 192 [hyper,188,6,80] {-} $F.
% 0.79/1.00
% 0.79/1.00 Length of proof is 15. Level of proof is 9.
% 0.79/1.00
% 0.79/1.00 ---------------- PROOF ----------------
% 0.79/1.00 % SZS status Theorem
% 0.79/1.00 % SZS output start Refutation
% 0.79/1.00
% 0.79/1.00 3 [] {+} -cUnsatisfiable(A)|ca(A).
% 0.79/1.00 4 [] {+} -cUnsatisfiable(A)|rs(A,$f1(A)).
% 0.79/1.00 5 [] {+} -cUnsatisfiable(A)|ca_Ax2($f1(A)).
% 0.79/1.00 6 [] {+} -ca(A)| -ra_Px1(A,B).
% 0.79/1.00 7 [] {+} -caxcomp(A)|ra_Px1(A,$f3(A)).
% 0.79/1.00 9 [] {+} -cc(A)| -rinvR(A,B)|ca_Vx7(B).
% 0.79/1.00 11 [] {+} -ca_Ax2(A)| -rp(A,B)|ca_Vx3(B).
% 0.79/1.00 12 [] {+} -ca_Ax2(A)| -rp(A,B)|ca_Vx5(B).
% 0.79/1.00 16 [] {+} -ca_Ax2(A)|rp(A,$f6(A)).
% 0.79/1.00 35 [] {+} -ca_Vx3(A)|rr(A,$f11(A)).
% 0.79/1.00 41 [] {+} -ca_Vx5(A)| -rr(A,B)|cc(B).
% 0.79/1.00 43 [] {+} -ca_Vx6(A)| -rinvS(A,B)|caxcomp(B).
% 0.79/1.00 45 [] {+} -ca_Vx7(A)| -rinvP(A,B)|ca_Vx6(B).
% 0.79/1.00 48 [] {+} rinvP(A,B)| -rp(B,A).
% 0.79/1.00 50 [] {+} rinvR(A,B)| -rr(B,A).
% 0.79/1.00 52 [] {+} rinvS(A,B)| -rs(B,A).
% 0.79/1.00 77 [] {-} cUnsatisfiable(i2003_11_14_17_21_33997).
% 0.79/1.00 78 [hyper,77,5] {+} ca_Ax2($f1(i2003_11_14_17_21_33997)).
% 0.79/1.00 79 [hyper,77,4] {+} rs(i2003_11_14_17_21_33997,$f1(i2003_11_14_17_21_33997)).
% 0.79/1.00 80 [hyper,77,3] {+} ca(i2003_11_14_17_21_33997).
% 0.79/1.00 81 [hyper,78,16] {+} rp($f1(i2003_11_14_17_21_33997),$f6($f1(i2003_11_14_17_21_33997))).
% 0.79/1.00 83 [hyper,79,52] {+} rinvS($f1(i2003_11_14_17_21_33997),i2003_11_14_17_21_33997).
% 0.79/1.00 88 [hyper,81,48] {+} rinvP($f6($f1(i2003_11_14_17_21_33997)),$f1(i2003_11_14_17_21_33997)).
% 0.79/1.00 91 [hyper,81,12,78] {+} ca_Vx5($f6($f1(i2003_11_14_17_21_33997))).
% 0.79/1.00 92 [hyper,81,11,78] {+} ca_Vx3($f6($f1(i2003_11_14_17_21_33997))).
% 0.79/1.00 97 [hyper,92,35] {+} rr($f6($f1(i2003_11_14_17_21_33997)),$f11($f6($f1(i2003_11_14_17_21_33997)))).
% 0.79/1.00 126 [hyper,97,50] {+} rinvR($f11($f6($f1(i2003_11_14_17_21_33997))),$f6($f1(i2003_11_14_17_21_33997))).
% 0.79/1.00 127 [hyper,97,41,91] {+} cc($f11($f6($f1(i2003_11_14_17_21_33997)))).
% 0.79/1.00 184 [hyper,126,9,127] {+} ca_Vx7($f6($f1(i2003_11_14_17_21_33997))).
% 0.79/1.00 185 [hyper,184,45,88] {+} ca_Vx6($f1(i2003_11_14_17_21_33997)).
% 0.79/1.00 187 [hyper,185,43,83] {-} caxcomp(i2003_11_14_17_21_33997).
% 0.79/1.00 188 [hyper,187,7] {+} ra_Px1(i2003_11_14_17_21_33997,$f3(i2003_11_14_17_21_33997)).
% 0.79/1.00 192 [hyper,188,6,80] {-} $F.
% 0.79/1.00
% 0.79/1.00 % SZS output end Refutation
% 0.79/1.00 ------------ end of proof -------------
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Search stopped by max_proofs option.
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Search stopped by max_proofs option.
% 0.79/1.00
% 0.79/1.00 ============ end of search ============
% 0.79/1.00
% 0.79/1.00 ----------- soft-scott stats ----------
% 0.79/1.00
% 0.79/1.00 true clauses given 50 (74.6%)
% 0.79/1.00 false clauses given 17
% 0.79/1.00
% 0.79/1.00 FALSE TRUE
% 0.79/1.00 8 0 3
% 0.79/1.00 9 0 1
% 0.79/1.00 10 0 4
% 0.79/1.00 12 0 1
% 0.79/1.00 14 0 1
% 0.79/1.00 16 0 1
% 0.79/1.00 36 0 2
% 0.79/1.00 38 0 4
% 0.79/1.00 40 0 6
% 0.79/1.00 42 0 8
% 0.79/1.00 44 0 6
% 0.79/1.00 46 0 4
% 0.79/1.00 48 0 2
% 0.79/1.00 tot: 0 43 (100.0% true)
% 0.79/1.00
% 0.79/1.00
% 0.79/1.00 Model 9 [ 3 1 1813 ] (0.00 seconds, 250000 Inserts)
% 0.79/1.00
% 0.79/1.00 That finishes the proof of the theorem.
% 0.79/1.00
% 0.79/1.00 Process 17181 finished Tue Jun 7 17:44:06 2022
%------------------------------------------------------------------------------