↑ Up

SOS---2.0.UNS-Ref.s

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

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

% Result   : Unsatisfiable 8.20s 8.39s
% Output   : Refutation 8.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL238-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n013.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 : Sun Jul  3 15:54:44 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n013.cluster.edu,
% 0.13/0.36  Sun Jul  3 15:54:44 2022
% 0.13/0.36  The command was "./sos".  The process ID is 3038.
% 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=1, symmetry=0, max_lits=3.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set with equality.  The strategy will be
% 0.13/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36  sos and nonpositive clauses in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(knuth_bendix).
% 0.13/0.36     dependent: set(para_from).
% 0.13/0.36     dependent: set(para_into).
% 0.13/0.36     dependent: clear(para_from_right).
% 0.13/0.36     dependent: clear(para_into_right).
% 0.13/0.36     dependent: set(para_from_vars).
% 0.13/0.36     dependent: set(eq_units_both_ways).
% 0.13/0.36     dependent: set(dynamic_demod_all).
% 0.13/0.36     dependent: set(dynamic_demod).
% 0.13/0.36     dependent: set(order_eq).
% 0.13/0.36     dependent: set(back_demod).
% 0.13/0.36     dependent: set(lrpo).
% 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    Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.13/0.40  
% 0.13/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  -------------- Softie stats --------------
% 0.13/0.40  
% 0.13/0.40  UPDATE_STOP: 300
% 0.13/0.40  SFINDER_TIME_LIMIT: 2
% 0.13/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40  number of clauses in intial UL: 3
% 0.13/0.40  number of clauses initially in problem: 13
% 0.13/0.40  percentage of clauses intially in UL: 23
% 0.13/0.40  percentage of distinct symbols occuring in initial UL: 66
% 0.13/0.40  percent of all initial clauses that are short: 100
% 0.13/0.40  absolute distinct symbol count: 9
% 0.13/0.40     distinct predicate count: 3
% 0.13/0.40     distinct function count: 4
% 0.13/0.40     distinct constant count: 2
% 0.13/0.40  
% 0.13/0.40  ---------- no more Softie stats ----------
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  =========== start of search ===========
% 8.20/8.38  
% 8.20/8.38  
% 8.20/8.38  Changing weight limit from 60 to 37.
% 8.20/8.38  
% 8.20/8.38  Model 3 (0.00 seconds, 0 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on number of solutions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 4 [ 2 1 291 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 5 [ 21 0 276 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 6 [ 1 1 171 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 7 [ 27 1 65 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 8 [ 1 1 64 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 9 [ 5 1 98 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 10 [ 1 0 316 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 11 [ 1 3 35306 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 12 [ 10 0 153 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Model 13 (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on number of solutions
% 8.20/8.38  
% 8.20/8.38  Model 14 (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on number of solutions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 15 [ 3 9 94626 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 16 [ 34 1 384 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 17 [ 36 15 118777 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Model 18 (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on number of solutions
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 19 [ 35 6 36764 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 20 [ 36 21 163147 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 21 [ 36 0 318 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 22 [ 36 4 14168 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 23 [ 50 34 130060 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 24 [ 1 23 84179 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Stopped by limit on insertions
% 8.20/8.38  
% 8.20/8.38  Model 25 [ 1 59 190393 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.38  
% 8.20/8.38  Resetting weight limit to 37 after 265 givens.
% 8.20/8.38  
% 8.20/8.39  
% 8.20/8.39  -------- PROOF -------- 
% 8.20/8.39  % SZS status Unsatisfiable
% 8.20/8.39  % SZS output start Refutation
% 8.20/8.39  
% 8.20/8.39  ----> UNIT CONFLICT at   7.99 sec ----> 4211 [binary,4210.1,3.1] {+} $F.
% 8.20/8.39  
% 8.20/8.39  Length of proof is 25.  Level of proof is 13.
% 8.20/8.39  
% 8.20/8.39  ---------------- PROOF ----------------
% 8.20/8.39  % SZS status Unsatisfiable
% 8.20/8.39  % SZS output start Refutation
% 8.20/8.39  
% 8.20/8.39  1 [] {+} theorem(A)| -axiom(A).
% 8.20/8.39  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 8.20/8.39  3 [] {+} -theorem(implies(and(p,q),and(q,p))).
% 8.20/8.39  4 [] {+} axiom(implies(or(A,A),A)).
% 8.20/8.39  5 [] {+} axiom(implies(A,or(B,A))).
% 8.20/8.39  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 8.20/8.39  8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 8.20/8.39  9 [] {-} implies(A,B)=or(not(A),B).
% 8.20/8.39  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 8.20/8.39  12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 8.20/8.39  13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 8.20/8.39  16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 8.20/8.39  17 [hyper,5,1] {-} theorem(implies(A,or(B,A))).
% 8.20/8.39  18 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 8.20/8.39  25 [para_from,10.1.1,17.1.1.2] {+} theorem(implies(A,implies(B,A))).
% 8.20/8.39  36 [para_into,18.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 8.20/8.39  37 [para_into,18.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 8.20/8.39  38 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 8.20/8.39  43 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 8.20/8.39  44 [copy,43,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 8.20/8.39  57 [para_into,37.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 8.20/8.39  141 [para_into,57.1.1,44.1.1] {-} theorem(or(and(A,B),implies(B,not(A)))).
% 8.20/8.39  288 [hyper,36,2,25] {+} theorem(or(implies(A,B),not(B))).
% 8.20/8.39  330 [hyper,38,2,37] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 8.20/8.39  350 [para_into,330.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,not(C))),implies(A,implies(C,B)))).
% 8.20/8.39  358 [hyper,350,2,17] {-} theorem(implies(not(A),implies(A,B))).
% 8.20/8.39  366 [hyper,358,2,38] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 8.20/8.39  414 [hyper,366,2,288] {+} theorem(or(implies(A,B),implies(B,C))).
% 8.20/8.39  756 [hyper,414,2,16] {+} theorem(implies(A,A)).
% 8.20/8.39  794 [hyper,756,2,36] {+} theorem(or(A,not(A))).
% 8.20/8.39  834 [para_into,794.1.1,43.1.1] {-} theorem(implies(implies(A,not(B)),not(and(A,B)))).
% 8.20/8.39  999 [hyper,834,2,38] {-} theorem(implies(or(A,implies(B,not(C))),or(A,not(and(B,C))))).
% 8.20/8.39  2464 [hyper,141,2,999] {-} theorem(or(and(A,B),not(and(B,A)))).
% 8.20/8.39  4210 [hyper,2464,2,37] {-} theorem(implies(and(A,B),and(B,A))).
% 8.20/8.39  4211 [binary,4210.1,3.1] {+} $F.
% 8.20/8.39  
% 8.20/8.39  % SZS output end Refutation
% 8.20/8.39  ------------ end of proof -------------
% 8.20/8.39  
% 8.20/8.39  
% 8.20/8.39  Search stopped by max_proofs option.
% 8.20/8.39  
% 8.20/8.39  
% 8.20/8.39  Search stopped by max_proofs option.
% 8.20/8.39  
% 8.20/8.39  ============ end of search ============
% 8.20/8.39  
% 8.20/8.39  ----------- soft-scott stats ----------
% 8.20/8.39  
% 8.20/8.39  true clauses given          77      (28.8%)
% 8.20/8.39  false clauses given        190
% 8.20/8.39  
% 8.20/8.39        FALSE     TRUE
% 8.20/8.39     8  0         66
% 8.20/8.39     9  2         122
% 8.20/8.39    10  20        247
% 8.20/8.39    11  67        165
% 8.20/8.39    12  63        181
% 8.20/8.39    13  92        139
% 8.20/8.39    14  28        220
% 8.20/8.39    15  68        297
% 8.20/8.39    16  81        250
% 8.20/8.39    17  101       250
% 8.20/8.39    18  114       124
% 8.20/8.39    19  41        87
% 8.20/8.39    20  36        72
% 8.20/8.39    21  31        88
% 8.20/8.39    22  48        128
% 8.20/8.39    23  41        73
% 8.20/8.39    24  19        22
% 8.20/8.39    25  31        0
% 8.20/8.39    26  18        0
% 8.20/8.39    27  25        4
% 8.20/8.39    28  5         0
% 8.20/8.39    29  3         0
% 8.20/8.39    30  3         0
% 8.20/8.39    31  1         0
% 8.20/8.39    32  4         0
% 8.20/8.39    33  1         0
% 8.20/8.39    34  5         0
% 8.20/8.39    35  3         0
% 8.20/8.39    36  2         0
% 8.20/8.39    37  2         0
% 8.20/8.39  tot:  955       2535      (72.6% true)
% 8.20/8.39  
% 8.20/8.39  
% 8.20/8.39  Model 25 [ 1 59 190393 ] (0.00 seconds, 250000 Inserts)
% 8.20/8.39  
% 8.20/8.39  That finishes the proof of the theorem.
% 8.20/8.39  
% 8.20/8.39  Process 3038 finished Sun Jul  3 15:54:52 2022
%------------------------------------------------------------------------------