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