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

View Problem - Process Solution

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

% Computer : n007.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:22 EDT 2022

% Result   : Unsatisfiable 43.78s 43.97s
% Output   : Refutation 43.78s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL014-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul  3 05:22:25 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox on n007.cluster.edu,
% 0.12/0.35  Sun Jul  3 05:22:25 2022
% 0.12/0.35  The command was "./sos".  The process ID is 22547.
% 0.12/0.35  
% 0.12/0.35  set(prolog_style_variables).
% 0.12/0.35  set(auto).
% 0.12/0.35     dependent: set(auto1).
% 0.12/0.35     dependent: set(process_input).
% 0.12/0.35     dependent: clear(print_kept).
% 0.12/0.35     dependent: clear(print_new_demod).
% 0.12/0.35     dependent: clear(print_back_demod).
% 0.12/0.35     dependent: clear(print_back_sub).
% 0.12/0.35     dependent: set(control_memory).
% 0.12/0.35     dependent: assign(max_mem, 12000).
% 0.12/0.35     dependent: assign(pick_given_ratio, 4).
% 0.12/0.35     dependent: assign(stats_level, 1).
% 0.12/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35     dependent: assign(sos_limit, 5000).
% 0.12/0.35     dependent: assign(max_weight, 60).
% 0.12/0.35  clear(print_given).
% 0.12/0.35  
% 0.12/0.35  list(usable).
% 0.12/0.35  
% 0.12/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.35  
% 0.12/0.35  This is a Horn set without equality.  The strategy will
% 0.12/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.35  in usable.
% 0.12/0.35  
% 0.12/0.35     dependent: set(hyper_res).
% 0.12/0.35     dependent: clear(order_hyper).
% 0.12/0.35  
% 0.12/0.35  ------------> process usable:
% 0.12/0.35  
% 0.12/0.35  ------------> process sos:
% 0.12/0.35  
% 0.12/0.35  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 2
% 0.12/0.38  number of clauses initially in problem: 3
% 0.12/0.38  percentage of clauses intially in UL: 66
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 5
% 0.12/0.38     distinct predicate count: 1
% 0.12/0.38     distinct function count: 1
% 0.12/0.38     distinct constant count: 3
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 41.65/41.86  
% 41.65/41.86  
% 41.65/41.86  Changing weight limit from 60 to 40.
% 41.65/41.86  
% 41.65/41.86  Model 2 [ 1 0 362 ] (0.00 seconds, 198058 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 3 [ 2 1 216 ] (0.00 seconds, 198176 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 4 [ 2 0 676 ] (0.00 seconds, 198732 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 5 [ 6 0 377 ] (0.00 seconds, 199597 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 6 [ 3 1 741 ] (0.00 seconds, 204382 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 7 [ 3 0 363 ] (0.00 seconds, 199228 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 8 [ 6 1 369 ] (0.00 seconds, 202019 Inserts)
% 41.65/41.86  
% 41.65/41.86  Model 9 [ 14 0 601 ] (0.00 seconds, 199053 Inserts)
% 41.65/41.86  
% 41.65/41.86  Resetting weight limit to 40 after 80 givens.
% 41.65/41.86  
% 41.75/41.99  
% 41.75/41.99  
% 41.75/41.99  Changing weight limit from 40 to 32.
% 41.75/41.99  
% 41.75/41.99  Resetting weight limit to 32 after 85 givens.
% 41.75/41.99  
% 41.83/42.04  
% 41.83/42.04  
% 41.83/42.04  Changing weight limit from 32 to 28.
% 41.83/42.04  
% 41.83/42.04  Resetting weight limit to 28 after 90 givens.
% 41.83/42.04  
% 41.94/42.16  
% 41.94/42.16  
% 41.94/42.16  Changing weight limit from 28 to 24.
% 41.94/42.16  
% 41.94/42.16  Resetting weight limit to 24 after 100 givens.
% 41.94/42.16  
% 42.04/42.25  
% 42.04/42.25  
% 42.04/42.25  Changing weight limit from 24 to 20.
% 42.04/42.25  
% 42.04/42.25  Resetting weight limit to 20 after 110 givens.
% 42.04/42.25  
% 43.78/43.97  
% 43.78/43.97  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 43.78/43.97  
% 43.78/43.97  Modelling stopped after 300 given clauses and 0.00 seconds
% 43.78/43.97  
% 43.78/43.97  
% 43.78/43.97  ----> UNIT CONFLICT at  43.54 sec ----> 29686 [binary,29685.1,2.1] {-} $F.
% 43.78/43.97  
% 43.78/43.97  Length of proof is 23.  Level of proof is 14.
% 43.78/43.97  
% 43.78/43.97  ---------------- PROOF ----------------
% 43.78/43.97  % SZS status Unsatisfiable
% 43.78/43.97  % SZS output start Refutation
% 43.78/43.97  
% 43.78/43.97  1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 43.78/43.97  2 [] {+} -is_a_theorem(equivalent(a,equivalent(equivalent(b,equivalent(a,c)),equivalent(c,b)))).
% 43.78/43.97  3 [] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(C,equivalent(A,B)))).
% 43.78/43.97  4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(A,B),equivalent(equivalent(A,equivalent(B,C)),C))).
% 43.78/43.97  5 [hyper,4,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(A,equivalent(B,C)),C),D)),D)).
% 43.78/43.97  6 [hyper,4,1,3] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(B,equivalent(C,A))))).
% 43.78/43.97  7 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,equivalent(A,B)),D)),D)).
% 43.78/43.97  9 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,equivalent(C,A))),D)),D)).
% 43.78/43.97  13 [hyper,5,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(equivalent(A,equivalent(B,C)),C),D)),equivalent(D,E)),E)).
% 43.78/43.97  16 [hyper,7,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(B,C)),equivalent(equivalent(C,equivalent(A,B)),D)),equivalent(D,E)),E)).
% 43.78/43.97  31 [hyper,9,1,4] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,A),B))).
% 43.78/43.97  32 [hyper,31,1,31] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(C,B),C))),A)).
% 43.78/43.97  35 [hyper,31,1,5] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(A,B)))).
% 43.78/43.97  65 [hyper,32,1,35] {+} is_a_theorem(equivalent(A,A)).
% 43.78/43.97  99 [hyper,65,1,4] {+} is_a_theorem(equivalent(equivalent(A,equivalent(A,B)),B)).
% 43.78/43.97  117 [hyper,99,1,31] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,equivalent(B,C)),C)),A)).
% 43.78/43.97  356 [hyper,13,1,65] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(B,C)),C),equivalent(A,B))).
% 43.78/43.97  903 [hyper,16,1,65] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,C)),equivalent(B,equivalent(C,A)))).
% 43.78/43.97  1248 [hyper,356,1,117] {+} is_a_theorem(equivalent(A,equivalent(B,equivalent(B,A)))).
% 43.78/43.97  1404 [hyper,1248,1,3] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(B,A))).
% 43.78/43.97  1496 [hyper,1404,1,4] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(equivalent(B,A),C)),C)).
% 43.78/43.97  2753 [hyper,903,1,903] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(C,equivalent(A,B))))).
% 43.78/43.97  5727 [hyper,1496,1,1404] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,C),equivalent(equivalent(C,B),A)))).
% 43.78/43.97  8245 [hyper,2753,1,1404] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),equivalent(B,equivalent(C,A))),C)).
% 43.78/43.97  11908 [hyper,5727,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,B),C),equivalent(C,equivalent(B,A)))).
% 43.78/43.97  29685 [hyper,11908,1,8245] {-} is_a_theorem(equivalent(A,equivalent(equivalent(B,equivalent(A,C)),equivalent(C,B)))).
% 43.78/43.97  29686 [binary,29685.1,2.1] {-} $F.
% 43.78/43.97  
% 43.78/43.97  % SZS output end Refutation
% 43.78/43.97  ------------ end of proof -------------
% 43.78/43.97  
% 43.78/43.97  
% 43.78/43.97  Search stopped by max_proofs option.
% 43.78/43.97  
% 43.78/43.97  
% 43.78/43.97  Search stopped by max_proofs option.
% 43.78/43.97  
% 43.78/43.97  ============ end of search ============
% 43.78/43.97  
% 43.78/43.97  ----------- soft-scott stats ----------
% 43.78/43.97  
% 43.78/43.97  true clauses given           9      (2.8%)
% 43.78/43.97  false clauses given        309
% 43.78/43.97  
% 43.78/43.97        FALSE     TRUE
% 43.78/43.97    12  124       84
% 43.78/43.97    16  2467      495
% 43.78/43.97    20  216       566
% 43.78/43.97  tot:  2807      1145      (29.0% true)
% 43.78/43.97  
% 43.78/43.97  
% 43.78/43.97  Model 9 [ 14 0 601 ] (0.00 seconds, 199053 Inserts)
% 43.78/43.97  
% 43.78/43.97  That finishes the proof of the theorem.
% 43.78/43.97  
% 43.78/43.97  Process 22547 finished Sun Jul  3 05:23:09 2022
%------------------------------------------------------------------------------