TSTP Solution File: GEO176+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:43 EDT 2022
% Result : Theorem 0.71s 0.89s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO176+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n021.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 10:53:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.35 ----- Otter 3.2, August 2001 -----
% 0.20/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.20/0.35 Sat Jun 18 10:53:31 2022
% 0.20/0.35 The command was "./sos". The process ID is 27531.
% 0.20/0.35
% 0.20/0.35 set(prolog_style_variables).
% 0.20/0.35 set(auto).
% 0.20/0.35 dependent: set(auto1).
% 0.20/0.35 dependent: set(process_input).
% 0.20/0.35 dependent: clear(print_kept).
% 0.20/0.35 dependent: clear(print_new_demod).
% 0.20/0.35 dependent: clear(print_back_demod).
% 0.20/0.35 dependent: clear(print_back_sub).
% 0.20/0.35 dependent: set(control_memory).
% 0.20/0.35 dependent: assign(max_mem, 12000).
% 0.20/0.35 dependent: assign(pick_given_ratio, 4).
% 0.20/0.35 dependent: assign(stats_level, 1).
% 0.20/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.35 dependent: assign(sos_limit, 5000).
% 0.20/0.35 dependent: assign(max_weight, 60).
% 0.20/0.35 clear(print_given).
% 0.20/0.35
% 0.20/0.35 formula_list(usable).
% 0.20/0.35
% 0.20/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.20/0.35
% 0.20/0.35 This is a non-Horn set without equality. The strategy
% 0.20/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.20/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.20/0.35
% 0.20/0.35 dependent: set(hyper_res).
% 0.20/0.35 dependent: set(factor).
% 0.20/0.35 dependent: set(unit_deletion).
% 0.20/0.35
% 0.20/0.35 ------------> process usable:
% 0.20/0.35
% 0.20/0.35 ------------> process sos:
% 0.20/0.35
% 0.20/0.35 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 15
% 0.20/0.40 number of clauses initially in problem: 18
% 0.20/0.40 percentage of clauses intially in UL: 83
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 90
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 10
% 0.20/0.40 distinct predicate count: 4
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 4
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.71/0.89
% 0.71/0.89 -------- PROOF --------
% 0.71/0.89 % SZS status Theorem
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 Model 3 (0.00 seconds, 0 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on number of solutions
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 4 [ 1 1 81 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 5 [ 1 1 157 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 6 [ 5 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 7 [ 8 0 67 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 8 [ 2 0 117 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 Stopped by limit on insertions
% 0.71/0.89
% 0.71/0.89 Model 9 [ 7 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 ----> UNIT CONFLICT at 0.52 sec ----> 69 [binary,68.1,3.1] {-} $F.
% 0.71/0.89
% 0.71/0.89 Length of proof is 7. Level of proof is 6.
% 0.71/0.89
% 0.71/0.89 ---------------- PROOF ----------------
% 0.71/0.89 % SZS status Theorem
% 0.71/0.89 % SZS output start Refutation
% 0.71/0.89
% 0.71/0.89 3 [] {+} -convergent_lines(A,A).
% 0.71/0.89 6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.71/0.89 9 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),A).
% 0.71/0.89 10 [] {+} -convergent_lines(A,B)| -apart_point_and_line(intersection_point(A,B),B).
% 0.71/0.89 12 [] {+} -apart_point_and_line(A,B)|distinct_points(A,C)|apart_point_and_line(C,B).
% 0.71/0.89 15 [] {+} -distinct_points($c4,intersection_point($c2,$c1)).
% 0.71/0.89 17 [] {+} convergent_lines($c2,$c1).
% 0.71/0.89 18 [] {-} apart_point_and_line($c4,$c2)|apart_point_and_line($c4,$c1).
% 0.71/0.89 21 [hyper,17,6] {+} convergent_lines($c2,A)|convergent_lines($c1,A).
% 0.71/0.89 23 [hyper,18,12] {-} apart_point_and_line($c4,$c1)|distinct_points($c4,A)|apart_point_and_line(A,$c2).
% 0.71/0.89 38 [hyper,23,15] {-} apart_point_and_line($c4,$c1)|apart_point_and_line(intersection_point($c2,$c1),$c2).
% 0.71/0.89 45 [hyper,38,9,17] {+} apart_point_and_line($c4,$c1).
% 0.71/0.89 47 [hyper,45,12] {+} distinct_points($c4,A)|apart_point_and_line(A,$c1).
% 0.71/0.89 58 [hyper,47,15] {+} apart_point_and_line(intersection_point($c2,$c1),$c1).
% 0.71/0.89 68 [hyper,58,10,21] {-} convergent_lines($c1,$c1).
% 0.71/0.89 69 [binary,68.1,3.1] {-} $F.
% 0.71/0.89
% 0.71/0.89 % SZS output end Refutation
% 0.71/0.89 ------------ end of proof -------------
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Search stopped by max_proofs option.
% 0.71/0.89
% 0.71/0.89 ============ end of search ============
% 0.71/0.89
% 0.71/0.89 ----------- soft-scott stats ----------
% 0.71/0.89
% 0.71/0.89 true clauses given 4 (23.5%)
% 0.71/0.89 false clauses given 13
% 0.71/0.89
% 0.71/0.89 FALSE TRUE
% 0.71/0.89 6 3 0
% 0.71/0.89 8 2 0
% 0.71/0.89 9 6 2
% 0.71/0.89 12 3 0
% 0.71/0.89 tot: 14 2 (12.5% true)
% 0.71/0.89
% 0.71/0.89
% 0.71/0.89 Model 9 [ 7 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.71/0.89
% 0.71/0.89 That finishes the proof of the theorem.
% 0.71/0.89
% 0.71/0.89 Process 27531 finished Sat Jun 18 10:53:32 2022
%------------------------------------------------------------------------------