TSTP Solution File: GEO201+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO201+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:04 EDT 2022
% Result : Theorem 19.80s 20.05s
% Output : Refutation 19.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO201+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.14/0.33 % Computer : n026.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Fri Jun 17 16:03:09 EDT 2022
% 0.14/0.33 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox on n026.cluster.edu,
% 0.14/0.35 Fri Jun 17 16:03:09 2022
% 0.14/0.35 The command was "./sos". The process ID is 30080.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 formula_list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.14/0.35
% 0.14/0.35 This is a non-Horn set without equality. The strategy
% 0.14/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: set(factor).
% 0.14/0.35 dependent: set(unit_deletion).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35
% 0.14/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 14
% 0.20/0.39 number of clauses initially in problem: 16
% 0.20/0.39 percentage of clauses intially in UL: 87
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 8
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 2
% 0.20/0.39 distinct constant count: 2
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 19.80/20.05
% 19.80/20.05 -- HEY sandbox, WE HAVE A PROOF!! --
% 19.80/20.05
% 19.80/20.05 Stopped by limit on insertions
% 19.80/20.05
% 19.80/20.05 Model 3 [ 1 0 74 ] (0.00 seconds, 250000 Inserts)
% 19.80/20.05
% 19.80/20.05 ----> UNIT CONFLICT at 19.66 sec ----> 2307 [binary,2306.1,3.1] {-} $F.
% 19.80/20.05
% 19.80/20.05 Length of proof is 14. Level of proof is 9.
% 19.80/20.05
% 19.80/20.05 ---------------- PROOF ----------------
% 19.80/20.05 % SZS status Theorem
% 19.80/20.05 % SZS output start Refutation
% 19.80/20.05
% 19.80/20.05 1 [] {+} -distinct_points(A,A).
% 19.80/20.05 3 [] {+} -convergent_lines(A,A).
% 19.80/20.05 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 19.80/20.05 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 19.80/20.05 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 19.80/20.05 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 19.80/20.05 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).
% 19.80/20.05 14 [] {+} -convergent_lines(A,B)|distinct_lines(B,C)|convergent_lines(A,C).
% 19.80/20.05 15 [] {+} convergent_lines($c2,$c1).
% 19.80/20.05 16 [] {-} distinct_points(intersection_point($c2,$c1),intersection_point($c1,$c2)).
% 19.80/20.05 17 [hyper,15,14] {+} distinct_lines($c1,A)|convergent_lines($c2,A).
% 19.80/20.05 18 [hyper,15,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 19.80/20.05 19 [hyper,16,4] {-} distinct_points(intersection_point($c2,$c1),A)|distinct_points(intersection_point($c1,$c2),A).
% 19.80/20.05 21 [hyper,19,1] {-} distinct_points(intersection_point($c1,$c2),intersection_point($c2,$c1)).
% 19.80/20.05 23 [hyper,17,11,21] {-} convergent_lines($c2,A)|apart_point_and_line(intersection_point($c1,$c2),$c1)|apart_point_and_line(intersection_point($c1,$c2),A)|apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),A).
% 19.80/20.05 28 [hyper,18,6] {+} convergent_lines($c1,A)|convergent_lines($c2,B)|convergent_lines(A,B).
% 19.80/20.05 74 [hyper,23,3] {-} apart_point_and_line(intersection_point($c1,$c2),$c1)|apart_point_and_line(intersection_point($c1,$c2),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 19.80/20.05 262 [hyper,28,3] {+} convergent_lines($c1,A)|convergent_lines(A,$c2).
% 19.80/20.05 286 [hyper,262,6] {+} convergent_lines(A,$c2)|convergent_lines($c1,B)|convergent_lines(A,B).
% 19.80/20.05 1392 [hyper,286,3] {+} convergent_lines(A,$c2)|convergent_lines(A,$c1).
% 19.80/20.05 2092 [hyper,74,9,1392,unit_del,3] {-} apart_point_and_line(intersection_point($c1,$c2),$c2)|apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 19.80/20.05 2104 [hyper,2092,10,1392,unit_del,3] {-} apart_point_and_line(intersection_point($c2,$c1),$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 19.80/20.05 2300 [hyper,2104,10,1392,unit_del,3] {+} apart_point_and_line(intersection_point($c2,$c1),$c2).
% 19.80/20.05 2306 [hyper,2300,9,1392] {-} convergent_lines($c2,$c2).
% 19.80/20.05 2307 [binary,2306.1,3.1] {-} $F.
% 19.80/20.05
% 19.80/20.05 % SZS output end Refutation
% 19.80/20.05 ------------ end of proof -------------
% 19.80/20.05
% 19.80/20.05
% 19.80/20.05 Search stopped by max_proofs option.
% 19.80/20.05
% 19.80/20.05
% 19.80/20.05 Search stopped by max_proofs option.
% 19.80/20.05
% 19.80/20.05 ============ end of search ============
% 19.80/20.05
% 19.80/20.05 ----------- soft-scott stats ----------
% 19.80/20.05
% 19.80/20.05 true clauses given 24 (24.2%)
% 19.80/20.05 false clauses given 75
% 19.80/20.05
% 19.80/20.05 FALSE TRUE
% 19.80/20.05 5 0 1
% 19.80/20.05 9 4 0
% 19.80/20.05 12 29 0
% 19.80/20.05 21 0 2
% 19.80/20.05 22 52 4
% 19.80/20.05 24 0 10
% 19.80/20.05 25 0 29
% 19.80/20.05 26 0 5
% 19.80/20.05 27 0 48
% 19.80/20.05 28 0 145
% 19.80/20.05 30 0 106
% 19.80/20.05 31 0 324
% 19.80/20.05 32 0 3
% 19.80/20.05 33 0 186
% 19.80/20.05 34 0 405
% 19.80/20.05 35 0 6
% 19.80/20.05 36 0 273
% 19.80/20.05 39 0 22
% 19.80/20.05 41 0 14
% 19.80/20.05 42 0 52
% 19.80/20.05 44 0 15
% 19.80/20.05 tot: 85 1650 (95.1% true)
% 19.80/20.05
% 19.80/20.05
% 19.80/20.05 Model 3 [ 1 0 74 ] (0.00 seconds, 250000 Inserts)
% 19.80/20.05
% 19.80/20.05 That finishes the proof of the theorem.
% 19.80/20.05
% 19.80/20.05 Process 30080 finished Fri Jun 17 16:03:28 2022
%------------------------------------------------------------------------------