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

View Problem - Process Solution

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

% Computer : n012.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:31 EDT 2022

% Result   : Unsatisfiable 21.40s 21.60s
% Output   : Refutation 21.40s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL192-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n012.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 : Sun Jul  3 10:56:31 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.35  ----- Otter 3.2, August 2001 -----
% 0.19/0.35  The process was started by sandbox on n012.cluster.edu,
% 0.19/0.35  Sun Jul  3 10:56:31 2022
% 0.19/0.35  The command was "./sos".  The process ID is 10151.
% 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  list(usable).
% 0.19/0.35  
% 0.19/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.19/0.35  
% 0.19/0.35  This is a Horn set with equality.  The strategy will be
% 0.19/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.35  sos and nonpositive clauses in usable.
% 0.19/0.35  
% 0.19/0.35     dependent: set(knuth_bendix).
% 0.19/0.35     dependent: set(para_from).
% 0.19/0.35     dependent: set(para_into).
% 0.19/0.35     dependent: clear(para_from_right).
% 0.19/0.35     dependent: clear(para_into_right).
% 0.19/0.35     dependent: set(para_from_vars).
% 0.19/0.35     dependent: set(eq_units_both_ways).
% 0.19/0.35     dependent: set(dynamic_demod_all).
% 0.19/0.35     dependent: set(dynamic_demod).
% 0.19/0.35     dependent: set(order_eq).
% 0.19/0.35     dependent: set(back_demod).
% 0.19/0.35     dependent: set(lrpo).
% 0.19/0.35     dependent: set(hyper_res).
% 0.19/0.35     dependent: clear(order_hyper).
% 0.19/0.35  
% 0.19/0.35  ------------> process usable:
% 0.19/0.35  
% 0.19/0.35  ------------> process sos:
% 0.19/0.35    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.19/0.35  
% 0.19/0.35  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 3
% 0.19/0.39  number of clauses initially in problem: 11
% 0.19/0.39  percentage of clauses intially in UL: 27
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 77
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 9
% 0.19/0.39     distinct predicate count: 3
% 0.19/0.39     distinct function count: 3
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 3.22/3.39  
% 3.22/3.39  
% 3.22/3.39  Changing weight limit from 60 to 30.
% 3.22/3.39  
% 3.22/3.39  Model 3 (0.00 seconds, 0 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on number of solutions
% 3.22/3.39  
% 3.22/3.39  Model 4 (0.00 seconds, 0 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on number of solutions
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 5 [ 1 1 5043 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 6 [ 5 28 240566 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 7 [ 22 5 62051 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 8 [ 22 1 3651 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 9 [ 1 1 1800 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 10 [ 31 10 149606 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 11 [ 33 0 570 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Stopped by limit on insertions
% 3.22/3.39  
% 3.22/3.39  Model 12 [ 1 1 5275 ] (0.00 seconds, 250000 Inserts)
% 3.22/3.39  
% 3.22/3.39  Resetting weight limit to 30 after 205 givens.
% 3.22/3.39  
% 5.01/5.20  
% 5.01/5.20  
% 5.01/5.20  Changing weight limit from 30 to 20.
% 5.01/5.20  
% 5.01/5.20  Stopped by limit on insertions
% 5.01/5.20  
% 5.01/5.20  Stopped by limit on insertions
% 5.01/5.20  
% 5.01/5.20  Model 13 [ 4 1 11799 ] (0.00 seconds, 250000 Inserts)
% 5.01/5.20  
% 5.01/5.20  Resetting weight limit to 20 after 295 givens.
% 5.01/5.20  
% 11.94/12.14  
% 11.94/12.14  
% 11.94/12.14  Changing weight limit from 20 to 19.
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 14 [ 32 3 21961 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 15 [ 2 2 15463 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 16 [ 3 2 8206 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 17 [ 4 44 156712 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 18 [ 33 2 5710 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 19 [ 4 8 21923 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 20 [ 33 1 352 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Stopped by limit on insertions
% 11.94/12.14  
% 11.94/12.14  Model 21 [ 34 32 86182 ] (0.00 seconds, 250000 Inserts)
% 11.94/12.14  
% 11.94/12.14  Resetting weight limit to 19 after 335 givens.
% 11.94/12.14  
% 11.94/12.15  
% 11.94/12.15  
% 11.94/12.15  Changing weight limit from 19 to 17.
% 11.94/12.15  
% 11.94/12.15  Resetting weight limit to 17 after 340 givens.
% 11.94/12.15  
% 12.02/12.20  
% 12.02/12.20  
% 12.02/12.20  Changing weight limit from 17 to 16.
% 12.02/12.20  
% 12.02/12.20  Resetting weight limit to 16 after 350 givens.
% 12.02/12.20  
% 12.02/12.21  
% 12.02/12.21  
% 12.02/12.21  Changing weight limit from 16 to 15.
% 12.02/12.21  
% 12.02/12.21  Resetting weight limit to 15 after 355 givens.
% 12.02/12.21  
% 12.14/12.38  
% 12.14/12.38  
% 12.14/12.38  Changing weight limit from 15 to 14.
% 12.14/12.38  
% 12.14/12.38  Resetting weight limit to 14 after 385 givens.
% 12.14/12.38  
% 12.53/12.74  
% 12.53/12.74  
% 12.53/12.74  Changing weight limit from 14 to 13.
% 12.53/12.74  
% 12.53/12.74  Modelling stopped after 300 given clauses and 0.00 seconds
% 12.53/12.74  
% 12.53/12.74  
% 12.53/12.74  Resetting weight limit to 13 after 560 givens.
% 12.53/12.74  
% 21.40/21.60  
% 21.40/21.60  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 21.40/21.60  
% 21.40/21.60  ----> UNIT CONFLICT at  20.44 sec ----> 89445 [binary,89444.1,3.1] {+} $F.
% 21.40/21.60  
% 21.40/21.60  Length of proof is 41.  Level of proof is 14.
% 21.40/21.60  
% 21.40/21.60  ---------------- PROOF ----------------
% 21.40/21.60  % SZS status Unsatisfiable
% 21.40/21.60  % SZS output start Refutation
% 21.40/21.60  
% 21.40/21.60  1 [] {+} theorem(A)| -axiom(A).
% 21.40/21.60  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 21.40/21.60  3 [] {+} -theorem(implies(or(or(p,q),r),or(p,or(q,r)))).
% 21.40/21.60  4 [] {+} axiom(implies(or(A,A),A)).
% 21.40/21.60  5 [] {+} axiom(implies(A,or(B,A))).
% 21.40/21.60  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 21.40/21.60  7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 21.40/21.60  8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 21.40/21.60  9 [] {-} implies(A,B)=or(not(A),B).
% 21.40/21.60  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 21.40/21.60  13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 21.40/21.60  14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 21.40/21.60  15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 21.40/21.60  20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 21.40/21.60  23 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 21.40/21.60  24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 21.40/21.60  30 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 21.40/21.60  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)))).
% 21.40/21.60  54 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 21.40/21.60  62 [hyper,30,2,15] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 21.40/21.60  83 [hyper,23,2,15] {+} theorem(or(or(A,B),not(or(B,A)))).
% 21.40/21.60  115 [para_into,53.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 21.40/21.60  151 [hyper,54,2,14] {+} theorem(or(A,implies(B,B))).
% 21.40/21.60  163 [hyper,151,2,13] {+} theorem(implies(A,A)).
% 21.40/21.60  249 [hyper,163,2,54] {+} theorem(or(A,implies(or(A,B),B))).
% 21.40/21.60  250 [hyper,163,2,23] {+} theorem(or(A,not(A))).
% 21.40/21.60  274 [para_into,250.1.1,10.1.1] {+} theorem(implies(A,not(not(A)))).
% 21.40/21.60  407 [hyper,274,2,30] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 21.40/21.60  2163 [hyper,249,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 21.40/21.60  2165 [para_into,249.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(A,implies(implies(A,B),B))).
% 21.40/21.60  2626 [para_into,62.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),implies(A,or(C,B)))).
% 21.40/21.60  7578 [hyper,2163,2,407] {-} theorem(or(implies(or(A,B),B),not(not(A)))).
% 21.40/21.60  7603 [hyper,2163,2,62] {-} theorem(or(implies(or(or(A,B),C),C),or(B,A))).
% 21.40/21.60  8966 [hyper,2165,2,2163] {-} theorem(implies(implies(or(implies(or(A,B),B),A),C),C)).
% 21.40/21.60  10671 [hyper,7578,2,24] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 21.40/21.60  10710 [hyper,115,2,10671] {-} theorem(implies(or(A,B),implies(not(A),B))).
% 21.40/21.60  10734 [hyper,115,2,30] {-} theorem(implies(or(A,B),implies(implies(B,C),or(A,C)))).
% 21.40/21.60  10834 [hyper,10710,2,83] {-} theorem(implies(not(or(A,B)),not(or(B,A)))).
% 21.40/21.60  22333 [hyper,2626,2,20] {-} theorem(implies(or(A,or(B,C)),or(or(A,C),B))).
% 21.40/21.60  34366 [hyper,7603,2,15] {-} theorem(or(or(A,B),implies(or(or(B,A),C),C))).
% 21.40/21.60  39087 [hyper,10734,2,8966] {-} theorem(implies(implies(A,B),or(implies(or(A,C),C),B))).
% 21.40/21.60  46201 [hyper,22333,2,54] {-} theorem(or(or(A,B),implies(or(A,or(C,B)),C))).
% 21.40/21.60  58659 [hyper,34366,2,53] {-} theorem(implies(or(or(A,B),C),or(or(B,A),C))).
% 21.40/21.60  62398 [hyper,39087,2,2626] {-} theorem(implies(implies(A,B),or(B,implies(or(A,C),C)))).
% 21.40/21.60  76658 [hyper,58659,2,46201] {-} theorem(or(or(A,B),implies(or(B,or(C,A)),C))).
% 21.40/21.60  78162 [hyper,62398,2,10834,demod,11,11] {-} theorem(implies(or(A,B),implies(implies(or(B,A),C),C))).
% 21.40/21.60  83430 [hyper,76658,2,53] {-} theorem(implies(or(A,or(B,C)),or(or(C,A),B))).
% 21.40/21.60  84166 [hyper,78162,2,115] {-} theorem(implies(implies(or(A,B),C),implies(or(B,A),C))).
% 21.40/21.60  86835 [hyper,83430,2,2626] {-} theorem(implies(or(A,or(B,C)),or(B,or(C,A)))).
% 21.40/21.60  89444 [hyper,86835,2,84166] {-} theorem(implies(or(or(A,B),C),or(A,or(B,C)))).
% 21.40/21.60  89445 [binary,89444.1,3.1] {+} $F.
% 21.40/21.60  
% 21.40/21.60  % SZS output end Refutation
% 21.40/21.60  ------------ end of proof -------------
% 21.40/21.60  
% 21.40/21.60  
% 21.40/21.60  Search stopped by max_proofs option.
% 21.40/21.60  
% 21.40/21.60  
% 21.40/21.60  Search stopped by max_proofs option.
% 21.40/21.60  
% 21.40/21.60  ============ end of search ============
% 21.40/21.60  
% 21.40/21.60  ----------- soft-scott stats ----------
% 21.40/21.60  
% 21.40/21.60  true clauses given        1198      (28.5%)
% 21.40/21.60  false clauses given       3004
% 21.40/21.60  
% 21.40/21.60        FALSE     TRUE
% 21.40/21.60    10  0         309
% 21.40/21.60    11  0         1867
% 21.40/21.60    12  61        324
% 21.40/21.60    13  2443      13
% 21.40/21.60  tot:  2504      2513      (50.1% true)
% 21.40/21.60  
% 21.40/21.60  
% 21.40/21.60  Model 21 [ 34 32 86182 ] (0.00 seconds, 250000 Inserts)
% 21.40/21.60  
% 21.40/21.60  That finishes the proof of the theorem.
% 21.40/21.60  
% 21.40/21.60  Process 10151 finished Sun Jul  3 10:56:53 2022
%------------------------------------------------------------------------------