TSTP Solution File: GEO251+3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO251+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n032.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:19:39 EDT 2022

% Result   : Theorem 0.15s 0.53s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem  : GEO251+3 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.10  % Command  : sos-script %s
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Sat Jun 18 12:52:32 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.10/0.30  ----- Otter 3.2, August 2001 -----
% 0.10/0.30  The process was started by sandbox on n032.cluster.edu,
% 0.10/0.30  Sat Jun 18 12:52:32 2022
% 0.10/0.30  The command was "./sos".  The process ID is 7194.
% 0.10/0.30  
% 0.10/0.30  set(prolog_style_variables).
% 0.10/0.30  set(auto).
% 0.10/0.30     dependent: set(auto1).
% 0.10/0.30     dependent: set(process_input).
% 0.10/0.30     dependent: clear(print_kept).
% 0.10/0.30     dependent: clear(print_new_demod).
% 0.10/0.30     dependent: clear(print_back_demod).
% 0.10/0.30     dependent: clear(print_back_sub).
% 0.10/0.30     dependent: set(control_memory).
% 0.10/0.30     dependent: assign(max_mem, 12000).
% 0.10/0.30     dependent: assign(pick_given_ratio, 4).
% 0.10/0.30     dependent: assign(stats_level, 1).
% 0.10/0.30     dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.30     dependent: assign(sos_limit, 5000).
% 0.10/0.30     dependent: assign(max_weight, 60).
% 0.10/0.30  clear(print_given).
% 0.10/0.30  
% 0.10/0.30  formula_list(usable).
% 0.10/0.30  
% 0.10/0.30  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=10.
% 0.10/0.30  
% 0.10/0.30  This ia a non-Horn set with equality.  The strategy will be
% 0.10/0.30  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.10/0.30  unit deletion, with positive clauses in sos and nonpositive
% 0.10/0.30  clauses in usable.
% 0.10/0.30  
% 0.10/0.30     dependent: set(knuth_bendix).
% 0.10/0.30     dependent: set(para_from).
% 0.10/0.30     dependent: set(para_into).
% 0.10/0.30     dependent: clear(para_from_right).
% 0.10/0.30     dependent: clear(para_into_right).
% 0.10/0.30     dependent: set(para_from_vars).
% 0.10/0.30     dependent: set(eq_units_both_ways).
% 0.10/0.30     dependent: set(dynamic_demod_all).
% 0.10/0.30     dependent: set(dynamic_demod).
% 0.10/0.30     dependent: set(order_eq).
% 0.10/0.30     dependent: set(back_demod).
% 0.10/0.30     dependent: set(lrpo).
% 0.10/0.30     dependent: set(hyper_res).
% 0.10/0.30     dependent: set(unit_deletion).
% 0.10/0.30     dependent: set(factor).
% 0.10/0.30  
% 0.10/0.30  ------------> process usable:
% 0.10/0.30    Following clause subsumed by 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.10/0.30    Following clause subsumed by 36 during input processing: 0 [] {-} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|unequally_directed_lines(A,reverse_line(C))|unequally_directed_lines(B,reverse_line(C)).
% 0.10/0.30    Following clause subsumed by 40 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.10/0.30    Following clause subsumed by 41 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.10/0.30    Following clause subsumed by 40 during input processing: 0 [unit_del,40,41] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.10/0.30    Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.10/0.30    Following clause subsumed by 40 during input processing: 0 [unit_del,40] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.10/0.30    Following clause subsumed by 41 during input processing: 0 [unit_del,41] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.10/0.30    Following clause subsumed by 40 during input processing: 0 [] {-} -left_apart_point($c3,parallel_through_point($c1,$c2)).
% 0.10/0.30  40 back subsumes 20.
% 0.10/0.30  40 back subsumes 19.
% 0.10/0.30  40 back subsumes 10.
% 0.10/0.30  40 back subsumes 4.
% 0.10/0.30  41 back subsumes 6.
% 0.10/0.30  
% 0.10/0.30  ------------> process sos:
% 0.10/0.30    Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] {-} equally_directed_lines(A,A).
% 0.10/0.30  72 back subsumes 49.
% 0.10/0.30  72 back subsumes 48.
% 0.10/0.30  72 back subsumes 47.
% 0.10/0.30  72 back subsumes 46.
% 0.10/0.30  72 back subsumes 9.
% 0.10/0.30  
% 0.10/0.30  ======= end of input processing =======
% 0.15/0.52  
% 0.15/0.52  Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.52  
% 0.15/0.52  Stopped by limit on number of solutions
% 0.15/0.52  
% 0.15/0.52  
% 0.15/0.52  -------------- Softie stats --------------
% 0.15/0.52  
% 0.15/0.52  UPDATE_STOP: 300
% 0.15/0.52  SFINDER_TIME_LIMIT: 2
% 0.15/0.52  SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.52  number of clauses in intial UL: 49
% 0.15/0.52  number of clauses initially in problem: 57
% 0.15/0.52  percentage of clauses intially in UL: 85
% 0.15/0.52  percentage of distinct symbols occuring in initial UL: 87
% 0.15/0.52  percent of all initial clauses that are short: 100
% 0.15/0.52  absolute distinct symbol count: 24
% 0.15/0.52     distinct predicate count: 18
% 0.15/0.52     distinct function count: 4
% 0.15/0.52     distinct constant count: 2
% 0.15/0.52  
% 0.15/0.52  ---------- no more Softie stats ----------
% 0.15/0.52  
% 0.15/0.52  
% 0.15/0.52  
% 0.15/0.52  Stopped by limit on insertions
% 0.15/0.52  
% 0.15/0.52  =========== start of search ===========
% 0.15/0.53  
% 0.15/0.53  -------- PROOF -------- 
% 0.15/0.53  % SZS status Theorem
% 0.15/0.53  % SZS output start Refutation
% 0.15/0.53  
% 0.15/0.53  Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.53  
% 0.15/0.53  Stopped by limit on number of solutions
% 0.15/0.53  
% 0.15/0.53  ----> UNIT CONFLICT at   0.20 sec ----> 98 [binary,97.1,72.1] {-} $F.
% 0.15/0.53  
% 0.15/0.53  Length of proof is 3.  Level of proof is 2.
% 0.15/0.53  
% 0.15/0.53  ---------------- PROOF ----------------
% 0.15/0.53  % SZS status Theorem
% 0.15/0.53  % SZS output start Refutation
% 0.15/0.53  
% 0.15/0.53  11 [] {+} apart_point_and_line(A,B)| -right_apart_point(A,B).
% 0.15/0.53  50 [] {-} -apart_point_and_line(A,parallel_through_point(B,A)).
% 0.15/0.53  69,68 [] {-} equally_directed_lines(parallel_through_point(A,B),A).
% 0.15/0.53  70 [] {-} right_apart_point($c2,parallel_through_point($c1,$c3)).
% 0.15/0.53  71 [copy,70,demod,69] {-} right_apart_point($c2,$c1).
% 0.15/0.53  72 [back_demod,50,demod,69] {-} -apart_point_and_line(A,B).
% 0.15/0.53  97 [hyper,71,11] {-} apart_point_and_line($c2,$c1).
% 0.15/0.53  98 [binary,97.1,72.1] {-} $F.
% 0.15/0.53  
% 0.15/0.53  % SZS output end Refutation
% 0.15/0.53  ------------ end of proof -------------
% 0.15/0.53  
% 0.15/0.53  
% 0.15/0.53  Search stopped by max_proofs option.
% 0.15/0.53  
% 0.15/0.53  
% 0.15/0.53  Search stopped by max_proofs option.
% 0.15/0.53  
% 0.15/0.53  ============ end of search ============
% 0.15/0.53  
% 0.15/0.53  ----------- soft-scott stats ----------
% 0.15/0.53  
% 0.15/0.53  true clauses given           0      (0.0%)
% 0.15/0.53  false clauses given          3
% 0.15/0.53  
% 0.15/0.53        FALSE     TRUE
% 0.15/0.53     3  1         0
% 0.15/0.53     5  1         0
% 0.15/0.53     6  1         0
% 0.15/0.53     7  0         7
% 0.15/0.53     8  0         2
% 0.15/0.53     9  0         1
% 0.15/0.53    10  0         3
% 0.15/0.53    11  0         1
% 0.15/0.53    14  0         3
% 0.15/0.53    16  0         3
% 0.15/0.53    17  0         2
% 0.15/0.53    18  0         1
% 0.15/0.53  tot:  3         23      (88.5% true)
% 0.15/0.53  
% 0.15/0.53  
% 0.15/0.53  Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.53  
% 0.15/0.53  That finishes the proof of the theorem.
% 0.15/0.53  
% 0.15/0.53  Process 7194 finished Sat Jun 18 12:52:32 2022
%------------------------------------------------------------------------------