TSTP Solution File: GEO233+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO233+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n024.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:29 EDT 2022

% Result   : Theorem 0.20s 0.44s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GEO233+1 : TPTP v8.1.0. Bugfixed v6.4.0.
% 0.07/0.14  % Command  : sos-script %s
% 0.13/0.35  % Computer : n024.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jun 18 13:40:47 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox on n024.cluster.edu,
% 0.13/0.37  Sat Jun 18 13:40:47 2022
% 0.13/0.37  The command was "./sos".  The process ID is 14319.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  formula_list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=10.
% 0.13/0.37  
% 0.13/0.37  This is a non-Horn set without equality.  The strategy
% 0.13/0.37  will be ordered hyper_res, ur_res, unit deletion, and
% 0.13/0.37  factoring, with satellites in sos and nuclei in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: set(factor).
% 0.13/0.37     dependent: set(unit_deletion).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37    Following clause subsumed by 31 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.13/0.37    Following clause subsumed by 31 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.13/0.37    Following clause subsumed by 36 during input processing: 0 [] {-} -left_apart_point(A,reverse_line(B)).
% 0.13/0.37    Following clause subsumed by 37 during input processing: 0 [] {-} -left_convergent_lines(A,reverse_line(B)).
% 0.13/0.37    Following clause subsumed by 36 during input processing: 0 [unit_del,36,37] {-} -distinct_points(A,B)| -left_apart_point(A,C).
% 0.13/0.37    Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)|distinct_points(A,C).
% 0.13/0.37    Following clause subsumed by 36 during input processing: 0 [unit_del,36] {-} -left_apart_point(A,B)| -unequally_directed_lines(B,C)|distinct_lines(B,C).
% 0.13/0.37    Following clause subsumed by 37 during input processing: 0 [unit_del,37] {-} -left_convergent_lines(A,B)|unequally_directed_lines(B,C).
% 0.13/0.37  36 back subsumes 17.
% 0.13/0.37  36 back subsumes 16.
% 0.13/0.37  36 back subsumes 15.
% 0.13/0.37  36 back subsumes 14.
% 0.13/0.37  36 back subsumes 12.
% 0.13/0.37  36 back subsumes 11.
% 0.13/0.37  36 back subsumes 3.
% 0.13/0.37  36 back subsumes 2.
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.42  
% 0.20/0.42  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42  
% 0.20/0.42  Stopped by limit on number of solutions
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  -------------- Softie stats --------------
% 0.20/0.42  
% 0.20/0.42  UPDATE_STOP: 300
% 0.20/0.42  SFINDER_TIME_LIMIT: 2
% 0.20/0.42  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42  number of clauses in intial UL: 49
% 0.20/0.42  number of clauses initially in problem: 50
% 0.20/0.42  percentage of clauses intially in UL: 98
% 0.20/0.42  percentage of distinct symbols occuring in initial UL: 94
% 0.20/0.42  percent of all initial clauses that are short: 100
% 0.20/0.42  absolute distinct symbol count: 17
% 0.20/0.42     distinct predicate count: 12
% 0.20/0.42     distinct function count: 4
% 0.20/0.42     distinct constant count: 1
% 0.20/0.42  
% 0.20/0.42  ---------- no more Softie stats ----------
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  
% 0.20/0.42  =========== start of search ===========
% 0.20/0.44  
% 0.20/0.44  -------- PROOF -------- 
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  % SZS output start Refutation
% 0.20/0.44  
% 0.20/0.44  -----> EMPTY CLAUSE at   0.04 sec ----> 67 [hyper,62,35,60,unit_del,37,37,30] {-} $F.
% 0.20/0.44  
% 0.20/0.44  Length of proof is 2.  Level of proof is 2.
% 0.20/0.44  
% 0.20/0.44  ---------------- PROOF ----------------
% 0.20/0.44  % SZS status Theorem
% 0.20/0.44  % SZS output start Refutation
% 0.20/0.44  
% 0.20/0.44  30 [] {+} -unequally_directed_lines(A,A).
% 0.20/0.44  31 [] {+} -unequally_directed_lines(A,B)|unequally_directed_lines(A,C)|unequally_directed_lines(B,C).
% 0.20/0.44  35 [] {+} -unequally_directed_lines(A,B)| -unequally_directed_lines(A,reverse_line(B))|left_convergent_lines(A,B)|left_convergent_lines(A,reverse_line(B)).
% 0.20/0.44  37 [] {+} -left_convergent_lines(A,B).
% 0.20/0.44  59 [] {-} unequally_directed_lines(reverse_line(reverse_line($c1)),$c1).
% 0.20/0.44  60 [hyper,59,31] {-} unequally_directed_lines(reverse_line(reverse_line($c1)),A)|unequally_directed_lines($c1,A).
% 0.20/0.44  62 [hyper,60,35,59,unit_del,37,37] {-} unequally_directed_lines($c1,reverse_line($c1)).
% 0.20/0.44  67 [hyper,62,35,60,unit_del,37,37,30] {-} $F.
% 0.20/0.44  
% 0.20/0.44  % SZS output end Refutation
% 0.20/0.44  ------------ end of proof -------------
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Search stopped by max_proofs option.
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Search stopped by max_proofs option.
% 0.20/0.44  
% 0.20/0.44  ============ end of search ============
% 0.20/0.44  
% 0.20/0.44  ----------- soft-scott stats ----------
% 0.20/0.44  
% 0.20/0.44  true clauses given           0      (0.0%)
% 0.20/0.44  false clauses given          3
% 0.20/0.44  
% 0.20/0.44        FALSE     TRUE
% 0.20/0.44     5  1         0
% 0.20/0.44     7  1         0
% 0.20/0.44    11  3         0
% 0.20/0.44  tot:  5         0      (0.0% true)
% 0.20/0.44  
% 0.20/0.44  
% 0.20/0.44  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.44  
% 0.20/0.44  That finishes the proof of the theorem.
% 0.20/0.44  
% 0.20/0.44  Process 14319 finished Sat Jun 18 13:40:47 2022
%------------------------------------------------------------------------------