TSTP Solution File: GEO002-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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:15 EDT 2022
% Result : Unsatisfiable 2.50s 2.68s
% Output : Refutation 2.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GEO002-4 : TPTP v8.1.0. Released v1.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n017.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 08:30:27 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox on n017.cluster.edu,
% 0.12/0.34 Sat Jun 18 08:30:27 2022
% 0.12/0.34 The command was "./sos". The process ID is 22704.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This is a Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.34 sos and nonpositive clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: clear(order_hyper).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 6
% 0.18/0.39 number of clauses initially in problem: 8
% 0.18/0.39 percentage of clauses intially in UL: 75
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 85
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 7
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 2
% 0.18/0.39 distinct constant count: 2
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 2.50/2.68
% 2.50/2.68 -------- PROOF --------
% 2.50/2.68 % SZS status Unsatisfiable
% 2.50/2.68 % SZS output start Refutation
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 3 [ 27 9 40875 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 4 [ 6 3 45337 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 5 [ 6 5 75207 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 6 [ 76 3 22224 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 7 [ 139 3 25218 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Model 8 [ 78 1 5290 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 Stopped by limit on insertions
% 2.50/2.68
% 2.50/2.68 ----> UNIT CONFLICT at 2.32 sec ----> 134 [binary,133.1,6.1] {+} $F.
% 2.50/2.68
% 2.50/2.68 Length of proof is 6. Level of proof is 5.
% 2.50/2.68
% 2.50/2.68 ---------------- PROOF ----------------
% 2.50/2.68 % SZS status Unsatisfiable
% 2.50/2.68 % SZS output start Refutation
% 2.50/2.68
% 2.50/2.68 1 [] {+} -between(A,B,C)| -between(B,D,C)|between(A,B,D).
% 2.50/2.68 2 [] {+} -equidistant(A,B,C,C)|equalish(A,B).
% 2.50/2.68 3 [] {+} -between(A,B,C)| -between(D,C,E)|between(A,outer_pasch(B,A,D,E,C),D).
% 2.50/2.68 4 [] {+} -between(A,B,C)| -between(D,C,E)|between(E,B,outer_pasch(B,A,D,E,C)).
% 2.50/2.68 5 [] {+} -equalish(A,B)| -between(C,D,A)|between(C,D,B).
% 2.50/2.68 6 [] {+} -between(a,a,b).
% 2.50/2.68 7 [] {+} between(A,B,extension(A,B,C,D)).
% 2.50/2.68 8 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 2.50/2.68 13 [hyper,8,2,flip.1] {+} equalish(extension(A,B,C,C),B).
% 2.50/2.68 22 [hyper,13,5,7] {-} between(A,B,B).
% 2.50/2.68 34 [hyper,22,4,22] {+} between(A,A,outer_pasch(A,B,C,A,A)).
% 2.50/2.68 36 [hyper,22,3,22] {-} between(A,outer_pasch(B,A,C,B,B),C).
% 2.50/2.68 105 [hyper,36,1,22] {-} between(A,B,outer_pasch(C,B,B,C,C)).
% 2.50/2.68 133 [hyper,105,1,34] {-} between(A,A,B).
% 2.50/2.68 134 [binary,133.1,6.1] {+} $F.
% 2.50/2.68
% 2.50/2.68 % SZS output end Refutation
% 2.50/2.68 ------------ end of proof -------------
% 2.50/2.68
% 2.50/2.68
% 2.50/2.68 Search stopped by max_proofs option.
% 2.50/2.68
% 2.50/2.68
% 2.50/2.68 Search stopped by max_proofs option.
% 2.50/2.68
% 2.50/2.68 ============ end of search ============
% 2.50/2.68
% 2.50/2.68 ----------- soft-scott stats ----------
% 2.50/2.68
% 2.50/2.68 true clauses given 2 (15.4%)
% 2.50/2.68 false clauses given 11
% 2.50/2.68
% 2.50/2.68 FALSE TRUE
% 2.50/2.68 9 0 3
% 2.50/2.68 13 4 0
% 2.50/2.68 14 8 3
% 2.50/2.68 17 1 1
% 2.50/2.68 18 1 0
% 2.50/2.68 19 6 0
% 2.50/2.68 21 1 1
% 2.50/2.68 22 0 2
% 2.50/2.68 23 1 0
% 2.50/2.68 24 3 0
% 2.50/2.68 26 9 0
% 2.50/2.68 27 1 0
% 2.50/2.68 29 2 0
% 2.50/2.68 30 1 0
% 2.50/2.68 31 1 1
% 2.50/2.68 32 1 0
% 2.50/2.68 34 2 13
% 2.50/2.68 38 1 0
% 2.50/2.68 41 2 0
% 2.50/2.68 42 2 0
% 2.50/2.68 43 3 0
% 2.50/2.68 44 0 1
% 2.50/2.68 47 1 0
% 2.50/2.68 48 1 0
% 2.50/2.68 51 3 0
% 2.50/2.68 53 1 0
% 2.50/2.68 59 2 1
% 2.50/2.68 60 1 0
% 2.50/2.68 tot: 59 26 (30.6% true)
% 2.50/2.68
% 2.50/2.68
% 2.50/2.68 Model 8 [ 78 -73 5290 ] (0.00 seconds, 250000 Inserts)
% 2.50/2.68
% 2.50/2.68 That finishes the proof of the theorem.
% 2.50/2.68
% 2.50/2.68 Process 22704 finished Sat Jun 18 08:30:29 2022
%------------------------------------------------------------------------------