↑ Up

SOS---2.0.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : GEO206+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n005.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:09 EDT 2022

% Result   : Theorem 0.19s 0.41s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : GEO206+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : sos-script %s
% 0.13/0.33  % Computer : n005.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Fri Jun 17 15:45:53 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox on n005.cluster.edu,
% 0.19/0.35  Fri Jun 17 15:45:53 2022
% 0.19/0.35  The command was "./sos".  The process ID is 16808.
% 0.19/0.35  
% 0.19/0.35  set(prolog_style_variables).
% 0.19/0.35  set(auto).
% 0.19/0.35     dependent: set(auto1).
% 0.19/0.35     dependent: set(process_input).
% 0.19/0.35     dependent: clear(print_kept).
% 0.19/0.35     dependent: clear(print_new_demod).
% 0.19/0.35     dependent: clear(print_back_demod).
% 0.19/0.35     dependent: clear(print_back_sub).
% 0.19/0.35     dependent: set(control_memory).
% 0.19/0.35     dependent: assign(max_mem, 12000).
% 0.19/0.35     dependent: assign(pick_given_ratio, 4).
% 0.19/0.35     dependent: assign(stats_level, 1).
% 0.19/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35     dependent: assign(sos_limit, 5000).
% 0.19/0.35     dependent: assign(max_weight, 60).
% 0.19/0.35  clear(print_given).
% 0.19/0.35  
% 0.19/0.35  formula_list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 0.19/0.35  
% 0.19/0.35  This is a non-Horn set without equality.  The strategy
% 0.19/0.35  will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.35  factoring, with satellites in sos and nuclei in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: set(factor).
% 0.19/0.35     dependent: set(unit_deletion).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.37  
% 0.19/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37  
% 0.19/0.37  Stopped by limit on number of solutions
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  -------------- Softie stats --------------
% 0.19/0.37  
% 0.19/0.37  UPDATE_STOP: 300
% 0.19/0.37  SFINDER_TIME_LIMIT: 2
% 0.19/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37  number of clauses in intial UL: 19
% 0.19/0.37  number of clauses initially in problem: 20
% 0.19/0.37  percentage of clauses intially in UL: 95
% 0.19/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.37  percent of all initial clauses that are short: 100
% 0.19/0.37  absolute distinct symbol count: 10
% 0.19/0.37     distinct predicate count: 4
% 0.19/0.37     distinct function count: 3
% 0.19/0.37     distinct constant count: 3
% 0.19/0.37  
% 0.19/0.37  ---------- no more Softie stats ----------
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  
% 0.19/0.37  =========== start of search ===========
% 0.19/0.41  
% 0.19/0.41  -------- PROOF -------- 
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  
% 0.19/0.41  ----> UNIT CONFLICT at   0.04 sec ----> 160 [binary,159.1,16.1] {-} $F.
% 0.19/0.41  
% 0.19/0.41  Length of proof is 4.  Level of proof is 4.
% 0.19/0.41  
% 0.19/0.41  ---------------- PROOF ----------------
% 0.19/0.41  % SZS status Theorem
% 0.19/0.41  % SZS output start Refutation
% 0.19/0.41  
% 0.19/0.41  6 [] {+} -convergent_lines(A,B)|convergent_lines(A,C)|convergent_lines(B,C).
% 0.19/0.41  15 [] {+} -convergent_lines(parallel_through_point(A,B),A).
% 0.19/0.41  16 [] {+} -apart_point_and_line(A,parallel_through_point(B,A)).
% 0.19/0.41  17 [] {+} -distinct_lines(A,B)|apart_point_and_line(C,A)|apart_point_and_line(C,B)|convergent_lines(A,B).
% 0.19/0.41  18 [] {+} -apart_point_and_line($c3,$c2).
% 0.19/0.41  19 [] {+} -convergent_lines($c2,$c1).
% 0.19/0.41  20 [] {-} distinct_lines($c2,parallel_through_point($c1,$c3)).
% 0.19/0.41  21 [hyper,20,17] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3))|convergent_lines($c2,parallel_through_point($c1,$c3)).
% 0.19/0.41  40 [hyper,21,6] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3))|convergent_lines($c2,B)|convergent_lines(parallel_through_point($c1,$c3),B).
% 0.19/0.41  158 [hyper,40,19,unit_del,15] {-} apart_point_and_line(A,$c2)|apart_point_and_line(A,parallel_through_point($c1,$c3)).
% 0.19/0.41  159 [hyper,158,18] {-} apart_point_and_line($c3,parallel_through_point($c1,$c3)).
% 0.19/0.41  160 [binary,159.1,16.1] {-} $F.
% 0.19/0.41  
% 0.19/0.41  % SZS output end Refutation
% 0.19/0.41  ------------ end of proof -------------
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Search stopped by max_proofs option.
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Search stopped by max_proofs option.
% 0.19/0.41  
% 0.19/0.41  ============ end of search ============
% 0.19/0.41  
% 0.19/0.41  ----------- soft-scott stats ----------
% 0.19/0.41  
% 0.19/0.41  true clauses given           0      (0.0%)
% 0.19/0.41  false clauses given         38
% 0.19/0.41  
% 0.19/0.41        FALSE     TRUE
% 0.19/0.41    16  2         0
% 0.19/0.41    17  36        0
% 0.19/0.41    19  7         0
% 0.19/0.41    20  34        0
% 0.19/0.41    22  16        0
% 0.19/0.41    23  1         0
% 0.19/0.41    25  2         0
% 0.19/0.41  tot:  98        0      (0.0% true)
% 0.19/0.41  
% 0.19/0.41  
% 0.19/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.41  
% 0.19/0.41  That finishes the proof of the theorem.
% 0.19/0.41  
% 0.19/0.41  Process 16808 finished Fri Jun 17 15:45:53 2022
%------------------------------------------------------------------------------