TSTP Solution File: GEO032-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO032-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:33 EDT 2022
% Result : Unsatisfiable 0.40s 0.56s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO032-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n011.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 : Sat Jun 18 04:21:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n011.cluster.edu,
% 0.21/0.37 Sat Jun 18 04:21:52 2022
% 0.21/0.37 The command was "./sos". The process ID is 3531.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.21/0.37 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 94 during input processing: 0 [demod,97] {-} between(A,B,extension(A,B,A,B)).
% 0.21/0.37 Following clause subsumed by 95 during input processing: 0 [demod,97] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.21/0.37 Following clause subsumed by 94 during input processing: 0 [] {-} between(A,B,extension(A,B,lower_dimension_point_1,lower_dimension_point_2)).
% 0.21/0.37 Following clause subsumed by 103 during input processing: 0 [] {-} A=A.
% 0.21/0.37 93 back subsumes 90.
% 0.21/0.37 93 back subsumes 89.
% 0.21/0.37 93 back subsumes 82.
% 0.21/0.37 98 back subsumes 91.
% 0.21/0.37 98 back subsumes 68.
% 0.21/0.37 98 back subsumes 55.
% 0.21/0.37 Following clause subsumed by 103 during input processing: 0 [copy,103,flip.1] {-} A=A.
% 0.21/0.37 103 back subsumes 71.
% 0.21/0.37 103 back subsumes 70.
% 0.21/0.37 103 back subsumes 69.
% 0.21/0.37 104 back subsumes 78.
% 0.21/0.37 104 back subsumes 77.
% 0.21/0.37 104 back subsumes 56.
% 0.21/0.37 111 back subsumes 72.
% 0.21/0.37 111 back subsumes 60.
% 0.21/0.37 111 back subsumes 59.
% 0.21/0.37 112 back subsumes 61.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 Failed to model usable list: disabling FINDER
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 -------------- Softie stats --------------
% 0.21/0.46
% 0.21/0.46 UPDATE_STOP: 300
% 0.21/0.46 SFINDER_TIME_LIMIT: 2
% 0.21/0.46 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.46 number of clauses in intial UL: 67
% 0.21/0.46 number of clauses initially in problem: 89
% 0.21/0.46 percentage of clauses intially in UL: 75
% 0.21/0.46 percentage of distinct symbols occuring in initial UL: 83
% 0.21/0.46 percent of all initial clauses that are short: 100
% 0.21/0.46 absolute distinct symbol count: 18
% 0.21/0.46 distinct predicate count: 3
% 0.21/0.46 distinct function count: 6
% 0.21/0.46 distinct constant count: 9
% 0.21/0.46
% 0.21/0.46 ---------- no more Softie stats ----------
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46
% 0.21/0.46 =========== start of search ===========
% 0.40/0.56
% 0.40/0.56 -------- PROOF --------
% 0.40/0.56 % SZS status Unsatisfiable
% 0.40/0.56 % SZS output start Refutation
% 0.40/0.56
% 0.40/0.56 ----> UNIT CONFLICT at 0.16 sec ----> 908 [binary,907.1,54.1] {-} $F.
% 0.40/0.56
% 0.40/0.56 Length of proof is 2. Level of proof is 2.
% 0.40/0.56
% 0.40/0.56 ---------------- PROOF ----------------
% 0.40/0.56 % SZS status Unsatisfiable
% 0.40/0.56 % SZS output start Refutation
% 0.40/0.56
% 0.40/0.56 53 [] {+} -equidistant(A,B,C,D)| -equidistant(A,E,C,F)| -equidistant(A,G,C,H)| -equidistant(E,G,F,H)| -between(A,B,E)| -between(C,D,F)|equidistant(B,G,D,H).
% 0.40/0.56 54 [] {+} -equidistant(v,w,v1,w1).
% 0.40/0.56 79 [factor,53.2.3] {+} -equidistant(A,B,C,D)| -equidistant(A,E,C,F)| -equidistant(E,E,F,F)| -between(A,B,E)| -between(C,D,F)|equidistant(B,E,D,F).
% 0.40/0.56 104 [] {-} equidistant(A,A,B,B).
% 0.40/0.56 114 [] {-} between(u,v,w).
% 0.40/0.56 115 [] {-} between(u1,v1,w1).
% 0.40/0.56 116 [] {-} equidistant(u,v,u1,v1).
% 0.40/0.56 117 [] {-} equidistant(u,w,u1,w1).
% 0.40/0.56 907 [hyper,117,79,116,104,114,115] {-} equidistant(v,w,v1,w1).
% 0.40/0.56 908 [binary,907.1,54.1] {-} $F.
% 0.40/0.56
% 0.40/0.56 % SZS output end Refutation
% 0.40/0.56 ------------ end of proof -------------
% 0.40/0.56
% 0.40/0.56
% 0.40/0.56 Search stopped by max_proofs option.
% 0.40/0.56
% 0.40/0.56
% 0.40/0.56 Search stopped by max_proofs option.
% 0.40/0.56
% 0.40/0.56 ============ end of search ============
% 0.40/0.56
% 0.40/0.56 That finishes the proof of the theorem.
% 0.40/0.56
% 0.40/0.56 Process 3531 finished Sat Jun 18 04:21:53 2022
%------------------------------------------------------------------------------