TSTP Solution File: GEO190+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO190+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:18:55 EDT 2022
% Result : Theorem 2.13s 2.34s
% Output : Refutation 2.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO190+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n006.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 06:50:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n006.cluster.edu,
% 0.13/0.36 Sat Jun 18 06:50:55 2022
% 0.13/0.36 The command was "./sos". The process ID is 19042.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This is a non-Horn set without equality. The strategy
% 0.13/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 15
% 0.13/0.38 number of clauses initially in problem: 19
% 0.13/0.38 percentage of clauses intially in UL: 78
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 9
% 0.13/0.38 distinct predicate count: 4
% 0.13/0.38 distinct function count: 2
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 2.13/2.34
% 2.13/2.34 -------- PROOF --------
% 2.13/2.34 % SZS status Theorem
% 2.13/2.34 % SZS output start Refutation
% 2.13/2.34
% 2.13/2.34 Model 2 (0.00 seconds, 0 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on number of solutions
% 2.13/2.34
% 2.13/2.34 Model 3 (0.00 seconds, 0 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on number of solutions
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 4 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 5 [ 1 0 67 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 6 [ 1 0 63 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 7 [ 2 0 119 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 8 [ 2 1 74 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 9 [ 2 0 82 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 10 [ 3 0 74 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 11 [ 3 1 100 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 12 [ 4 0 69 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 13 [ 4 0 81 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 14 [ 5 0 66 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 Model 15 [ 5 1 68 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 Stopped by limit on insertions
% 2.13/2.34
% 2.13/2.34 -----> EMPTY CLAUSE at 1.95 sec ----> 917 [hyper,774,7,63,unit_del,1,1] {-} $F.
% 2.13/2.34
% 2.13/2.34 Length of proof is 11. Level of proof is 8.
% 2.13/2.34
% 2.13/2.34 ---------------- PROOF ----------------
% 2.13/2.34 % SZS status Theorem
% 2.13/2.34 % SZS output start Refutation
% 2.13/2.34
% 2.13/2.34 1 [] {+} -distinct_points(A,A).
% 2.13/2.34 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.13/2.34 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 2.13/2.34 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 2.13/2.34 11 [] {+} -distinct_points(A,B)| -distinct_lines(C,D)|apart_point_and_line(A,C)|apart_point_and_line(A,D)|apart_point_and_line(B,C)|apart_point_and_line(B,D).
% 2.13/2.34 13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 2.13/2.34 15 [] {+} -apart_point_and_line($c1,line_connecting($c3,$c2)).
% 2.13/2.34 16 [] {+} distinct_points($c3,$c2).
% 2.13/2.34 19 [] {-} apart_point_and_line($c1,line_connecting($c2,$c3)).
% 2.13/2.34 20 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 2.13/2.34 23 [hyper,19,13] {-} distinct_lines(line_connecting($c2,$c3),A)|apart_point_and_line($c1,A).
% 2.13/2.34 25 [hyper,20,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,B).
% 2.13/2.34 26 [hyper,20,1] {+} distinct_points($c2,$c3).
% 2.13/2.34 34 [hyper,23,11,26] {-} apart_point_and_line($c1,A)|apart_point_and_line($c2,line_connecting($c2,$c3))|apart_point_and_line($c2,A)|apart_point_and_line($c3,line_connecting($c2,$c3))|apart_point_and_line($c3,A).
% 2.13/2.34 50 [hyper,25,1] {-} distinct_points($c2,A)|distinct_points(A,$c3).
% 2.13/2.34 58 [hyper,50,4] {-} distinct_points(A,$c3)|distinct_points($c2,B)|distinct_points(A,B).
% 2.13/2.34 63 [hyper,58,1] {+} distinct_points(A,$c3)|distinct_points(A,$c2).
% 2.13/2.34 129 [hyper,34,7,63,unit_del,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c2,A)|apart_point_and_line($c3,line_connecting($c2,$c3))|apart_point_and_line($c3,A).
% 2.13/2.34 550 [hyper,129,8,63,unit_del,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c2,A)|apart_point_and_line($c3,A).
% 2.13/2.34 774 [hyper,550,8,16,unit_del,15,1] {-} apart_point_and_line($c3,line_connecting($c3,$c2)).
% 2.13/2.34 917 [hyper,774,7,63,unit_del,1,1] {-} $F.
% 2.13/2.34
% 2.13/2.34 % SZS output end Refutation
% 2.13/2.34 ------------ end of proof -------------
% 2.13/2.34
% 2.13/2.34
% 2.13/2.34 Search stopped by max_proofs option.
% 2.13/2.34
% 2.13/2.34
% 2.13/2.34 Search stopped by max_proofs option.
% 2.13/2.34
% 2.13/2.34 ============ end of search ============
% 2.13/2.34
% 2.13/2.34 ----------- soft-scott stats ----------
% 2.13/2.34
% 2.13/2.34 true clauses given 7 (11.3%)
% 2.13/2.34 false clauses given 55
% 2.13/2.34
% 2.13/2.34 FALSE TRUE
% 2.13/2.34 5 1 0
% 2.13/2.34 10 8 0
% 2.13/2.34 12 6 15
% 2.13/2.34 13 36 0
% 2.13/2.34 14 4 0
% 2.13/2.34 15 24 4
% 2.13/2.34 16 52 0
% 2.13/2.34 18 2 0
% 2.13/2.34 19 40 0
% 2.13/2.34 22 3 0
% 2.13/2.34 23 6 0
% 2.13/2.34 25 17 0
% 2.13/2.34 26 23 0
% 2.13/2.34 28 36 0
% 2.13/2.34 29 27 0
% 2.13/2.34 31 14 0
% 2.13/2.34 32 6 0
% 2.13/2.34 33 1 0
% 2.13/2.34 36 6 0
% 2.13/2.34 39 4 0
% 2.13/2.34 41 1 0
% 2.13/2.34 42 4 0
% 2.13/2.34 44 2 0
% 2.13/2.34 tot: 323 19 (5.6% true)
% 2.13/2.34
% 2.13/2.34
% 2.13/2.34 Model 15 [ 5 -59 68 ] (0.00 seconds, 250000 Inserts)
% 2.13/2.34
% 2.13/2.34 That finishes the proof of the theorem.
% 2.13/2.34
% 2.13/2.34 Process 19042 finished Sat Jun 18 06:50:57 2022
%------------------------------------------------------------------------------