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

View Problem - Process Solution

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

% Computer : n010.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:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : LCL111-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n010.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 : Mon Jul  4 14:20:02 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 n010.cluster.edu,
% 0.13/0.35  Mon Jul  4 14:20:02 2022
% 0.13/0.35  The command was "./sos".  The process ID is 9682.
% 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.40  
% 0.13/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  -------------- Softie stats --------------
% 0.13/0.40  
% 0.13/0.40  UPDATE_STOP: 300
% 0.13/0.40  SFINDER_TIME_LIMIT: 2
% 0.13/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.40  number of clauses in intial UL: 2
% 0.13/0.40  number of clauses initially in problem: 6
% 0.13/0.40  percentage of clauses intially in UL: 33
% 0.13/0.40  percentage of distinct symbols occuring in initial UL: 83
% 0.13/0.40  percent of all initial clauses that are short: 100
% 0.13/0.40  absolute distinct symbol count: 6
% 0.13/0.40     distinct predicate count: 1
% 0.13/0.40     distinct function count: 2
% 0.13/0.40     distinct constant count: 3
% 0.13/0.40  
% 0.13/0.40  ---------- no more Softie stats ----------
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  
% 0.13/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.40  
% 0.13/0.40  Stopped by limit on number of solutions
% 0.13/0.40  
% 0.13/0.40  =========== start of search ===========
% 0.19/0.49  
% 0.19/0.49  -------- PROOF -------- 
% 0.19/0.49  % SZS status Unsatisfiable
% 0.19/0.49  % SZS output start Refutation
% 0.19/0.49  
% 0.19/0.49  Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.49  
% 0.19/0.49  Stopped by limit on number of solutions
% 0.19/0.49  
% 0.19/0.49  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.49  
% 0.19/0.49  Stopped by limit on number of solutions
% 0.19/0.49  
% 0.19/0.49  ----> UNIT CONFLICT at   0.10 sec ----> 97 [binary,96.1,2.1] {-} $F.
% 0.19/0.49  
% 0.19/0.49  Length of proof is 5.  Level of proof is 4.
% 0.19/0.49  
% 0.19/0.49  ---------------- PROOF ----------------
% 0.19/0.49  % SZS status Unsatisfiable
% 0.19/0.49  % SZS output start Refutation
% 0.19/0.49  
% 0.19/0.49  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 0.19/0.49  2 [] {+} -is_a_theorem(implies(implies(a,b),implies(implies(c,a),implies(c,b)))).
% 0.19/0.49  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 0.19/0.49  4 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 0.19/0.49  5 [] {-} is_a_theorem(implies(implies(implies(A,B),B),implies(implies(B,A),A))).
% 0.19/0.49  9 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 0.19/0.49  12 [hyper,4,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 0.19/0.49  20 [hyper,5,1,12] {+} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 0.19/0.49  66 [hyper,20,1,4] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(A,C))).
% 0.19/0.49  96 [hyper,66,1,9] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 0.19/0.49  97 [binary,96.1,2.1] {-} $F.
% 0.19/0.49  
% 0.19/0.49  % SZS output end Refutation
% 0.19/0.49  ------------ end of proof -------------
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Search stopped by max_proofs option.
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Search stopped by max_proofs option.
% 0.19/0.49  
% 0.19/0.49  ============ end of search ============
% 0.19/0.49  
% 0.19/0.49  ----------- soft-scott stats ----------
% 0.19/0.49  
% 0.19/0.49  true clauses given           2      (13.3%)
% 0.19/0.49  false clauses given         13
% 0.19/0.49  
% 0.19/0.49        FALSE     TRUE
% 0.19/0.49     8  0         1
% 0.19/0.49     9  0         3
% 0.19/0.49    10  0         8
% 0.19/0.49    11  0         7
% 0.19/0.49    12  0         10
% 0.19/0.49    13  1         0
% 0.19/0.49    14  9         1
% 0.19/0.49    15  3         1
% 0.19/0.49    16  15        3
% 0.19/0.49    18  1         0
% 0.19/0.49    20  3         0
% 0.19/0.49  tot:  32        34      (51.5% true)
% 0.19/0.49  
% 0.19/0.49  
% 0.19/0.49  Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.49  
% 0.19/0.49  That finishes the proof of the theorem.
% 0.19/0.49  
% 0.19/0.49  Process 9682 finished Mon Jul  4 14:20:02 2022
%------------------------------------------------------------------------------