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 : 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 : Sat Jul 16 06:18:19 EDT 2022
% Result : Theorem 5.06s 5.27s
% Output : Refutation 5.06s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GEO124+1 : TPTP v8.1.0. Released v2.4.0.
% 0.08/0.15 % Command : sos-script %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 12:43:18 EDT 2022
% 0.15/0.37 % CPUTime :
% 0.15/0.39 ----- Otter 3.2, August 2001 -----
% 0.15/0.39 The process was started by sandbox on n020.cluster.edu,
% 0.15/0.39 Sat Jun 18 12:43:18 2022
% 0.15/0.39 The command was "./sos". The process ID is 15388.
% 0.15/0.39
% 0.15/0.39 set(prolog_style_variables).
% 0.15/0.39 set(auto).
% 0.15/0.39 dependent: set(auto1).
% 0.15/0.39 dependent: set(process_input).
% 0.15/0.39 dependent: clear(print_kept).
% 0.15/0.39 dependent: clear(print_new_demod).
% 0.15/0.39 dependent: clear(print_back_demod).
% 0.15/0.39 dependent: clear(print_back_sub).
% 0.15/0.39 dependent: set(control_memory).
% 0.15/0.39 dependent: assign(max_mem, 12000).
% 0.15/0.39 dependent: assign(pick_given_ratio, 4).
% 0.15/0.39 dependent: assign(stats_level, 1).
% 0.15/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.39 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 formula_list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=12.
% 0.15/0.39
% 0.15/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.39 clauses in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(knuth_bendix).
% 0.15/0.39 dependent: set(para_from).
% 0.15/0.39 dependent: set(para_into).
% 0.15/0.39 dependent: clear(para_from_right).
% 0.15/0.39 dependent: clear(para_into_right).
% 0.15/0.39 dependent: set(para_from_vars).
% 0.15/0.39 dependent: set(eq_units_both_ways).
% 0.15/0.39 dependent: set(dynamic_demod_all).
% 0.15/0.39 dependent: set(dynamic_demod).
% 0.15/0.39 dependent: set(order_eq).
% 0.15/0.39 dependent: set(back_demod).
% 0.15/0.39 dependent: set(lrpo).
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: set(unit_deletion).
% 0.15/0.39 dependent: set(factor).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39 Following clause subsumed by 116 during input processing: 0 [copy,116,flip.1] {-} A=A.
% 0.15/0.39 116 back subsumes 104.
% 0.15/0.39 116 back subsumes 103.
% 0.15/0.39 116 back subsumes 102.
% 0.15/0.39 116 back subsumes 99.
% 0.15/0.39 116 back subsumes 98.
% 0.15/0.39 116 back subsumes 92.
% 0.15/0.39 116 back subsumes 91.
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.88/1.16
% 0.88/1.16 Model 1 (0.00 seconds, 0 Inserts)
% 0.88/1.16
% 0.88/1.16 Stopped by limit on number of solutions
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16 -------------- Softie stats --------------
% 0.88/1.16
% 0.88/1.16 UPDATE_STOP: 300
% 0.88/1.16 SFINDER_TIME_LIMIT: 2
% 0.88/1.16 SHORT_CLAUSE_CUTOFF: 4
% 0.88/1.16 number of clauses in intial UL: 92
% 0.88/1.16 number of clauses initially in problem: 108
% 0.88/1.16 percentage of clauses intially in UL: 85
% 0.88/1.16 percentage of distinct symbols occuring in initial UL: 90
% 0.88/1.16 percent of all initial clauses that are short: 100
% 0.88/1.16 absolute distinct symbol count: 43
% 0.88/1.16 distinct predicate count: 14
% 0.88/1.16 distinct function count: 26
% 0.88/1.16 distinct constant count: 3
% 0.88/1.16
% 0.88/1.16 ---------- no more Softie stats ----------
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16
% 0.88/1.16 Stopped by limit on insertions
% 0.88/1.16
% 0.88/1.16 =========== start of search ===========
% 5.06/5.27
% 5.06/5.27 -------- PROOF --------
% 5.06/5.27 % SZS status Theorem
% 5.06/5.27 % SZS output start Refutation
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 2 [ 3 21 109308 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 3 [ 6 4 14079 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 4 [ 6 7 42751 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 5 [ 6 9 54880 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 6 [ 8 6 39071 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 7 [ 7 9 55373 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 8 [ 9 8 54968 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 9 [ 5 8 54131 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 10 [ 9 8 54368 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 Model 11 [ 12 12 83854 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 Stopped by limit on insertions
% 5.06/5.27
% 5.06/5.27 -----> EMPTY CLAUSE at 4.85 sec ----> 2161 [hyper,1285,42,116] {-} $F.
% 5.06/5.27
% 5.06/5.27 Length of proof is 6. Level of proof is 4.
% 5.06/5.27
% 5.06/5.27 ---------------- PROOF ----------------
% 5.06/5.27 % SZS status Theorem
% 5.06/5.27 % SZS output start Refutation
% 5.06/5.27
% 5.06/5.27 42 [] {+} -between_c(A,B,C,D)|B!=D.
% 5.06/5.27 53 [] {+} between_o(A,B,C,D)| -ordered_by(A,D,C)| -ordered_by(A,C,B).
% 5.06/5.27 54 [] {+} -start_point(A,B)|incident_o(A,B).
% 5.06/5.27 55 [] {+} -start_point(A,B)|A=C| -incident_o(C,B)|ordered_by(B,A,C).
% 5.06/5.27 72 [] {+} -between_o(A,B,C,D)|between_c($f18(B,C,D,A),B,C,D).
% 5.06/5.27 82 [] {+} $c2!=$c1.
% 5.06/5.27 114 [] {+} start_point($c2,$c3).
% 5.06/5.27 115 [] {+} start_point($c1,$c3).
% 5.06/5.27 116 [] {+} A=A.
% 5.06/5.27 141 [hyper,114,54] {+} incident_o($c2,$c3).
% 5.06/5.27 180 [hyper,115,54] {+} incident_o($c1,$c3).
% 5.06/5.27 240 [hyper,141,55,115,unit_del,82] {+} ordered_by($c3,$c1,$c2).
% 5.06/5.27 856 [hyper,180,55,114,unit_del,82] {+} ordered_by($c3,$c2,$c1).
% 5.06/5.27 1137 [hyper,856,53,240] {-} between_o($c3,$c1,$c2,$c1).
% 5.06/5.27 1285 [hyper,1137,72] {-} between_c($f18($c1,$c2,$c1,$c3),$c1,$c2,$c1).
% 5.06/5.27 2161 [hyper,1285,42,116] {-} $F.
% 5.06/5.27
% 5.06/5.27 % SZS output end Refutation
% 5.06/5.27 ------------ end of proof -------------
% 5.06/5.27
% 5.06/5.27
% 5.06/5.27 Search stopped by max_proofs option.
% 5.06/5.27
% 5.06/5.27
% 5.06/5.27 Search stopped by max_proofs option.
% 5.06/5.27
% 5.06/5.27 ============ end of search ============
% 5.06/5.27
% 5.06/5.27 ----------- soft-scott stats ----------
% 5.06/5.27
% 5.06/5.27 true clauses given 2 (10.5%)
% 5.06/5.27 false clauses given 17
% 5.06/5.27
% 5.06/5.27 FALSE TRUE
% 5.06/5.27 4 0 4
% 5.06/5.27 5 0 2
% 5.06/5.27 6 0 6
% 5.06/5.27 7 0 4
% 5.06/5.27 8 0 13
% 5.06/5.27 9 1 11
% 5.06/5.27 10 0 17
% 5.06/5.27 11 7 25
% 5.06/5.27 12 9 20
% 5.06/5.27 13 25 34
% 5.06/5.27 14 20 31
% 5.06/5.27 15 41 23
% 5.06/5.27 16 11 16
% 5.06/5.27 17 30 45
% 5.06/5.27 18 41 59
% 5.06/5.27 19 67 60
% 5.06/5.27 20 55 54
% 5.06/5.27 21 8 38
% 5.06/5.27 22 23 45
% 5.06/5.27 23 37 6
% 5.06/5.27 24 7 9
% 5.06/5.27 25 47 16
% 5.06/5.27 26 9 18
% 5.06/5.27 27 20 21
% 5.06/5.27 28 11 6
% 5.06/5.27 29 28 17
% 5.06/5.27 30 8 30
% 5.06/5.27 31 30 33
% 5.06/5.27 32 6 22
% 5.06/5.27 33 10 23
% 5.06/5.27 34 20 10
% 5.06/5.27 35 20 27
% 5.06/5.27 36 10 27
% 5.06/5.27 37 19 61
% 5.06/5.27 38 1 27
% 5.06/5.27 39 28 11
% 5.06/5.27 40 15 26
% 5.06/5.27 41 1 9
% 5.06/5.27 42 12 25
% 5.06/5.27 43 38 28
% 5.06/5.27 44 12 17
% 5.06/5.27 45 0 23
% 5.06/5.27 46 11 40
% 5.06/5.27 47 17 14
% 5.06/5.27 48 12 2
% 5.06/5.27 49 6 26
% 5.06/5.27 50 14 14
% 5.06/5.27 51 14 23
% 5.06/5.27 52 3 8
% 5.06/5.27 53 2 2
% 5.06/5.27 54 14 12
% 5.06/5.27 55 12 12
% 5.06/5.27 56 0 16
% 5.06/5.27 57 2 12
% 5.06/5.27 58 2 14
% 5.06/5.27 60 0 2
% 5.06/5.27 tot: 836 1196 (58.9% true)
% 5.06/5.27
% 5.06/5.27
% 5.06/5.27 Model 11 [ 12 -117 83854 ] (0.00 seconds, 250000 Inserts)
% 5.06/5.27
% 5.06/5.27 That finishes the proof of the theorem.
% 5.06/5.27
% 5.06/5.27 Process 15388 finished Sat Jun 18 12:43:23 2022
%------------------------------------------------------------------------------