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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL087-1 : TPTP v8.1.0. Released v1.0.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:27:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL087-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.12/0.33  % Computer : n029.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 15:02:11 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 sandbox2 on n029.cluster.edu,
% 0.12/0.35  Sun Jul  3 15:02:11 2022
% 0.12/0.35  The command was "./sos".  The process ID is 6462.
% 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.37  
% 0.12/0.37  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37  
% 0.12/0.37  Stopped by limit on number of solutions
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  -------------- Softie stats --------------
% 0.12/0.37  
% 0.12/0.37  UPDATE_STOP: 300
% 0.12/0.37  SFINDER_TIME_LIMIT: 2
% 0.12/0.37  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37  number of clauses in intial UL: 2
% 0.12/0.37  number of clauses initially in problem: 3
% 0.12/0.37  percentage of clauses intially in UL: 66
% 0.12/0.37  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37  percent of all initial clauses that are short: 100
% 0.12/0.37  absolute distinct symbol count: 4
% 0.12/0.37     distinct predicate count: 1
% 0.12/0.37     distinct function count: 1
% 0.12/0.37     distinct constant count: 2
% 0.12/0.37  
% 0.12/0.37  ---------- no more Softie stats ----------
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  
% 0.12/0.37  =========== start of search ===========
% 0.19/0.45  
% 0.19/0.45  -------- PROOF -------- 
% 0.19/0.45  % SZS status Unsatisfiable
% 0.19/0.45  % SZS output start Refutation
% 0.19/0.45  
% 0.19/0.45  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.45  
% 0.19/0.45  Stopped by limit on number of solutions
% 0.19/0.45  
% 0.19/0.45  ----> UNIT CONFLICT at   0.07 sec ----> 45 [binary,44.1,2.1] {-} $F.
% 0.19/0.45  
% 0.19/0.45  Length of proof is 8.  Level of proof is 8.
% 0.19/0.45  
% 0.19/0.45  ---------------- PROOF ----------------
% 0.19/0.45  % SZS status Unsatisfiable
% 0.19/0.45  % SZS output start Refutation
% 0.19/0.45  
% 0.19/0.45  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.45  2 [] {+} -is_a_theorem(implies(a,implies(b,a))).
% 0.19/0.45  3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 0.19/0.45  4 [hyper,3,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(implies(B,C),implies(D,C)),implies(C,E)),implies(F,implies(C,E))))).
% 0.19/0.45  5 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),implies(B,D)),implies(E,implies(B,D)))).
% 0.19/0.45  7 [hyper,5,1,5] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 0.19/0.45  10 [hyper,7,1,7] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 0.19/0.45  12 [hyper,10,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))).
% 0.19/0.45  32 [hyper,12,1,12] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))).
% 0.19/0.45  37 [hyper,32,1,5] {-} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.19/0.45  44 [hyper,37,1,37] {-} is_a_theorem(implies(A,implies(B,A))).
% 0.19/0.45  45 [binary,44.1,2.1] {-} $F.
% 0.19/0.45  
% 0.19/0.45  % SZS output end Refutation
% 0.19/0.45  ------------ end of proof -------------
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Search stopped by max_proofs option.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Search stopped by max_proofs option.
% 0.19/0.45  
% 0.19/0.45  ============ end of search ============
% 0.19/0.45  
% 0.19/0.45  ----------- soft-scott stats ----------
% 0.19/0.45  
% 0.19/0.45  true clauses given           0      (0.0%)
% 0.19/0.45  false clauses given         12
% 0.19/0.45  
% 0.19/0.45        FALSE     TRUE
% 0.19/0.45     6  0         1
% 0.19/0.45    12  1         0
% 0.19/0.45    14  2         0
% 0.19/0.45    16  7         0
% 0.19/0.45    18  3         0
% 0.19/0.45    22  5         0
% 0.19/0.45    24  2         0
% 0.19/0.45    26  1         0
% 0.19/0.45    28  3         0
% 0.19/0.45    30  2         0
% 0.19/0.45    38  1         0
% 0.19/0.45    46  1         0
% 0.19/0.45  tot:  28        1      (3.4% true)
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.45  
% 0.19/0.45  That finishes the proof of the theorem.
% 0.19/0.45  
% 0.19/0.45  Process 6462 finished Sun Jul  3 15:02:11 2022
%------------------------------------------------------------------------------