TSTP Solution File: GEO182+2 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO182+2 : 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:48 EDT 2022

% Result   : Theorem 2.32s 2.58s
% Output   : Refutation 2.32s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO182+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n021.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jun 18 00:59:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.35  ----- Otter 3.2, August 2001 -----
% 0.18/0.35  The process was started by sandbox2 on n021.cluster.edu,
% 0.18/0.35  Sat Jun 18 00:59:31 2022
% 0.18/0.35  The command was "./sos".  The process ID is 1254.
% 0.18/0.35  
% 0.18/0.35  set(prolog_style_variables).
% 0.18/0.35  set(auto).
% 0.18/0.35     dependent: set(auto1).
% 0.18/0.35     dependent: set(process_input).
% 0.18/0.35     dependent: clear(print_kept).
% 0.18/0.35     dependent: clear(print_new_demod).
% 0.18/0.35     dependent: clear(print_back_demod).
% 0.18/0.35     dependent: clear(print_back_sub).
% 0.18/0.35     dependent: set(control_memory).
% 0.18/0.35     dependent: assign(max_mem, 12000).
% 0.18/0.35     dependent: assign(pick_given_ratio, 4).
% 0.18/0.35     dependent: assign(stats_level, 1).
% 0.18/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35     dependent: assign(sos_limit, 5000).
% 0.18/0.35     dependent: assign(max_weight, 60).
% 0.18/0.35  clear(print_given).
% 0.18/0.35  
% 0.18/0.35  formula_list(usable).
% 0.18/0.35  
% 0.18/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.18/0.35  
% 0.18/0.35  This is a non-Horn set without equality.  The strategy
% 0.18/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.18/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.18/0.35  
% 0.18/0.35     dependent: set(hyper_res).
% 0.18/0.35     dependent: set(factor).
% 0.18/0.35     dependent: set(unit_deletion).
% 0.18/0.35  
% 0.18/0.35  ------------> process usable:
% 0.18/0.35  
% 0.18/0.35  ------------> process sos:
% 0.18/0.35  
% 0.18/0.35  ======= end of input processing =======
% 0.18/0.37  
% 0.18/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.37  
% 0.18/0.37  Stopped by limit on number of solutions
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  -------------- Softie stats --------------
% 0.18/0.37  
% 0.18/0.37  UPDATE_STOP: 300
% 0.18/0.37  SFINDER_TIME_LIMIT: 2
% 0.18/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.37  number of clauses in intial UL: 15
% 0.18/0.37  number of clauses initially in problem: 17
% 0.18/0.37  percentage of clauses intially in UL: 88
% 0.18/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.18/0.37  percent of all initial clauses that are short: 100
% 0.18/0.37  absolute distinct symbol count: 9
% 0.18/0.37     distinct predicate count: 4
% 0.18/0.37     distinct function count: 2
% 0.18/0.37     distinct constant count: 3
% 0.18/0.37  
% 0.18/0.37  ---------- no more Softie stats ----------
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  
% 0.18/0.37  =========== start of search ===========
% 2.32/2.58  
% 2.32/2.58  -------- PROOF -------- 
% 2.32/2.58  % SZS status Theorem
% 2.32/2.58  % SZS output start Refutation
% 2.32/2.58  
% 2.32/2.58  Model 2 (0.00 seconds, 0 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on number of solutions
% 2.32/2.58  
% 2.32/2.58  Model 3 (0.00 seconds, 0 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on number of solutions
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 4 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 5 [ 1 1 67 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 6 [ 1 0 63 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 7 [ 2 0 119 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 8 [ 2 0 74 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 9 [ 2 0 82 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 10 [ 3 1 74 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 11 [ 3 1 100 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 12 [ 4 0 69 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 13 [ 4 0 81 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 14 [ 5 0 66 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 15 [ 5 0 68 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 16 [ 5 1 2228 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  Stopped by limit on insertions
% 2.32/2.58  
% 2.32/2.58  Model 17 [ 9 0 879 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  ----> UNIT CONFLICT at   2.20 sec ----> 958 [binary,957.1,1.1] {-} $F.
% 2.32/2.58  
% 2.32/2.58  Length of proof is 19.  Level of proof is 9.
% 2.32/2.58  
% 2.32/2.58  ---------------- PROOF ----------------
% 2.32/2.58  % SZS status Theorem
% 2.32/2.58  % SZS output start Refutation
% 2.32/2.58  
% 2.32/2.58  1 [] {+} -distinct_points(A,A).
% 2.32/2.58  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.32/2.58  7 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,A).
% 2.32/2.58  8 [] {+} -distinct_points(A,B)| -apart_point_and_line(C,line_connecting(A,B))|distinct_points(C,B).
% 2.32/2.58  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).
% 2.32/2.58  13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 2.32/2.58  15 [] {+} -apart_point_and_line($c1,line_connecting($c2,$c3)).
% 2.32/2.58  16 [] {+} distinct_points($c3,$c2).
% 2.32/2.58  17 [] {-} apart_point_and_line($c1,line_connecting($c3,$c2)).
% 2.32/2.58  18 [hyper,16,4] {+} distinct_points($c3,A)|distinct_points($c2,A).
% 2.32/2.58  19 [hyper,17,13] {-} distinct_lines(line_connecting($c3,$c2),A)|apart_point_and_line($c1,A).
% 2.32/2.58  25 [hyper,18,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,B).
% 2.32/2.58  26 [hyper,18,1] {+} distinct_points($c2,$c3).
% 2.32/2.58  30 [hyper,19,11,16] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,line_connecting($c3,$c2))|apart_point_and_line($c3,A)|apart_point_and_line($c2,line_connecting($c3,$c2))|apart_point_and_line($c2,A).
% 2.32/2.58  43 [hyper,25,1] {-} distinct_points($c2,A)|distinct_points(A,$c3).
% 2.32/2.58  45 [hyper,25,4] {-} distinct_points($c2,A)|distinct_points($c3,B)|distinct_points(A,C)|distinct_points(B,C).
% 2.32/2.58  46 [factor,45.1.3,unit_del,1] {-} distinct_points($c3,A)|distinct_points(A,$c2).
% 2.32/2.58  48 [hyper,43,4] {-} distinct_points(A,$c3)|distinct_points($c2,B)|distinct_points(A,B).
% 2.32/2.58  50 [hyper,46,4] {-} distinct_points(A,$c2)|distinct_points($c3,B)|distinct_points(A,B).
% 2.32/2.58  55 [hyper,48,4] {-} distinct_points(A,$c3)|distinct_points(A,B)|distinct_points($c2,C)|distinct_points(B,C).
% 2.32/2.58  56 [hyper,48,1] {+} distinct_points(A,$c3)|distinct_points(A,$c2).
% 2.32/2.58  125 [hyper,30,7,56,unit_del,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,A)|apart_point_and_line($c2,line_connecting($c3,$c2))|apart_point_and_line($c2,A).
% 2.32/2.58  217 [hyper,50,4] {-} distinct_points(A,$c2)|distinct_points(A,B)|distinct_points($c3,C)|distinct_points(B,C).
% 2.32/2.58  361 [hyper,55,1] {-} distinct_points(A,$c3)|distinct_points(A,B)|distinct_points(B,$c2).
% 2.32/2.58  393 [hyper,217,1] {-} distinct_points(A,$c2)|distinct_points(A,B)|distinct_points(B,$c3).
% 2.32/2.58  593 [hyper,125,8,361,unit_del,1,1,1] {-} apart_point_and_line($c1,A)|apart_point_and_line($c3,A)|apart_point_and_line($c2,A).
% 2.32/2.58  800 [hyper,593,8,26,unit_del,15,1] {+} apart_point_and_line($c2,line_connecting($c2,$c3)).
% 2.32/2.58  957 [hyper,800,7,393,unit_del,1,factor_simp] {-} distinct_points(A,$c2).
% 2.32/2.58  958 [binary,957.1,1.1] {-} $F.
% 2.32/2.58  
% 2.32/2.58  % SZS output end Refutation
% 2.32/2.58  ------------ end of proof -------------
% 2.32/2.58  
% 2.32/2.58  
% 2.32/2.58  Search stopped by max_proofs option.
% 2.32/2.58  
% 2.32/2.58  
% 2.32/2.58  Search stopped by max_proofs option.
% 2.32/2.58  
% 2.32/2.58  ============ end of search ============
% 2.32/2.58  
% 2.32/2.58  ----------- soft-scott stats ----------
% 2.32/2.58  
% 2.32/2.58  true clauses given           3      (4.8%)
% 2.32/2.58  false clauses given         60
% 2.32/2.58  
% 2.32/2.58        FALSE     TRUE
% 2.32/2.58     5  0         1
% 2.32/2.58    10  8         0
% 2.32/2.58    12  6         16
% 2.32/2.58    13  33        3
% 2.32/2.58    14  4         0
% 2.32/2.58    15  24        0
% 2.32/2.58    16  48        4
% 2.32/2.58    18  2         0
% 2.32/2.58    19  29        7
% 2.32/2.58    22  1         0
% 2.32/2.58    23  6         0
% 2.32/2.58    25  21        0
% 2.32/2.58    26  24        0
% 2.32/2.58    28  49        0
% 2.32/2.58    29  32        0
% 2.32/2.58    31  28        0
% 2.32/2.58    32  6         0
% 2.32/2.58    33  3         0
% 2.32/2.58    36  8         0
% 2.32/2.58    39  6         0
% 2.32/2.58    41  1         0
% 2.32/2.58    42  6         0
% 2.32/2.58    44  2         0
% 2.32/2.58  tot:  347       31      (8.2% true)
% 2.32/2.58  
% 2.32/2.58  
% 2.32/2.58  Model 17 [ 9 0 879 ] (0.00 seconds, 250000 Inserts)
% 2.32/2.58  
% 2.32/2.58  That finishes the proof of the theorem.
% 2.32/2.58  
% 2.32/2.58  Process 1254 finished Sat Jun 18 00:59:33 2022
%------------------------------------------------------------------------------