↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL392-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n029.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:29:53 EDT 2022

% Result   : Unsatisfiable 26.07s 26.31s
% Output   : Refutation 26.07s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL392-1 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jul  3 11:18:40 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n029.cluster.edu,
% 0.12/0.36  Sun Jul  3 11:18:40 2022
% 0.12/0.36  The command was "./sos".  The process ID is 16730.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.12/0.36  
% 0.12/0.36  This is a Horn set without equality.  The strategy will
% 0.12/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.12/0.36  in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: clear(order_hyper).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.12/0.38  
% 0.12/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38  
% 0.12/0.38  Stopped by limit on number of solutions
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  -------------- Softie stats --------------
% 0.12/0.38  
% 0.12/0.38  UPDATE_STOP: 300
% 0.12/0.38  SFINDER_TIME_LIMIT: 2
% 0.12/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38  number of clauses in intial UL: 2
% 0.12/0.38  number of clauses initially in problem: 5
% 0.12/0.38  percentage of clauses intially in UL: 40
% 0.12/0.38  percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.38  percent of all initial clauses that are short: 100
% 0.12/0.38  absolute distinct symbol count: 6
% 0.12/0.38     distinct predicate count: 1
% 0.12/0.38     distinct function count: 2
% 0.12/0.38     distinct constant count: 3
% 0.12/0.38  
% 0.12/0.38  ---------- no more Softie stats ----------
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  
% 0.12/0.38  =========== start of search ===========
% 3.02/3.23  
% 3.02/3.23  
% 3.02/3.23  Changing weight limit from 60 to 59.
% 3.02/3.23  
% 3.02/3.23  Model 2 (0.00 seconds, 0 Inserts)
% 3.02/3.23  
% 3.02/3.23  Stopped by limit on number of solutions
% 3.02/3.23  
% 3.02/3.23  Model 3 (0.00 seconds, 0 Inserts)
% 3.02/3.23  
% 3.02/3.23  Stopped by limit on number of solutions
% 3.02/3.23  
% 3.02/3.23  Model 4 (0.00 seconds, 0 Inserts)
% 3.02/3.23  
% 3.02/3.23  Stopped by limit on number of solutions
% 3.02/3.23  
% 3.02/3.23  Stopped by limit on insertions
% 3.02/3.23  
% 3.02/3.23  Model 5 [ 1 0 347 ] (0.00 seconds, 250000 Inserts)
% 3.02/3.23  
% 3.02/3.23  Resetting weight limit to 59 after 155 givens.
% 3.02/3.23  
% 10.05/10.29  
% 10.05/10.29  
% 10.05/10.29  Changing weight limit from 59 to 28.
% 10.05/10.29  
% 10.05/10.29  Stopped by limit on insertions
% 10.05/10.29  
% 10.05/10.29  Model 6 [ 1 0 242 ] (0.00 seconds, 250000 Inserts)
% 10.05/10.29  
% 10.05/10.29  Resetting weight limit to 28 after 250 givens.
% 10.05/10.29  
% 18.66/18.85  
% 18.66/18.85  
% 18.66/18.85  Changing weight limit from 28 to 26.
% 18.66/18.85  
% 18.66/18.85  Stopped by limit on insertions
% 18.66/18.85  
% 18.66/18.85  Stopped by limit on insertions
% 18.66/18.85  
% 18.66/18.85  Model 7 [ 1 1 4551 ] (0.00 seconds, 250000 Inserts)
% 18.66/18.85  
% 18.66/18.85  Modelling stopped after 300 given clauses and 0.00 seconds
% 18.66/18.85  
% 18.66/18.85  
% 18.66/18.85  Resetting weight limit to 26 after 575 givens.
% 18.66/18.85  
% 18.78/18.99  
% 18.78/18.99  
% 18.78/18.99  Changing weight limit from 26 to 25.
% 18.78/18.99  
% 18.78/18.99  Resetting weight limit to 25 after 585 givens.
% 18.78/18.99  
% 18.82/19.04  
% 18.82/19.04  
% 18.82/19.04  Changing weight limit from 25 to 24.
% 18.82/19.04  
% 18.82/19.04  Resetting weight limit to 24 after 595 givens.
% 18.82/19.04  
% 18.98/19.20  
% 18.98/19.20  
% 18.98/19.20  Changing weight limit from 24 to 23.
% 18.98/19.20  
% 18.98/19.20  Resetting weight limit to 23 after 615 givens.
% 18.98/19.20  
% 19.07/19.32  
% 19.07/19.32  
% 19.07/19.32  Changing weight limit from 23 to 22.
% 19.07/19.32  
% 19.07/19.32  Resetting weight limit to 22 after 630 givens.
% 19.07/19.32  
% 19.28/19.49  
% 19.28/19.49  
% 19.28/19.49  Changing weight limit from 22 to 21.
% 19.28/19.49  
% 19.28/19.49  Resetting weight limit to 21 after 660 givens.
% 19.28/19.49  
% 19.60/19.80  
% 19.60/19.80  
% 19.60/19.80  Changing weight limit from 21 to 20.
% 19.60/19.80  
% 19.60/19.80  Resetting weight limit to 20 after 710 givens.
% 19.60/19.80  
% 19.89/20.11  
% 19.89/20.11  
% 19.89/20.11  Changing weight limit from 20 to 19.
% 19.89/20.11  
% 19.89/20.11  Resetting weight limit to 19 after 740 givens.
% 19.89/20.11  
% 20.41/20.65  
% 20.41/20.65  
% 20.41/20.65  Changing weight limit from 19 to 18.
% 20.41/20.65  
% 20.41/20.65  Resetting weight limit to 18 after 810 givens.
% 20.41/20.65  
% 20.96/21.19  
% 20.96/21.19  
% 20.96/21.19  Changing weight limit from 18 to 17.
% 20.96/21.19  
% 20.96/21.19  Resetting weight limit to 17 after 890 givens.
% 20.96/21.19  
% 22.27/22.54  
% 22.27/22.54  
% 22.27/22.54  Changing weight limit from 17 to 16.
% 22.27/22.54  
% 22.27/22.54  Resetting weight limit to 16 after 1195 givens.
% 22.27/22.54  
% 24.35/24.53  
% 24.35/24.53  
% 24.35/24.53  Changing weight limit from 16 to 15.
% 24.35/24.53  
% 24.35/24.53  Resetting weight limit to 15 after 1500 givens.
% 24.35/24.53  
% 26.07/26.31  
% 26.07/26.31  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 26.07/26.31  
% 26.07/26.31  ----> UNIT CONFLICT at  25.37 sec ----> 127944 [binary,127943.1,2.1] {+} $F.
% 26.07/26.31  
% 26.07/26.31  Length of proof is 43.  Level of proof is 25.
% 26.07/26.31  
% 26.07/26.31  ---------------- PROOF ----------------
% 26.07/26.31  % SZS status Unsatisfiable
% 26.07/26.31  % SZS output start Refutation
% 26.07/26.31  
% 26.07/26.31  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 26.07/26.31  2 [] {+} -is_a_theorem(implies(implies(implies(implies(x,y),y),z),implies(implies(not(x),y),z))).
% 26.07/26.31  3 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 26.07/26.31  4 [] {+} is_a_theorem(implies(implies(not(A),A),A)).
% 26.07/26.31  5 [] {+} is_a_theorem(implies(A,implies(not(A),B))).
% 26.07/26.31  6 [hyper,3,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 26.07/26.31  7 [hyper,4,1,3] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),A),B))).
% 26.07/26.31  9 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(not(A),B),C),implies(A,C))).
% 26.07/26.31  12 [hyper,7,1,7] {+} is_a_theorem(implies(implies(not(implies(A,B)),implies(A,B)),implies(implies(not(A),A),B))).
% 26.07/26.31  14 [hyper,7,1,3] {+} is_a_theorem(implies(implies(implies(implies(not(A),A),B),C),implies(implies(A,B),C))).
% 26.07/26.31  21 [hyper,6,1,7] {+} is_a_theorem(implies(implies(not(implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(implies(A,B),implies(C,B)),D)),implies(implies(C,A),D))).
% 26.07/26.31  22 [hyper,6,1,6] {+} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(D,B),implies(A,implies(D,C))))).
% 26.07/26.31  27 [hyper,6,1,3] {+} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),D),implies(implies(B,C),D)))).
% 26.07/26.31  28 [hyper,9,1,7] {-} is_a_theorem(implies(implies(not(implies(implies(not(A),B),C)),implies(implies(not(A),B),C)),implies(A,C))).
% 26.07/26.31  29 [hyper,9,1,6] {-} is_a_theorem(implies(implies(A,not(B)),implies(B,implies(A,C)))).
% 26.07/26.31  34 [hyper,9,1,4] {+} is_a_theorem(implies(A,A)).
% 26.07/26.31  40 [hyper,29,1,9] {+} is_a_theorem(implies(A,implies(B,implies(not(A),C)))).
% 26.07/26.31  43 [hyper,29,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),D),implies(implies(B,not(A)),D))).
% 26.07/26.31  57 [hyper,40,1,3] {-} is_a_theorem(implies(implies(implies(A,implies(not(B),C)),D),implies(B,D))).
% 26.07/26.31  73 [hyper,57,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(not(A),B),C),implies(D,C)))).
% 26.07/26.31  85 [hyper,73,1,34] {-} is_a_theorem(implies(implies(implies(not(implies(A,A)),B),C),implies(D,C))).
% 26.07/26.31  113 [hyper,85,1,4] {+} is_a_theorem(implies(A,implies(B,B))).
% 26.07/26.31  138 [hyper,12,1,85] {+} is_a_theorem(implies(A,implies(implies(not(B),B),B))).
% 26.07/26.31  183 [hyper,113,1,3] {-} is_a_theorem(implies(implies(implies(A,A),B),implies(C,B))).
% 26.07/26.31  195 [hyper,183,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,D),B),C))).
% 26.07/26.31  249 [hyper,138,1,3] {-} is_a_theorem(implies(implies(implies(implies(not(A),A),A),B),implies(C,B))).
% 26.07/26.31  281 [hyper,249,1,6] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(C,implies(A,B)))).
% 26.07/26.31  7638 [hyper,281,1,43] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(C,implies(B,A)))).
% 26.07/26.31  7693 [hyper,7638,1,281] {-} is_a_theorem(implies(A,implies(implies(not(B),not(C)),implies(C,B)))).
% 26.07/26.31  7721 [hyper,7693,1,7693] {-} is_a_theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 26.07/26.31  7758 [hyper,7693,1,28] {+} is_a_theorem(implies(A,implies(B,A))).
% 26.07/26.31  8048 [hyper,7758,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 26.07/26.31  8068 [hyper,7721,1,195] {-} is_a_theorem(implies(implies(implies(A,A),not(B)),implies(B,C))).
% 26.07/26.31  10012 [hyper,8048,1,8068] {-} is_a_theorem(implies(not(A),implies(A,B))).
% 26.07/26.31  10195 [hyper,10012,1,27] {+} is_a_theorem(implies(implies(implies(not(A),B),C),implies(implies(implies(A,D),B),C))).
% 26.07/26.31  10201 [hyper,10012,1,3] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(not(A),C))).
% 26.07/26.31  36642 [hyper,10201,1,281] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 26.07/26.31  36829 [hyper,36642,1,21] {+} is_a_theorem(implies(implies(A,implies(A,B)),implies(A,B))).
% 26.07/26.31  38232 [hyper,36829,1,281] {+} is_a_theorem(implies(implies(A,implies(not(B),B)),implies(A,B))).
% 26.07/26.31  65510 [hyper,38232,1,6] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(B,A),A))).
% 26.07/26.31  65707 [hyper,65510,1,8048] {-} is_a_theorem(implies(A,implies(implies(A,B),B))).
% 26.07/26.31  66146 [hyper,65707,1,22] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 26.07/26.31  122918 [hyper,10195,1,65510] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 26.07/26.31  126227 [hyper,122918,1,6] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),B),B))).
% 26.07/26.31  127287 [hyper,126227,1,66146] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(A,C),C))).
% 26.07/26.31  127634 [hyper,127287,1,14] {-} is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B))).
% 26.07/26.31  127669 [hyper,127634,1,66146] {-} is_a_theorem(implies(implies(not(A),B),implies(implies(A,B),B))).
% 26.07/26.31  127943 [hyper,127669,1,3] {-} is_a_theorem(implies(implies(implies(implies(A,B),B),C),implies(implies(not(A),B),C))).
% 26.07/26.31  127944 [binary,127943.1,2.1] {+} $F.
% 26.07/26.31  
% 26.07/26.31  % SZS output end Refutation
% 26.07/26.31  ------------ end of proof -------------
% 26.07/26.31  
% 26.07/26.31  
% 26.07/26.31  Search stopped by max_proofs option.
% 26.07/26.31  
% 26.07/26.31  
% 26.07/26.31  Search stopped by max_proofs option.
% 26.07/26.31  
% 26.07/26.31  ============ end of search ============
% 26.07/26.31  
% 26.07/26.31  ----------- soft-scott stats ----------
% 26.07/26.31  
% 26.07/26.31  true clauses given         332      (17.6%)
% 26.07/26.31  false clauses given       1553
% 26.07/26.31  
% 26.07/26.31        FALSE     TRUE
% 26.07/26.31    12  1         194
% 26.07/26.31    13  1402      479
% 26.07/26.31    14  1097      1075
% 26.07/26.31    15  0         752
% 26.07/26.31  tot:  2500      2500      (50.0% true)
% 26.07/26.31  
% 26.07/26.31  
% 26.07/26.31  Model 7 [ 1 1 4551 ] (0.00 seconds, 250000 Inserts)
% 26.07/26.31  
% 26.07/26.31  That finishes the proof of the theorem.
% 26.07/26.31  
% 26.07/26.31  Process 16730 finished Sun Jul  3 11:19:06 2022
%------------------------------------------------------------------------------