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