TSTP Solution File: GEO062-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO062-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:49 EDT 2022
% Result : Unsatisfiable 2.39s 2.60s
% Output : Refutation 2.39s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO062-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.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 : Fri Jun 17 23:19:34 EDT 2022
% 0.13/0.34 % 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 Fri Jun 17 23:19:34 2022
% 0.13/0.37 The command was "./sos". The process ID is 6102.
% 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.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 Following clause subsumed by 36 during input processing: 0 [] {-} -between(A,B,C)| -between(B,A,C)|A=B|B=C.
% 0.13/0.37 Following clause subsumed by 37 during input processing: 0 [] {-} -between(A,B,C)| -between(A,C,B)|A=B|B=C.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 109 during input processing: 0 [demod,112] {-} between(A,B,extension(A,B,A,B)).
% 0.13/0.37 Following clause subsumed by 110 during input processing: 0 [demod,112] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.13/0.37 Following clause subsumed by 109 during input processing: 0 [] {-} between(A,B,extension(A,B,lower_dimension_point_1,lower_dimension_point_2)).
% 0.13/0.37 Following clause subsumed by 120 during input processing: 0 [] {-} A=A.
% 0.13/0.37 108 back subsumes 106.
% 0.13/0.37 108 back subsumes 105.
% 0.13/0.37 108 back subsumes 104.
% 0.13/0.37 108 back subsumes 102.
% 0.13/0.37 108 back subsumes 101.
% 0.13/0.37 108 back subsumes 94.
% 0.13/0.37 115 back subsumes 87.
% 0.13/0.37 115 back subsumes 74.
% 0.13/0.37 115 back subsumes 61.
% 0.13/0.37 Following clause subsumed by 120 during input processing: 0 [copy,120,flip.1] {-} A=A.
% 0.13/0.37 120 back subsumes 77.
% 0.13/0.37 120 back subsumes 76.
% 0.13/0.37 120 back subsumes 75.
% 0.13/0.37 121 back subsumes 90.
% 0.13/0.37 121 back subsumes 89.
% 0.13/0.37 121 back subsumes 88.
% 0.13/0.37 121 back subsumes 84.
% 0.13/0.37 121 back subsumes 83.
% 0.13/0.37 121 back subsumes 62.
% 0.13/0.37 128 back subsumes 78.
% 0.13/0.37 128 back subsumes 66.
% 0.13/0.37 128 back subsumes 65.
% 0.13/0.37 129 back subsumes 67.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Failed to model usable list: disabling FINDER
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 -------------- Softie stats --------------
% 0.19/0.48
% 0.19/0.48 UPDATE_STOP: 300
% 0.19/0.48 SFINDER_TIME_LIMIT: 2
% 0.19/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.48 number of clauses in intial UL: 72
% 0.19/0.48 number of clauses initially in problem: 97
% 0.19/0.48 percentage of clauses intially in UL: 74
% 0.19/0.48 percentage of distinct symbols occuring in initial UL: 68
% 0.19/0.48 percent of all initial clauses that are short: 100
% 0.19/0.48 absolute distinct symbol count: 16
% 0.19/0.48 distinct predicate count: 3
% 0.19/0.48 distinct function count: 7
% 0.19/0.48 distinct constant count: 6
% 0.19/0.48
% 0.19/0.48 ---------- no more Softie stats ----------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 =========== start of search ===========
% 2.39/2.60
% 2.39/2.60 -------- PROOF --------
% 2.39/2.60 % SZS status Unsatisfiable
% 2.39/2.60 % SZS output start Refutation
% 2.39/2.60
% 2.39/2.60 -----> EMPTY CLAUSE at 2.21 sec ----> 4363 [para_into,136.1.1,32.3.1,unit_del,120,1972,50] {-} $F.
% 2.39/2.60
% 2.39/2.60 Length of proof is 9. Level of proof is 3.
% 2.39/2.60
% 2.39/2.60 ---------------- PROOF ----------------
% 2.39/2.60 % SZS status Unsatisfiable
% 2.39/2.60 % SZS output start Refutation
% 2.39/2.60
% 2.39/2.60 31 [] {-} -between(A,B,C)|A=B|C=extension(A,B,B,C).
% 2.39/2.60 32 [copy,31,flip.3] {+} -between(A,B,C)|A=B|extension(A,B,B,C)=C.
% 2.39/2.60 35 [] {+} -between(A,B,C)|between(C,B,A).
% 2.39/2.60 38 [] {+} -between(A,B,C)| -between(A,C,D)|between(B,C,D).
% 2.39/2.60 49 [] {-} A!=extension(B,A,lower_dimension_point_1,lower_dimension_point_2).
% 2.39/2.60 50 [copy,49,flip.1] {+} extension(A,B,lower_dimension_point_1,lower_dimension_point_2)!=B.
% 2.39/2.60 59 [] {-} v!=insertion(u,w,u,v).
% 2.39/2.60 60 [copy,59,flip.1] {-} insertion(u,w,u,v)!=v.
% 2.39/2.60 109 [] {-} between(A,B,extension(A,B,C,D)).
% 2.39/2.60 112,111 [] {-} reflection(A,B)=extension(A,B,A,B).
% 2.39/2.60 114,113 [] {-} insertion(A,B,C,D)=extension(extension(B,A,lower_dimension_point_1,lower_dimension_point_2),A,C,D).
% 2.39/2.60 116 [] {-} A=extension(B,A,C,C).
% 2.39/2.60 118,117 [copy,116,flip.1] {-} extension(A,B,C,C)=B.
% 2.39/2.60 119 [] {-} A=reflection(A,A).
% 2.39/2.60 120 [copy,119,demod,112,118] {-} A=A.
% 2.39/2.60 133 [] {-} between(u,v,w).
% 2.39/2.60 136 [back_demod,60,demod,114] {-} extension(extension(w,u,lower_dimension_point_1,lower_dimension_point_2),u,u,v)!=v.
% 2.39/2.60 192 [hyper,133,35] {-} between(w,v,u).
% 2.39/2.60 396 [hyper,192,38,109] {-} between(v,u,extension(w,u,A,B)).
% 2.39/2.60 1972 [hyper,396,35] {-} between(extension(w,u,A,B),u,v).
% 2.39/2.60 4363 [para_into,136.1.1,32.3.1,unit_del,120,1972,50] {-} $F.
% 2.39/2.60
% 2.39/2.60 % SZS output end Refutation
% 2.39/2.60 ------------ end of proof -------------
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Search stopped by max_proofs option.
% 2.39/2.60
% 2.39/2.60
% 2.39/2.60 Search stopped by max_proofs option.
% 2.39/2.60
% 2.39/2.60 ============ end of search ============
% 2.39/2.60
% 2.39/2.60 That finishes the proof of the theorem.
% 2.39/2.60
% 2.39/2.60 Process 6102 finished Fri Jun 17 23:19:36 2022
%------------------------------------------------------------------------------