TSTP Solution File: GEO058-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO058-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:47 EDT 2022
% Result : Unsatisfiable 3.41s 3.61s
% Output : Refutation 3.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO058-2 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.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 14:56:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n013.cluster.edu,
% 0.13/0.36 Sat Jun 18 14:56:14 2022
% 0.13/0.36 The command was "./sos". The process ID is 6062.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 36 back subsumes 33.
% 0.13/0.36 Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.69/0.88
% 0.69/0.88 Model 1 (0.00 seconds, 0 Inserts)
% 0.69/0.88
% 0.69/0.88 Stopped by limit on number of solutions
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 -------------- Softie stats --------------
% 0.69/0.88
% 0.69/0.88 UPDATE_STOP: 300
% 0.69/0.88 SFINDER_TIME_LIMIT: 2
% 0.69/0.88 SHORT_CLAUSE_CUTOFF: 4
% 0.69/0.88 number of clauses in intial UL: 33
% 0.69/0.88 number of clauses initially in problem: 41
% 0.69/0.88 percentage of clauses intially in UL: 80
% 0.69/0.88 percentage of distinct symbols occuring in initial UL: 85
% 0.69/0.88 percent of all initial clauses that are short: 100
% 0.69/0.88 absolute distinct symbol count: 14
% 0.69/0.88 distinct predicate count: 3
% 0.69/0.88 distinct function count: 6
% 0.69/0.88 distinct constant count: 5
% 0.69/0.88
% 0.69/0.88 ---------- no more Softie stats ----------
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88
% 0.69/0.88 Model 2 (0.00 seconds, 0 Inserts)
% 0.69/0.88
% 0.69/0.88 Stopped by limit on number of solutions
% 0.69/0.88
% 0.69/0.88 =========== start of search ===========
% 3.41/3.61
% 3.41/3.61 -------- PROOF --------
% 3.41/3.61 % SZS status Unsatisfiable
% 3.41/3.61 % SZS output start Refutation
% 3.41/3.61
% 3.41/3.61 Model 3 (0.00 seconds, 0 Inserts)
% 3.41/3.61
% 3.41/3.61 Stopped by limit on number of solutions
% 3.41/3.61
% 3.41/3.61 Stopped by limit on insertions
% 3.41/3.61
% 3.41/3.61 Model 4 [ 3 47 197585 ] (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 Model 5 (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 Stopped by limit on number of solutions
% 3.41/3.61
% 3.41/3.61 Stopped by limit on insertions
% 3.41/3.61
% 3.41/3.61 Model 6 [ 39 36 152264 ] (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 Stopped by limit on insertions
% 3.41/3.61
% 3.41/3.61 Model 7 [ 95 29 130715 ] (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 Stopped by limit on insertions
% 3.41/3.61
% 3.41/3.61 Model 8 [ 102 4 11448 ] (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 ----> UNIT CONFLICT at 3.22 sec ----> 310 [binary,308.1,17.1] {-} $F.
% 3.41/3.61
% 3.41/3.61 Length of proof is 7. Level of proof is 4.
% 3.41/3.61
% 3.41/3.61 ---------------- PROOF ----------------
% 3.41/3.61 % SZS status Unsatisfiable
% 3.41/3.61 % SZS output start Refutation
% 3.41/3.61
% 3.41/3.61 1 [] {+} -equidistant(A,B,C,D)| -equidistant(A,B,E,F)|equidistant(C,D,E,F).
% 3.41/3.61 2 [] {+} -equidistant(A,B,C,C)|A=B.
% 3.41/3.61 16 [] {-} u!=v.
% 3.41/3.61 17 [copy,16,flip.1] {+} v!=u.
% 3.41/3.61 18 [factor,1.1.2] {+} -equidistant(A,B,C,D)|equidistant(C,D,C,D).
% 3.41/3.61 36 [] {+} equidistant(A,B,B,A).
% 3.41/3.61 38 [] {+} equidistant(A,extension(B,A,C,D),C,D).
% 3.41/3.61 40,39 [] {-} reflection(A,B)=extension(A,B,A,B).
% 3.41/3.61 41 [] {-} v=reflection(u,v).
% 3.41/3.61 42 [copy,41,demod,40,flip.1] {+} extension(u,v,u,v)=v.
% 3.41/3.61 45 [hyper,36,18] {+} equidistant(A,B,A,B).
% 3.41/3.61 161 [para_into,38.1.2,42.1.1] {+} equidistant(v,v,u,v).
% 3.41/3.61 182 [hyper,161,1,45] {-} equidistant(u,v,v,v).
% 3.41/3.61 308 [hyper,182,2,flip.1] {-} v=u.
% 3.41/3.61 310 [binary,308.1,17.1] {-} $F.
% 3.41/3.61
% 3.41/3.61 % SZS output end Refutation
% 3.41/3.61 ------------ end of proof -------------
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 Search stopped by max_proofs option.
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 Search stopped by max_proofs option.
% 3.41/3.61
% 3.41/3.61 ============ end of search ============
% 3.41/3.61
% 3.41/3.61 ----------- soft-scott stats ----------
% 3.41/3.61
% 3.41/3.61 true clauses given 1 (11.1%)
% 3.41/3.61 false clauses given 8
% 3.41/3.61
% 3.41/3.61 FALSE TRUE
% 3.41/3.61 7 1 1
% 3.41/3.61 8 0 4
% 3.41/3.61 9 8 7
% 3.41/3.61 10 4 0
% 3.41/3.61 11 0 5
% 3.41/3.61 12 0 5
% 3.41/3.61 13 3 4
% 3.41/3.61 14 2 5
% 3.41/3.61 15 1 0
% 3.41/3.61 16 3 6
% 3.41/3.61 17 2 7
% 3.41/3.61 18 7 2
% 3.41/3.61 19 1 0
% 3.41/3.61 20 2 10
% 3.41/3.61 21 0 7
% 3.41/3.61 22 9 7
% 3.41/3.61 23 4 4
% 3.41/3.61 24 4 9
% 3.41/3.61 25 0 6
% 3.41/3.61 26 0 10
% 3.41/3.61 27 8 2
% 3.41/3.61 28 0 1
% 3.41/3.61 29 1 8
% 3.41/3.61 30 3 1
% 3.41/3.61 31 0 6
% 3.41/3.61 32 4 6
% 3.41/3.61 33 3 10
% 3.41/3.61 34 4 4
% 3.41/3.61 35 2 8
% 3.41/3.61 36 1 2
% 3.41/3.61 37 2 3
% 3.41/3.61 38 2 4
% 3.41/3.61 39 2 0
% 3.41/3.61 40 0 5
% 3.41/3.61 41 0 1
% 3.41/3.61 42 1 0
% 3.41/3.61 43 2 0
% 3.41/3.61 44 1 1
% 3.41/3.61 45 0 2
% 3.41/3.61 49 0 1
% 3.41/3.61 50 0 1
% 3.41/3.61 tot: 87 165 (65.5% true)
% 3.41/3.61
% 3.41/3.61
% 3.41/3.61 Model 8 [ 102 -26 11448 ] (0.00 seconds, 250000 Inserts)
% 3.41/3.61
% 3.41/3.61 That finishes the proof of the theorem.
% 3.41/3.61
% 3.41/3.61 Process 6062 finished Sat Jun 18 14:56:17 2022
%------------------------------------------------------------------------------