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

View Problem - Process Solution

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

% Result   : Unsatisfiable 1.97s 2.21s
% Output   : Refutation 1.97s
% Verified : 
% SZS Type : -

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