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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL086-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:50 EDT 2022

% Result   : Unsatisfiable 0.23s 0.47s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : LCL086-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : sos-script %s
% 0.15/0.36  % Computer : n008.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 600
% 0.15/0.36  % DateTime : Sat Jul  2 20:29:38 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 0.15/0.38  ----- Otter 3.2, August 2001 -----
% 0.15/0.38  The process was started by sandbox2 on n008.cluster.edu,
% 0.15/0.38  Sat Jul  2 20:29:38 2022
% 0.15/0.38  The command was "./sos".  The process ID is 29263.
% 0.15/0.38  
% 0.15/0.38  set(prolog_style_variables).
% 0.15/0.38  set(auto).
% 0.15/0.38     dependent: set(auto1).
% 0.15/0.38     dependent: set(process_input).
% 0.15/0.38     dependent: clear(print_kept).
% 0.15/0.38     dependent: clear(print_new_demod).
% 0.15/0.38     dependent: clear(print_back_demod).
% 0.15/0.38     dependent: clear(print_back_sub).
% 0.15/0.38     dependent: set(control_memory).
% 0.15/0.38     dependent: assign(max_mem, 12000).
% 0.15/0.38     dependent: assign(pick_given_ratio, 4).
% 0.15/0.38     dependent: assign(stats_level, 1).
% 0.15/0.38     dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.38     dependent: assign(sos_limit, 5000).
% 0.15/0.38     dependent: assign(max_weight, 60).
% 0.15/0.38  clear(print_given).
% 0.15/0.38  
% 0.15/0.38  list(usable).
% 0.15/0.38  
% 0.15/0.38  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.15/0.38  
% 0.15/0.38  This is a Horn set without equality.  The strategy will
% 0.15/0.38  be hyperresolution, with satellites in sos and nuclei
% 0.15/0.38  in usable.
% 0.15/0.38  
% 0.15/0.38     dependent: set(hyper_res).
% 0.15/0.38     dependent: clear(order_hyper).
% 0.15/0.38  
% 0.15/0.38  ------------> process usable:
% 0.15/0.38  
% 0.15/0.38  ------------> process sos:
% 0.15/0.38  
% 0.15/0.38  ======= end of input processing =======
% 0.15/0.40  
% 0.15/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.40  
% 0.15/0.40  Stopped by limit on number of solutions
% 0.15/0.40  
% 0.15/0.40  
% 0.15/0.40  -------------- Softie stats --------------
% 0.15/0.40  
% 0.15/0.40  UPDATE_STOP: 300
% 0.15/0.40  SFINDER_TIME_LIMIT: 2
% 0.15/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.40  number of clauses in intial UL: 2
% 0.15/0.40  number of clauses initially in problem: 3
% 0.15/0.40  percentage of clauses intially in UL: 66
% 0.15/0.40  percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.40  percent of all initial clauses that are short: 100
% 0.15/0.40  absolute distinct symbol count: 3
% 0.15/0.40     distinct predicate count: 1
% 0.15/0.40     distinct function count: 1
% 0.15/0.40     distinct constant count: 1
% 0.15/0.40  
% 0.15/0.40  ---------- no more Softie stats ----------
% 0.15/0.40  
% 0.15/0.40  
% 0.15/0.40  
% 0.15/0.40  =========== start of search ===========
% 0.23/0.47  
% 0.23/0.47  -------- PROOF -------- 
% 0.23/0.47  % SZS status Unsatisfiable
% 0.23/0.47  % SZS output start Refutation
% 0.23/0.47  
% 0.23/0.47  Model 2 (0.00 seconds, 0 Inserts)
% 0.23/0.47  
% 0.23/0.47  Stopped by limit on number of solutions
% 0.23/0.47  
% 0.23/0.47  Model 3 (0.00 seconds, 0 Inserts)
% 0.23/0.47  
% 0.23/0.47  Stopped by limit on number of solutions
% 0.23/0.47  
% 0.23/0.47  Model 4 (0.00 seconds, 0 Inserts)
% 0.23/0.47  
% 0.23/0.47  Stopped by limit on number of solutions
% 0.23/0.47  
% 0.23/0.47  ----> UNIT CONFLICT at   0.07 sec ----> 89 [binary,88.1,2.1] {-} $F.
% 0.23/0.47  
% 0.23/0.47  Length of proof is 12.  Level of proof is 12.
% 0.23/0.47  
% 0.23/0.47  ---------------- PROOF ----------------
% 0.23/0.47  % SZS status Unsatisfiable
% 0.23/0.47  % SZS output start Refutation
% 0.23/0.47  
% 0.23/0.47  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.23/0.47  2 [] {+} -is_a_theorem(implies(a,a)).
% 0.23/0.47  3 [] {-} is_a_theorem(implies(implies(implies(A,B),implies(C,D)),implies(E,implies(implies(D,A),implies(C,A))))).
% 0.23/0.47  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.23/0.47  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.23/0.47  7 [hyper,5,1,5] {-} is_a_theorem(implies(A,implies(implies(B,C),implies(C,implies(B,C))))).
% 0.23/0.47  10 [hyper,7,1,7] {+} is_a_theorem(implies(implies(A,B),implies(B,implies(A,B)))).
% 0.23/0.47  12 [hyper,10,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(C,B)))).
% 0.23/0.47  32 [hyper,12,1,12] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(B,A))).
% 0.23/0.47  37 [hyper,32,1,5] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 0.23/0.47  52 [hyper,37,1,37] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.23/0.47  71 [hyper,52,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 0.23/0.47  79 [hyper,71,1,71] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 0.23/0.47  83 [hyper,79,1,79] {-} is_a_theorem(implies(A,implies(B,B))).
% 0.23/0.47  88 [hyper,83,1,83] {-} is_a_theorem(implies(A,A)).
% 0.23/0.47  89 [binary,88.1,2.1] {-} $F.
% 0.23/0.47  
% 0.23/0.47  % SZS output end Refutation
% 0.23/0.47  ------------ end of proof -------------
% 0.23/0.47  
% 0.23/0.47  
% 0.23/0.47  Search stopped by max_proofs option.
% 0.23/0.47  
% 0.23/0.47  
% 0.23/0.47  Search stopped by max_proofs option.
% 0.23/0.47  
% 0.23/0.47  ============ end of search ============
% 0.23/0.47  
% 0.23/0.47  ----------- soft-scott stats ----------
% 0.23/0.47  
% 0.23/0.47  true clauses given           1      (5.0%)
% 0.23/0.47  false clauses given         19
% 0.23/0.47  
% 0.23/0.47        FALSE     TRUE
% 0.23/0.47     8  0         1
% 0.23/0.47    10  1         1
% 0.23/0.47    12  0         3
% 0.23/0.47    14  4         2
% 0.23/0.47    16  6         1
% 0.23/0.47    18  3         1
% 0.23/0.47    20  2         0
% 0.23/0.47    22  3         0
% 0.23/0.47    24  3         0
% 0.23/0.47    26  3         0
% 0.23/0.47    28  3         0
% 0.23/0.47    30  2         0
% 0.23/0.47  tot:  30        9      (23.1% true)
% 0.23/0.47  
% 0.23/0.47  
% 0.23/0.47  Model 4 (0.00 seconds, 0 Inserts)
% 0.23/0.47  
% 0.23/0.47  That finishes the proof of the theorem.
% 0.23/0.47  
% 0.23/0.47  Process 29263 finished Sat Jul  2 20:29:38 2022
%------------------------------------------------------------------------------