↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL204-1 : TPTP v8.1.0. Released v1.1.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 : Sun Jul 17 14:28:38 EDT 2022

% Result   : Unsatisfiable 1.51s 1.71s
% Output   : Refutation 1.51s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL204-1 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n021.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sat Jul  2 23:42:45 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox2 on n021.cluster.edu,
% 0.13/0.36  Sat Jul  2 23:42:45 2022
% 0.13/0.36  The command was "./sos".  The process ID is 11617.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set without equality.  The strategy will
% 0.13/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36  in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: clear(order_hyper).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.21/0.40  
% 0.21/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.40  
% 0.21/0.40  Stopped by limit on number of solutions
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  -------------- Softie stats --------------
% 0.21/0.40  
% 0.21/0.40  UPDATE_STOP: 300
% 0.21/0.40  SFINDER_TIME_LIMIT: 2
% 0.21/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.40  number of clauses in intial UL: 4
% 0.21/0.40  number of clauses initially in problem: 9
% 0.21/0.40  percentage of clauses intially in UL: 44
% 0.21/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.40  percent of all initial clauses that are short: 100
% 0.21/0.40  absolute distinct symbol count: 6
% 0.21/0.40     distinct predicate count: 2
% 0.21/0.40     distinct function count: 2
% 0.21/0.40     distinct constant count: 2
% 0.21/0.40  
% 0.21/0.40  ---------- no more Softie stats ----------
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  
% 0.21/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.40  
% 0.21/0.40  Stopped by limit on number of solutions
% 0.21/0.40  
% 0.21/0.40  =========== start of search ===========
% 1.51/1.71  
% 1.51/1.71  -------- PROOF -------- 
% 1.51/1.71  % SZS status Unsatisfiable
% 1.51/1.71  % SZS output start Refutation
% 1.51/1.71  
% 1.51/1.71  Model 3 (0.00 seconds, 0 Inserts)
% 1.51/1.71  
% 1.51/1.71  Stopped by limit on number of solutions
% 1.51/1.71  
% 1.51/1.71  Stopped by limit on insertions
% 1.51/1.71  
% 1.51/1.71  Model 4 [ 1 1 2944 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.71  
% 1.51/1.71  ----> UNIT CONFLICT at   1.31 sec ----> 448 [binary,447.1,4.1] {-} $F.
% 1.51/1.71  
% 1.51/1.71  Length of proof is 6.  Level of proof is 6.
% 1.51/1.71  
% 1.51/1.71  ---------------- PROOF ----------------
% 1.51/1.71  % SZS status Unsatisfiable
% 1.51/1.71  % SZS output start Refutation
% 1.51/1.71  
% 1.51/1.71  1 [] {+} theorem(A)| -axiom(A).
% 1.51/1.71  2 [] {+} theorem(A)| -axiom(or(not(B),A))| -theorem(B).
% 1.51/1.71  3 [] {+} theorem(or(not(A),B))| -axiom(or(not(A),C))| -theorem(or(not(C),B)).
% 1.51/1.71  4 [] {+} -theorem(or(not(not(or(not(p),q))),or(not(not(p)),q))).
% 1.51/1.71  6 [] {+} axiom(or(not(A),or(B,A))).
% 1.51/1.71  7 [] {-} axiom(or(not(or(A,B)),or(B,A))).
% 1.51/1.71  8 [] {+} axiom(or(not(or(A,or(B,C))),or(B,or(A,C)))).
% 1.51/1.71  12 [hyper,7,1] {-} theorem(or(not(or(A,B)),or(B,A))).
% 1.51/1.71  14 [hyper,12,3,6] {+} theorem(or(not(A),or(A,B))).
% 1.51/1.71  25 [hyper,8,2,14] {+} theorem(or(A,or(not(A),B))).
% 1.51/1.71  118 [hyper,25,3,7] {-} theorem(or(not(or(A,B)),or(not(not(or(B,A))),C))).
% 1.51/1.71  435 [hyper,118,3,6] {-} theorem(or(not(A),or(not(not(or(A,B))),C))).
% 1.51/1.71  447 [hyper,435,2,8] {-} theorem(or(not(not(or(A,B))),or(not(A),C))).
% 1.51/1.71  448 [binary,447.1,4.1] {-} $F.
% 1.51/1.71  
% 1.51/1.71  % SZS output end Refutation
% 1.51/1.71  ------------ end of proof -------------
% 1.51/1.71  
% 1.51/1.71  
% 1.51/1.71  Search stopped by max_proofs option.
% 1.51/1.71  
% 1.51/1.71  
% 1.51/1.71  Search stopped by max_proofs option.
% 1.51/1.71  
% 1.51/1.71  ============ end of search ============
% 1.51/1.71  
% 1.51/1.71  ----------- soft-scott stats ----------
% 1.51/1.71  
% 1.51/1.71  true clauses given          37      (38.9%)
% 1.51/1.71  false clauses given         58
% 1.51/1.71  
% 1.51/1.71        FALSE     TRUE
% 1.51/1.71     9  0         25
% 1.51/1.71    11  0         31
% 1.51/1.71    13  55        37
% 1.51/1.71    14  5         2
% 1.51/1.71    15  47        23
% 1.51/1.71    16  8         0
% 1.51/1.71    17  24        17
% 1.51/1.71    18  5         0
% 1.51/1.71    19  10        12
% 1.51/1.71    20  2         2
% 1.51/1.71    21  6         6
% 1.51/1.71    22  1         1
% 1.51/1.71    23  2         0
% 1.51/1.71    27  0         1
% 1.51/1.71    28  0         1
% 1.51/1.71    33  0         1
% 1.51/1.71  tot:  165       159      (49.1% true)
% 1.51/1.71  
% 1.51/1.71  
% 1.51/1.71  Model 4 [ 1 1 2944 ] (0.00 seconds, 250000 Inserts)
% 1.51/1.71  
% 1.51/1.71  That finishes the proof of the theorem.
% 1.51/1.71  
% 1.51/1.71  Process 11617 finished Sat Jul  2 23:42:46 2022
%------------------------------------------------------------------------------