TSTP Solution File: GEO254+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO254+1 : TPTP v8.1.0. Bugfixed v6.4.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:19:40 EDT 2022
% Result : Theorem 5.12s 5.29s
% Output : Refutation 5.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO254+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jun 18 14:27:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n010.cluster.edu,
% 0.14/0.36 Sat Jun 18 14:27:23 2022
% 0.14/0.36 The command was "./sos". The process ID is 27881.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=10.
% 0.14/0.36
% 0.14/0.36 This is a non-Horn set without equality. The strategy
% 0.14/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36 Following clause subsumed by 31 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.14/0.36 Following clause subsumed by 31 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.14/0.36 Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.14/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.14/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.14/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.14/0.36 Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.14/0.36 Following clause subsumed by 37 during input processing: 0 [unit_del,37] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.14/0.36 36 back subsumes 17.
% 0.14/0.36 36 back subsumes 16.
% 0.14/0.36 36 back subsumes 15.
% 0.14/0.36 36 back subsumes 14.
% 0.14/0.36 36 back subsumes 12.
% 0.14/0.36 36 back subsumes 11.
% 0.14/0.36 36 back subsumes 3.
% 0.14/0.36 36 back subsumes 2.
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 52
% 0.21/0.42 number of clauses initially in problem: 53
% 0.21/0.42 percentage of clauses intially in UL: 98
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 19
% 0.21/0.42 distinct predicate count: 12
% 0.21/0.42 distinct function count: 4
% 0.21/0.42 distinct constant count: 3
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 4.40/4.61
% 4.40/4.61
% 4.40/4.61 Changing weight limit from 60 to 27.
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Stopped by limit on insertions
% 4.40/4.61
% 4.40/4.61 Resetting weight limit to 27 after 190 givens.
% 4.40/4.61
% 4.69/4.89
% 4.69/4.89
% 4.69/4.89 Changing weight limit from 27 to 25.
% 4.69/4.89
% 4.69/4.89 Resetting weight limit to 25 after 195 givens.
% 4.69/4.89
% 5.12/5.29
% 5.12/5.29 -------- PROOF --------
% 5.12/5.29 % SZS status Theorem
% 5.12/5.29 % SZS output start Refutation
% 5.12/5.29
% 5.12/5.29 -----> EMPTY CLAUSE at 4.88 sec ----> 3462 [hyper,3457,54,3415] {-} $F.
% 5.12/5.29
% 5.12/5.29 Length of proof is 25. Level of proof is 10.
% 5.12/5.29
% 5.12/5.29 ---------------- PROOF ----------------
% 5.12/5.29 % SZS status Theorem
% 5.12/5.29 % SZS output start Refutation
% 5.12/5.29
% 5.12/5.29 18 [] {+} -before_on_line(A,B,C)| -unequally_directed_lines(A,line_connecting(B,C)).
% 5.12/5.29 19 [] {+} before_on_line(A,B,C)| -distinct_points(B,C)|left_apart_point(B,A)|left_apart_point(B,reverse_line(A))|left_apart_point(C,A)|left_apart_point(C,reverse_line(A))|unequally_directed_lines(A,line_connecting(B,C)).
% 5.12/5.29 26 [] {+} -distinct_points(A,A).
% 5.12/5.29 27 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 5.12/5.29 30 [] {+} -unequally_directed_lines(A,A).
% 5.12/5.29 31 [] {+} -unequally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 5.12/5.29 35 [] {+} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 5.12/5.29 36 [] {+} -left_apart_point(A,B).
% 5.12/5.29 37 [] {+} -left_convergent_lines(A,B).
% 5.12/5.29 48 [] {+} -unequally_directed_lines(line_connecting(A,B),reverse_line(line_connecting(B,A))).
% 5.12/5.29 54 [] {+} -before_on_line($c1,$c3,$c2)| -before_on_line($c1,$c2,$c3).
% 5.12/5.29 62 [] {-} distinct_points($c3,$c2).
% 5.12/5.29 63 [hyper,62,27] {-} distinct_points($c3,A)|distinct_points($c2,A).
% 5.12/5.29 64 [hyper,62,19,unit_del,36,36,36,36] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,line_connecting($c3,$c2)).
% 5.12/5.29 66 [hyper,63,26] {-} distinct_points($c2,$c3).
% 5.12/5.29 70 [hyper,66,19,unit_del,36,36,36,36] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(A,line_connecting($c2,$c3)).
% 5.12/5.29 72 [hyper,64,31] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,B)|unequally_directed_lines(line_connecting($c3,$c2),B).
% 5.12/5.29 96 [hyper,70,31] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(A,B)|unequally_directed_lines(line_connecting($c2,$c3),B).
% 5.12/5.29 126 [hyper,72,30] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(line_connecting($c3,$c2),A).
% 5.12/5.29 128 [hyper,72,35,72,unit_del,37,37] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(B))|before_on_line(C,$c3,$c2)|unequally_directed_lines(C,B).
% 5.12/5.29 131 [hyper,72,31] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,B)|unequally_directed_lines(line_connecting($c3,$c2),C)|unequally_directed_lines(B,C).
% 5.12/5.29 132 [factor,128.1.3] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,B).
% 5.12/5.29 139 [hyper,126,35,72,unit_del,37,37] {-} before_on_line(A,$c3,$c2)|before_on_line(B,$c3,$c2)|unequally_directed_lines(B,reverse_line(A)).
% 5.12/5.29 141 [factor,139.1.2] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(A)).
% 5.12/5.29 142 [hyper,141,48] {-} before_on_line(line_connecting(A,A),$c3,$c2).
% 5.12/5.29 208 [hyper,132,31] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 5.12/5.29 210 [factor,208.2.3] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(B,reverse_line(B)).
% 5.12/5.29 485 [hyper,96,30] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(line_connecting($c2,$c3),A).
% 5.12/5.29 501 [hyper,96,48] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(A,reverse_line(line_connecting($c3,$c2))).
% 5.12/5.29 549 [hyper,485,35,96,unit_del,37,37] {-} before_on_line(A,$c2,$c3)|before_on_line(B,$c2,$c3)|unequally_directed_lines(B,reverse_line(A)).
% 5.12/5.29 552 [factor,549.1.2] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(A,reverse_line(A)).
% 5.12/5.29 555 [hyper,552,31] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(A,B)|unequally_directed_lines(reverse_line(A),B).
% 5.12/5.29 986 [hyper,555,35,501,unit_del,37,37,factor_simp] {-} before_on_line(A,$c2,$c3)|unequally_directed_lines(reverse_line(A),line_connecting($c3,$c2)).
% 5.12/5.29 2460 [hyper,210,48] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,reverse_line(line_connecting(B,B))).
% 5.12/5.29 3376 [hyper,131,18,142,unit_del,30] {-} before_on_line(A,$c3,$c2)|unequally_directed_lines(A,line_connecting(B,B)).
% 5.12/5.29 3415 [hyper,3376,35,2460,unit_del,37,37,factor_simp] {-} before_on_line(A,$c3,$c2).
% 5.12/5.29 3457 [hyper,3415,18,986] {-} before_on_line(A,$c2,$c3).
% 5.12/5.29 3462 [hyper,3457,54,3415] {-} $F.
% 5.12/5.29
% 5.12/5.29 % SZS output end Refutation
% 5.12/5.29 ------------ end of proof -------------
% 5.12/5.29
% 5.12/5.29
% 5.12/5.29 Search stopped by max_proofs option.
% 5.12/5.29
% 5.12/5.29
% 5.12/5.29 Search stopped by max_proofs option.
% 5.12/5.29
% 5.12/5.29 ============ end of search ============
% 5.12/5.29
% 5.12/5.29 ----------- soft-scott stats ----------
% 5.12/5.29
% 5.12/5.29 true clauses given 0 (0.0%)
% 5.12/5.29 false clauses given 199
% 5.12/5.29
% 5.12/5.29 FALSE TRUE
% 5.12/5.29 7 2 0
% 5.12/5.29 8 2 0
% 5.12/5.29 9 8 0
% 5.12/5.29 10 4 0
% 5.12/5.29 11 4 0
% 5.12/5.29 12 11 0
% 5.12/5.29 13 2 0
% 5.12/5.29 14 22 0
% 5.12/5.29 15 58 0
% 5.12/5.29 16 2 0
% 5.12/5.29 17 14 0
% 5.12/5.29 18 82 0
% 5.12/5.29 19 4 0
% 5.12/5.29 20 4 0
% 5.12/5.29 22 56 0
% 5.12/5.29 25 68 0
% 5.12/5.29 tot: 343 0 (0.0% true)
% 5.12/5.29
% 5.12/5.29
% 5.12/5.29 Model 1 (0.00 seconds, 0 Inserts)
% 5.12/5.29
% 5.12/5.29 That finishes the proof of the theorem.
% 5.12/5.29
% 5.12/5.29 Process 27881 finished Sat Jun 18 14:27:28 2022
%------------------------------------------------------------------------------