↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n026.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:30:04 EDT 2022

% Result   : Unsatisfiable 47.52s 47.69s
% Output   : Refutation 47.52s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL416-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.14/0.34  % Computer : n026.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.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon Jul  4 05:21:06 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.14/0.36  ----- Otter 3.2, August 2001 -----
% 0.14/0.36  The process was started by sandbox2 on n026.cluster.edu,
% 0.14/0.36  Mon Jul  4 05:21:06 2022
% 0.14/0.36  The command was "./sos".  The process ID is 27002.
% 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.21/0.39  
% 0.21/0.39  Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.39  
% 0.21/0.39  Stopped by limit on number of solutions
% 0.21/0.39  
% 0.21/0.39  
% 0.21/0.39  -------------- Softie stats --------------
% 0.21/0.39  
% 0.21/0.39  UPDATE_STOP: 300
% 0.21/0.39  SFINDER_TIME_LIMIT: 2
% 0.21/0.39  SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.39  number of clauses in intial UL: 2
% 0.21/0.39  number of clauses initially in problem: 3
% 0.21/0.39  percentage of clauses intially in UL: 66
% 0.21/0.39  percentage of distinct symbols occuring in initial UL: 100
% 0.21/0.39  percent of all initial clauses that are short: 100
% 0.21/0.39  absolute distinct symbol count: 3
% 0.21/0.39     distinct predicate count: 1
% 0.21/0.39     distinct function count: 1
% 0.21/0.39     distinct constant count: 1
% 0.21/0.39  
% 0.21/0.39  ---------- no more Softie stats ----------
% 0.21/0.39  
% 0.21/0.39  
% 0.21/0.39  
% 0.21/0.39  =========== start of search ===========
% 29.62/29.85  
% 29.62/29.85  
% 29.62/29.85  Changing weight limit from 60 to 56.
% 29.62/29.85  
% 29.62/29.85  Model 2 (0.00 seconds, 0 Inserts)
% 29.62/29.85  
% 29.62/29.85  Stopped by limit on number of solutions
% 29.62/29.85  
% 29.62/29.85  Resetting weight limit to 56 after 190 givens.
% 29.62/29.85  
% 30.80/31.02  
% 30.80/31.02  
% 30.80/31.02  Changing weight limit from 56 to 52.
% 30.80/31.02  
% 30.80/31.02  Resetting weight limit to 52 after 195 givens.
% 30.80/31.02  
% 32.57/32.76  
% 32.57/32.76  
% 32.57/32.76  Changing weight limit from 52 to 48.
% 32.57/32.76  
% 32.57/32.76  Resetting weight limit to 48 after 200 givens.
% 32.57/32.76  
% 38.05/38.26  
% 38.05/38.26  
% 38.05/38.26  Changing weight limit from 48 to 44.
% 38.05/38.26  
% 38.05/38.26  Resetting weight limit to 44 after 230 givens.
% 38.05/38.26  
% 42.87/43.08  
% 42.87/43.08  
% 42.87/43.08  Changing weight limit from 44 to 40.
% 42.87/43.08  
% 42.87/43.08  Resetting weight limit to 40 after 255 givens.
% 42.87/43.08  
% 47.52/47.69  
% 47.52/47.69  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 47.52/47.69  
% 47.52/47.69  ----> UNIT CONFLICT at  47.20 sec ----> 16624 [binary,16623.1,2.1] {+} $F.
% 47.52/47.69  
% 47.52/47.69  Length of proof is 23.  Level of proof is 13.
% 47.52/47.69  
% 47.52/47.69  ---------------- PROOF ----------------
% 47.52/47.69  % SZS status Unsatisfiable
% 47.52/47.69  % SZS output start Refutation
% 47.52/47.69  
% 47.52/47.69  1 [] {+} -is_a_theorem(equivalent(A,B))| -is_a_theorem(A)|is_a_theorem(B).
% 47.52/47.69  2 [] {+} -is_a_theorem(equivalent(a,a)).
% 47.52/47.69  3 [] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C))).
% 47.52/47.69  4 [hyper,3,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),equivalent(E,D)),E)).
% 47.52/47.69  5 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),equivalent(E,D)),E),F),equivalent(G,F)),G)).
% 47.52/47.69  6 [hyper,4,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),E),equivalent(D,E))).
% 47.52/47.69  8 [hyper,6,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),E),equivalent(D,E)),F),equivalent(G,F)),G)).
% 47.52/47.69  9 [hyper,6,1,4] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),D)),E),equivalent(F,E)),F)),A)).
% 47.52/47.69  18 [hyper,9,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),D)),E),equivalent(F,E)),F)),A),G),equivalent(H,G)),H)).
% 47.52/47.69  25 [hyper,5,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),equivalent(E,D)),E),F),G),equivalent(F,G))).
% 47.52/47.69  44 [hyper,8,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),E),equivalent(D,E)),F),G),equivalent(F,G))).
% 47.52/47.69  89 [hyper,44,1,25] {-} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(equivalent(C,equivalent(equivalent(equivalent(C,D),equivalent(E,D)),E)),F),equivalent(G,F)),G)),B),A))).
% 47.52/47.69  138 [hyper,89,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(equivalent(B,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),D)),E),equivalent(F,E)),F)),A),equivalent(G,equivalent(equivalent(equivalent(G,H),equivalent(I,H)),I)))).
% 47.52/47.69  260 [hyper,18,1,25] {-} is_a_theorem(equivalent(equivalent(A,equivalent(B,equivalent(equivalent(equivalent(B,C),equivalent(D,C)),D))),A)).
% 47.52/47.69  277 [hyper,260,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),equivalent(equivalent(equivalent(D,E),equivalent(F,E)),F))).
% 47.52/47.69  309 [hyper,277,1,4] {+} is_a_theorem(equivalent(equivalent(A,B),equivalent(A,B))).
% 47.52/47.69  329 [hyper,309,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,B)),C),equivalent(D,C)),D)).
% 47.52/47.69  330 [hyper,329,1,277] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,B)),C),D),equivalent(C,D)),E),equivalent(F,E)),F)).
% 47.52/47.69  348 [hyper,329,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(A,B),equivalent(A,B)),C),D),equivalent(C,D))).
% 47.52/47.69  349 [hyper,348,1,348] {+} is_a_theorem(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,C)),A))).
% 47.52/47.69  365 [hyper,348,1,329] {-} is_a_theorem(equivalent(equivalent(A,equivalent(equivalent(B,C),equivalent(B,C))),A)).
% 47.52/47.69  389 [hyper,365,1,8] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),equivalent(D,E)),equivalent(D,E))).
% 47.52/47.69  418 [hyper,349,1,3] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,C)),A)),D),equivalent(E,D)),E)).
% 47.52/47.69  755 [hyper,418,1,389] {-} is_a_theorem(equivalent(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(B,C),equivalent(B,C)),A)),D),E),equivalent(D,E))).
% 47.52/47.69  16599 [hyper,138,1,330] {-} is_a_theorem(equivalent(equivalent(equivalent(A,equivalent(equivalent(equivalent(A,B),equivalent(C,B)),C)),D),D)).
% 47.52/47.69  16623 [hyper,16599,1,755] {-} is_a_theorem(equivalent(A,A)).
% 47.52/47.69  16624 [binary,16623.1,2.1] {+} $F.
% 47.52/47.69  
% 47.52/47.69  % SZS output end Refutation
% 47.52/47.69  ------------ end of proof -------------
% 47.52/47.69  
% 47.52/47.69  
% 47.52/47.69  Search stopped by max_proofs option.
% 47.52/47.69  
% 47.52/47.69  
% 47.52/47.69  Search stopped by max_proofs option.
% 47.52/47.69  
% 47.52/47.69  ============ end of search ============
% 47.52/47.69  
% 47.52/47.69  ----------- soft-scott stats ----------
% 47.52/47.69  
% 47.52/47.69  true clauses given          55      (18.8%)
% 47.52/47.69  false clauses given        237
% 47.52/47.69  
% 47.52/47.69        FALSE     TRUE
% 47.52/47.69    24  0         41
% 47.52/47.69    28  225       181
% 47.52/47.69    32  750       463
% 47.52/47.69    36  1526      1059
% 47.52/47.69    40  14        756
% 47.52/47.69  tot:  2515      2500      (49.9% true)
% 47.52/47.69  
% 47.52/47.69  
% 47.52/47.69  Model 2 (0.00 seconds, 0 Inserts)
% 47.52/47.69  
% 47.52/47.69  That finishes the proof of the theorem.
% 47.52/47.69  
% 47.52/47.69  Process 27002 finished Mon Jul  4 05:21:54 2022
%------------------------------------------------------------------------------