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

View Problem - Process Solution

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

% Computer : n015.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:31 EDT 2022

% Result   : Unsatisfiable 24.24s 24.47s
% Output   : Refutation 24.24s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL040-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n015.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.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jul  2 17:48:59 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox on n015.cluster.edu,
% 0.14/0.36  Sat Jul  2 17:48:59 2022
% 0.14/0.36  The command was "./sos".  The process ID is 4566.
% 0.14/0.36  
% 0.14/0.36  set(prolog_style_variables).
% 0.14/0.36  set(auto).
% 0.14/0.36     dependent: set(auto1).
% 0.14/0.36     dependent: set(process_input).
% 0.14/0.36     dependent: clear(print_kept).
% 0.14/0.36     dependent: clear(print_new_demod).
% 0.14/0.36     dependent: clear(print_back_demod).
% 0.14/0.36     dependent: clear(print_back_sub).
% 0.14/0.36     dependent: set(control_memory).
% 0.14/0.36     dependent: assign(max_mem, 12000).
% 0.14/0.36     dependent: assign(pick_given_ratio, 4).
% 0.14/0.36     dependent: assign(stats_level, 1).
% 0.14/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36     dependent: assign(sos_limit, 5000).
% 0.14/0.36     dependent: assign(max_weight, 60).
% 0.14/0.36  clear(print_given).
% 0.14/0.36  
% 0.14/0.36  list(usable).
% 0.14/0.36  
% 0.14/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.14/0.36  
% 0.14/0.36  This is a Horn set without equality.  The strategy will
% 0.14/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.14/0.36  in usable.
% 0.14/0.36  
% 0.14/0.36     dependent: set(hyper_res).
% 0.14/0.36     dependent: clear(order_hyper).
% 0.14/0.36  
% 0.14/0.36  ------------> process usable:
% 0.14/0.36  
% 0.14/0.36  ------------> process sos:
% 0.14/0.36  
% 0.14/0.36  ======= end of input processing =======
% 0.14/0.40  
% 0.14/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40  
% 0.14/0.40  Stopped by limit on number of solutions
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  -------------- Softie stats --------------
% 0.14/0.40  
% 0.14/0.40  UPDATE_STOP: 300
% 0.14/0.40  SFINDER_TIME_LIMIT: 2
% 0.14/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40  number of clauses in intial UL: 2
% 0.14/0.40  number of clauses initially in problem: 7
% 0.14/0.40  percentage of clauses intially in UL: 28
% 0.14/0.40  percentage of distinct symbols occuring in initial UL: 83
% 0.14/0.40  percent of all initial clauses that are short: 100
% 0.14/0.40  absolute distinct symbol count: 6
% 0.14/0.40     distinct predicate count: 1
% 0.14/0.40     distinct function count: 2
% 0.14/0.40     distinct constant count: 3
% 0.14/0.40  
% 0.14/0.40  ---------- no more Softie stats ----------
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  
% 0.14/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40  
% 0.14/0.40  Stopped by limit on number of solutions
% 0.14/0.40  
% 0.14/0.40  =========== start of search ===========
% 10.14/10.36  
% 10.14/10.36  
% 10.14/10.36  Changing weight limit from 60 to 28.
% 10.14/10.36  
% 10.14/10.36  Model 3 (0.00 seconds, 0 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on number of solutions
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 4 [ 1 1 762 ] (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Model 5 (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on number of solutions
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 6 (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on number of solutions
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 7 [ 2 1 747 ] (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 8 [ 3 0 310 ] (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 9 [ 3 0 951 ] (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Model 10 [ 6 3 14348 ] (0.00 seconds, 250000 Inserts)
% 10.14/10.36  
% 10.14/10.36  Stopped by limit on insertions
% 10.14/10.36  
% 10.14/10.36  Resetting weight limit to 28 after 200 givens.
% 10.14/10.36  
% 10.66/10.86  
% 10.66/10.86  
% 10.66/10.86  Changing weight limit from 28 to 24.
% 10.66/10.86  
% 10.66/10.86  Resetting weight limit to 24 after 395 givens.
% 10.66/10.86  
% 10.66/10.88  
% 10.66/10.88  
% 10.66/10.88  Changing weight limit from 24 to 22.
% 10.66/10.88  
% 10.66/10.88  Resetting weight limit to 22 after 400 givens.
% 10.66/10.88  
% 10.75/10.99  
% 10.75/10.99  
% 10.75/10.99  Changing weight limit from 22 to 20.
% 10.75/10.99  
% 10.75/10.99  Modelling stopped after 300 given clauses and 0.00 seconds
% 10.75/10.99  
% 10.75/10.99  
% 10.75/10.99  Resetting weight limit to 20 after 410 givens.
% 10.75/10.99  
% 10.95/11.13  
% 10.95/11.13  
% 10.95/11.13  Changing weight limit from 20 to 18.
% 10.95/11.13  
% 10.95/11.13  Resetting weight limit to 18 after 430 givens.
% 10.95/11.13  
% 11.65/11.86  
% 11.65/11.86  
% 11.65/11.86  Changing weight limit from 18 to 17.
% 11.65/11.86  
% 11.65/11.86  Resetting weight limit to 17 after 560 givens.
% 11.65/11.86  
% 11.95/12.13  
% 11.95/12.13  
% 11.95/12.13  Changing weight limit from 17 to 16.
% 11.95/12.13  
% 11.95/12.13  Resetting weight limit to 16 after 625 givens.
% 11.95/12.13  
% 13.04/13.20  
% 13.04/13.20  
% 13.04/13.20  Changing weight limit from 16 to 15.
% 13.04/13.20  
% 13.04/13.20  Resetting weight limit to 15 after 870 givens.
% 13.04/13.20  
% 21.16/21.38  
% 21.16/21.38  
% 21.16/21.38  Changing weight limit from 15 to 14.
% 21.16/21.38  
% 21.16/21.38  Resetting weight limit to 14 after 3085 givens.
% 21.16/21.38  
% 24.24/24.47  
% 24.24/24.47  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 24.24/24.47  
% 24.24/24.47  ----> UNIT CONFLICT at  22.55 sec ----> 66725 [binary,66724.1,2.1] {-} $F.
% 24.24/24.47  
% 24.24/24.47  Length of proof is 10.  Level of proof is 6.
% 24.24/24.47  
% 24.24/24.47  ---------------- PROOF ----------------
% 24.24/24.47  % SZS status Unsatisfiable
% 24.24/24.47  % SZS output start Refutation
% 24.24/24.47  
% 24.24/24.47  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 24.24/24.47  2 [] {+} -is_a_theorem(implies(implies(a,implies(b,c)),implies(b,implies(a,c)))).
% 24.24/24.47  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 24.24/24.47  4 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 24.24/24.47  8 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 24.24/24.47  15 [hyper,8,1,3] {-} is_a_theorem(implies(A,implies(B,implies(C,implies(D,C))))).
% 24.24/24.47  19 [hyper,4,1,4] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 24.24/24.47  20 [hyper,4,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))).
% 24.24/24.47  253 [hyper,19,1,15] {-} is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))).
% 24.24/24.47  256 [hyper,19,1,8] {-} is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))).
% 24.24/24.47  1181 [hyper,256,1,20] {-} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 24.24/24.47  14478 [hyper,253,1,1181] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 24.24/24.47  14525 [hyper,14478,1,1181] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),D)),implies(A,implies(C,D)))).
% 24.24/24.47  66724 [hyper,14525,1,4] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 24.24/24.47  66725 [binary,66724.1,2.1] {-} $F.
% 24.24/24.47  
% 24.24/24.47  % SZS output end Refutation
% 24.24/24.47  ------------ end of proof -------------
% 24.24/24.47  
% 24.24/24.47  
% 24.24/24.47  Search stopped by max_proofs option.
% 24.24/24.47  
% 24.24/24.47  
% 24.24/24.47  Search stopped by max_proofs option.
% 24.24/24.47  
% 24.24/24.47  ============ end of search ============
% 24.24/24.47  
% 24.24/24.47  ----------- soft-scott stats ----------
% 24.24/24.47  
% 24.24/24.47  true clauses given        1055      (28.8%)
% 24.24/24.47  false clauses given       2604
% 24.24/24.47  
% 24.24/24.47        FALSE     TRUE
% 24.24/24.47    12  0         4
% 24.24/24.47    13  0         894
% 24.24/24.47    14  2457      1788
% 24.24/24.47  tot:  2457      2686      (52.2% true)
% 24.24/24.47  
% 24.24/24.47  
% 24.24/24.47  Model 10 [ 6 -166 14348 ] (0.00 seconds, 250000 Inserts)
% 24.24/24.47  
% 24.24/24.47  That finishes the proof of the theorem.
% 24.24/24.47  
% 24.24/24.47  Process 4566 finished Sat Jul  2 17:49:23 2022
%------------------------------------------------------------------------------