TSTP Solution File: GEO030-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO030-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:32 EDT 2022
% Result : Unsatisfiable 0.89s 1.12s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO030-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jun 18 09:15:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n012.cluster.edu,
% 0.12/0.36 Sat Jun 18 09:15:08 2022
% 0.12/0.36 The command was "./sos". The process ID is 11749.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 86 during input processing: 0 [demod,89] {-} between(A,B,extension(A,B,A,B)).
% 0.12/0.36 Following clause subsumed by 87 during input processing: 0 [demod,89] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.12/0.36 Following clause subsumed by 86 during input processing: 0 [] {-} between(A,B,extension(A,B,lower_dimension_point_1,lower_dimension_point_2)).
% 0.12/0.36 Following clause subsumed by 95 during input processing: 0 [] {-} A=A.
% 0.12/0.36 85 back subsumes 78.
% 0.12/0.36 90 back subsumes 69.
% 0.12/0.36 90 back subsumes 56.
% 0.12/0.36 Following clause subsumed by 95 during input processing: 0 [copy,95,flip.1] {-} A=A.
% 0.12/0.36 95 back subsumes 72.
% 0.12/0.36 95 back subsumes 71.
% 0.12/0.36 95 back subsumes 70.
% 0.12/0.36 96 back subsumes 57.
% 0.12/0.36 103 back subsumes 73.
% 0.12/0.36 103 back subsumes 61.
% 0.12/0.36 103 back subsumes 60.
% 0.12/0.36 104 back subsumes 62.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 Failed to model usable list: disabling FINDER
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 -------------- Softie stats --------------
% 0.19/0.46
% 0.19/0.46 UPDATE_STOP: 300
% 0.19/0.46 SFINDER_TIME_LIMIT: 2
% 0.19/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.46 number of clauses in intial UL: 62
% 0.19/0.46 number of clauses initially in problem: 83
% 0.19/0.46 percentage of clauses intially in UL: 74
% 0.19/0.46 percentage of distinct symbols occuring in initial UL: 93
% 0.19/0.46 percent of all initial clauses that are short: 100
% 0.19/0.46 absolute distinct symbol count: 16
% 0.19/0.46 distinct predicate count: 3
% 0.19/0.46 distinct function count: 6
% 0.19/0.46 distinct constant count: 7
% 0.19/0.46
% 0.19/0.46 ---------- no more Softie stats ----------
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46
% 0.19/0.46 =========== start of search ===========
% 0.89/1.12
% 0.89/1.12 -------- PROOF --------
% 0.89/1.12 % SZS status Unsatisfiable
% 0.89/1.12 % SZS output start Refutation
% 0.89/1.12
% 0.89/1.12 ----> UNIT CONFLICT at 0.73 sec ----> 2386 [binary,2384.1,55.1] {-} $F.
% 0.89/1.12
% 0.89/1.12 Length of proof is 6. Level of proof is 4.
% 0.89/1.12
% 0.89/1.12 ---------------- PROOF ----------------
% 0.89/1.12 % SZS status Unsatisfiable
% 0.89/1.12 % SZS output start Refutation
% 0.89/1.12
% 0.89/1.12 1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 0.89/1.12 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 0.89/1.12 3 [] {+} -equidistant(A,B,C,D)| -equidistant(B,E,D,F)| -equidistant(A,G,C,H)| -equidistant(B,G,D,H)| -between(A,B,E)| -between(C,D,F)|A=B|equidistant(E,G,F,H).
% 0.89/1.12 52 [] {-} u!=v.
% 0.89/1.12 53 [copy,52,flip.1] {+} v!=u.
% 0.89/1.12 54 [] {-} w!=w1.
% 0.89/1.12 55 [copy,54,flip.1] {+} w1!=w.
% 0.89/1.12 58 [factor,3.5.6] {+} -equidistant(A,B,A,B)| -equidistant(B,C,B,C)| -equidistant(A,D,A,E)| -equidistant(B,D,B,E)| -between(A,B,C)|A=B|equidistant(C,D,C,E).
% 0.89/1.12 90 [] {-} equidistant(A,B,A,B).
% 0.89/1.12 96 [] {-} equidistant(A,A,B,B).
% 0.89/1.12 106 [] {-} between(u,v,w).
% 0.89/1.12 107 [] {-} equidistant(u,w,u,w1).
% 0.89/1.12 108 [] {-} equidistant(v,w,v,w1).
% 0.89/1.12 634 [hyper,108,58,90,90,107,106,unit_del,53] {-} equidistant(w,w,w,w1).
% 0.89/1.12 1379 [hyper,634,1,96] {-} equidistant(w,w1,A,A).
% 0.89/1.12 2384 [hyper,1379,2,flip.1] {-} w1=w.
% 0.89/1.12 2386 [binary,2384.1,55.1] {-} $F.
% 0.89/1.12
% 0.89/1.12 % SZS output end Refutation
% 0.89/1.12 ------------ end of proof -------------
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 Search stopped by max_proofs option.
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 Search stopped by max_proofs option.
% 0.89/1.12
% 0.89/1.12 ============ end of search ============
% 0.89/1.12
% 0.89/1.12 That finishes the proof of the theorem.
% 0.89/1.12
% 0.89/1.12 Process 11749 finished Sat Jun 18 09:15:09 2022
%------------------------------------------------------------------------------