TSTP Solution File: GEO180+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO180+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:47 EDT 2022
% Result : Theorem 2.48s 2.70s
% Output : Refutation 2.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO180+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n018.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 06:02:32 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n018.cluster.edu,
% 0.12/0.35 Sat Jun 18 06:02:33 2022
% 0.12/0.35 The command was "./sos". The process ID is 11750.
% 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
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.37
% 0.18/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37
% 0.18/0.37 Stopped by limit on number of solutions
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 -------------- Softie stats --------------
% 0.18/0.37
% 0.18/0.37 UPDATE_STOP: 300
% 0.18/0.37 SFINDER_TIME_LIMIT: 2
% 0.18/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37 number of clauses in intial UL: 15
% 0.18/0.37 number of clauses initially in problem: 17
% 0.18/0.37 percentage of clauses intially in UL: 88
% 0.18/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37 percent of all initial clauses that are short: 100
% 0.18/0.37 absolute distinct symbol count: 9
% 0.18/0.37 distinct predicate count: 4
% 0.18/0.37 distinct function count: 2
% 0.18/0.37 distinct constant count: 3
% 0.18/0.37
% 0.18/0.37 ---------- no more Softie stats ----------
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37
% 0.18/0.37 =========== start of search ===========
% 2.48/2.70
% 2.48/2.70 -------- PROOF --------
% 2.48/2.70 % SZS status Theorem
% 2.48/2.70 % SZS output start Refutation
% 2.48/2.70
% 2.48/2.70 Model 2 (0.00 seconds, 0 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on number of solutions
% 2.48/2.70
% 2.48/2.70 Model 3 (0.00 seconds, 0 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on number of solutions
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 4 [ 1 0 67 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 5 [ 1 1 73 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 6 [ 1 0 63 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 7 [ 2 1 72 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 8 [ 2 0 68 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 9 [ 2 7 206752 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Model 10 (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 Stopped by limit on number of solutions
% 2.48/2.70
% 2.48/2.70 Stopped by limit on insertions
% 2.48/2.70
% 2.48/2.70 Model 11 [ 3 0 76 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 -----> EMPTY CLAUSE at 2.33 sec ----> 883 [hyper,723,8,63,unit_del,1,1] {-} $F.
% 2.48/2.70
% 2.48/2.70 Length of proof is 14. Level of proof is 7.
% 2.48/2.70
% 2.48/2.70 ---------------- PROOF ----------------
% 2.48/2.70 % SZS status Theorem
% 2.48/2.70 % SZS output start Refutation
% 2.48/2.70
% 2.48/2.70 1 [] {+} -distinct_points(A,A).
% 2.48/2.70 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.48/2.70 7 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 2.48/2.70 8 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 2.48/2.70 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.48/2.70 13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 2.48/2.70 15 [] {+} -apart_point_and_line($c3,line_connecting($c1,$c2)).
% 2.48/2.70 16 [] {+} distinct_points($c3,$c2).
% 2.48/2.70 17 [] {-} apart_point_and_line($c1,line_connecting($c3,$c2)).
% 2.48/2.70 18 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 2.48/2.70 19 [hyper,17,13] {-} distinct_lines(line_connecting($c3,$c2),A)|apart_point_and_line($c1,A).
% 2.48/2.70 21 [hyper,17,8,16] {+} distinct_points($c1,$c2).
% 2.48/2.70 24 [hyper,18,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,B).
% 2.48/2.70 27 [hyper,21,4] {+} distinct_points($c1,A)|distinct_points($c2,A).
% 2.48/2.70 30 [hyper,19,11,16] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,line_connecting($c3,$c2))|apart_point_and_line($c3,A)|apart_point_and_line($c2,line_connecting($c3,$c2))|apart_point_and_line($c2,A).
% 2.48/2.70 35 [hyper,27,4] {-} distinct_points($c2,A)|distinct_points($c1,B)|distinct_points(A,B).
% 2.48/2.70 45 [hyper,24,4] {+} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.48/2.70 46 [factor,45.1.3,unit_del,1] {+} distinct_points($c3,A)|distinct_points(A,$c2).
% 2.48/2.70 62 [hyper,35,4] {-} distinct_points($c2,A)|distinct_points($c1,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.48/2.70 63 [factor,62.1.3,unit_del,1] {+} distinct_points($c1,A)|distinct_points(A,$c2).
% 2.48/2.70 244 [hyper,30,7,46,unit_del,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,A)|apart_point_and_line($c2,line_connecting($c3,$c2))|apart_point_and_line($c2,A).
% 2.48/2.70 641 [hyper,244,8,46,unit_del,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,A)|apart_point_and_line($c2,A).
% 2.48/2.70 723 [hyper,641,7,21,unit_del,15,1] {+} apart_point_and_line($c2,line_connecting($c1,$c2)).
% 2.48/2.70 883 [hyper,723,8,63,unit_del,1,1] {-} $F.
% 2.48/2.70
% 2.48/2.70 % SZS output end Refutation
% 2.48/2.70 ------------ end of proof -------------
% 2.48/2.70
% 2.48/2.70
% 2.48/2.70 Search stopped by max_proofs option.
% 2.48/2.70
% 2.48/2.70
% 2.48/2.70 Search stopped by max_proofs option.
% 2.48/2.70
% 2.48/2.70 ============ end of search ============
% 2.48/2.70
% 2.48/2.70 ----------- soft-scott stats ----------
% 2.48/2.70
% 2.48/2.70 true clauses given 11 (23.4%)
% 2.48/2.70 false clauses given 36
% 2.48/2.70
% 2.48/2.70 FALSE TRUE
% 2.48/2.70 5 0 1
% 2.48/2.70 9 2 4
% 2.48/2.70 10 6 2
% 2.48/2.70 12 10 7
% 2.48/2.70 13 20 10
% 2.48/2.70 14 2 0
% 2.48/2.70 15 2 4
% 2.48/2.70 16 16 8
% 2.48/2.70 17 12 0
% 2.48/2.70 18 5 0
% 2.48/2.70 19 4 0
% 2.48/2.70 21 5 1
% 2.48/2.70 22 3 0
% 2.48/2.70 23 14 0
% 2.48/2.70 24 2 2
% 2.48/2.70 25 17 0
% 2.48/2.70 26 64 0
% 2.48/2.70 28 34 0
% 2.48/2.70 29 76 0
% 2.48/2.70 31 41 0
% 2.48/2.70 32 26 0
% 2.48/2.70 33 3 0
% 2.48/2.70 34 30 0
% 2.48/2.70 36 13 0
% 2.48/2.70 39 17 0
% 2.48/2.70 41 2 0
% 2.48/2.70 42 23 0
% 2.48/2.70 44 5 0
% 2.48/2.70 45 12 0
% 2.48/2.70 47 3 0
% 2.48/2.70 tot: 469 39 (7.7% true)
% 2.48/2.70
% 2.48/2.70
% 2.48/2.70 Model 11 [ 3 0 76 ] (0.00 seconds, 250000 Inserts)
% 2.48/2.70
% 2.48/2.70 That finishes the proof of the theorem.
% 2.48/2.70
% 2.48/2.70 Process 11750 finished Sat Jun 18 06:02:35 2022
%------------------------------------------------------------------------------