TSTP Solution File: GEO059-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO059-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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:48 EDT 2022
% Result : Unsatisfiable 2.41s 2.60s
% Output : Refutation 2.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GEO059-3 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n010.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jun 18 14:08:38 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.39 ----- Otter 3.2, August 2001 -----
% 0.15/0.39 The process was started by sandbox2 on n010.cluster.edu,
% 0.15/0.39 Sat Jun 18 14:08:38 2022
% 0.15/0.39 The command was "./sos". The process ID is 7082.
% 0.15/0.39
% 0.15/0.39 set(prolog_style_variables).
% 0.15/0.39 set(auto).
% 0.15/0.39 dependent: set(auto1).
% 0.15/0.39 dependent: set(process_input).
% 0.15/0.39 dependent: clear(print_kept).
% 0.15/0.39 dependent: clear(print_new_demod).
% 0.15/0.39 dependent: clear(print_back_demod).
% 0.15/0.39 dependent: clear(print_back_sub).
% 0.15/0.39 dependent: set(control_memory).
% 0.15/0.39 dependent: assign(max_mem, 12000).
% 0.15/0.39 dependent: assign(pick_given_ratio, 4).
% 0.15/0.39 dependent: assign(stats_level, 1).
% 0.15/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.39 dependent: assign(sos_limit, 5000).
% 0.15/0.39 dependent: assign(max_weight, 60).
% 0.15/0.39 clear(print_given).
% 0.15/0.39
% 0.15/0.39 list(usable).
% 0.15/0.39
% 0.15/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.15/0.39
% 0.15/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.39 clauses in usable.
% 0.15/0.39
% 0.15/0.39 dependent: set(knuth_bendix).
% 0.15/0.39 dependent: set(para_from).
% 0.15/0.39 dependent: set(para_into).
% 0.15/0.39 dependent: clear(para_from_right).
% 0.15/0.39 dependent: clear(para_into_right).
% 0.15/0.39 dependent: set(para_from_vars).
% 0.15/0.39 dependent: set(eq_units_both_ways).
% 0.15/0.39 dependent: set(dynamic_demod_all).
% 0.15/0.39 dependent: set(dynamic_demod).
% 0.15/0.39 dependent: set(order_eq).
% 0.15/0.39 dependent: set(back_demod).
% 0.15/0.39 dependent: set(lrpo).
% 0.15/0.39 dependent: set(hyper_res).
% 0.15/0.39 dependent: set(unit_deletion).
% 0.15/0.39 dependent: set(factor).
% 0.15/0.39
% 0.15/0.39 ------------> process usable:
% 0.15/0.39
% 0.15/0.39 ------------> process sos:
% 0.15/0.39 Following clause subsumed by 54 during input processing: 0 [demod,57] {-} between(A,B,extension(A,B,A,B)).
% 0.15/0.39 Following clause subsumed by 55 during input processing: 0 [demod,57] {-} equidistant(A,extension(B,A,B,A),B,A).
% 0.15/0.39 Following clause subsumed by 63 during input processing: 0 [] {-} A=A.
% 0.15/0.39 53 back subsumes 50.
% 0.15/0.39 58 back subsumes 48.
% 0.15/0.39 58 back subsumes 35.
% 0.15/0.39 Following clause subsumed by 63 during input processing: 0 [copy,63,flip.1] {-} A=A.
% 0.15/0.39 63 back subsumes 49.
% 0.15/0.39 64 back subsumes 36.
% 0.15/0.39
% 0.15/0.39 ======= end of input processing =======
% 0.77/0.96
% 0.77/0.96 Model 1 (0.00 seconds, 0 Inserts)
% 0.77/0.96
% 0.77/0.96 Stopped by limit on number of solutions
% 0.77/0.96
% 0.77/0.96
% 0.77/0.96 -------------- Softie stats --------------
% 0.77/0.96
% 0.77/0.96 UPDATE_STOP: 300
% 0.77/0.96 SFINDER_TIME_LIMIT: 2
% 0.77/0.96 SHORT_CLAUSE_CUTOFF: 4
% 0.77/0.96 number of clauses in intial UL: 41
% 0.77/0.96 number of clauses initially in problem: 55
% 0.77/0.96 percentage of clauses intially in UL: 74
% 0.77/0.96 percentage of distinct symbols occuring in initial UL: 78
% 0.77/0.96 percent of all initial clauses that are short: 100
% 0.77/0.96 absolute distinct symbol count: 14
% 0.77/0.96 distinct predicate count: 3
% 0.77/0.96 distinct function count: 6
% 0.77/0.96 distinct constant count: 5
% 0.77/0.96
% 0.77/0.96 ---------- no more Softie stats ----------
% 0.77/0.96
% 0.77/0.96
% 0.77/0.96
% 0.77/0.96 Model 2 (0.00 seconds, 0 Inserts)
% 0.77/0.96
% 0.77/0.96 Stopped by limit on number of solutions
% 0.77/0.96
% 0.77/0.96 =========== start of search ===========
% 2.41/2.60
% 2.41/2.60 -------- PROOF --------
% 2.41/2.60 % SZS status Unsatisfiable
% 2.41/2.60 % SZS output start Refutation
% 2.41/2.60
% 2.41/2.60 Model 3 (0.00 seconds, 0 Inserts)
% 2.41/2.60
% 2.41/2.60 Stopped by limit on number of solutions
% 2.41/2.60
% 2.41/2.60 Model 4 (0.00 seconds, 0 Inserts)
% 2.41/2.60
% 2.41/2.60 Stopped by limit on number of solutions
% 2.41/2.60
% 2.41/2.60 Stopped by limit on insertions
% 2.41/2.60
% 2.41/2.60 Model 5 [ 36 53 228902 ] (0.00 seconds, 250000 Inserts)
% 2.41/2.60
% 2.41/2.60 ----> UNIT CONFLICT at 2.19 sec ----> 339 [binary,338.1,66.1] {+} $F.
% 2.41/2.60
% 2.41/2.60 Length of proof is 3. Level of proof is 2.
% 2.41/2.60
% 2.41/2.60 ---------------- PROOF ----------------
% 2.41/2.60 % SZS status Unsatisfiable
% 2.41/2.60 % SZS output start Refutation
% 2.41/2.60
% 2.41/2.60 21 [] {+} -equidistant(A,B,C,D)|equidistant(D,C,A,B).
% 2.41/2.60 23 [] {+} -equidistant(A,B,C,D)| -equidistant(C,D,E,F)|equidistant(A,B,E,F).
% 2.41/2.60 34 [] {-} -equidistant(v,u,v,reflection(reflection(u,v),v)).
% 2.41/2.60 55 [] {-} equidistant(A,extension(B,A,C,D),C,D).
% 2.41/2.60 57,56 [] {+} reflection(A,B)=extension(A,B,A,B).
% 2.41/2.60 66 [back_demod,34,demod,57,57] {+} -equidistant(v,u,v,extension(extension(u,v,u,v),v,extension(u,v,u,v),v)).
% 2.41/2.60 94 [hyper,55,21] {-} equidistant(A,B,C,extension(D,C,B,A)).
% 2.41/2.60 338 [hyper,94,23,94] {-} equidistant(A,B,C,extension(D,C,extension(E,F,B,A),F)).
% 2.41/2.60 339 [binary,338.1,66.1] {+} $F.
% 2.41/2.60
% 2.41/2.60 % SZS output end Refutation
% 2.41/2.60 ------------ end of proof -------------
% 2.41/2.60
% 2.41/2.60
% 2.41/2.60 Search stopped by max_proofs option.
% 2.41/2.60
% 2.41/2.60
% 2.41/2.60 Search stopped by max_proofs option.
% 2.41/2.60
% 2.41/2.60 ============ end of search ============
% 2.41/2.60
% 2.41/2.60 ----------- soft-scott stats ----------
% 2.41/2.60
% 2.41/2.60 true clauses given 5 (35.7%)
% 2.41/2.60 false clauses given 9
% 2.41/2.60
% 2.41/2.60 FALSE TRUE
% 2.41/2.60 8 0 10
% 2.41/2.60 9 3 2
% 2.41/2.60 10 1 2
% 2.41/2.60 11 0 1
% 2.41/2.60 12 0 3
% 2.41/2.60 13 20 2
% 2.41/2.60 14 4 4
% 2.41/2.60 15 0 3
% 2.41/2.60 16 0 6
% 2.41/2.60 17 8 9
% 2.41/2.60 18 0 7
% 2.41/2.60 19 0 5
% 2.41/2.60 20 0 11
% 2.41/2.60 21 4 5
% 2.41/2.60 22 2 2
% 2.41/2.60 23 0 5
% 2.41/2.60 24 4 4
% 2.41/2.60 25 2 4
% 2.41/2.60 26 0 1
% 2.41/2.60 27 2 1
% 2.41/2.60 28 0 6
% 2.41/2.60 29 14 4
% 2.41/2.60 30 4 1
% 2.41/2.60 31 4 2
% 2.41/2.60 32 2 3
% 2.41/2.60 33 0 4
% 2.41/2.60 34 12 0
% 2.41/2.60 35 0 1
% 2.41/2.60 36 4 1
% 2.41/2.60 37 0 3
% 2.41/2.60 38 0 5
% 2.41/2.60 39 4 1
% 2.41/2.60 42 0 1
% 2.41/2.60 43 4 1
% 2.41/2.60 44 4 0
% 2.41/2.60 45 1 2
% 2.41/2.60 46 2 0
% 2.41/2.60 47 2 0
% 2.41/2.60 49 0 1
% 2.41/2.60 50 4 0
% 2.41/2.60 tot: 111 123 (52.6% true)
% 2.41/2.60
% 2.41/2.60
% 2.41/2.60 Model 5 [ 36 -38 228902 ] (0.00 seconds, 250000 Inserts)
% 2.41/2.60
% 2.41/2.60 That finishes the proof of the theorem.
% 2.41/2.60
% 2.41/2.60 Process 7082 finished Sat Jun 18 14:08:40 2022
%------------------------------------------------------------------------------