TSTP Solution File: LCL390-1 by SOS---2.0

View Problem - Process Solution

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

% Computer : n029.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:52 EDT 2022

% Result   : Unsatisfiable 23.64s 23.91s
% Output   : Refutation 23.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14  % Problem  : LCL390-1 : TPTP v8.1.0. Released v2.3.0.
% 0.14/0.14  % Command  : sos-script %s
% 0.14/0.36  % Computer : n029.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul  4 04:15:56 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.14/0.38  ----- Otter 3.2, August 2001 -----
% 0.14/0.38  The process was started by sandbox2 on n029.cluster.edu,
% 0.14/0.38  Mon Jul  4 04:15:56 2022
% 0.14/0.38  The command was "./sos".  The process ID is 27469.
% 0.14/0.38  
% 0.14/0.38  set(prolog_style_variables).
% 0.14/0.38  set(auto).
% 0.14/0.38     dependent: set(auto1).
% 0.14/0.38     dependent: set(process_input).
% 0.14/0.38     dependent: clear(print_kept).
% 0.14/0.38     dependent: clear(print_new_demod).
% 0.14/0.38     dependent: clear(print_back_demod).
% 0.14/0.38     dependent: clear(print_back_sub).
% 0.14/0.38     dependent: set(control_memory).
% 0.14/0.38     dependent: assign(max_mem, 12000).
% 0.14/0.38     dependent: assign(pick_given_ratio, 4).
% 0.14/0.38     dependent: assign(stats_level, 1).
% 0.14/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38     dependent: assign(sos_limit, 5000).
% 0.14/0.38     dependent: assign(max_weight, 60).
% 0.14/0.38  clear(print_given).
% 0.14/0.38  
% 0.14/0.38  list(usable).
% 0.14/0.38  
% 0.14/0.38  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.38  
% 0.14/0.38  This is a Horn set without equality.  The strategy will
% 0.14/0.38  be hyperresolution, with satellites in sos and nuclei
% 0.14/0.38  in usable.
% 0.14/0.38  
% 0.14/0.38     dependent: set(hyper_res).
% 0.14/0.38     dependent: clear(order_hyper).
% 0.14/0.38  
% 0.14/0.38  ------------> process usable:
% 0.14/0.38  
% 0.14/0.38  ------------> process sos:
% 0.14/0.38  
% 0.14/0.38  ======= end of input processing =======
% 0.14/0.41  
% 0.14/0.41  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.41  
% 0.14/0.41  Stopped by limit on number of solutions
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  -------------- Softie stats --------------
% 0.14/0.41  
% 0.14/0.41  UPDATE_STOP: 300
% 0.14/0.41  SFINDER_TIME_LIMIT: 2
% 0.14/0.41  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.41  number of clauses in intial UL: 2
% 0.14/0.41  number of clauses initially in problem: 5
% 0.14/0.41  percentage of clauses intially in UL: 40
% 0.14/0.41  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.41  percent of all initial clauses that are short: 100
% 0.14/0.41  absolute distinct symbol count: 5
% 0.14/0.41     distinct predicate count: 1
% 0.14/0.41     distinct function count: 2
% 0.14/0.41     distinct constant count: 2
% 0.14/0.41  
% 0.14/0.41  ---------- no more Softie stats ----------
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  
% 0.14/0.41  =========== start of search ===========
% 11.21/11.42  
% 11.21/11.42  
% 11.21/11.42  Changing weight limit from 60 to 52.
% 11.21/11.42  
% 11.21/11.42  Model 2 (0.00 seconds, 0 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on number of solutions
% 11.21/11.42  
% 11.21/11.42  Model 3 (0.00 seconds, 0 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on number of solutions
% 11.21/11.42  
% 11.21/11.42  Model 4 (0.00 seconds, 0 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on number of solutions
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on insertions
% 11.21/11.42  
% 11.21/11.42  Model 5 [ 1 0 109 ] (0.00 seconds, 250000 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on insertions
% 11.21/11.42  
% 11.21/11.42  Model 6 [ 1 0 74 ] (0.00 seconds, 250000 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on insertions
% 11.21/11.42  
% 11.21/11.42  Model 7 [ 1 1 29 ] (0.00 seconds, 250000 Inserts)
% 11.21/11.42  
% 11.21/11.42  Stopped by limit on insertions
% 11.21/11.42  
% 11.21/11.42  Resetting weight limit to 52 after 165 givens.
% 11.21/11.42  
% 12.52/12.75  
% 12.52/12.75  
% 12.52/12.75  Changing weight limit from 52 to 29.
% 12.52/12.75  
% 12.52/12.75  Resetting weight limit to 29 after 295 givens.
% 12.52/12.75  
% 12.60/12.78  
% 12.60/12.78  
% 12.60/12.78  Changing weight limit from 29 to 27.
% 12.60/12.78  
% 12.60/12.78  Resetting weight limit to 27 after 300 givens.
% 12.60/12.78  
% 15.53/15.71  
% 15.53/15.71  
% 15.53/15.71  Changing weight limit from 27 to 26.
% 15.53/15.71  
% 15.53/15.71  Stopped by limit on insertions
% 15.53/15.71  
% 15.53/15.71  Model 8 [ 1 0 46 ] (0.00 seconds, 250000 Inserts)
% 15.53/15.71  
% 15.53/15.71  Resetting weight limit to 26 after 345 givens.
% 15.53/15.71  
% 15.56/15.74  
% 15.56/15.74  
% 15.56/15.74  Changing weight limit from 26 to 23.
% 15.56/15.74  
% 15.56/15.74  Resetting weight limit to 23 after 350 givens.
% 15.56/15.74  
% 15.56/15.76  
% 15.56/15.76  
% 15.56/15.76  Changing weight limit from 23 to 22.
% 15.56/15.76  
% 15.56/15.76  Resetting weight limit to 22 after 355 givens.
% 15.56/15.76  
% 15.56/15.78  
% 15.56/15.78  
% 15.56/15.78  Changing weight limit from 22 to 21.
% 15.56/15.78  
% 15.56/15.78  Resetting weight limit to 21 after 360 givens.
% 15.56/15.78  
% 15.56/15.80  
% 15.56/15.80  
% 15.56/15.80  Changing weight limit from 21 to 20.
% 15.56/15.80  
% 15.56/15.80  Resetting weight limit to 20 after 365 givens.
% 15.56/15.80  
% 15.66/15.87  
% 15.66/15.87  
% 15.66/15.87  Changing weight limit from 20 to 19.
% 15.66/15.87  
% 15.66/15.87  Resetting weight limit to 19 after 385 givens.
% 15.66/15.87  
% 15.74/15.92  
% 15.74/15.92  
% 15.74/15.92  Changing weight limit from 19 to 18.
% 15.74/15.92  
% 15.74/15.92  Resetting weight limit to 18 after 395 givens.
% 15.74/15.92  
% 15.81/16.02  
% 15.81/16.02  
% 15.81/16.02  Changing weight limit from 18 to 17.
% 15.81/16.02  
% 15.81/16.02  Resetting weight limit to 17 after 430 givens.
% 15.81/16.02  
% 16.04/16.27  
% 16.04/16.27  
% 16.04/16.27  Changing weight limit from 17 to 16.
% 16.04/16.27  
% 16.04/16.27  Modelling stopped after 300 given clauses and 0.00 seconds
% 16.04/16.27  
% 16.04/16.27  
% 16.04/16.27  Resetting weight limit to 16 after 500 givens.
% 16.04/16.27  
% 16.91/17.10  
% 16.91/17.10  
% 16.91/17.10  Changing weight limit from 16 to 15.
% 16.91/17.10  
% 16.91/17.10  Resetting weight limit to 15 after 745 givens.
% 16.91/17.10  
% 20.77/20.99  
% 20.77/20.99  
% 20.77/20.99  Changing weight limit from 15 to 14.
% 20.77/20.99  
% 20.77/20.99  Resetting weight limit to 14 after 1920 givens.
% 20.77/20.99  
% 23.64/23.91  
% 23.64/23.91  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 23.64/23.91  
% 23.64/23.91  ----> UNIT CONFLICT at  22.69 sec ----> 52117 [binary,52116.1,2.1] {-} $F.
% 23.64/23.91  
% 23.64/23.91  Length of proof is 33.  Level of proof is 20.
% 23.64/23.91  
% 23.64/23.91  ---------------- PROOF ----------------
% 23.64/23.91  % SZS status Unsatisfiable
% 23.64/23.91  % SZS output start Refutation
% 23.64/23.91  
% 23.64/23.91  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 23.64/23.91  2 [] {+} -is_a_theorem(implies(implies(not(x),y),implies(implies(x,y),y))).
% 23.64/23.91  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 23.64/23.91  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 23.64/23.91  5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 23.64/23.91  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 23.64/23.91  7 [hyper,4,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 23.64/23.91  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 23.64/23.91  15 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 23.64/23.91  18 [hyper,6,1,6] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 23.64/23.91  21 [hyper,6,1,9] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 23.64/23.91  24 [hyper,21,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 23.64/23.91  26 [hyper,21,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 23.64/23.91  55 [hyper,24,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 23.64/23.91  71 [hyper,55,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 23.64/23.91  85 [hyper,71,1,15] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 23.64/23.91  111 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 23.64/23.91  162 [hyper,111,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 23.64/23.91  203 [hyper,162,1,7] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 23.64/23.91  437 [hyper,203,1,18] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 23.64/23.91  931 [hyper,437,1,437] {-} is_a_theorem(implies(A,implies(implies(B,implies(not(C),C)),implies(B,C)))).
% 23.64/23.91  937 [hyper,437,1,55] {+} is_a_theorem(implies(A,implies(B,implies(C,A)))).
% 23.64/23.91  939 [hyper,437,1,26] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 23.64/23.91  971 [hyper,939,1,437] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 23.64/23.91  991 [hyper,937,1,437] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 23.64/23.91  1097 [hyper,991,1,991] {+} is_a_theorem(implies(A,implies(B,A))).
% 23.64/23.91  1124 [hyper,971,1,971] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 23.64/23.91  1213 [hyper,1097,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 23.64/23.91  1474 [hyper,931,1,931] {-} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 23.64/23.91  1505 [hyper,1474,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 23.64/23.91  1589 [hyper,1505,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(not(B),A),C))).
% 23.64/23.91  1892 [hyper,1213,1,1505] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 23.64/23.91  1894 [hyper,1213,1,1124] {+} is_a_theorem(implies(not(A),implies(A,B))).
% 23.64/23.91  2427 [hyper,1894,1,1505] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 23.64/23.91  2537 [hyper,1892,1,2427] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),C)).
% 23.64/23.91  7114 [hyper,2537,1,6] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 23.64/23.91  11315 [hyper,7114,1,6] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 23.64/23.91  52116 [hyper,11315,1,1589] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 23.64/23.91  52117 [binary,52116.1,2.1] {-} $F.
% 23.64/23.91  
% 23.64/23.91  % SZS output end Refutation
% 23.64/23.91  ------------ end of proof -------------
% 23.64/23.91  
% 23.64/23.91  
% 23.64/23.91  Search stopped by max_proofs option.
% 23.64/23.91  
% 23.64/23.91  
% 23.64/23.91  Search stopped by max_proofs option.
% 23.64/23.91  
% 23.64/23.91  ============ end of search ============
% 23.64/23.91  
% 23.64/23.91  ----------- soft-scott stats ----------
% 23.64/23.91  
% 23.64/23.91  true clauses given         920      (33.7%)
% 23.64/23.91  false clauses given       1809
% 23.64/23.91  
% 23.64/23.91        FALSE     TRUE
% 23.64/23.91    12  0         404
% 23.64/23.91    13  0         1271
% 23.64/23.91    14  2092      834
% 23.64/23.91  tot:  2092      2509      (54.5% true)
% 23.64/23.91  
% 23.64/23.91  
% 23.64/23.91  Model 8 [ 1 0 46 ] (0.00 seconds, 250000 Inserts)
% 23.64/23.91  
% 23.64/23.91  That finishes the proof of the theorem.
% 23.64/23.91  
% 23.64/23.91  Process 27469 finished Mon Jul  4 04:16:20 2022
%------------------------------------------------------------------------------