TSTP Solution File: LCL193-3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL193-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n017.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:32 EDT 2022

% Result   : Unsatisfiable 58.50s 58.72s
% Output   : Refutation 58.53s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : LCL193-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.12  % Command  : sos-script %s
% 0.11/0.33  % Computer : n017.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon Jul  4 02:23:42 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.35  ----- Otter 3.2, August 2001 -----
% 0.11/0.35  The process was started by sandbox on n017.cluster.edu,
% 0.11/0.35  Mon Jul  4 02:23:42 2022
% 0.11/0.35  The command was "./sos".  The process ID is 24605.
% 0.11/0.35  
% 0.11/0.35  set(prolog_style_variables).
% 0.11/0.35  set(auto).
% 0.11/0.35     dependent: set(auto1).
% 0.11/0.35     dependent: set(process_input).
% 0.11/0.35     dependent: clear(print_kept).
% 0.11/0.35     dependent: clear(print_new_demod).
% 0.11/0.35     dependent: clear(print_back_demod).
% 0.11/0.35     dependent: clear(print_back_sub).
% 0.11/0.35     dependent: set(control_memory).
% 0.11/0.35     dependent: assign(max_mem, 12000).
% 0.11/0.35     dependent: assign(pick_given_ratio, 4).
% 0.11/0.35     dependent: assign(stats_level, 1).
% 0.11/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35     dependent: assign(sos_limit, 5000).
% 0.11/0.35     dependent: assign(max_weight, 60).
% 0.11/0.35  clear(print_given).
% 0.11/0.35  
% 0.11/0.35  list(usable).
% 0.11/0.35  
% 0.11/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.11/0.35  
% 0.11/0.35  This is a Horn set with equality.  The strategy will be
% 0.11/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.35  sos and nonpositive clauses in usable.
% 0.11/0.35  
% 0.11/0.35     dependent: set(knuth_bendix).
% 0.11/0.35     dependent: set(para_from).
% 0.11/0.35     dependent: set(para_into).
% 0.11/0.35     dependent: clear(para_from_right).
% 0.11/0.35     dependent: clear(para_into_right).
% 0.11/0.35     dependent: set(para_from_vars).
% 0.11/0.35     dependent: set(eq_units_both_ways).
% 0.11/0.35     dependent: set(dynamic_demod_all).
% 0.11/0.35     dependent: set(dynamic_demod).
% 0.11/0.35     dependent: set(order_eq).
% 0.11/0.35     dependent: set(back_demod).
% 0.11/0.35     dependent: set(lrpo).
% 0.11/0.35     dependent: set(hyper_res).
% 0.11/0.35     dependent: clear(order_hyper).
% 0.11/0.35  
% 0.11/0.35  ------------> process usable:
% 0.11/0.35  
% 0.11/0.35  ------------> process sos:
% 0.11/0.35    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.11/0.35  
% 0.11/0.35  ======= end of input processing =======
% 0.11/0.39  
% 0.11/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.39  
% 0.11/0.39  Stopped by limit on number of solutions
% 0.11/0.39  
% 0.11/0.39  
% 0.11/0.39  -------------- Softie stats --------------
% 0.11/0.39  
% 0.11/0.39  UPDATE_STOP: 300
% 0.11/0.39  SFINDER_TIME_LIMIT: 2
% 0.11/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.39  number of clauses in intial UL: 3
% 0.11/0.39  number of clauses initially in problem: 11
% 0.11/0.39  percentage of clauses intially in UL: 27
% 0.11/0.39  percentage of distinct symbols occuring in initial UL: 77
% 0.11/0.39  percent of all initial clauses that are short: 100
% 0.11/0.39  absolute distinct symbol count: 9
% 0.11/0.39     distinct predicate count: 3
% 0.11/0.39     distinct function count: 3
% 0.11/0.39     distinct constant count: 3
% 0.11/0.39  
% 0.11/0.39  ---------- no more Softie stats ----------
% 0.11/0.39  
% 0.11/0.39  
% 0.11/0.39  
% 0.11/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.11/0.39  
% 0.11/0.39  Stopped by limit on number of solutions
% 0.11/0.39  
% 0.11/0.39  =========== start of search ===========
% 3.94/4.19  
% 3.94/4.19  
% 3.94/4.19  Changing weight limit from 60 to 34.
% 3.94/4.19  
% 3.94/4.19  Model 3 (0.00 seconds, 0 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on number of solutions
% 3.94/4.19  
% 3.94/4.19  Model 4 (0.00 seconds, 0 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on number of solutions
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 5 [ 1 1 3867 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 6 [ 1 1 9122 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 7 [ 1 0 546 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 8 [ 1 0 1321 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 9 [ 1 0 747 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 10 [ 1 0 987 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 11 [ 1 1 4367 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 12 [ 1 14 115613 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 13 [ 31 5 37062 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 14 [ 30 2 3053 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Stopped by limit on insertions
% 3.94/4.19  
% 3.94/4.19  Model 15 [ 31 41 184475 ] (0.00 seconds, 250000 Inserts)
% 3.94/4.19  
% 3.94/4.19  Resetting weight limit to 34 after 215 givens.
% 3.94/4.19  
% 4.33/4.54  
% 4.33/4.54  
% 4.33/4.54  Changing weight limit from 34 to 22.
% 4.33/4.54  
% 4.33/4.54  Resetting weight limit to 22 after 300 givens.
% 4.33/4.54  
% 4.33/4.55  
% 4.33/4.55  
% 4.33/4.55  Changing weight limit from 22 to 20.
% 4.33/4.55  
% 4.33/4.55  Resetting weight limit to 20 after 305 givens.
% 4.33/4.55  
% 4.33/4.57  
% 4.33/4.57  
% 4.33/4.57  Changing weight limit from 20 to 18.
% 4.33/4.57  
% 4.33/4.57  Resetting weight limit to 18 after 310 givens.
% 4.33/4.57  
% 4.40/4.61  
% 4.40/4.61  
% 4.40/4.61  Changing weight limit from 18 to 16.
% 4.40/4.61  
% 4.40/4.61  Resetting weight limit to 16 after 325 givens.
% 4.40/4.61  
% 4.50/4.69  
% 4.50/4.69  
% 4.50/4.69  Changing weight limit from 16 to 15.
% 4.50/4.69  
% 4.50/4.69  Resetting weight limit to 15 after 350 givens.
% 4.50/4.69  
% 5.23/5.49  
% 5.23/5.49  
% 5.23/5.49  Changing weight limit from 15 to 14.
% 5.23/5.49  
% 5.23/5.49  Modelling stopped after 300 given clauses and 0.00 seconds
% 5.23/5.49  
% 5.23/5.49  
% 5.23/5.49  Resetting weight limit to 14 after 575 givens.
% 5.23/5.49  
% 7.13/7.33  
% 7.13/7.33  
% 7.13/7.33  Changing weight limit from 14 to 13.
% 7.13/7.33  
% 7.13/7.33  Resetting weight limit to 13 after 1305 givens.
% 7.13/7.33  
% 58.50/58.72  
% 58.50/58.72  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 58.50/58.72  
% 58.50/58.72  ----> UNIT CONFLICT at  52.43 sec ----> 245905 [binary,245904.1,3.1] {+} $F.
% 58.50/58.72  
% 58.50/58.72  Length of proof is 70.  Level of proof is 24.
% 58.50/58.72  
% 58.50/58.72  ---------------- PROOF ----------------
% 58.50/58.72  % SZS status Unsatisfiable
% 58.50/58.72  % SZS output start Refutation
% 58.50/58.72  
% 58.50/58.72  1 [] {+} theorem(A)| -axiom(A).
% 58.50/58.72  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 58.50/58.72  3 [] {+} -theorem(implies(implies(q,r),implies(or(p,q),or(r,p)))).
% 58.50/58.72  4 [] {+} axiom(implies(or(A,A),A)).
% 58.50/58.72  5 [] {+} axiom(implies(A,or(B,A))).
% 58.50/58.72  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 58.50/58.72  7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 58.50/58.72  8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 58.50/58.72  9 [] {-} implies(A,B)=or(not(A),B).
% 58.50/58.72  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 58.50/58.72  13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 58.50/58.72  14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 58.50/58.72  15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 58.50/58.72  20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 58.50/58.72  23 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 58.50/58.72  24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 58.50/58.72  26 [para_into,13.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 58.50/58.72  28 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 58.50/58.72  30 [para_into,24.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 58.50/58.72  53 [para_into,20.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 58.50/58.72  54 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 58.50/58.72  60 [hyper,28,2,24] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 58.50/58.72  62 [hyper,28,2,15] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 58.50/58.72  63 [hyper,28,2,14] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 58.50/58.72  64 [hyper,28,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 58.50/58.72  65 [para_into,28.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 58.50/58.72  70 [hyper,26,2,28] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 58.50/58.72  83 [hyper,23,2,15] {+} theorem(or(or(A,B),not(or(B,A)))).
% 58.50/58.72  84 [hyper,23,2,14] {+} theorem(or(or(A,B),not(B))).
% 58.50/58.72  110 [hyper,84,2,63] {-} theorem(or(or(A,B),or(C,not(B)))).
% 58.50/58.72  129 [hyper,110,2,15] {-} theorem(or(or(A,not(B)),or(C,B))).
% 58.50/58.72  136 [hyper,129,2,64] {+} theorem(or(or(A,not(B)),B)).
% 58.50/58.72  225 [hyper,136,2,24] {-} theorem(implies(A,or(B,not(not(A))))).
% 58.50/58.72  227 [hyper,136,2,15] {+} theorem(or(A,or(B,not(A)))).
% 58.53/58.72  252 [para_into,53.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 58.53/58.72  280 [hyper,54,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 58.53/58.72  281 [hyper,54,2,14] {+} theorem(or(A,implies(B,B))).
% 58.53/58.72  294 [hyper,281,2,13] {+} theorem(implies(A,A)).
% 58.53/58.72  300 [hyper,280,2,15] {+} theorem(or(implies(or(A,B),A),B)).
% 58.53/58.72  417 [hyper,225,2,54] {-} theorem(or(A,implies(B,not(not(B))))).
% 58.53/58.72  474 [hyper,417,2,13] {+} theorem(implies(A,not(not(A)))).
% 58.53/58.72  480 [hyper,294,2,54] {+} theorem(or(A,implies(or(A,B),B))).
% 58.53/58.72  493 [hyper,474,2,28] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 58.53/58.72  698 [hyper,493,2,23] {-} theorem(or(or(A,not(not(B))),not(or(A,B)))).
% 58.53/58.72  2273 [hyper,60,2,227] {+} theorem(or(A,implies(A,B))).
% 58.53/58.72  2317 [hyper,2273,2,53] {+} theorem(implies(A,or(A,B))).
% 58.53/58.72  2519 [para_into,2317.1.1.2,10.1.1] {+} theorem(implies(not(A),implies(A,B))).
% 58.53/58.72  3627 [hyper,2519,2,28] {-} theorem(implies(or(A,not(B)),or(A,implies(B,C)))).
% 58.53/58.72  3807 [hyper,300,2,3627] {-} theorem(or(implies(or(A,not(B)),A),implies(B,C))).
% 58.53/58.72  3817 [hyper,300,2,493] {-} theorem(or(implies(or(A,B),A),not(not(B)))).
% 58.53/58.72  3921 [hyper,3817,2,24] {-} theorem(implies(not(A),implies(or(B,A),B))).
% 58.53/58.72  3975 [hyper,3921,2,65] {-} theorem(implies(implies(A,not(B)),implies(A,implies(or(C,B),C)))).
% 58.53/58.72  4312 [hyper,3807,2,15] {-} theorem(or(implies(A,B),implies(or(C,not(A)),C))).
% 58.53/58.72  5039 [hyper,480,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 58.53/58.72  5154 [hyper,4312,2,53] {-} theorem(implies(or(A,not(B)),or(implies(B,C),A))).
% 58.53/58.72  5535 [hyper,5154,2,698] {-} theorem(or(implies(or(A,B),C),or(A,not(not(B))))).
% 58.53/58.72  10841 [hyper,5039,2,493] {-} theorem(or(implies(or(A,B),B),not(not(A)))).
% 58.53/58.72  10889 [hyper,10841,2,24] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 58.53/58.72  10905 [hyper,10889,2,65] {-} theorem(implies(implies(A,not(B)),implies(A,implies(or(B,C),C)))).
% 58.53/58.72  14638 [hyper,5535,2,62,demod,11] {-} theorem(or(implies(or(A,B),C),implies(not(B),A))).
% 58.53/58.72  14674 [hyper,14638,2,15] {-} theorem(or(implies(not(A),B),implies(or(B,A),C))).
% 58.53/58.72  14925 [hyper,14674,2,70] {-} theorem(or(implies(not(A),B),not(or(B,A)))).
% 58.53/58.72  19343 [hyper,252,2,10889] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 58.53/58.72  19366 [hyper,252,2,28] {-} theorem(implies(or(A,B),implies(implies(B,C),or(A,C)))).
% 58.53/58.72  19396 [hyper,19343,2,14925] {-} theorem(implies(not(implies(not(A),B)),not(or(B,A)))).
% 58.53/58.72  19467 [hyper,19343,2,83] {+} theorem(implies(not(or(A,B)),not(or(B,A)))).
% 58.53/58.72  20877 [hyper,19396,2,30] {-} theorem(implies(or(A,B),not(not(implies(not(B),A))))).
% 58.53/58.72  33493 [hyper,19366,2,23] {-} theorem(or(implies(implies(A,B),or(C,B)),not(or(C,A)))).
% 58.53/58.72  33605 [hyper,19366,2,280] {-} theorem(implies(implies(implies(or(A,B),A),C),or(B,C))).
% 58.53/58.72  57954 [hyper,3975,2,33605,demod,11] {-} theorem(or(A,implies(implies(B,A),implies(or(C,B),C)))).
% 58.53/58.72  57995 [hyper,57954,2,53] {-} theorem(implies(implies(A,B),or(B,implies(or(C,A),C)))).
% 58.53/58.72  67272 [hyper,10905,2,20877,demod,11] {-} theorem(implies(or(A,B),implies(implies(implies(not(B),A),C),C))).
% 58.53/58.72  84649 [hyper,19467,2,57995,demod,11] {-} theorem(implies(or(A,B),implies(or(C,not(or(B,A))),C))).
% 58.53/58.72  147693 [hyper,67272,2,252] {-} theorem(implies(implies(implies(not(A),B),C),implies(or(B,A),C))).
% 58.53/58.72  166199 [hyper,84649,2,252] {-} theorem(implies(or(A,not(or(B,C))),implies(or(C,B),A))).
% 58.53/58.72  244266 [hyper,166199,2,33493] {-} theorem(implies(or(A,B),implies(implies(A,C),or(B,C)))).
% 58.53/58.72  244293 [hyper,244266,2,252] {-} theorem(implies(implies(A,B),implies(or(A,C),or(C,B)))).
% 58.53/58.72  244471 [hyper,244293,2,147693,demod,11] {-} theorem(implies(or(A,B),implies(implies(B,C),or(C,A)))).
% 58.53/58.72  245904 [hyper,244471,2,252] {-} theorem(implies(implies(A,B),implies(or(C,A),or(B,C)))).
% 58.53/58.72  245905 [binary,245904.1,3.1] {+} $F.
% 58.53/58.72  
% 58.53/58.72  % SZS output end Refutation
% 58.53/58.72  ------------ end of proof -------------
% 58.53/58.72  
% 58.53/58.72  
% 58.53/58.72  Search stopped by max_proofs option.
% 58.53/58.72  
% 58.53/58.72  
% 58.53/58.72  Search stopped by max_proofs option.
% 58.53/58.72  
% 58.53/58.72  ============ end of search ============
% 58.53/58.72  
% 58.53/58.72  ----------- soft-scott stats ----------
% 58.53/58.72  
% 58.53/58.72  true clauses given        4311      (39.1%)
% 58.53/58.72  false clauses given       6721
% 58.53/58.72  
% 58.53/58.72        FALSE     TRUE
% 58.53/58.72    11  0         8
% 58.53/58.72    12  3         2494
% 58.53/58.72    13  675       28
% 58.53/58.72  tot:  678       2530      (78.9% true)
% 58.53/58.72  
% 58.53/58.72  
% 58.53/58.72  Model 15 [ 31 41 184475 ] (0.00 seconds, 250000 Inserts)
% 58.53/58.72  
% 58.53/58.72  That finishes the proof of the theorem.
% 58.53/58.72  
% 58.53/58.72  Process 24605 finished Mon Jul  4 02:24:40 2022
%------------------------------------------------------------------------------