TSTP Solution File: GEO215+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO215+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:16 EDT 2022
% Result : Theorem 2.10s 2.29s
% Output : Refutation 2.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO215+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n007.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 13:49:43 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 sandbox on n007.cluster.edu,
% 0.12/0.35 Sat Jun 18 13:49:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 26291.
% 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=0, symmetry=0, max_lits=6.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 6 during input processing: 0 [] {-} -convergent_lines(A,B)| -unorthogonal_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 25
% 0.12/0.39 number of clauses initially in problem: 27
% 0.12/0.39 percentage of clauses intially in UL: 92
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 12
% 0.12/0.39 distinct predicate count: 5
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 3
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 2.10/2.29
% 2.10/2.29 -------- PROOF --------
% 2.10/2.29 % SZS status Theorem
% 2.10/2.29 % SZS output start Refutation
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 3 [ 5 1 525 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 4 [ 1 1 1322 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 5 [ 20 1 541 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 6 [ 13 0 333 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 7 [ 22 1 115 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 8 [ 12 5 207244 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 9 [ 32 1 189 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 10 [ 19 1 636 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 11 [ 40 1 166 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 Model 12 [ 27 0 342 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 Stopped by limit on insertions
% 2.10/2.29
% 2.10/2.29 -----> EMPTY CLAUSE at 1.92 sec ----> 304 [hyper,290,9,60,unit_del,1,3] {-} $F.
% 2.10/2.29
% 2.10/2.29 Length of proof is 8. Level of proof is 5.
% 2.10/2.29
% 2.10/2.29 ---------------- PROOF ----------------
% 2.10/2.29 % SZS status Theorem
% 2.10/2.29 % SZS output start Refutation
% 2.10/2.29
% 2.10/2.29 1 [] {+} -distinct_points(A,A).
% 2.10/2.29 3 [] {+} -convergent_lines(A,A).
% 2.10/2.29 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 2.10/2.29 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 2.10/2.29 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 2.10/2.29 14 [] {+} -convergent_lines(A,B)|distinct_lines(A,B).
% 2.10/2.29 23 [] {+} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|unorthogonal_lines(A,D)|unorthogonal_lines(B,D).
% 2.10/2.29 24 [] {+} -unorthogonal_lines($c3,$c1).
% 2.10/2.29 25 [] {+} -unorthogonal_lines($c2,$c1).
% 2.10/2.29 27 [] {-} convergent_lines($c3,$c2).
% 2.10/2.29 31 [hyper,27,14] {+} distinct_lines($c3,$c2).
% 2.10/2.29 32 [hyper,27,6] {-} convergent_lines($c3,A)|convergent_lines($c2,A).
% 2.10/2.29 33 [hyper,31,23] {+} apart_point_and_line(A,$c3)|apart_point_and_line(A,$c2)|unorthogonal_lines($c3,B)|unorthogonal_lines($c2,B).
% 2.10/2.29 42 [hyper,32,6] {-} convergent_lines($c2,A)|convergent_lines($c3,B)|convergent_lines(A,B).
% 2.10/2.29 51 [hyper,33,24,unit_del,25] {+} apart_point_and_line(A,$c3)|apart_point_and_line(A,$c2).
% 2.10/2.29 60 [hyper,42,3] {-} convergent_lines($c2,A)|convergent_lines(A,$c3).
% 2.10/2.29 87 [hyper,51,10,60,unit_del,3] {-} apart_point_and_line(A,$c2)|distinct_points(A,intersection_point($c2,$c3)).
% 2.10/2.29 290 [hyper,87,1] {-} apart_point_and_line(intersection_point($c2,$c3),$c2).
% 2.10/2.29 304 [hyper,290,9,60,unit_del,1,3] {-} $F.
% 2.10/2.29
% 2.10/2.29 % SZS output end Refutation
% 2.10/2.29 ------------ end of proof -------------
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Search stopped by max_proofs option.
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Search stopped by max_proofs option.
% 2.10/2.29
% 2.10/2.29 ============ end of search ============
% 2.10/2.29
% 2.10/2.29 ----------- soft-scott stats ----------
% 2.10/2.29
% 2.10/2.29 true clauses given 15 (31.2%)
% 2.10/2.29 false clauses given 33
% 2.10/2.29
% 2.10/2.29 FALSE TRUE
% 2.10/2.29 6 0 5
% 2.10/2.29 7 0 1
% 2.10/2.29 8 8 9
% 2.10/2.29 9 12 13
% 2.10/2.29 10 3 4
% 2.10/2.29 11 13 4
% 2.10/2.29 12 5 1
% 2.10/2.29 13 3 6
% 2.10/2.29 14 4 0
% 2.10/2.29 15 4 11
% 2.10/2.29 16 3 1
% 2.10/2.29 17 1 0
% 2.10/2.29 18 2 17
% 2.10/2.29 19 2 8
% 2.10/2.29 20 1 9
% 2.10/2.29 21 4 15
% 2.10/2.29 22 6 7
% 2.10/2.29 23 5 5
% 2.10/2.29 24 0 9
% 2.10/2.29 26 1 1
% 2.10/2.29 27 2 1
% 2.10/2.29 tot: 79 127 (61.7% true)
% 2.10/2.29
% 2.10/2.29
% 2.10/2.29 Model 12 [ 27 -23 342 ] (0.00 seconds, 250000 Inserts)
% 2.10/2.29
% 2.10/2.29 That finishes the proof of the theorem.
% 2.10/2.29
% 2.10/2.29 Process 26291 finished Sat Jun 18 13:49:45 2022
%------------------------------------------------------------------------------