↑ Up

SOS---2.0.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL026-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:26 EDT 2022

% Result   : Unsatisfiable 3.74s 3.93s
% Output   : Refutation 3.74s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL026-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n008.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 : Sun Jul  3 06:06:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox2 on n008.cluster.edu,
% 0.13/0.36  Sun Jul  3 06:06:38 2022
% 0.13/0.36  The command was "./sos".  The process ID is 6944.
% 0.13/0.36  
% 0.13/0.36  set(prolog_style_variables).
% 0.13/0.36  set(auto).
% 0.13/0.36     dependent: set(auto1).
% 0.13/0.36     dependent: set(process_input).
% 0.13/0.36     dependent: clear(print_kept).
% 0.13/0.36     dependent: clear(print_new_demod).
% 0.13/0.36     dependent: clear(print_back_demod).
% 0.13/0.36     dependent: clear(print_back_sub).
% 0.13/0.36     dependent: set(control_memory).
% 0.13/0.36     dependent: assign(max_mem, 12000).
% 0.13/0.36     dependent: assign(pick_given_ratio, 4).
% 0.13/0.36     dependent: assign(stats_level, 1).
% 0.13/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36     dependent: assign(sos_limit, 5000).
% 0.13/0.36     dependent: assign(max_weight, 60).
% 0.13/0.36  clear(print_given).
% 0.13/0.36  
% 0.13/0.36  list(usable).
% 0.13/0.36  
% 0.13/0.36  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36  
% 0.13/0.36  This is a Horn set without equality.  The strategy will
% 0.13/0.36  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36  in usable.
% 0.13/0.36  
% 0.13/0.36     dependent: set(hyper_res).
% 0.13/0.36     dependent: clear(order_hyper).
% 0.13/0.36  
% 0.13/0.36  ------------> process usable:
% 0.13/0.36  
% 0.13/0.36  ------------> process sos:
% 0.13/0.36  
% 0.13/0.36  ======= end of input processing =======
% 0.19/0.39  
% 0.19/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  -------------- Softie stats --------------
% 0.19/0.39  
% 0.19/0.39  UPDATE_STOP: 300
% 0.19/0.39  SFINDER_TIME_LIMIT: 2
% 0.19/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39  number of clauses in intial UL: 2
% 0.19/0.39  number of clauses initially in problem: 5
% 0.19/0.39  percentage of clauses intially in UL: 40
% 0.19/0.39  percentage of distinct symbols occuring in initial UL: 80
% 0.19/0.39  percent of all initial clauses that are short: 100
% 0.19/0.39  absolute distinct symbol count: 5
% 0.19/0.39     distinct predicate count: 1
% 0.19/0.39     distinct function count: 1
% 0.19/0.39     distinct constant count: 3
% 0.19/0.39  
% 0.19/0.39  ---------- no more Softie stats ----------
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  
% 0.19/0.39  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39  
% 0.19/0.39  Stopped by limit on number of solutions
% 0.19/0.39  
% 0.19/0.39  =========== start of search ===========
% 0.69/0.92  
% 0.69/0.92  
% 0.69/0.92  Changing weight limit from 60 to 50.
% 0.69/0.92  
% 0.69/0.92  Model 3 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Model 4 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Model 5 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Model 6 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Model 7 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Model 8 (0.00 seconds, 0 Inserts)
% 0.69/0.92  
% 0.69/0.92  Stopped by limit on number of solutions
% 0.69/0.92  
% 0.69/0.92  Resetting weight limit to 50 after 230 givens.
% 0.69/0.92  
% 1.88/2.06  
% 1.88/2.06  
% 1.88/2.06  Changing weight limit from 50 to 38.
% 1.88/2.06  
% 1.88/2.06  Modelling stopped after 300 given clauses and 0.00 seconds
% 1.88/2.06  
% 1.88/2.06  
% 1.88/2.06  Resetting weight limit to 38 after 410 givens.
% 1.88/2.06  
% 1.90/2.09  
% 1.90/2.09  
% 1.90/2.09  Changing weight limit from 38 to 34.
% 1.90/2.09  
% 1.90/2.09  Resetting weight limit to 34 after 415 givens.
% 1.90/2.09  
% 1.94/2.12  
% 1.94/2.12  
% 1.94/2.12  Changing weight limit from 34 to 30.
% 1.94/2.12  
% 1.94/2.12  Resetting weight limit to 30 after 420 givens.
% 1.94/2.12  
% 1.97/2.17  
% 1.97/2.17  
% 1.97/2.17  Changing weight limit from 30 to 28.
% 1.97/2.17  
% 1.97/2.17  Resetting weight limit to 28 after 430 givens.
% 1.97/2.17  
% 1.97/2.23  
% 1.97/2.23  
% 1.97/2.23  Changing weight limit from 28 to 24.
% 1.97/2.23  
% 1.97/2.23  Resetting weight limit to 24 after 435 givens.
% 1.97/2.23  
% 2.25/2.51  
% 2.25/2.51  
% 2.25/2.51  Changing weight limit from 24 to 22.
% 2.25/2.51  
% 2.25/2.51  Resetting weight limit to 22 after 460 givens.
% 2.25/2.51  
% 2.67/2.92  
% 2.67/2.92  
% 2.67/2.92  Changing weight limit from 22 to 20.
% 2.67/2.92  
% 2.67/2.92  Resetting weight limit to 20 after 505 givens.
% 2.67/2.92  
% 3.74/3.92  
% 3.74/3.92  
% 3.74/3.92  Changing weight limit from 20 to 18.
% 3.74/3.92  
% 3.74/3.92  Resetting weight limit to 18 after 640 givens.
% 3.74/3.92  
% 3.74/3.93  
% 3.74/3.93  -------- PROOF -------- 
% 3.74/3.93  % SZS status Unsatisfiable
% 3.74/3.93  % SZS output start Refutation
% 3.74/3.93  
% 3.74/3.93  ----> UNIT CONFLICT at   3.46 sec ----> 23193 [binary,23192.1,2.1] {+} $F.
% 3.74/3.93  
% 3.74/3.93  Length of proof is 26.  Level of proof is 11.
% 3.74/3.93  
% 3.74/3.93  ---------------- PROOF ----------------
% 3.74/3.93  % SZS status Unsatisfiable
% 3.74/3.93  % SZS output start Refutation
% 3.74/3.93  
% 3.74/3.93  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 3.74/3.93  2 [] {+} -is_a_theorem(implies(implies(implies(a,b),a),a)).
% 3.74/3.93  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 3.74/3.93  4 [] {-} is_a_theorem(implies(implies(implies(A,falsehood),falsehood),A)).
% 3.74/3.93  5 [] {-} is_a_theorem(implies(implies(A,implies(B,C)),implies(implies(A,B),implies(A,C)))).
% 3.74/3.93  6 [hyper,3,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,B)))).
% 3.74/3.93  8 [hyper,4,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,falsehood),falsehood),B))).
% 3.74/3.93  10 [hyper,8,1,3] {-} is_a_theorem(implies(A,implies(B,implies(implies(implies(C,falsehood),falsehood),C)))).
% 3.74/3.93  12 [hyper,5,1,5] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),implies(A,B)),implies(implies(A,implies(B,C)),implies(A,C)))).
% 3.74/3.93  13 [hyper,5,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(C,D)),implies(implies(B,C),implies(B,D))))).
% 3.74/3.93  15 [hyper,5,1,8] {-} is_a_theorem(implies(implies(A,implies(implies(B,falsehood),falsehood)),implies(A,B))).
% 3.74/3.93  17 [hyper,5,1,3] {+} is_a_theorem(implies(implies(A,B),implies(A,A))).
% 3.74/3.93  23 [hyper,15,1,3] {+} is_a_theorem(implies(falsehood,A)).
% 3.74/3.93  25 [hyper,23,1,3] {+} is_a_theorem(implies(A,implies(falsehood,B))).
% 3.74/3.93  29 [hyper,6,1,3] {+} is_a_theorem(implies(A,implies(B,implies(C,implies(D,C))))).
% 3.74/3.93  32 [hyper,17,1,10] {+} is_a_theorem(implies(A,A)).
% 3.74/3.93  33 [hyper,32,1,5] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(implies(A,B),B))).
% 3.74/3.93  35 [hyper,33,1,15] {-} is_a_theorem(implies(implies(implies(A,falsehood),A),A)).
% 3.74/3.93  43 [hyper,35,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,falsehood),B),B))).
% 3.74/3.93  47 [hyper,25,1,5] {+} is_a_theorem(implies(implies(A,falsehood),implies(A,B))).
% 3.74/3.93  50 [hyper,43,1,5] {-} is_a_theorem(implies(implies(A,implies(implies(B,falsehood),B)),implies(A,B))).
% 3.74/3.93  58 [hyper,50,1,3] {-} is_a_theorem(implies(A,implies(implies(B,implies(implies(C,falsehood),C)),implies(B,C)))).
% 3.74/3.93  67 [hyper,12,1,6] {+} is_a_theorem(implies(implies(A,implies(implies(B,A),C)),implies(A,C))).
% 3.74/3.93  118 [hyper,47,1,3] {+} is_a_theorem(implies(A,implies(implies(B,falsehood),implies(B,C)))).
% 3.74/3.93  203 [hyper,58,1,5] {-} is_a_theorem(implies(implies(A,implies(B,implies(implies(C,falsehood),C))),implies(A,implies(B,C)))).
% 3.74/3.93  251 [hyper,29,1,12] {+} is_a_theorem(implies(implies(A,implies(implies(B,implies(C,B)),D)),implies(A,D))).
% 3.74/3.93  440 [hyper,118,1,12] {+} is_a_theorem(implies(implies(implies(A,falsehood),implies(implies(A,B),C)),implies(implies(A,falsehood),C))).
% 3.74/3.93  1061 [hyper,67,1,13] {+} is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 3.74/3.93  15115 [hyper,1061,1,251] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 3.74/3.93  15620 [hyper,15115,1,203] {-} is_a_theorem(implies(implies(implies(A,B),implies(implies(C,falsehood),C)),implies(B,C))).
% 3.74/3.93  23192 [hyper,440,1,15620] {-} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 3.74/3.93  23193 [binary,23192.1,2.1] {+} $F.
% 3.74/3.93  
% 3.74/3.93  % SZS output end Refutation
% 3.74/3.93  ------------ end of proof -------------
% 3.74/3.93  
% 3.74/3.93  
% 3.74/3.93  Search stopped by max_proofs option.
% 3.74/3.93  
% 3.74/3.93  
% 3.74/3.93  Search stopped by max_proofs option.
% 3.74/3.93  
% 3.74/3.93  ============ end of search ============
% 3.74/3.93  
% 3.74/3.93  ----------- soft-scott stats ----------
% 3.74/3.93  
% 3.74/3.93  true clauses given         167      (26.1%)
% 3.74/3.93  false clauses given        474
% 3.74/3.93  
% 3.74/3.93        FALSE     TRUE
% 3.74/3.93    12  0         46
% 3.74/3.93    14  0         338
% 3.74/3.93    16  637       876
% 3.74/3.93    18  1863      1240
% 3.74/3.93  tot:  2500      2500      (50.0% true)
% 3.74/3.93  
% 3.74/3.93  
% 3.74/3.93  Model 8 (0.00 seconds, 0 Inserts)
% 3.74/3.93  
% 3.74/3.93  That finishes the proof of the theorem.
% 3.74/3.93  
% 3.74/3.93  Process 6944 finished Sun Jul  3 06:06:41 2022
%------------------------------------------------------------------------------