↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n013.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:48 EDT 2022

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

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