↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n021.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:47 EDT 2022

% Result   : Unsatisfiable 14.14s 14.36s
% Output   : Refutation 14.14s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL080-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13  % Command  : sos-script %s
% 0.13/0.35  % Computer : n021.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul  4 01:21:16 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.13/0.37  ----- Otter 3.2, August 2001 -----
% 0.13/0.37  The process was started by sandbox on n021.cluster.edu,
% 0.13/0.37  Mon Jul  4 01:21:16 2022
% 0.13/0.37  The command was "./sos".  The process ID is 7466.
% 0.13/0.37  
% 0.13/0.37  set(prolog_style_variables).
% 0.13/0.37  set(auto).
% 0.13/0.37     dependent: set(auto1).
% 0.13/0.37     dependent: set(process_input).
% 0.13/0.37     dependent: clear(print_kept).
% 0.13/0.37     dependent: clear(print_new_demod).
% 0.13/0.37     dependent: clear(print_back_demod).
% 0.13/0.37     dependent: clear(print_back_sub).
% 0.13/0.37     dependent: set(control_memory).
% 0.13/0.37     dependent: assign(max_mem, 12000).
% 0.13/0.37     dependent: assign(pick_given_ratio, 4).
% 0.13/0.37     dependent: assign(stats_level, 1).
% 0.13/0.37     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37     dependent: assign(sos_limit, 5000).
% 0.13/0.37     dependent: assign(max_weight, 60).
% 0.13/0.37  clear(print_given).
% 0.13/0.37  
% 0.13/0.37  list(usable).
% 0.13/0.37  
% 0.13/0.37  SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.37  
% 0.13/0.37  This is a Horn set without equality.  The strategy will
% 0.13/0.37  be hyperresolution, with satellites in sos and nuclei
% 0.13/0.37  in usable.
% 0.13/0.37  
% 0.13/0.37     dependent: set(hyper_res).
% 0.13/0.37     dependent: clear(order_hyper).
% 0.13/0.37  
% 0.13/0.37  ------------> process usable:
% 0.13/0.37  
% 0.13/0.37  ------------> process sos:
% 0.13/0.37  
% 0.13/0.37  ======= end of input processing =======
% 0.20/0.47  
% 0.20/0.47  Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.47  
% 0.20/0.47  Stopped by limit on number of solutions
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  -------------- Softie stats --------------
% 0.20/0.47  
% 0.20/0.47  UPDATE_STOP: 300
% 0.20/0.47  SFINDER_TIME_LIMIT: 2
% 0.20/0.47  SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.47  number of clauses in intial UL: 2
% 0.20/0.47  number of clauses initially in problem: 5
% 0.20/0.47  percentage of clauses intially in UL: 40
% 0.20/0.47  percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.47  percent of all initial clauses that are short: 100
% 0.20/0.47  absolute distinct symbol count: 6
% 0.20/0.47     distinct predicate count: 1
% 0.20/0.47     distinct function count: 1
% 0.20/0.47     distinct constant count: 4
% 0.20/0.47  
% 0.20/0.47  ---------- no more Softie stats ----------
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  
% 0.20/0.47  Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.47  
% 0.20/0.47  Stopped by limit on number of solutions
% 0.20/0.47  
% 0.20/0.47  =========== start of search ===========
% 14.14/14.36  
% 14.14/14.36  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 14.14/14.36  
% 14.14/14.36  Stopped by limit on insertions
% 14.14/14.36  
% 14.14/14.36  Model 3 [ 1 1 2556 ] (0.00 seconds, 250000 Inserts)
% 14.14/14.36  
% 14.14/14.36  Stopped by limit on insertions
% 14.14/14.36  
% 14.14/14.36  Stopped by limit on insertions
% 14.14/14.36  
% 14.14/14.36  Model 4 [ 1 0 240 ] (0.00 seconds, 250000 Inserts)
% 14.14/14.36  
% 14.14/14.36  ----> UNIT CONFLICT at  13.96 sec ----> 1783 [binary,1782.1,2.1] {-} $F.
% 14.14/14.36  
% 14.14/14.36  Length of proof is 18.  Level of proof is 11.
% 14.14/14.36  
% 14.14/14.36  ---------------- PROOF ----------------
% 14.14/14.36  % SZS status Unsatisfiable
% 14.14/14.36  % SZS output start Refutation
% 14.14/14.36  
% 14.14/14.36  1 [] {+} -is_a_theorem(implies(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 14.14/14.36  2 [] {+} -is_a_theorem(implies(implies(implies(a,b),c),implies(implies(c,a),implies(e,a)))).
% 14.14/14.36  3 [] {+} is_a_theorem(implies(A,implies(B,A))).
% 14.14/14.36  4 [] {+} is_a_theorem(implies(implies(implies(A,B),A),A)).
% 14.14/14.36  5 [] {-} is_a_theorem(implies(implies(A,B),implies(implies(B,C),implies(A,C)))).
% 14.14/14.36  7 [hyper,4,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),B))).
% 14.14/14.36  11 [hyper,5,1,5] {+} is_a_theorem(implies(implies(implies(implies(A,B),implies(C,B)),D),implies(implies(C,A),D))).
% 14.14/14.36  14 [hyper,5,1,7] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),A),C),implies(D,C))).
% 14.14/14.36  16 [hyper,5,1,4] {-} is_a_theorem(implies(implies(A,B),implies(implies(implies(A,C),A),B))).
% 14.14/14.36  17 [hyper,5,1,3] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(B,C))).
% 14.14/14.36  18 [hyper,17,1,5] {+} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(implies(D,A),B),C))).
% 14.14/14.36  45 [hyper,16,1,3] {-} is_a_theorem(implies(implies(implies(A,B),A),implies(C,A))).
% 14.14/14.36  51 [hyper,45,1,3] {-} is_a_theorem(implies(A,implies(implies(implies(B,C),B),implies(D,B)))).
% 14.14/14.36  74 [hyper,14,1,11] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(D,implies(A,B)))).
% 14.14/14.36  120 [hyper,74,1,74] {-} is_a_theorem(implies(A,implies(implies(B,implies(implies(C,D),C)),implies(B,C)))).
% 14.14/14.36  129 [hyper,74,1,17] {-} is_a_theorem(implies(A,implies(implies(implies(B,implies(C,D)),C),C))).
% 14.14/14.36  155 [hyper,129,1,129] {-} is_a_theorem(implies(implies(implies(A,implies(B,C)),B),B)).
% 14.14/14.36  198 [hyper,18,1,155] {-} is_a_theorem(implies(implies(implies(A,implies(B,implies(C,D))),C),C)).
% 14.14/14.36  227 [hyper,120,1,198] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,B))).
% 14.14/14.36  239 [hyper,227,1,11] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),A))).
% 14.14/14.36  274 [hyper,239,1,51] {-} is_a_theorem(implies(implies(implies(implies(implies(A,B),A),implies(C,A)),D),D)).
% 14.14/14.36  831 [hyper,274,1,11] {-} is_a_theorem(implies(implies(A,implies(implies(B,C),B)),implies(A,implies(D,B)))).
% 14.14/14.36  1782 [hyper,831,1,11] {-} is_a_theorem(implies(implies(implies(A,B),C),implies(implies(C,A),implies(D,A)))).
% 14.14/14.36  1783 [binary,1782.1,2.1] {-} $F.
% 14.14/14.36  
% 14.14/14.36  % SZS output end Refutation
% 14.14/14.36  ------------ end of proof -------------
% 14.14/14.36  
% 14.14/14.36  
% 14.14/14.36  Search stopped by max_proofs option.
% 14.14/14.36  
% 14.14/14.36  
% 14.14/14.36  Search stopped by max_proofs option.
% 14.14/14.36  
% 14.14/14.36  ============ end of search ============
% 14.14/14.36  
% 14.14/14.36  ----------- soft-scott stats ----------
% 14.14/14.36  
% 14.14/14.36  true clauses given          40      (29.6%)
% 14.14/14.36  false clauses given         95
% 14.14/14.36  
% 14.14/14.36        FALSE     TRUE
% 14.14/14.36    12  0         24
% 14.14/14.36    14  12        78
% 14.14/14.36    16  178       110
% 14.14/14.36    18  257       99
% 14.14/14.36    20  310       58
% 14.14/14.36    22  213       29
% 14.14/14.36    24  103       12
% 14.14/14.36    26  61        0
% 14.14/14.36    28  37        0
% 14.14/14.36    30  26        0
% 14.14/14.36    32  8         0
% 14.14/14.36    34  4         0
% 14.14/14.36    36  3         0
% 14.14/14.36    38  1         0
% 14.14/14.36    40  1         0
% 14.14/14.36  tot:  1214      410      (25.2% true)
% 14.14/14.36  
% 14.14/14.36  
% 14.14/14.36  Model 4 [ 1 0 240 ] (0.00 seconds, 250000 Inserts)
% 14.14/14.36  
% 14.14/14.36  That finishes the proof of the theorem.
% 14.14/14.36  
% 14.14/14.36  Process 7466 finished Mon Jul  4 01:21:30 2022
%------------------------------------------------------------------------------