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

View Problem - Process Solution

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

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

% Result   : Unsatisfiable 0.68s 0.88s
% Output   : Refutation 0.68s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LCL090-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n011.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 : Sat Jul  2 22:22:35 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.12/0.35  ----- Otter 3.2, August 2001 -----
% 0.12/0.35  The process was started by sandbox2 on n011.cluster.edu,
% 0.12/0.35  Sat Jul  2 22:22:35 2022
% 0.12/0.35  The command was "./sos".  The process ID is 26237.
% 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: 3
% 0.12/0.37     distinct predicate count: 1
% 0.12/0.37     distinct function count: 1
% 0.12/0.37     distinct constant count: 1
% 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.68/0.88  
% 0.68/0.88  -------- PROOF -------- 
% 0.68/0.88  % SZS status Unsatisfiable
% 0.68/0.88  % SZS output start Refutation
% 0.68/0.88  
% 0.68/0.88  Model 2 (0.00 seconds, 0 Inserts)
% 0.68/0.88  
% 0.68/0.88  Stopped by limit on number of solutions
% 0.68/0.88  
% 0.68/0.88  ----> UNIT CONFLICT at   0.51 sec ----> 389 [binary,388.1,2.1] {+} $F.
% 0.68/0.88  
% 0.68/0.88  Length of proof is 16.  Level of proof is 16.
% 0.68/0.88  
% 0.68/0.88  ---------------- PROOF ----------------
% 0.68/0.88  % SZS status Unsatisfiable
% 0.68/0.88  % SZS output start Refutation
% 0.68/0.88  
% 0.68/0.88  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.68/0.88  2 [] {+} -is_a_theorem(implies(a,a)).
% 0.68/0.88  3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(implies(D,A),implies(E,implies(C,A))))).
% 0.68/0.88  4 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(C,D)),implies(E,implies(implies(F,C),implies(C,D))))).
% 0.68/0.88  5 [hyper,4,1,4] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(implies(D,E),implies(E,C)))))).
% 0.68/0.88  7 [hyper,5,1,5] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(implies(C,D),implies(D,B))))).
% 0.68/0.88  11 [hyper,7,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(B,C)),D),implies(E,implies(C,D)))).
% 0.68/0.88  18 [hyper,11,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(C,D),implies(D,A))),implies(E,implies(F,implies(implies(C,D),implies(D,A)))))).
% 0.68/0.88  54 [hyper,18,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(C,D),implies(D,implies(D,D)))))).
% 0.68/0.88  106 [hyper,54,1,54] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(C,C))))).
% 0.68/0.88  109 [hyper,106,1,106] {-} is_a_theorem(implies(implies(A,B),implies(B,implies(B,B)))).
% 0.68/0.88  114 [hyper,109,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,implies(A,B)))).
% 0.68/0.88  122 [hyper,114,1,3] {-} is_a_theorem(implies(implies(implies(A,B),implies(A,A)),implies(C,implies(D,implies(A,A))))).
% 0.68/0.88  308 [hyper,122,1,114] {+} is_a_theorem(implies(A,implies(B,implies(implies(C,C),implies(C,C))))).
% 0.68/0.88  315 [hyper,308,1,308] {+} is_a_theorem(implies(A,implies(implies(B,B),implies(B,B)))).
% 0.68/0.88  346 [hyper,315,1,315] {+} is_a_theorem(implies(implies(A,A),implies(A,A))).
% 0.68/0.88  377 [hyper,346,1,122] {-} is_a_theorem(implies(A,implies(B,implies(C,C)))).
% 0.68/0.88  379 [hyper,377,1,377] {-} is_a_theorem(implies(A,implies(B,B))).
% 0.68/0.88  388 [hyper,379,1,379] {-} is_a_theorem(implies(A,A)).
% 0.68/0.88  389 [binary,388.1,2.1] {+} $F.
% 0.68/0.88  
% 0.68/0.88  % SZS output end Refutation
% 0.68/0.88  ------------ end of proof -------------
% 0.68/0.88  
% 0.68/0.88  
% 0.68/0.88  Search stopped by max_proofs option.
% 0.68/0.88  
% 0.68/0.88  
% 0.68/0.88  Search stopped by max_proofs option.
% 0.68/0.88  
% 0.68/0.88  ============ end of search ============
% 0.68/0.88  
% 0.68/0.88  ----------- soft-scott stats ----------
% 0.68/0.88  
% 0.68/0.88  true clauses given           9      (16.4%)
% 0.68/0.88  false clauses given         46
% 0.68/0.88  
% 0.68/0.88        FALSE     TRUE
% 0.68/0.88    10  1         0
% 0.68/0.88    12  2         0
% 0.68/0.88    14  2         0
% 0.68/0.88    16  4         1
% 0.68/0.88    18  18        6
% 0.68/0.88    20  28        5
% 0.68/0.88    22  32        9
% 0.68/0.88    24  36        9
% 0.68/0.88    26  19        7
% 0.68/0.88    28  8         3
% 0.68/0.88    30  7         3
% 0.68/0.88    32  5         0
% 0.68/0.88    34  3         0
% 0.68/0.88    36  5         1
% 0.68/0.88    38  2         0
% 0.68/0.88    40  2         0
% 0.68/0.88    42  1         0
% 0.68/0.88  tot:  175       44      (20.1% true)
% 0.68/0.88  
% 0.68/0.88  
% 0.68/0.88  Model 2 (0.00 seconds, 0 Inserts)
% 0.68/0.88  
% 0.68/0.88  That finishes the proof of the theorem.
% 0.68/0.88  
% 0.68/0.88  Process 26237 finished Sat Jul  2 22:22:35 2022
%------------------------------------------------------------------------------