TSTP Solution File: GEO011-5 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:22 EDT 2022
% Result : Unsatisfiable 0.21s 0.55s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GEO011-5 : TPTP v8.1.0. Released v1.0.0.
% 0.14/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n014.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jun 17 17:34:04 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox on n014.cluster.edu,
% 0.21/0.37 Fri Jun 17 17:34:04 2022
% 0.21/0.37 The command was "./sos". The process ID is 1571.
% 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
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} equal_distance(distance(A,B),distance(B,A)).
% 0.21/0.37 22 back subsumes 21.
% 0.21/0.37 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] {-} A=A.
% 0.21/0.37 Following clause subsumed by 24 during input processing: 0 [copy,27,flip.1] {-} equal_distance(distance(A,extension(B,A,C,D)),distance(C,D)).
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.21/0.43
% 0.21/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.43
% 0.21/0.43 Stopped by limit on number of solutions
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 -------------- Softie stats --------------
% 0.21/0.43
% 0.21/0.43 UPDATE_STOP: 300
% 0.21/0.43 SFINDER_TIME_LIMIT: 2
% 0.21/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.43 number of clauses in intial UL: 20
% 0.21/0.43 number of clauses initially in problem: 26
% 0.21/0.43 percentage of clauses intially in UL: 76
% 0.21/0.43 percentage of distinct symbols occuring in initial UL: 90
% 0.21/0.43 percent of all initial clauses that are short: 100
% 0.21/0.43 absolute distinct symbol count: 10
% 0.21/0.43 distinct predicate count: 4
% 0.21/0.43 distinct function count: 3
% 0.21/0.43 distinct constant count: 3
% 0.21/0.43
% 0.21/0.43 ---------- no more Softie stats ----------
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.43
% 0.21/0.43 Stopped by limit on number of solutions
% 0.21/0.43
% 0.21/0.43 =========== start of search ===========
% 0.21/0.55
% 0.21/0.55 -------- PROOF --------
% 0.21/0.55 % SZS status Unsatisfiable
% 0.21/0.55 % SZS output start Refutation
% 0.21/0.55
% 0.21/0.55 -----> EMPTY CLAUSE at 0.16 sec ----> 62 [hyper,25,4,unit_del,11,12,13] {-} $F.
% 0.21/0.55
% 0.21/0.55 Length of proof is 0. Level of proof is 0.
% 0.21/0.55
% 0.21/0.55 ---------------- PROOF ----------------
% 0.21/0.55 % SZS status Unsatisfiable
% 0.21/0.55 % SZS output start Refutation
% 0.21/0.55
% 0.21/0.55 4 [] {+} -colinear(A,B,C)|between(A,B,C)|between(B,C,A)|between(C,A,B).
% 0.21/0.55 11 [] {+} -between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 0.21/0.55 12 [] {+} -between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1).
% 0.21/0.55 13 [] {+} -between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2).
% 0.21/0.55 25 [] {-} colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3).
% 0.21/0.55 62 [hyper,25,4,unit_del,11,12,13] {-} $F.
% 0.21/0.55
% 0.21/0.55 % SZS output end Refutation
% 0.21/0.55 ------------ end of proof -------------
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Search stopped by max_proofs option.
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Search stopped by max_proofs option.
% 0.21/0.55
% 0.21/0.55 ============ end of search ============
% 0.21/0.55
% 0.21/0.55 ----------- soft-scott stats ----------
% 0.21/0.55
% 0.21/0.55 true clauses given 0 (0.0%)
% 0.21/0.55 false clauses given 2
% 0.21/0.55
% 0.21/0.55 FALSE TRUE
% 0.21/0.55 3 0 1
% 0.21/0.55 7 0 1
% 0.21/0.55 8 1 0
% 0.21/0.55 10 0 1
% 0.21/0.55 11 2 0
% 0.21/0.55 13 0 1
% 0.21/0.55 14 0 1
% 0.21/0.55 21 0 3
% 0.21/0.55 28 0 5
% 0.21/0.55 32 0 1
% 0.21/0.55 36 0 1
% 0.21/0.55 37 0 1
% 0.21/0.55 39 0 8
% 0.21/0.55 45 0 1
% 0.21/0.55 46 0 6
% 0.21/0.55 47 0 1
% 0.21/0.55 48 0 1
% 0.21/0.55 54 0 1
% 0.21/0.55 57 0 1
% 0.21/0.55 tot: 3 35 (92.1% true)
% 0.21/0.55
% 0.21/0.55
% 0.21/0.55 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.55
% 0.21/0.55 That finishes the proof of the theorem.
% 0.21/0.55
% 0.21/0.55 Process 1571 finished Fri Jun 17 17:34:04 2022
%------------------------------------------------------------------------------