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

View Problem - Process Solution

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

% Computer : n020.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:48 EDT 2022

% Result   : Unsatisfiable 0.19s 0.43s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL083-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul  3 19:08:30 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n020.cluster.edu,
% 0.13/0.35  Sun Jul  3 19:08:30 2022
% 0.13/0.35  The command was "./sos".  The process ID is 21030.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This is a Horn set without equality.  The strategy will
% 0.13/0.35  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.35  in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: clear(order_hyper).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35  
% 0.13/0.35  ======= end of input processing =======
% 0.13/0.38  
% 0.13/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38  
% 0.13/0.38  Stopped by limit on number of solutions
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  -------------- Softie stats --------------
% 0.13/0.38  
% 0.13/0.38  UPDATE_STOP: 300
% 0.13/0.38  SFINDER_TIME_LIMIT: 2
% 0.13/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38  number of clauses in intial UL: 2
% 0.13/0.38  number of clauses initially in problem: 3
% 0.13/0.38  percentage of clauses intially in UL: 66
% 0.13/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38  percent of all initial clauses that are short: 100
% 0.13/0.38  absolute distinct symbol count: 4
% 0.13/0.38     distinct predicate count: 1
% 0.13/0.38     distinct function count: 1
% 0.13/0.38     distinct constant count: 2
% 0.13/0.38  
% 0.13/0.38  ---------- no more Softie stats ----------
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  
% 0.13/0.38  =========== start of search ===========
% 0.19/0.43  
% 0.19/0.43  -------- PROOF -------- 
% 0.19/0.43  % SZS status Unsatisfiable
% 0.19/0.43  % SZS output start Refutation
% 0.19/0.43  
% 0.19/0.43  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43  
% 0.19/0.43  Stopped by limit on number of solutions
% 0.19/0.43  
% 0.19/0.43  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.43  
% 0.19/0.43  Stopped by limit on number of solutions
% 0.19/0.43  
% 0.19/0.43  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43  
% 0.19/0.43  Stopped by limit on number of solutions
% 0.19/0.43  
% 0.19/0.43  ----> UNIT CONFLICT at   0.05 sec ----> 112 [binary,111.1,2.1] {-} $F.
% 0.19/0.43  
% 0.19/0.43  Length of proof is 16.  Level of proof is 15.
% 0.19/0.43  
% 0.19/0.43  ---------------- PROOF ----------------
% 0.19/0.43  % SZS status Unsatisfiable
% 0.19/0.43  % SZS output start Refutation
% 0.19/0.43  
% 0.19/0.43  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.43  2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 0.19/0.43  3 [] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 0.19/0.43  4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 0.19/0.43  5 [hyper,4,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 0.19/0.43  6 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(E,B))),implies(F,implies(implies(D,B),implies(E,B))))).
% 0.19/0.43  7 [hyper,5,1,5] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 0.19/0.43  9 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,A)),B),implies(C,B))).
% 0.19/0.43  19 [hyper,6,1,9] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,C)))).
% 0.19/0.43  21 [hyper,19,1,19] {+} is_a_theorem(implies(implies(A,B),implies(B,B))).
% 0.19/0.43  25 [hyper,21,1,9] {+} is_a_theorem(implies(implies(A,B),implies(A,B))).
% 0.19/0.43  27 [hyper,25,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 0.19/0.43  39 [hyper,27,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(B,C)),implies(D,implies(B,C)))).
% 0.19/0.43  42 [hyper,39,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(D,B)),implies(E,implies(D,B)))).
% 0.19/0.43  51 [hyper,42,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),D),C),implies(B,C)))).
% 0.19/0.43  52 [hyper,51,1,51] {-} is_a_theorem(implies(implies(implies(implies(A,B),C),B),implies(A,B))).
% 0.19/0.43  54 [hyper,52,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(A,B),C)),implies(D,implies(implies(A,B),C)))).
% 0.19/0.43  106 [hyper,54,1,27] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 0.19/0.43  111 [hyper,106,1,106] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 0.19/0.43  112 [binary,111.1,2.1] {-} $F.
% 0.19/0.43  
% 0.19/0.43  % SZS output end Refutation
% 0.19/0.43  ------------ end of proof -------------
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Search stopped by max_proofs option.
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Search stopped by max_proofs option.
% 0.19/0.43  
% 0.19/0.43  ============ end of search ============
% 0.19/0.43  
% 0.19/0.43  ----------- soft-scott stats ----------
% 0.19/0.43  
% 0.19/0.43  true clauses given          11      (25.6%)
% 0.19/0.43  false clauses given         32
% 0.19/0.43  
% 0.19/0.43        FALSE     TRUE
% 0.19/0.43    10  1         1
% 0.19/0.43    12  3         5
% 0.19/0.43    14  1         4
% 0.19/0.43    16  2         3
% 0.19/0.43    18  13        0
% 0.19/0.43    20  10        1
% 0.19/0.43    24  2         0
% 0.19/0.43    26  2         0
% 0.19/0.43    30  2         0
% 0.19/0.43    32  1         0
% 0.19/0.43  tot:  37        14      (27.5% true)
% 0.19/0.43  
% 0.19/0.43  
% 0.19/0.43  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43  
% 0.19/0.43  That finishes the proof of the theorem.
% 0.19/0.43  
% 0.19/0.43  Process 21030 finished Sun Jul  3 19:08:30 2022
%------------------------------------------------------------------------------