%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO260+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:44 EDT 2022
% Result : Theorem 0.83s 1.03s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO260+3 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n011.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:05:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n011.cluster.edu,
% 0.19/0.36 Sat Jun 18 14:05:08 2022
% 0.19/0.36 The command was "./sos". The process ID is 28288.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36 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.19/0.36 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.19/0.36 Following clause subsumed by 40 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.19/0.36 Following clause subsumed by 41 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.19/0.36 Following clause subsumed by 40 during input processing: 0 [unit_del,40,41] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.19/0.36 Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.19/0.36 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.19/0.36 Following clause subsumed by 41 during input processing: 0 [unit_del,41] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.19/0.36 40 back subsumes 20.
% 0.19/0.36 40 back subsumes 19.
% 0.19/0.36 40 back subsumes 10.
% 0.19/0.36 40 back subsumes 4.
% 0.19/0.36 41 back subsumes 6.
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] {-} equally_directed_lines(A,A).
% 0.19/0.36 72 back subsumes 49.
% 0.19/0.36 72 back subsumes 48.
% 0.19/0.36 72 back subsumes 47.
% 0.19/0.36 72 back subsumes 46.
% 0.19/0.36 72 back subsumes 9.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.41
% 0.19/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 -------------- Softie stats --------------
% 0.19/0.41
% 0.19/0.41 UPDATE_STOP: 300
% 0.19/0.41 SFINDER_TIME_LIMIT: 2
% 0.19/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.41 number of clauses in intial UL: 49
% 0.19/0.41 number of clauses initially in problem: 58
% 0.19/0.41 percentage of clauses intially in UL: 84
% 0.19/0.41 percentage of distinct symbols occuring in initial UL: 80
% 0.19/0.41 percent of all initial clauses that are short: 100
% 0.19/0.41 absolute distinct symbol count: 26
% 0.19/0.41 distinct predicate count: 18
% 0.19/0.41 distinct function count: 4
% 0.19/0.41 distinct constant count: 4
% 0.19/0.41
% 0.19/0.41 ---------- no more Softie stats ----------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 =========== start of search ===========
% 0.83/1.03
% 0.83/1.03 -------- PROOF --------
% 0.83/1.03 % SZS status Theorem
% 0.83/1.03 % SZS output start Refutation
% 0.83/1.03
% 0.83/1.03 Model 3 (0.00 seconds, 0 Inserts)
% 0.83/1.03
% 0.83/1.03 Stopped by limit on number of solutions
% 0.83/1.03
% 0.83/1.03 Model 4 (0.00 seconds, 0 Inserts)
% 0.83/1.03
% 0.83/1.03 Stopped by limit on number of solutions
% 0.83/1.03
% 0.83/1.03 Stopped by limit on insertions
% 0.83/1.03
% 0.83/1.03 Model 5 (0.00 seconds, 0 Inserts)
% 0.83/1.03
% 0.83/1.03 Stopped by limit on number of solutions
% 0.83/1.03
% 0.83/1.03 Model 6 [ 4 2 9380 ] (0.00 seconds, 10196 Inserts)
% 0.83/1.03
% 0.83/1.03 Model 7 [ 9 1 4752 ] (0.00 seconds, 5771 Inserts)
% 0.83/1.03
% 0.83/1.03 Stopped by limit on insertions
% 0.83/1.03
% 0.83/1.03 Model 8 [ 8 1 4836 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.03
% 0.83/1.03 Stopped by limit on insertions
% 0.83/1.03
% 0.83/1.03 -----> EMPTY CLAUSE at 0.65 sec ----> 405 [hyper,390,39,211,demod,403,403,403,403,403,unit_del,41,41] {-} $F.
% 0.83/1.03
% 0.83/1.03 Length of proof is 12. Level of proof is 7.
% 0.83/1.03
% 0.83/1.03 ---------------- PROOF ----------------
% 0.83/1.03 % SZS status Theorem
% 0.83/1.03 % SZS output start Refutation
% 0.83/1.03
% 0.83/1.03 1 [] {+} -unequally_directed_opposite_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 0.83/1.03 7 [] {+} -equally_directed_lines(A,B)| -unequally_directed_lines(A,B).
% 0.83/1.03 13 [] {+} -convergent_lines(A,B)|unequally_directed_opposite_lines(A,B).
% 0.83/1.03 14 [] {+} convergent_lines(A,B)| -unequally_directed_lines(A,B)| -unequally_directed_opposite_lines(A,B).
% 0.83/1.03 36 [] {+} -unequally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.83/1.03 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.83/1.03 41 [] {+} -left_convergent_lines(A,B).
% 0.83/1.03 62 [factor,36.2.3] {+} -unequally_directed_lines(A,A)|unequally_directed_lines(A,B).
% 0.83/1.03 64 [] {+} equally_directed_lines(A,B)|unequally_directed_lines(A,B).
% 0.83/1.03 65 [] {-} equally_directed_opposite_lines(A,B)|unequally_directed_opposite_lines(A,B).
% 0.83/1.03 67 [] {+} unequally_directed_lines(A,B)|unequally_directed_lines(A,reverse_line(B)).
% 0.83/1.03 69,68 [] {+} equally_directed_lines(parallel_through_point(A,B),A).
% 0.83/1.03 74 [hyper,64,36] {+} equally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.83/1.03 97 [para_into,68.1.1,64.1.1,demod,69] {+} equally_directed_lines(A,B)|unequally_directed_lines(B,A).
% 0.83/1.03 117 [para_from,65.1.1,68.1.1,demod,69] {+} equally_directed_lines(A,B)|unequally_directed_opposite_lines(B,A).
% 0.83/1.03 183 [hyper,97,14,117,factor_simp] {-} equally_directed_lines(A,B)|convergent_lines(B,A).
% 0.83/1.03 211 [hyper,67,62,factor_simp] {+} unequally_directed_lines(A,reverse_line(A)).
% 0.83/1.03 300 [hyper,183,7,211] {-} convergent_lines(reverse_line(A),A).
% 0.83/1.03 332 [hyper,300,13] {-} unequally_directed_opposite_lines(reverse_line(A),A).
% 0.83/1.03 386 [para_from,74.1.1,1.2.2] {+} -unequally_directed_opposite_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(reverse_line(B),D)|unequally_directed_lines(C,D).
% 0.83/1.03 389 [factor,386.2.3,unit_del,332] {-} unequally_directed_lines(reverse_line(A),B)|unequally_directed_lines(B,B).
% 0.83/1.03 390 [factor,389.1.2] {-} unequally_directed_lines(reverse_line(A),reverse_line(A)).
% 0.83/1.03 403,402 [hyper,390,39,97,unit_del,41,41,flip.1] {-} equally_directed_lines(reverse_line(A),A).
% 0.83/1.03 405 [hyper,390,39,211,demod,403,403,403,403,403,unit_del,41,41] {-} $F.
% 0.83/1.03
% 0.83/1.03 % SZS output end Refutation
% 0.83/1.03 ------------ end of proof -------------
% 0.83/1.03
% 0.83/1.03
% 0.83/1.03 Search stopped by max_proofs option.
% 0.83/1.03
% 0.83/1.03
% 0.83/1.03 Search stopped by max_proofs option.
% 0.83/1.03
% 0.83/1.03 ============ end of search ============
% 0.83/1.03
% 0.83/1.03 ----------- soft-scott stats ----------
% 0.83/1.03
% 0.83/1.03 true clauses given 5 (26.3%)
% 0.83/1.03 false clauses given 14
% 0.83/1.03
% 0.83/1.03 FALSE TRUE
% 0.83/1.03 4 0 1
% 0.83/1.03 5 0 1
% 0.83/1.03 6 1 1
% 0.83/1.03 7 20 27
% 0.83/1.03 8 51 16
% 0.83/1.03 9 18 6
% 0.83/1.03 10 14 27
% 0.83/1.03 11 8 24
% 0.83/1.03 12 0 7
% 0.83/1.03 13 0 14
% 0.83/1.03 14 0 16
% 0.83/1.03 15 0 6
% 0.83/1.03 16 0 5
% 0.83/1.03 17 0 13
% 0.83/1.03 18 0 9
% 0.83/1.03 19 0 2
% 0.83/1.03 20 0 2
% 0.83/1.03 21 0 1
% 0.83/1.03 tot: 112 178 (61.4% true)
% 0.83/1.03
% 0.83/1.03
% 0.83/1.03 Model 8 [ 8 -34 4836 ] (0.00 seconds, 250000 Inserts)
% 0.83/1.03
% 0.83/1.03 That finishes the proof of the theorem.
% 0.83/1.03
% 0.83/1.03 Process 28288 finished Sat Jun 18 14:05:08 2022
%------------------------------------------------------------------------------