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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL018-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n008.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:27:23 EDT 2022

% Result   : Unsatisfiable 76.98s 77.23s
% Output   : Refutation 76.98s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : LCL018-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.09  % Command  : sos-script %s
% 0.09/0.29  % Computer : n008.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Sat Jul  2 20:09:53 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.09/0.30  ----- Otter 3.2, August 2001 -----
% 0.09/0.30  The process was started by sandbox on n008.cluster.edu,
% 0.09/0.30  Sat Jul  2 20:09:53 2022
% 0.09/0.30  The command was "./sos".  The process ID is 1511.
% 0.09/0.30  
% 0.09/0.30  set(prolog_style_variables).
% 0.09/0.30  set(auto).
% 0.09/0.30     dependent: set(auto1).
% 0.09/0.30     dependent: set(process_input).
% 0.09/0.30     dependent: clear(print_kept).
% 0.09/0.30     dependent: clear(print_new_demod).
% 0.09/0.30     dependent: clear(print_back_demod).
% 0.09/0.30     dependent: clear(print_back_sub).
% 0.09/0.30     dependent: set(control_memory).
% 0.09/0.30     dependent: assign(max_mem, 12000).
% 0.09/0.30     dependent: assign(pick_given_ratio, 4).
% 0.09/0.30     dependent: assign(stats_level, 1).
% 0.09/0.30     dependent: assign(pick_semantic_ratio, 3).
% 0.09/0.30     dependent: assign(sos_limit, 5000).
% 0.09/0.30     dependent: assign(max_weight, 60).
% 0.09/0.30  clear(print_given).
% 0.09/0.30  
% 0.09/0.30  list(usable).
% 0.09/0.30  
% 0.09/0.30  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.09/0.30  
% 0.09/0.30  This is a Horn set without equality.  The strategy will
% 0.09/0.30  be hyperresolution, with satellites in sos and nuclei
% 0.09/0.30  in usable.
% 0.09/0.30  
% 0.09/0.30     dependent: set(hyper_res).
% 0.09/0.30     dependent: clear(order_hyper).
% 0.09/0.30  
% 0.09/0.30  ------------> process usable:
% 0.09/0.30  
% 0.09/0.30  ------------> process sos:
% 0.09/0.30  
% 0.09/0.30  ======= end of input processing =======
% 0.14/0.32  
% 0.14/0.32  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.32  
% 0.14/0.32  Stopped by limit on number of solutions
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  -------------- Softie stats --------------
% 0.14/0.32  
% 0.14/0.32  UPDATE_STOP: 300
% 0.14/0.32  SFINDER_TIME_LIMIT: 2
% 0.14/0.32  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.32  number of clauses in intial UL: 2
% 0.14/0.32  number of clauses initially in problem: 3
% 0.14/0.32  percentage of clauses intially in UL: 66
% 0.14/0.32  percentage of distinct symbols occuring in initial UL: 100
% 0.14/0.32  percent of all initial clauses that are short: 100
% 0.14/0.32  absolute distinct symbol count: 5
% 0.14/0.32     distinct predicate count: 1
% 0.14/0.32     distinct function count: 1
% 0.14/0.32     distinct constant count: 3
% 0.14/0.32  
% 0.14/0.32  ---------- no more Softie stats ----------
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  
% 0.14/0.32  =========== start of search ===========
% 58.68/58.93  
% 58.68/58.93  
% 58.68/58.93  Changing weight limit from 60 to 52.
% 58.68/58.93  
% 58.68/58.93  Model 2 (0.00 seconds, 0 Inserts)
% 58.68/58.93  
% 58.68/58.93  Stopped by limit on number of solutions
% 58.68/58.93  
% 58.68/58.93  Model 3 (0.00 seconds, 0 Inserts)
% 58.68/58.93  
% 58.68/58.93  Stopped by limit on number of solutions
% 58.68/58.93  
% 58.68/58.93  Model 4 [ 1 0 1196 ] (0.00 seconds, 184377 Inserts)
% 58.68/58.93  
% 58.68/58.93  Model 5 [ 3 0 111 ] (0.00 seconds, 184206 Inserts)
% 58.68/58.93  
% 58.68/58.93  Model 6 [ 8 1 979 ] (0.00 seconds, 184901 Inserts)
% 58.68/58.93  
% 58.68/58.93  Model 7 [ 4 0 1153 ] (0.00 seconds, 183951 Inserts)
% 58.68/58.93  
% 58.68/58.93  Resetting weight limit to 52 after 80 givens.
% 58.68/58.93  
% 59.14/59.37  
% 59.14/59.37  
% 59.14/59.37  Changing weight limit from 52 to 44.
% 59.14/59.37  
% 59.14/59.37  Resetting weight limit to 44 after 85 givens.
% 59.14/59.37  
% 65.80/66.09  
% 65.80/66.09  
% 65.80/66.09  Changing weight limit from 44 to 40.
% 65.80/66.09  
% 65.80/66.09  Model 8 [ 5 0 1236 ] (0.00 seconds, 184642 Inserts)
% 65.80/66.09  
% 65.80/66.09  Resetting weight limit to 40 after 95 givens.
% 65.80/66.09  
% 66.10/66.38  
% 66.10/66.38  
% 66.10/66.38  Changing weight limit from 40 to 36.
% 66.10/66.38  
% 66.10/66.38  Resetting weight limit to 36 after 100 givens.
% 66.10/66.38  
% 66.48/66.72  
% 66.48/66.72  
% 66.48/66.72  Changing weight limit from 36 to 32.
% 66.48/66.72  
% 66.48/66.72  Resetting weight limit to 32 after 110 givens.
% 66.48/66.72  
% 66.56/66.86  
% 66.56/66.86  
% 66.56/66.86  Changing weight limit from 32 to 28.
% 66.56/66.86  
% 66.56/66.86  Resetting weight limit to 28 after 125 givens.
% 66.56/66.86  
% 70.16/70.46  
% 70.16/70.46  
% 70.16/70.46  Changing weight limit from 28 to 24.
% 70.16/70.46  
% 70.16/70.46  Model 9 [ 6 329 181823 ] (0.00 seconds, 183886 Inserts)
% 70.16/70.46  
% 70.16/70.46  Resetting weight limit to 24 after 150 givens.
% 70.16/70.46  
% 70.29/70.55  
% 70.29/70.55  
% 70.29/70.55  Changing weight limit from 24 to 20.
% 70.29/70.55  
% 70.29/70.55  Resetting weight limit to 20 after 160 givens.
% 70.29/70.55  
% 76.98/77.23  
% 76.98/77.23  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 76.98/77.23  
% 76.98/77.23  Modelling stopped after 300 given clauses and 0.00 seconds
% 76.98/77.23  
% 76.98/77.23  
% 76.98/77.23  ----> UNIT CONFLICT at  76.70 sec ----> 101293 [binary,101292.1,2.1] {-} $F.
% 76.98/77.23  
% 76.98/77.23  Length of proof is 42.  Level of proof is 21.
% 76.98/77.23  
% 76.98/77.23  ---------------- PROOF ----------------
% 76.98/77.23  % SZS status Unsatisfiable
% 76.98/77.23  % SZS output start Refutation
% 76.98/77.23  
% 76.98/77.23  1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 76.98/77.23  2 [] {+} -is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),c),equivalent(b,a))).
% 76.98/77.23  3 [] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),B),equivalent(C,A))).
% 76.98/77.23  4 [hyper,3,1,3] {-} is_a_theorem(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,B),A),C)))).
% 76.98/77.23  5 [hyper,4,1,4] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,A),equivalent(C,equivalent(D,equivalent(equivalent(equivalent(E,D),C),E)))),B))).
% 76.98/77.23  6 [hyper,4,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,A),equivalent(equivalent(equivalent(C,equivalent(D,E)),D),equivalent(E,C))),B))).
% 76.98/77.23  9 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(equivalent(D,C),B),D)))),equivalent(E,equivalent(F,equivalent(equivalent(equivalent(G,F),E),G)))),A)).
% 76.98/77.23  10 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,D)),C),equivalent(D,B))),equivalent(E,equivalent(F,equivalent(equivalent(equivalent(G,F),E),G)))),A)).
% 76.98/77.23  31 [hyper,9,1,9] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,B),A),C))),equivalent(D,equivalent(E,equivalent(equivalent(equivalent(F,E),D),F))))).
% 76.98/77.23  36 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,A),C),B)),equivalent(C,equivalent(D,equivalent(E,equivalent(equivalent(equivalent(F,E),D),F)))))).
% 76.98/77.23  43 [hyper,31,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,equivalent(C,equivalent(equivalent(equivalent(D,C),B),D)))),E),A),E)).
% 76.98/77.23  56 [hyper,36,1,6] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),B),equivalent(C,A)),equivalent(D,equivalent(E,equivalent(equivalent(equivalent(F,E),D),F))))).
% 76.98/77.23  57 [hyper,10,1,9] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,B),A),C))),equivalent(equivalent(equivalent(D,equivalent(E,F)),E),equivalent(F,D)))).
% 76.98/77.23  70 [hyper,56,1,10] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(C,equivalent(equivalent(B,equivalent(D,A)),D))),C)).
% 76.98/77.23  71 [hyper,56,1,9] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,A),C),B)),equivalent(D,C)),D)).
% 76.98/77.23  78 [hyper,70,1,43] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(C,equivalent(equivalent(equivalent(D,C),B),D))),equivalent(E,A)),E))).
% 76.98/77.23  145 [hyper,57,1,70] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,equivalent(equivalent(equivalent(D,C),E),D)),equivalent(A,E)))),B)).
% 76.98/77.23  158 [hyper,145,1,78] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(C,B),A),C))),equivalent(equivalent(equivalent(D,equivalent(equivalent(equivalent(E,D),F),E)),equivalent(G,F)),G))).
% 76.98/77.23  1205 [hyper,158,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(C,B),D),C)),equivalent(E,D)),E)),F),A),F)).
% 76.98/77.23  1242 [hyper,1205,1,71] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),A),equivalent(B,C))).
% 76.98/77.23  1249 [hyper,1242,1,1242] {+} is_a_theorem(equivalent(A,A)).
% 76.98/77.23  1281 [hyper,1242,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,C),A),B),C))).
% 76.98/77.23  1294 [hyper,1242,1,56] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,A),C),B),C))).
% 76.98/77.23  1417 [hyper,1281,1,70] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(C,D)),C)),equivalent(D,B)),A)).
% 76.98/77.23  1425 [hyper,1281,1,1249] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(C,C)),A),B)).
% 76.98/77.23  1660 [hyper,1294,1,70] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,equivalent(D,B)),D)),A)).
% 76.98/77.23  1878 [hyper,1425,1,71] {+} is_a_theorem(equivalent(equivalent(equivalent(A,B),B),A)).
% 76.98/77.23  1905 [hyper,1878,1,3] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).
% 76.98/77.23  1907 [hyper,1878,1,1242] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),A),B)).
% 76.98/77.23  1908 [hyper,1878,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 76.98/77.23  2055 [hyper,1907,1,70] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(B,equivalent(C,A)),C))).
% 76.98/77.23  2060 [hyper,1908,1,1908] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,B),C))),A)).
% 76.98/77.23  3160 [hyper,2055,1,71] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),C),A),equivalent(C,B))).
% 76.98/77.23  3178 [hyper,2055,1,1905] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(A,B)),equivalent(C,B)),C)).
% 76.98/77.23  3367 [hyper,2060,1,1242] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(C,B),C)),A)).
% 76.98/77.23  5229 [hyper,3160,1,71] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(C,A),B),C))).
% 76.98/77.23  5772 [hyper,3178,1,2055] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 76.98/77.23  6378 [hyper,3367,1,5772] {-} is_a_theorem(equivalent(A,equivalent(equivalent(A,B),equivalent(equivalent(C,B),C)))).
% 76.98/77.23  9962 [hyper,5229,1,5772] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,B)),A)).
% 76.98/77.23  16195 [hyper,6378,1,145] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(A,C)),C),B))).
% 76.98/77.23  26047 [hyper,1660,1,3160] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(B,equivalent(C,A)))).
% 76.98/77.23  37132 [hyper,9962,1,1417] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(C,B)),C))).
% 76.98/77.23  48155 [hyper,26047,1,5772] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,A),B))).
% 76.98/77.23  74573 [hyper,48155,1,37132] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,equivalent(A,C)))).
% 76.98/77.23  101292 [hyper,74573,1,16195] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(B,A))).
% 76.98/77.23  101293 [binary,101292.1,2.1] {-} $F.
% 76.98/77.23  
% 76.98/77.23  % SZS output end Refutation
% 76.98/77.23  ------------ end of proof -------------
% 76.98/77.23  
% 76.98/77.23  
% 76.98/77.23  Search stopped by max_proofs option.
% 76.98/77.23  
% 76.98/77.23  
% 76.98/77.23  Search stopped by max_proofs option.
% 76.98/77.23  
% 76.98/77.23  ============ end of search ============
% 76.98/77.23  
% 76.98/77.23  ----------- soft-scott stats ----------
% 76.98/77.23  
% 76.98/77.23  true clauses given           6      (1.0%)
% 76.98/77.23  false clauses given        604
% 76.98/77.23  
% 76.98/77.23        FALSE     TRUE
% 76.98/77.23    12  64        64
% 76.98/77.23    16  2436      540
% 76.98/77.23    20  0         602
% 76.98/77.23  tot:  2500      1206      (32.5% true)
% 76.98/77.23  
% 76.98/77.23  
% 76.98/77.23  Model 9 [ 6 329 181823 ] (0.00 seconds, 183886 Inserts)
% 76.98/77.23  
% 76.98/77.23  That finishes the proof of the theorem.
% 76.98/77.23  
% 76.98/77.23  Process 1511 finished Sat Jul  2 20:11:10 2022
%------------------------------------------------------------------------------