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