TSTP Solution File: GEO191+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:56 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GEO191+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.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 01:39:02 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 sandbox2 on n022.cluster.edu,
% 0.12/0.35 Sat Jun 18 01:39:02 2022
% 0.12/0.35 The command was "./sos". The process ID is 2369.
% 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.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: 16
% 0.12/0.39 number of clauses initially in problem: 19
% 0.12/0.39 percentage of clauses intially in UL: 84
% 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: 10
% 0.12/0.39 distinct predicate count: 4
% 0.12/0.39 distinct function count: 2
% 0.12/0.39 distinct constant count: 4
% 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 ===========
% 0.19/0.56
% 0.19/0.56 -------- PROOF --------
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 % SZS output start Refutation
% 0.19/0.56
% 0.19/0.56 Stopped by limit on insertions
% 0.19/0.56
% 0.19/0.56 Model 3 [ 1 1 730 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.56
% 0.19/0.56 ----> UNIT CONFLICT at 0.18 sec ----> 111 [binary,110.1,1.1] {-} $F.
% 0.19/0.56
% 0.19/0.56 Length of proof is 12. Level of proof is 8.
% 0.19/0.56
% 0.19/0.56 ---------------- PROOF ----------------
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 % SZS output start Refutation
% 0.19/0.56
% 0.19/0.56 1 [] {+} -distinct_points(A,A).
% 0.19/0.56 3 [] {+} -convergent_lines(A,A).
% 0.19/0.56 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.19/0.56 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 0.19/0.56 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 0.19/0.56 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).
% 0.19/0.56 14 [] {+} -convergent_lines(A,B)|distinct_lines(A,B).
% 0.19/0.56 15 [] {+} -apart_point_and_line(intersection_point($c2,$c1),$c4).
% 0.19/0.56 16 [] {+} -apart_point_and_line(intersection_point($c2,$c1),$c3).
% 0.19/0.56 17 [] {+} convergent_lines($c4,$c3).
% 0.19/0.56 18 [] {+} convergent_lines($c2,$c1).
% 0.19/0.56 19 [] {-} apart_point_and_line(intersection_point($c4,$c3),$c2)|apart_point_and_line(intersection_point($c4,$c3),$c1).
% 0.19/0.56 20 [hyper,17,14] {+} distinct_lines($c4,$c3).
% 0.19/0.56 21 [hyper,17,6] {+} convergent_lines($c4,A)|convergent_lines($c3,A).
% 0.19/0.56 32 [hyper,18,10,19] {-} distinct_points(intersection_point($c4,$c3),intersection_point($c2,$c1))|apart_point_and_line(intersection_point($c4,$c3),$c2).
% 0.19/0.56 37 [hyper,32,11,20,unit_del,15,16] {-} apart_point_and_line(intersection_point($c4,$c3),$c2)|apart_point_and_line(intersection_point($c4,$c3),$c4)|apart_point_and_line(intersection_point($c4,$c3),$c3).
% 0.19/0.56 47 [hyper,21,3] {+} convergent_lines($c3,$c4).
% 0.19/0.56 53 [hyper,47,14] {+} distinct_lines($c3,$c4).
% 0.19/0.56 63 [hyper,37,9,17,unit_del,1] {-} apart_point_and_line(intersection_point($c4,$c3),$c2)|apart_point_and_line(intersection_point($c4,$c3),$c3).
% 0.19/0.56 76 [hyper,63,10,21,unit_del,1,3] {-} apart_point_and_line(intersection_point($c4,$c3),$c2).
% 0.19/0.56 88 [hyper,76,9,18] {-} distinct_points(intersection_point($c4,$c3),intersection_point($c2,$c1)).
% 0.19/0.56 89 [hyper,88,11,53,unit_del,16,15] {-} apart_point_and_line(intersection_point($c4,$c3),$c3)|apart_point_and_line(intersection_point($c4,$c3),$c4).
% 0.19/0.56 100 [hyper,89,10,21,unit_del,1,3] {+} apart_point_and_line(intersection_point($c4,$c3),$c4).
% 0.19/0.56 110 [hyper,100,9,17] {-} distinct_points(intersection_point($c4,$c3),intersection_point($c4,$c3)).
% 0.19/0.56 111 [binary,110.1,1.1] {-} $F.
% 0.19/0.56
% 0.19/0.56 % SZS output end Refutation
% 0.19/0.56 ------------ end of proof -------------
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Search stopped by max_proofs option.
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Search stopped by max_proofs option.
% 0.19/0.56
% 0.19/0.56 ============ end of search ============
% 0.19/0.56
% 0.19/0.56 ----------- soft-scott stats ----------
% 0.19/0.56
% 0.19/0.56 true clauses given 6 (24.0%)
% 0.19/0.56 false clauses given 19
% 0.19/0.56
% 0.19/0.56 FALSE TRUE
% 0.19/0.56 5 0 1
% 0.19/0.56 6 5 0
% 0.19/0.56 8 0 1
% 0.19/0.56 9 2 0
% 0.19/0.56 10 1 1
% 0.19/0.56 11 0 2
% 0.19/0.56 13 1 2
% 0.19/0.56 14 0 2
% 0.19/0.56 19 0 4
% 0.19/0.56 25 0 1
% 0.19/0.56 tot: 9 14 (60.9% true)
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Model 3 [ 1 1 730 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.56
% 0.19/0.56 That finishes the proof of the theorem.
% 0.19/0.56
% 0.19/0.56 Process 2369 finished Sat Jun 18 01:39:02 2022
%------------------------------------------------------------------------------