↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO174+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:41 EDT 2022

% Result   : Theorem 0.59s 0.81s
% Output   : Refutation 0.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : GEO174+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/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 : Fri Jun 17 20:35:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n021.cluster.edu,
% 0.12/0.35  Fri Jun 17 20:35:46 2022
% 0.12/0.35  The command was "./sos".  The process ID is 31206.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  formula_list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.12/0.35  
% 0.12/0.35  This is a non-Horn set without equality.  The strategy
% 0.12/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: set(factor).
% 0.12/0.35     dependent: set(unit_deletion).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.39  
% 0.12/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  -------------- Softie stats --------------
% 0.12/0.39  
% 0.12/0.39  UPDATE_STOP: 300
% 0.12/0.39  SFINDER_TIME_LIMIT: 2
% 0.12/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39  number of clauses in intial UL: 15
% 0.12/0.39  number of clauses initially in problem: 18
% 0.12/0.39  percentage of clauses intially in UL: 83
% 0.12/0.39  percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.39  percent of all initial clauses that are short: 100
% 0.12/0.39  absolute distinct symbol count: 10
% 0.12/0.39     distinct predicate count: 4
% 0.12/0.39     distinct function count: 2
% 0.12/0.39     distinct constant count: 4
% 0.12/0.39  
% 0.12/0.39  ---------- no more Softie stats ----------
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  
% 0.12/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39  
% 0.12/0.39  Stopped by limit on number of solutions
% 0.12/0.39  
% 0.12/0.39  =========== start of search ===========
% 0.59/0.81  
% 0.59/0.81  -------- PROOF -------- 
% 0.59/0.81  % SZS status Theorem
% 0.59/0.81  % SZS output start Refutation
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 3 [ 1 0 71 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 4 [ 1 0 131 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 5 [ 2 1 66 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 6 [ 3 1 86 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 7 [ 2 0 89 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  Stopped by limit on insertions
% 0.59/0.81  
% 0.59/0.81  Model 8 [ 4 1 4521 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  ----> UNIT CONFLICT at   0.43 sec ----> 44 [binary,43.1,1.1] {-} $F.
% 0.59/0.81  
% 0.59/0.81  Length of proof is 7.  Level of proof is 6.
% 0.59/0.81  
% 0.59/0.81  ---------------- PROOF ----------------
% 0.59/0.81  % SZS status Theorem
% 0.59/0.81  % SZS output start Refutation
% 0.59/0.81  
% 0.59/0.81  1 [] {+} -distinct_points(A,A).
% 0.59/0.81  4 [] {+} -distinct_points(A,B)|distinct_points(A,C)|distinct_points(B,C).
% 0.59/0.81  7 [] {+} -distinct_points(A,B)| -apart_point_and_line(A,line_connecting(A,B)).
% 0.59/0.81  8 [] {+} -distinct_points(A,B)| -apart_point_and_line(B,line_connecting(A,B)).
% 0.59/0.81  13 [] {+} -apart_point_and_line(A,B)|distinct_lines(B,C)|apart_point_and_line(A,C).
% 0.59/0.81  15 [] {+} -distinct_lines($c2,line_connecting($c4,$c3)).
% 0.59/0.81  16 [] {+} distinct_points($c4,$c3).
% 0.59/0.81  18 [] {-} apart_point_and_line($c4,$c2)|apart_point_and_line($c3,$c2).
% 0.59/0.81  19 [hyper,16,4] {+} distinct_points($c4,A)|distinct_points($c3,A).
% 0.59/0.81  20 [hyper,18,13] {-} apart_point_and_line($c3,$c2)|distinct_lines($c2,A)|apart_point_and_line($c4,A).
% 0.59/0.81  25 [hyper,20,15] {-} apart_point_and_line($c3,$c2)|apart_point_and_line($c4,line_connecting($c4,$c3)).
% 0.59/0.81  31 [hyper,25,7,16] {+} apart_point_and_line($c3,$c2).
% 0.59/0.81  32 [hyper,31,13] {+} distinct_lines($c2,A)|apart_point_and_line($c3,A).
% 0.59/0.81  39 [hyper,32,15] {+} apart_point_and_line($c3,line_connecting($c4,$c3)).
% 0.59/0.81  43 [hyper,39,8,19] {-} distinct_points($c3,$c3).
% 0.59/0.81  44 [binary,43.1,1.1] {-} $F.
% 0.59/0.81  
% 0.59/0.81  % SZS output end Refutation
% 0.59/0.81  ------------ end of proof -------------
% 0.59/0.81  
% 0.59/0.81  
% 0.59/0.81  Search stopped by max_proofs option.
% 0.59/0.81  
% 0.59/0.81  
% 0.59/0.81  Search stopped by max_proofs option.
% 0.59/0.81  
% 0.59/0.81  ============ end of search ============
% 0.59/0.81  
% 0.59/0.81  ----------- soft-scott stats ----------
% 0.59/0.81  
% 0.59/0.81  true clauses given           0      (0.0%)
% 0.59/0.81  false clauses given         10
% 0.59/0.81  
% 0.59/0.81        FALSE     TRUE
% 0.59/0.81     6  2         1
% 0.59/0.81     9  2         1
% 0.59/0.81  tot:  4         2      (33.3% true)
% 0.59/0.81  
% 0.59/0.81  
% 0.59/0.81  Model 8 [ 4 1 4521 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81  
% 0.59/0.81  That finishes the proof of the theorem.
% 0.59/0.81  
% 0.59/0.81  Process 31206 finished Fri Jun 17 20:35:46 2022
%------------------------------------------------------------------------------