TSTP Solution File: GEO255+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO255+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:41 EDT 2022
% Result : Theorem 0.88s 1.04s
% Output : Refutation 0.88s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO255+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 15:01:04 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.12/0.35 Sat Jun 18 15:01:04 2022
% 0.12/0.35 The command was "./sos". The process ID is 29006.
% 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 66 during input processing: 0 [copy,66,flip.1] {-} equally_directed_lines(A,A).
% 0.12/0.35 72 back subsumes 49.
% 0.12/0.35 72 back subsumes 48.
% 0.12/0.35 72 back subsumes 47.
% 0.12/0.35 72 back subsumes 46.
% 0.12/0.35 72 back subsumes 9.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 49
% 0.20/0.39 number of clauses initially in problem: 58
% 0.20/0.39 percentage of clauses intially in UL: 84
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 84
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 25
% 0.20/0.39 distinct predicate count: 18
% 0.20/0.39 distinct function count: 4
% 0.20/0.39 distinct constant count: 3
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.88/1.04
% 0.88/1.04 -------- PROOF --------
% 0.88/1.04 % SZS status Theorem
% 0.88/1.04 % SZS output start Refutation
% 0.88/1.04
% 0.88/1.04 Model 3 (0.00 seconds, 0 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on number of solutions
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Model 4 [ 2 1 2323 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Model 5 (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on number of solutions
% 0.88/1.04
% 0.88/1.04 Model 6 (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on number of solutions
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Model 7 [ 3 1 1915 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Model 8 [ 2 1 2480 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Model 9 (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on number of solutions
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Model 10 [ 9 1 4649 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Stopped by limit on insertions
% 0.88/1.04
% 0.88/1.04 Model 11 [ 12 1 2970 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 -----> EMPTY CLAUSE at 0.67 sec ----> 199 [para_from,154.1.1,39.4.2,demod,155,unit_del,197,197,41,41] {-} $F.
% 0.88/1.04
% 0.88/1.04 Length of proof is 6. Level of proof is 3.
% 0.88/1.04
% 0.88/1.04 ---------------- PROOF ----------------
% 0.88/1.04 % SZS status Theorem
% 0.88/1.04 % SZS output start Refutation
% 0.88/1.04
% 0.88/1.04 21 [] {+} -before_on_line(A,B,C)|distinct_points(B,C).
% 0.88/1.04 24 [] {+} -before_on_line(A,B,C)|equally_directed_lines(A,line_connecting(B,C)).
% 0.88/1.04 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.88/1.04 41 [] {+} -left_convergent_lines(A,B).
% 0.88/1.04 52 [] {-} -distinct_points(A,B)|equally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))).
% 0.88/1.04 53 [copy,52,flip.2] {+} -distinct_points(A,B)|equally_directed_lines(reverse_line(line_connecting(B,A)),line_connecting(A,B)).
% 0.88/1.04 67 [] {-} unequally_directed_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 0.88/1.04 70 [] {+} before_on_line($c3,$c2,$c1).
% 0.88/1.04 71 [] {+} before_on_line($c3,$c1,$c2).
% 0.88/1.04 98,97 [hyper,71,24,flip.1] {+} equally_directed_lines(line_connecting($c1,$c2),$c3).
% 0.88/1.04 101 [hyper,71,21] {+} distinct_points($c1,$c2).
% 0.88/1.04 140,139 [hyper,70,24,flip.1] {+} equally_directed_lines(line_connecting($c2,$c1),$c3).
% 0.88/1.04 155,154 [hyper,101,53,demod,140,98] {+} equally_directed_lines(reverse_line($c3),$c3).
% 0.88/1.04 197 [para_from,154.1.1,67.2.2,factor_simp] {-} unequally_directed_lines(A,$c3).
% 0.88/1.04 199 [para_from,154.1.1,39.4.2,demod,155,unit_del,197,197,41,41] {-} $F.
% 0.88/1.04
% 0.88/1.04 % SZS output end Refutation
% 0.88/1.04 ------------ end of proof -------------
% 0.88/1.04
% 0.88/1.04
% 0.88/1.04 Search stopped by max_proofs option.
% 0.88/1.04
% 0.88/1.04
% 0.88/1.04 Search stopped by max_proofs option.
% 0.88/1.04
% 0.88/1.04 ============ end of search ============
% 0.88/1.04
% 0.88/1.04 ----------- soft-scott stats ----------
% 0.88/1.04
% 0.88/1.04 true clauses given 1 (8.3%)
% 0.88/1.04 false clauses given 11
% 0.88/1.04
% 0.88/1.04 FALSE TRUE
% 0.88/1.04 3 1 1
% 0.88/1.04 4 2 0
% 0.88/1.04 5 2 2
% 0.88/1.04 6 8 3
% 0.88/1.04 7 15 12
% 0.88/1.04 8 3 5
% 0.88/1.04 9 3 11
% 0.88/1.04 10 3 12
% 0.88/1.04 11 0 3
% 0.88/1.04 12 0 3
% 0.88/1.04 13 0 2
% 0.88/1.04 14 0 6
% 0.88/1.04 16 0 4
% 0.88/1.04 17 0 4
% 0.88/1.04 18 0 2
% 0.88/1.04 tot: 37 70 (65.4% true)
% 0.88/1.04
% 0.88/1.04
% 0.88/1.04 Model 11 [ 12 1 2970 ] (0.00 seconds, 250000 Inserts)
% 0.88/1.04
% 0.88/1.04 That finishes the proof of the theorem.
% 0.88/1.04
% 0.88/1.04 Process 29006 finished Sat Jun 18 15:01:05 2022
%------------------------------------------------------------------------------