TSTP Solution File: GEO037-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO037-3 : TPTP v8.1.0. Released v1.0.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:17:36 EDT 2022
% Result : Unsatisfiable 2.04s 2.24s
% Output : Refutation 2.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GEO037-3 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Sat Jun 18 04:48:04 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 n020.cluster.edu,
% 0.13/0.37 Sat Jun 18 04:48:04 2022
% 0.13/0.37 The command was "./sos". The process ID is 16798.
% 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.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.38
% 0.13/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.38 clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: set(unit_deletion).
% 0.13/0.38 dependent: set(factor).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.13/0.38 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 73 during input processing: 0 [demod,76] {-} between(A,B,extension(A,B,A,B)).
% 0.13/0.38 Following clause subsumed by 74 during input processing: 0 [demod,76] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.13/0.38 Following clause subsumed by 82 during input processing: 0 [] {-} A=A.
% 0.13/0.38 72 back subsumes 69.
% 0.13/0.38 77 back subsumes 64.
% 0.13/0.38 77 back subsumes 51.
% 0.13/0.38 Following clause subsumed by 82 during input processing: 0 [copy,82,flip.1] {-} A=A.
% 0.13/0.38 82 back subsumes 67.
% 0.13/0.38 82 back subsumes 66.
% 0.13/0.38 82 back subsumes 65.
% 0.13/0.38 83 back subsumes 52.
% 0.13/0.38 90 back subsumes 68.
% 0.13/0.38 90 back subsumes 56.
% 0.13/0.38 90 back subsumes 55.
% 0.13/0.38 91 back subsumes 57.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.75/0.95
% 0.75/0.95 Model 1 (0.00 seconds, 0 Inserts)
% 0.75/0.95
% 0.75/0.95 Stopped by limit on number of solutions
% 0.75/0.95
% 0.75/0.95
% 0.75/0.95 -------------- Softie stats --------------
% 0.75/0.95
% 0.75/0.95 UPDATE_STOP: 300
% 0.75/0.95 SFINDER_TIME_LIMIT: 2
% 0.75/0.95 SHORT_CLAUSE_CUTOFF: 4
% 0.75/0.95 number of clauses in intial UL: 51
% 0.75/0.95 number of clauses initially in problem: 68
% 0.75/0.95 percentage of clauses intially in UL: 75
% 0.75/0.95 percentage of distinct symbols occuring in initial UL: 93
% 0.75/0.95 percent of all initial clauses that are short: 100
% 0.75/0.95 absolute distinct symbol count: 16
% 0.75/0.95 distinct predicate count: 3
% 0.75/0.95 distinct function count: 6
% 0.75/0.95 distinct constant count: 7
% 0.75/0.95
% 0.75/0.95 ---------- no more Softie stats ----------
% 0.75/0.95
% 0.75/0.95
% 0.75/0.95
% 0.75/0.95 Model 2 (0.00 seconds, 0 Inserts)
% 0.75/0.95
% 0.75/0.95 Stopped by limit on number of solutions
% 0.75/0.95
% 0.75/0.95 =========== start of search ===========
% 2.04/2.24
% 2.04/2.24 -------- PROOF --------
% 2.04/2.24 % SZS status Unsatisfiable
% 2.04/2.24 % SZS output start Refutation
% 2.04/2.24
% 2.04/2.24 Model 3 (0.00 seconds, 0 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on number of solutions
% 2.04/2.24
% 2.04/2.24 Model 4 (0.00 seconds, 0 Inserts)
% 2.04/2.24
% 2.04/2.24 Stopped by limit on number of solutions
% 2.04/2.24
% 2.04/2.24 Model 5 [ 36 38 147120 ] (0.00 seconds, 149839 Inserts)
% 2.04/2.24
% 2.04/2.24 ----> UNIT CONFLICT at 1.84 sec ----> 477 [binary,475.1,44.1] {+} $F.
% 2.04/2.24
% 2.04/2.24 Length of proof is 7. Level of proof is 4.
% 2.04/2.24
% 2.04/2.24 ---------------- PROOF ----------------
% 2.04/2.24 % SZS status Unsatisfiable
% 2.04/2.24 % SZS output start Refutation
% 2.04/2.24
% 2.04/2.24 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 2.04/2.24 21 [] {+} -equidistant(A,B,C,D)|equidistant(D,C,A,B).
% 2.04/2.24 23 [] {+} -equidistant(A,B,C,D)| -equidistant(C,D,E,F)|equidistant(A,B,E,F).
% 2.04/2.24 43 [] {-} lower_dimension_point_1!=lower_dimension_point_2.
% 2.04/2.24 44 [copy,43,flip.1] {+} lower_dimension_point_2!=lower_dimension_point_1.
% 2.04/2.24 49 [] {-} v=extension(u,v,lower_dimension_point_1,lower_dimension_point_2)| -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))| -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% 2.04/2.24 50 [copy,49,flip.1] {+} extension(u,v,lower_dimension_point_1,lower_dimension_point_2)=v| -equidistant(v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2),x,extension(w,x,lower_dimension_point_1,lower_dimension_point_2))| -between(u,v,extension(u,v,lower_dimension_point_1,lower_dimension_point_2)).
% 2.04/2.24 72 [] {+} equidistant(A,B,B,A).
% 2.04/2.24 73 [] {+} between(A,B,extension(A,B,C,D)).
% 2.04/2.24 74 [] {-} equidistant(A,extension(B,A,C,D),C,D).
% 2.04/2.24 115 [hyper,74,23,72] {-} equidistant(A,extension(B,A,C,D),D,C).
% 2.04/2.24 117 [hyper,74,21] {-} equidistant(A,B,C,extension(D,C,B,A)).
% 2.04/2.24 383 [hyper,117,23,115] {-} equidistant(A,extension(B,A,C,D),E,extension(F,E,C,D)).
% 2.04/2.24 445 [para_into,117.1.4,50.1.1,unit_del,383,73] {-} equidistant(lower_dimension_point_2,lower_dimension_point_1,v,v).
% 2.04/2.24 475 [hyper,445,2] {-} lower_dimension_point_2=lower_dimension_point_1.
% 2.04/2.24 477 [binary,475.1,44.1] {+} $F.
% 2.04/2.24
% 2.04/2.24 % SZS output end Refutation
% 2.04/2.24 ------------ end of proof -------------
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Search stopped by max_proofs option.
% 2.04/2.24
% 2.04/2.24 ============ end of search ============
% 2.04/2.24
% 2.04/2.24 ----------- soft-scott stats ----------
% 2.04/2.24
% 2.04/2.24 true clauses given 5 (33.3%)
% 2.04/2.24 false clauses given 10
% 2.04/2.24
% 2.04/2.24 FALSE TRUE
% 2.04/2.24 7 0 1
% 2.04/2.24 8 0 2
% 2.04/2.24 9 3 8
% 2.04/2.24 10 1 4
% 2.04/2.24 11 0 3
% 2.04/2.24 12 0 5
% 2.04/2.24 13 24 6
% 2.04/2.24 14 7 2
% 2.04/2.24 15 7 3
% 2.04/2.24 16 0 8
% 2.04/2.24 17 10 10
% 2.04/2.24 18 8 5
% 2.04/2.24 19 1 6
% 2.04/2.24 20 0 12
% 2.04/2.24 21 15 3
% 2.04/2.24 22 2 3
% 2.04/2.24 23 5 2
% 2.04/2.24 24 5 2
% 2.04/2.24 25 8 2
% 2.04/2.24 26 1 1
% 2.04/2.24 27 3 1
% 2.04/2.24 28 1 7
% 2.04/2.24 29 27 2
% 2.04/2.24 30 7 1
% 2.04/2.24 31 6 3
% 2.04/2.24 32 2 6
% 2.04/2.24 33 0 3
% 2.04/2.24 34 17 0
% 2.04/2.24 35 5 1
% 2.04/2.24 36 7 4
% 2.04/2.24 37 0 2
% 2.04/2.24 38 5 1
% 2.04/2.24 39 7 1
% 2.04/2.24 40 0 1
% 2.04/2.24 42 3 1
% 2.04/2.24 43 7 1
% 2.04/2.24 44 5 0
% 2.04/2.24 45 2 2
% 2.04/2.24 46 2 0
% 2.04/2.24 47 2 0
% 2.04/2.24 49 0 1
% 2.04/2.24 50 7 0
% 2.04/2.24 51 2 0
% 2.04/2.24 54 2 0
% 2.04/2.24 tot: 216 126 (36.8% true)
% 2.04/2.24
% 2.04/2.24
% 2.04/2.24 Model 5 [ 36 -29 147120 ] (0.00 seconds, 149839 Inserts)
% 2.04/2.24
% 2.04/2.24 That finishes the proof of the theorem.
% 2.04/2.24
% 2.04/2.24 Process 16798 finished Sat Jun 18 04:48:05 2022
%------------------------------------------------------------------------------