TSTP Solution File: GEO172+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO172+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:40 EDT 2022
% Result : Theorem 0.21s 0.52s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GEO172+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.15 % Command : sos-script %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sat Jun 18 04:01:23 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.39 ----- Otter 3.2, August 2001 -----
% 0.21/0.39 The process was started by sandbox on n012.cluster.edu,
% 0.21/0.39 Sat Jun 18 04:01:23 2022
% 0.21/0.39 The command was "./sos". The process ID is 31985.
% 0.21/0.39
% 0.21/0.39 set(prolog_style_variables).
% 0.21/0.39 set(auto).
% 0.21/0.39 dependent: set(auto1).
% 0.21/0.39 dependent: set(process_input).
% 0.21/0.39 dependent: clear(print_kept).
% 0.21/0.39 dependent: clear(print_new_demod).
% 0.21/0.39 dependent: clear(print_back_demod).
% 0.21/0.39 dependent: clear(print_back_sub).
% 0.21/0.39 dependent: set(control_memory).
% 0.21/0.39 dependent: assign(max_mem, 12000).
% 0.21/0.39 dependent: assign(pick_given_ratio, 4).
% 0.21/0.39 dependent: assign(stats_level, 1).
% 0.21/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.39 dependent: assign(sos_limit, 5000).
% 0.21/0.39 dependent: assign(max_weight, 60).
% 0.21/0.39 clear(print_given).
% 0.21/0.39
% 0.21/0.39 formula_list(usable).
% 0.21/0.39
% 0.21/0.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.21/0.39
% 0.21/0.39 This is a non-Horn set without equality. The strategy
% 0.21/0.39 will be ordered hyper_res, ur_res, unit deletion, and
% 0.21/0.39 factoring, with satellites in sos and nuclei in usable.
% 0.21/0.39
% 0.21/0.39 dependent: set(hyper_res).
% 0.21/0.39 dependent: set(factor).
% 0.21/0.39 dependent: set(unit_deletion).
% 0.21/0.39
% 0.21/0.39 ------------> process usable:
% 0.21/0.39
% 0.21/0.39 ------------> process sos:
% 0.21/0.39
% 0.21/0.39 ======= end of input processing =======
% 0.21/0.42
% 0.21/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 -------------- Softie stats --------------
% 0.21/0.42
% 0.21/0.42 UPDATE_STOP: 300
% 0.21/0.42 SFINDER_TIME_LIMIT: 2
% 0.21/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.42 number of clauses in intial UL: 16
% 0.21/0.42 number of clauses initially in problem: 18
% 0.21/0.42 percentage of clauses intially in UL: 88
% 0.21/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.42 percent of all initial clauses that are short: 100
% 0.21/0.42 absolute distinct symbol count: 9
% 0.21/0.42 distinct predicate count: 4
% 0.21/0.42 distinct function count: 2
% 0.21/0.42 distinct constant count: 3
% 0.21/0.42
% 0.21/0.42 ---------- no more Softie stats ----------
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42
% 0.21/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.42
% 0.21/0.42 Stopped by limit on number of solutions
% 0.21/0.42
% 0.21/0.42 =========== start of search ===========
% 0.21/0.52
% 0.21/0.52 -------- PROOF --------
% 0.21/0.52 % SZS status Theorem
% 0.21/0.52 % SZS output start Refutation
% 0.21/0.52
% 0.21/0.52 Stopped by limit on insertions
% 0.21/0.52
% 0.21/0.52 Model 3 [ 1 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.21/0.52
% 0.21/0.52 -----> EMPTY CLAUSE at 0.11 sec ----> 43 [hyper,37,10,20,unit_del,1,3] {-} $F.
% 0.21/0.52
% 0.21/0.52 Length of proof is 6. Level of proof is 4.
% 0.21/0.52
% 0.21/0.52 ---------------- PROOF ----------------
% 0.21/0.52 % SZS status Theorem
% 0.21/0.52 % SZS output start Refutation
% 0.21/0.52
% 0.21/0.52 1 [] {+} -distinct_points(A,A).
% 0.21/0.52 3 [] {+} -convergent_lines(A,A).
% 0.21/0.52 4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.21/0.52 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.21/0.52 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,A)|distinct_points(C,intersection_point(A,B)).
% 0.21/0.52 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(C,B)|distinct_points(C,intersection_point(A,B)).
% 0.21/0.52 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.21/0.52 14 [] {+} -convergent_lines(A,B)|distinct_lines(A,B).
% 0.21/0.52 15 [] {+} -apart_point_and_line($c1,$c3).
% 0.21/0.52 16 [] {+} -apart_point_and_line($c1,$c2).
% 0.21/0.52 17 [] {+} convergent_lines($c3,$c2).
% 0.21/0.52 18 [] {-} distinct_points($c1,intersection_point($c3,$c2)).
% 0.21/0.52 19 [hyper,17,14] {+} distinct_lines($c3,$c2).
% 0.21/0.52 20 [hyper,17,6] {+} convergent_lines($c3,A)|convergent_lines($c2,A).
% 0.21/0.52 21 [hyper,18,4] {-} distinct_points($c1,A)|distinct_points(intersection_point($c3,$c2),A).
% 0.21/0.52 23 [hyper,21,1] {-} distinct_points(intersection_point($c3,$c2),$c1).
% 0.21/0.52 25 [hyper,19,11,23,unit_del,15,16] {-} apart_point_and_line(intersection_point($c3,$c2),$c3)|apart_point_and_line(intersection_point($c3,$c2),$c2).
% 0.21/0.52 37 [hyper,25,9,17,unit_del,1] {+} apart_point_and_line(intersection_point($c3,$c2),$c2).
% 0.21/0.52 43 [hyper,37,10,20,unit_del,1,3] {-} $F.
% 0.21/0.52
% 0.21/0.52 % SZS output end Refutation
% 0.21/0.52 ------------ end of proof -------------
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 Search stopped by max_proofs option.
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 Search stopped by max_proofs option.
% 0.21/0.52
% 0.21/0.52 ============ end of search ============
% 0.21/0.52
% 0.21/0.52 ----------- soft-scott stats ----------
% 0.21/0.52
% 0.21/0.52 true clauses given 2 (25.0%)
% 0.21/0.52 false clauses given 6
% 0.21/0.52
% 0.21/0.52 FALSE TRUE
% 0.21/0.52 3 1 0
% 0.21/0.52 5 1 0
% 0.21/0.52 6 2 1
% 0.21/0.52 9 2 0
% 0.21/0.52 11 0 3
% 0.21/0.52 tot: 6 4 (40.0% true)
% 0.21/0.52
% 0.21/0.52
% 0.21/0.52 Model 3 [ 1 0 65 ] (0.00 seconds, 250000 Inserts)
% 0.21/0.52
% 0.21/0.52 That finishes the proof of the theorem.
% 0.21/0.52
% 0.21/0.52 Process 31985 finished Sat Jun 18 04:01:23 2022
%------------------------------------------------------------------------------