TSTP Solution File: GEO196+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO196+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:00 EDT 2022
% Result : Theorem 0.58s 0.76s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GEO196+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n020.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 04:13:04 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 sandbox2 on n020.cluster.edu,
% 0.13/0.36 Sat Jun 18 04:13:04 2022
% 0.13/0.36 The command was "./sos". The process ID is 3080.
% 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: 100
% 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.58/0.76
% 0.58/0.76 -------- PROOF --------
% 0.58/0.76 % SZS status Theorem
% 0.58/0.76 % SZS output start Refutation
% 0.58/0.76
% 0.58/0.76 Model 3 (0.00 seconds, 0 Inserts)
% 0.58/0.76
% 0.58/0.76 Stopped by limit on number of solutions
% 0.58/0.76
% 0.58/0.76 Stopped by limit on insertions
% 0.58/0.76
% 0.58/0.76 ----> UNIT CONFLICT at 0.38 sec ----> 247 [binary,246.1,1.1] {-} $F.
% 0.58/0.76
% 0.58/0.76 Length of proof is 12. Level of proof is 8.
% 0.58/0.76
% 0.58/0.76 ---------------- PROOF ----------------
% 0.58/0.76 % SZS status Theorem
% 0.58/0.76 % SZS output start Refutation
% 0.58/0.76
% 0.58/0.76 1 [] {+} -distinct_points(A,A).
% 0.58/0.76 3 [] {+} -convergent_lines(A,A).
% 0.58/0.76 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.58/0.76 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 0.58/0.76 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 0.58/0.76 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.58/0.76 14 [] {+} -convergent_lines(A,B)|distinct_lines(A,B).
% 0.58/0.76 15 [] {+} -apart_point_and_line(intersection_point($c4,$c3),$c2).
% 0.58/0.76 16 [] {+} -apart_point_and_line(intersection_point($c4,$c3),$c1).
% 0.58/0.76 17 [] {+} convergent_lines($c4,$c3).
% 0.58/0.76 18 [] {+} convergent_lines($c2,$c1).
% 0.58/0.76 19 [] {-} apart_point_and_line(intersection_point($c2,$c1),$c4)|apart_point_and_line(intersection_point($c2,$c1),$c3).
% 0.58/0.76 22 [hyper,18,14] {+} distinct_lines($c2,$c1).
% 0.58/0.76 23 [hyper,18,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.58/0.76 29 [hyper,19,10,17] {-} apart_point_and_line(intersection_point($c2,$c1),$c4)|distinct_points(intersection_point($c2,$c1),intersection_point($c4,$c3)).
% 0.58/0.76 45 [hyper,22,11,29,unit_del,15,16] {-} apart_point_and_line(intersection_point($c2,$c1),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c4).
% 0.58/0.76 53 [hyper,23,3] {+} convergent_lines($c1,$c2).
% 0.58/0.76 64 [hyper,53,14] {+} distinct_lines($c1,$c2).
% 0.58/0.76 95 [hyper,45,9,18,unit_del,1] {-} apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c4).
% 0.58/0.76 124 [hyper,95,10,23,unit_del,1,3] {-} apart_point_and_line(intersection_point($c2,$c1),$c4).
% 0.58/0.76 143 [hyper,124,9,17] {-} distinct_points(intersection_point($c2,$c1),intersection_point($c4,$c3)).
% 0.58/0.76 146 [hyper,143,11,64,unit_del,16,15] {-} apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.58/0.76 218 [hyper,146,10,23,unit_del,1,3] {-} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.58/0.76 246 [hyper,218,9,18] {-} distinct_points(intersection_point($c2,$c1),intersection_point($c2,$c1)).
% 0.58/0.76 247 [binary,246.1,1.1] {-} $F.
% 0.58/0.76
% 0.58/0.76 % SZS output end Refutation
% 0.58/0.76 ------------ end of proof -------------
% 0.58/0.76
% 0.58/0.76
% 0.58/0.76 Search stopped by max_proofs option.
% 0.58/0.76
% 0.58/0.76
% 0.58/0.76 Search stopped by max_proofs option.
% 0.58/0.76
% 0.58/0.76 ============ end of search ============
% 0.58/0.76
% 0.58/0.76 ----------- soft-scott stats ----------
% 0.58/0.76
% 0.58/0.76 true clauses given 16 (32.7%)
% 0.58/0.76 false clauses given 33
% 0.58/0.76
% 0.58/0.76 FALSE TRUE
% 0.58/0.76 5 1 0
% 0.58/0.76 6 0 5
% 0.58/0.76 9 0 17
% 0.58/0.76 10 1 1
% 0.58/0.76 11 2 0
% 0.58/0.76 12 0 7
% 0.58/0.76 13 9 2
% 0.58/0.76 16 1 0
% 0.58/0.76 18 2 0
% 0.58/0.76 21 1 0
% 0.58/0.76 22 1 0
% 0.58/0.76 23 2 0
% 0.58/0.76 24 6 0
% 0.58/0.76 26 3 0
% 0.58/0.76 29 1 0
% 0.58/0.76 tot: 30 32 (51.6% true)
% 0.58/0.76
% 0.58/0.76
% 0.58/0.76 Model 3 (0.00 seconds, 0 Inserts)
% 0.58/0.76
% 0.58/0.76 That finishes the proof of the theorem.
% 0.58/0.76
% 0.58/0.76 Process 3080 finished Sat Jun 18 04:13:04 2022
%------------------------------------------------------------------------------