TSTP Solution File: GEO261+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO261+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:19:45 EDT 2022
% Result : Theorem 0.66s 0.85s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : GEO261+3 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n003.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 18:28:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n003.cluster.edu,
% 0.12/0.35 Sat Jun 18 18:28:28 2022
% 0.12/0.35 The command was "./sos". The process ID is 13549.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.12/0.35 Following clause subsumed by 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,reverse_line(C))|unequally_directed_lines(B,reverse_line(C)).
% 0.12/0.35 Following clause subsumed by 40 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.12/0.35 Following clause subsumed by 41 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.12/0.35 Following clause subsumed by 40 during input processing: 0 [unit_del,40,41] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.12/0.35 Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.12/0.35 Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.12/0.35 Following clause subsumed by 41 during input processing: 0 [unit_del,41] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.12/0.35 40 back subsumes 20.
% 0.12/0.35 40 back subsumes 19.
% 0.12/0.35 40 back subsumes 10.
% 0.12/0.35 40 back subsumes 4.
% 0.12/0.35 41 back subsumes 6.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 67 during input processing: 0 [copy,67,flip.1] {-} equally_directed_lines(A,A).
% 0.12/0.35 74 back subsumes 49.
% 0.12/0.35 74 back subsumes 48.
% 0.12/0.35 74 back subsumes 47.
% 0.12/0.35 74 back subsumes 46.
% 0.12/0.35 74 back subsumes 9.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 50
% 0.19/0.40 number of clauses initially in problem: 60
% 0.19/0.40 percentage of clauses intially in UL: 83
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 88
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 27
% 0.19/0.40 distinct predicate count: 18
% 0.19/0.40 distinct function count: 4
% 0.19/0.40 distinct constant count: 5
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.66/0.85
% 0.66/0.85 -------- PROOF --------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 3 [ 3 1 3641 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 4 [ 2 1 1689 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 5 [ 1 0 2457 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 6 [ 1 1 2225 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 7 [ 6 1 2946 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 8 [ 2 1 2126 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 -----> EMPTY CLAUSE at 0.47 sec ----> 158 [hyper,147,7,67] {-} $F.
% 0.66/0.85
% 0.66/0.85 Length of proof is 4. Level of proof is 3.
% 0.66/0.85
% 0.66/0.85 ---------------- PROOF ----------------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 1 [] {+} -unequally_directed_opposite_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 0.66/0.85 7 [] {+} -equally_directed_lines(A,B)| -unequally_directed_lines(A,B).
% 0.66/0.85 12 [] {+} -convergent_lines(A,B)|unequally_directed_lines(A,B).
% 0.66/0.85 13 [] {+} -convergent_lines(A,B)|unequally_directed_opposite_lines(A,B).
% 0.66/0.85 39 [] {+} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 0.66/0.85 41 [] {+} -left_convergent_lines(A,B).
% 0.66/0.85 65 [] {+} equally_directed_lines(A,B)|unequally_directed_lines(A,B).
% 0.66/0.85 67 [] {+} equally_directed_lines(A,A).
% 0.66/0.85 72 [] {-} convergent_lines($c5,$c4).
% 0.66/0.85 102 [hyper,72,13] {+} unequally_directed_opposite_lines($c5,$c4).
% 0.66/0.85 103 [hyper,72,12] {+} unequally_directed_lines($c5,$c4).
% 0.66/0.85 109,108 [hyper,103,39,65,unit_del,41,41,flip.1] {-} equally_directed_lines(reverse_line($c4),$c5).
% 0.66/0.85 147 [hyper,102,1,demod,109] {-} unequally_directed_lines($c5,$c5).
% 0.66/0.85 158 [hyper,147,7,67] {-} $F.
% 0.66/0.85
% 0.66/0.85 % SZS output end Refutation
% 0.66/0.85 ------------ end of proof -------------
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85 ============ end of search ============
% 0.66/0.85
% 0.66/0.85 ----------- soft-scott stats ----------
% 0.66/0.85
% 0.66/0.85 true clauses given 0 (0.0%)
% 0.66/0.85 false clauses given 9
% 0.66/0.85
% 0.66/0.85 FALSE TRUE
% 0.66/0.85 4 1 0
% 0.66/0.85 5 2 0
% 0.66/0.85 6 9 7
% 0.66/0.85 7 1 17
% 0.66/0.85 8 2 1
% 0.66/0.85 9 5 5
% 0.66/0.85 10 3 3
% 0.66/0.85 11 0 2
% 0.66/0.85 14 4 2
% 0.66/0.85 16 0 4
% 0.66/0.85 17 0 4
% 0.66/0.85 18 0 2
% 0.66/0.85 tot: 27 47 (63.5% true)
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Model 8 [ 2 -6 2126 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 That finishes the proof of the theorem.
% 0.66/0.85
% 0.66/0.85 Process 13549 finished Sat Jun 18 18:28:29 2022
%------------------------------------------------------------------------------