TSTP Solution File: GEO124-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.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 : Sat Jul 16 06:18:18 EDT 2022
% Result : Unsatisfiable 5.38s 5.57s
% Output : Refutation 5.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO124-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % Command : sos-script %s
% 0.15/0.34 % Computer : n027.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 600
% 0.15/0.34 % DateTime : Sat Jun 18 02:14:37 EDT 2022
% 0.15/0.34 % CPUTime :
% 0.15/0.37 ----- Otter 3.2, August 2001 -----
% 0.15/0.37 The process was started by sandbox2 on n027.cluster.edu,
% 0.15/0.37 Sat Jun 18 02:14:37 2022
% 0.15/0.37 The command was "./sos". The process ID is 32419.
% 0.15/0.37
% 0.15/0.37 set(prolog_style_variables).
% 0.15/0.37 set(auto).
% 0.15/0.37 dependent: set(auto1).
% 0.15/0.37 dependent: set(process_input).
% 0.15/0.37 dependent: clear(print_kept).
% 0.15/0.37 dependent: clear(print_new_demod).
% 0.15/0.37 dependent: clear(print_back_demod).
% 0.15/0.37 dependent: clear(print_back_sub).
% 0.15/0.37 dependent: set(control_memory).
% 0.15/0.37 dependent: assign(max_mem, 12000).
% 0.15/0.37 dependent: assign(pick_given_ratio, 4).
% 0.15/0.37 dependent: assign(stats_level, 1).
% 0.15/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.37 dependent: assign(sos_limit, 5000).
% 0.15/0.37 dependent: assign(max_weight, 60).
% 0.15/0.37 clear(print_given).
% 0.15/0.37
% 0.15/0.37 list(usable).
% 0.15/0.37
% 0.15/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.15/0.37
% 0.15/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.37 clauses in usable.
% 0.15/0.37
% 0.15/0.37 dependent: set(knuth_bendix).
% 0.15/0.37 dependent: set(para_from).
% 0.15/0.37 dependent: set(para_into).
% 0.15/0.37 dependent: clear(para_from_right).
% 0.15/0.37 dependent: clear(para_into_right).
% 0.15/0.37 dependent: set(para_from_vars).
% 0.15/0.37 dependent: set(eq_units_both_ways).
% 0.15/0.37 dependent: set(dynamic_demod_all).
% 0.15/0.37 dependent: set(dynamic_demod).
% 0.15/0.37 dependent: set(order_eq).
% 0.15/0.37 dependent: set(back_demod).
% 0.15/0.37 dependent: set(lrpo).
% 0.15/0.37 dependent: set(hyper_res).
% 0.15/0.37 dependent: set(unit_deletion).
% 0.15/0.37 dependent: set(factor).
% 0.15/0.37
% 0.15/0.37 ------------> process usable:
% 0.15/0.37
% 0.15/0.37 ------------> process sos:
% 0.15/0.37 Following clause subsumed by 117 during input processing: 0 [copy,117,flip.1] {-} A=A.
% 0.15/0.37 117 back subsumes 105.
% 0.15/0.37 117 back subsumes 104.
% 0.15/0.37 117 back subsumes 103.
% 0.15/0.37 117 back subsumes 100.
% 0.15/0.37 117 back subsumes 99.
% 0.15/0.37 117 back subsumes 93.
% 0.15/0.37 117 back subsumes 92.
% 0.15/0.37
% 0.15/0.37 ======= end of input processing =======
% 0.90/1.11
% 0.90/1.11 Model 1 (0.00 seconds, 0 Inserts)
% 0.90/1.11
% 0.90/1.11 Stopped by limit on number of solutions
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11 -------------- Softie stats --------------
% 0.90/1.11
% 0.90/1.11 UPDATE_STOP: 300
% 0.90/1.11 SFINDER_TIME_LIMIT: 2
% 0.90/1.11 SHORT_CLAUSE_CUTOFF: 4
% 0.90/1.11 number of clauses in intial UL: 92
% 0.90/1.11 number of clauses initially in problem: 108
% 0.90/1.11 percentage of clauses intially in UL: 85
% 0.90/1.11 percentage of distinct symbols occuring in initial UL: 90
% 0.90/1.11 percent of all initial clauses that are short: 100
% 0.90/1.11 absolute distinct symbol count: 43
% 0.90/1.11 distinct predicate count: 14
% 0.90/1.11 distinct function count: 26
% 0.90/1.11 distinct constant count: 3
% 0.90/1.11
% 0.90/1.11 ---------- no more Softie stats ----------
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11
% 0.90/1.11 Stopped by limit on insertions
% 0.90/1.11
% 0.90/1.11 =========== start of search ===========
% 5.38/5.57
% 5.38/5.57 -------- PROOF --------
% 5.38/5.57 % SZS status Unsatisfiable
% 5.38/5.57 % SZS output start Refutation
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 2 [ 3 9 59045 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 3 [ 5 9 58961 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 4 [ 8 7 39738 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 5 [ 9 3 12448 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 6 [ 8 6 36156 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 7 [ 7 4 16514 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 8 [ 10 8 51159 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 9 [ 10 7 50237 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 10 [ 10 5 38192 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 11 [ 10 5 38915 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Stopped by limit on insertions
% 5.38/5.57
% 5.38/5.57 Model 12 [ 18 9 63175 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 -----> EMPTY CLAUSE at 5.16 sec ----> 2838 [hyper,2030,42,117] {-} $F.
% 5.38/5.57
% 5.38/5.57 Length of proof is 7. Level of proof is 4.
% 5.38/5.57
% 5.38/5.57 ---------------- PROOF ----------------
% 5.38/5.57 % SZS status Unsatisfiable
% 5.38/5.57 % SZS output start Refutation
% 5.38/5.57
% 5.38/5.57 42 [] {+} -between_c(A,B,C,D)|B!=D.
% 5.38/5.57 53 [] {+} -ordered_by(A,B,C)| -ordered_by(A,C,D)|between_o(A,D,C,B).
% 5.38/5.57 54 [] {+} -start_point(A,B)|incident_o(A,B).
% 5.38/5.57 55 [] {+} -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 5.38/5.57 72 [] {+} -between_o(A,B,C,D)|between_c(ax2_sk4(A,D,C,B),B,C,D).
% 5.38/5.57 82 [] {-} sk26!=sk27.
% 5.38/5.57 83 [copy,82,flip.1] {+} sk27!=sk26.
% 5.38/5.57 115 [] {+} start_point(sk26,sk25).
% 5.38/5.57 116 [] {+} start_point(sk27,sk25).
% 5.38/5.57 117 [] {+} A=A.
% 5.38/5.57 142 [hyper,116,54] {+} incident_o(sk27,sk25).
% 5.38/5.57 181 [hyper,115,54] {+} incident_o(sk26,sk25).
% 5.38/5.57 222 [hyper,142,55,115,unit_del,83] {+} ordered_by(sk25,sk26,sk27).
% 5.38/5.57 911 [hyper,181,55,116,unit_del,83] {+} ordered_by(sk25,sk27,sk26).
% 5.38/5.57 1253 [hyper,911,53,222] {-} between_o(sk25,sk26,sk27,sk26).
% 5.38/5.57 2030 [hyper,1253,72] {-} between_c(ax2_sk4(sk25,sk26,sk27,sk26),sk26,sk27,sk26).
% 5.38/5.57 2838 [hyper,2030,42,117] {-} $F.
% 5.38/5.57
% 5.38/5.57 % SZS output end Refutation
% 5.38/5.57 ------------ end of proof -------------
% 5.38/5.57
% 5.38/5.57
% 5.38/5.57 Search stopped by max_proofs option.
% 5.38/5.57
% 5.38/5.57
% 5.38/5.57 Search stopped by max_proofs option.
% 5.38/5.57
% 5.38/5.57 ============ end of search ============
% 5.38/5.57
% 5.38/5.57 ----------- soft-scott stats ----------
% 5.38/5.57
% 5.38/5.57 true clauses given 3 (13.0%)
% 5.38/5.57 false clauses given 20
% 5.38/5.57
% 5.38/5.57 FALSE TRUE
% 5.38/5.57 4 0 3
% 5.38/5.57 5 0 4
% 5.38/5.57 6 0 7
% 5.38/5.57 7 0 4
% 5.38/5.57 8 0 15
% 5.38/5.57 9 1 13
% 5.38/5.57 10 0 19
% 5.38/5.57 11 7 25
% 5.38/5.57 12 11 19
% 5.38/5.57 13 28 32
% 5.38/5.57 14 22 33
% 5.38/5.57 15 42 28
% 5.38/5.57 16 16 16
% 5.38/5.57 17 36 61
% 5.38/5.57 18 41 65
% 5.38/5.57 19 87 69
% 5.38/5.57 20 65 75
% 5.38/5.57 21 21 43
% 5.38/5.57 22 24 66
% 5.38/5.57 23 62 23
% 5.38/5.57 24 28 25
% 5.38/5.57 25 63 32
% 5.38/5.57 26 14 37
% 5.38/5.57 27 25 25
% 5.38/5.57 28 15 10
% 5.38/5.57 29 38 24
% 5.38/5.57 30 11 34
% 5.38/5.57 31 44 27
% 5.38/5.57 32 14 25
% 5.38/5.57 33 32 31
% 5.38/5.57 34 34 12
% 5.38/5.57 35 27 37
% 5.38/5.57 36 22 31
% 5.38/5.57 37 47 76
% 5.38/5.57 38 14 35
% 5.38/5.57 39 40 11
% 5.38/5.57 40 16 32
% 5.38/5.57 41 1 11
% 5.38/5.57 42 12 25
% 5.38/5.57 43 88 36
% 5.38/5.57 44 17 33
% 5.38/5.57 45 7 29
% 5.38/5.57 46 15 38
% 5.38/5.57 47 17 16
% 5.38/5.57 48 12 4
% 5.38/5.57 49 30 38
% 5.38/5.57 50 14 16
% 5.38/5.57 51 18 23
% 5.38/5.57 52 6 6
% 5.38/5.57 53 2 4
% 5.38/5.57 54 14 12
% 5.38/5.57 55 15 12
% 5.38/5.57 56 0 28
% 5.38/5.57 57 2 12
% 5.38/5.57 58 2 14
% 5.38/5.57 60 0 4
% 5.38/5.57 tot: 1219 1485 (54.9% true)
% 5.38/5.57
% 5.38/5.57
% 5.38/5.57 Model 12 [ 18 9 63175 ] (0.00 seconds, 250000 Inserts)
% 5.38/5.57
% 5.38/5.57 That finishes the proof of the theorem.
% 5.38/5.57
% 5.38/5.57 Process 32419 finished Sat Jun 18 02:14:42 2022
%------------------------------------------------------------------------------