TSTP Solution File: GEO175+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO175+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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:42 EDT 2022
% Result : Theorem 0.19s 0.48s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO175+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n027.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 01:38:22 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 n027.cluster.edu,
% 0.13/0.36 Sat Jun 18 01:38:22 2022
% 0.13/0.36 The command was "./sos". The process ID is 5755.
% 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.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 16
% 0.19/0.40 number of clauses initially in problem: 19
% 0.19/0.40 percentage of clauses intially in UL: 84
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 90
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 10
% 0.19/0.40 distinct predicate count: 4
% 0.19/0.40 distinct function count: 2
% 0.19/0.40 distinct constant count: 4
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.19/0.48
% 0.19/0.48 -------- PROOF --------
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 % SZS output start Refutation
% 0.19/0.48
% 0.19/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 ----> UNIT CONFLICT at 0.09 sec ----> 191 [binary,190.1,3.1] {-} $F.
% 0.19/0.48
% 0.19/0.48 Length of proof is 15. Level of proof is 11.
% 0.19/0.48
% 0.19/0.48 ---------------- PROOF ----------------
% 0.19/0.48 % SZS status Theorem
% 0.19/0.48 % SZS output start Refutation
% 0.19/0.48
% 0.19/0.48 1 [] {+} -distinct_points(A,A).
% 0.19/0.48 3 [] {+} -convergent_lines(A,A).
% 0.19/0.48 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.19/0.48 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.19/0.48 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 0.19/0.48 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 0.19/0.48 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.48 14 [] {+} -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 0.19/0.48 15 [] {+} -apart_point_and_line($c4,$c2).
% 0.19/0.48 16 [] {+} -apart_point_and_line($c4,$c1).
% 0.19/0.48 18 [] {+} convergent_lines($c2,$c1).
% 0.19/0.48 19 [] {-} distinct_points($c4,intersection_point($c2,$c1)).
% 0.19/0.48 21 [hyper,19,4] {-} distinct_points($c4,A)|distinct_points(intersection_point($c2,$c1),A).
% 0.19/0.48 22 [hyper,21,4] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points($c4,B)|distinct_points(A,B).
% 0.19/0.48 25 [hyper,18,14] {+} distinct_lines($c1,A)|convergent_lines($c2,A).
% 0.19/0.48 26 [hyper,18,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.19/0.48 32 [hyper,22,1] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points(A,$c4).
% 0.19/0.48 35 [hyper,32,4] {-} distinct_points(A,$c4)|distinct_points(intersection_point($c2,$c1),B)|distinct_points(A,B).
% 0.19/0.48 41 [hyper,25,11,35] {-} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(B,$c4)|distinct_points(intersection_point($c2,$c1),C).
% 0.19/0.48 63 [hyper,26,3] {+} convergent_lines($c1,$c2).
% 0.19/0.48 66 [hyper,63,14] {+} distinct_lines($c2,A)|convergent_lines($c1,A).
% 0.19/0.48 162 [hyper,41,11,66,unit_del,15] {-} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(intersection_point($c2,$c1),C)|apart_point_and_line(B,$c2)|apart_point_and_line(B,D)|apart_point_and_line($c4,D)|convergent_lines($c1,D).
% 0.19/0.48 166 [factor,162.2.8,unit_del,16,3] {+} convergent_lines($c2,A)|apart_point_and_line(B,$c1)|apart_point_and_line(B,A)|apart_point_and_line(C,$c1)|apart_point_and_line(C,A)|distinct_points(intersection_point($c2,$c1),C)|apart_point_and_line(B,$c2).
% 0.19/0.48 173 [factor,166.3.7,unit_del,3,factor_simp,factor_simp] {-} apart_point_and_line(A,$c1)|apart_point_and_line(A,$c2)|distinct_points(intersection_point($c2,$c1),A).
% 0.19/0.48 178 [hyper,173,1] {-} apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.19/0.48 184 [hyper,178,10,26,unit_del,3] {+} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.19/0.48 190 [hyper,184,9,26] {-} convergent_lines($c1,$c1).
% 0.19/0.48 191 [binary,190.1,3.1] {-} $F.
% 0.19/0.48
% 0.19/0.48 % SZS output end Refutation
% 0.19/0.48 ------------ end of proof -------------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Search stopped by max_proofs option.
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Search stopped by max_proofs option.
% 0.19/0.48
% 0.19/0.48 ============ end of search ============
% 0.19/0.48
% 0.19/0.48 ----------- soft-scott stats ----------
% 0.19/0.48
% 0.19/0.48 true clauses given 11 (31.4%)
% 0.19/0.48 false clauses given 24
% 0.19/0.48
% 0.19/0.48 FALSE TRUE
% 0.19/0.48 5 0 1
% 0.19/0.48 9 6 2
% 0.19/0.48 12 0 6
% 0.19/0.48 14 0 6
% 0.19/0.48 15 0 4
% 0.19/0.48 17 0 16
% 0.19/0.48 18 0 8
% 0.19/0.48 20 0 8
% 0.19/0.48 21 0 6
% 0.19/0.48 23 0 16
% 0.19/0.48 26 0 14
% 0.19/0.48 29 0 1
% 0.19/0.48 tot: 6 88 (93.6% true)
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 That finishes the proof of the theorem.
% 0.19/0.48
% 0.19/0.48 Process 5755 finished Sat Jun 18 01:38:22 2022
%------------------------------------------------------------------------------