↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n020.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:28:26 EDT 2022

% Result   : Unsatisfiable 15.91s 16.13s
% Output   : Refutation 15.91s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : LCL183-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n020.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 10:21:00 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n020.cluster.edu,
% 0.19/0.36  Sun Jul  3 10:21:00 2022
% 0.19/0.36  The command was "./sos".  The process ID is 29486.
% 0.19/0.36  
% 0.19/0.36  set(prolog_style_variables).
% 0.19/0.36  set(auto).
% 0.19/0.36     dependent: set(auto1).
% 0.19/0.36     dependent: set(process_input).
% 0.19/0.36     dependent: clear(print_kept).
% 0.19/0.36     dependent: clear(print_new_demod).
% 0.19/0.36     dependent: clear(print_back_demod).
% 0.19/0.36     dependent: clear(print_back_sub).
% 0.19/0.36     dependent: set(control_memory).
% 0.19/0.36     dependent: assign(max_mem, 12000).
% 0.19/0.36     dependent: assign(pick_given_ratio, 4).
% 0.19/0.36     dependent: assign(stats_level, 1).
% 0.19/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36     dependent: assign(sos_limit, 5000).
% 0.19/0.36     dependent: assign(max_weight, 60).
% 0.19/0.36  clear(print_given).
% 0.19/0.36  
% 0.19/0.36  list(usable).
% 0.19/0.36  
% 0.19/0.36  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.19/0.36  
% 0.19/0.36  This is a Horn set with equality.  The strategy will be
% 0.19/0.36  Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.36  sos and nonpositive clauses in usable.
% 0.19/0.36  
% 0.19/0.36     dependent: set(knuth_bendix).
% 0.19/0.36     dependent: set(para_from).
% 0.19/0.36     dependent: set(para_into).
% 0.19/0.36     dependent: clear(para_from_right).
% 0.19/0.36     dependent: clear(para_into_right).
% 0.19/0.36     dependent: set(para_from_vars).
% 0.19/0.36     dependent: set(eq_units_both_ways).
% 0.19/0.36     dependent: set(dynamic_demod_all).
% 0.19/0.36     dependent: set(dynamic_demod).
% 0.19/0.36     dependent: set(order_eq).
% 0.19/0.36     dependent: set(back_demod).
% 0.19/0.36     dependent: set(lrpo).
% 0.19/0.36     dependent: set(hyper_res).
% 0.19/0.36     dependent: clear(order_hyper).
% 0.19/0.36  
% 0.19/0.36  ------------> process usable:
% 0.19/0.36  
% 0.19/0.36  ------------> process sos:
% 0.19/0.36    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.19/0.36  
% 0.19/0.36  ======= end of input processing =======
% 0.19/0.40  
% 0.19/0.40  Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  -------------- Softie stats --------------
% 0.19/0.40  
% 0.19/0.40  UPDATE_STOP: 300
% 0.19/0.40  SFINDER_TIME_LIMIT: 2
% 0.19/0.40  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40  number of clauses in intial UL: 3
% 0.19/0.40  number of clauses initially in problem: 11
% 0.19/0.40  percentage of clauses intially in UL: 27
% 0.19/0.40  percentage of distinct symbols occuring in initial UL: 75
% 0.19/0.40  percent of all initial clauses that are short: 100
% 0.19/0.40  absolute distinct symbol count: 8
% 0.19/0.40     distinct predicate count: 3
% 0.19/0.40     distinct function count: 3
% 0.19/0.40     distinct constant count: 2
% 0.19/0.40  
% 0.19/0.40  ---------- no more Softie stats ----------
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  
% 0.19/0.40  Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40  
% 0.19/0.40  Stopped by limit on number of solutions
% 0.19/0.40  
% 0.19/0.40  =========== start of search ===========
% 9.09/9.29  
% 9.09/9.29  
% 9.09/9.29  Changing weight limit from 60 to 31.
% 9.09/9.29  
% 9.09/9.29  Model 3 (0.00 seconds, 0 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on number of solutions
% 9.09/9.29  
% 9.09/9.29  Model 4 (0.00 seconds, 0 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on number of solutions
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 5 [ 21 0 100 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 6 [ 1 0 478 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 7 [ 31 8 147738 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 8 [ 1 1 729 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 9 [ 1 0 444 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 10 [ 1 1 2920 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 11 [ 35 6 66932 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Model 12 [ 1 1 2222 ] (0.00 seconds, 250000 Inserts)
% 9.09/9.29  
% 9.09/9.29  Stopped by limit on insertions
% 9.09/9.29  
% 9.09/9.29  Resetting weight limit to 31 after 280 givens.
% 9.09/9.29  
% 9.25/9.44  
% 9.25/9.44  
% 9.25/9.44  Changing weight limit from 31 to 20.
% 9.25/9.44  
% 9.25/9.44  Resetting weight limit to 20 after 300 givens.
% 9.25/9.44  
% 9.43/9.60  
% 9.43/9.60  
% 9.43/9.60  Changing weight limit from 20 to 19.
% 9.43/9.60  
% 9.43/9.60  Resetting weight limit to 19 after 315 givens.
% 9.43/9.60  
% 9.62/9.83  
% 9.62/9.83  
% 9.62/9.83  Changing weight limit from 19 to 17.
% 9.62/9.83  
% 9.62/9.83  Resetting weight limit to 17 after 330 givens.
% 9.62/9.83  
% 9.90/10.09  
% 9.90/10.09  
% 9.90/10.09  Changing weight limit from 17 to 16.
% 9.90/10.09  
% 9.90/10.09  Resetting weight limit to 16 after 355 givens.
% 9.90/10.09  
% 10.16/10.35  
% 10.16/10.35  
% 10.16/10.35  Changing weight limit from 16 to 15.
% 10.16/10.35  
% 10.16/10.35  Resetting weight limit to 15 after 405 givens.
% 10.16/10.35  
% 12.13/12.32  
% 12.13/12.32  
% 12.13/12.32  Changing weight limit from 15 to 14.
% 12.13/12.32  
% 12.13/12.32  Stopped by limit on insertions
% 12.13/12.32  
% 12.13/12.32  Model 13 [ 1 0 56 ] (0.00 seconds, 250000 Inserts)
% 12.13/12.32  
% 12.13/12.32  Modelling stopped after 300 given clauses and 0.00 seconds
% 12.13/12.32  
% 12.13/12.32  
% 12.13/12.32  Resetting weight limit to 14 after 820 givens.
% 12.13/12.32  
% 13.68/13.87  
% 13.68/13.87  
% 13.68/13.87  Changing weight limit from 14 to 13.
% 13.68/13.87  
% 13.68/13.87  Resetting weight limit to 13 after 1490 givens.
% 13.68/13.87  
% 15.91/16.13  
% 15.91/16.13  -- HEY sandbox2, WE HAVE A PROOF!! -- 
% 15.91/16.13  
% 15.91/16.13  ----> UNIT CONFLICT at  15.35 sec ----> 51727 [binary,51726.1,3.1] {+} $F.
% 15.91/16.13  
% 15.91/16.13  Length of proof is 26.  Level of proof is 13.
% 15.91/16.13  
% 15.91/16.13  ---------------- PROOF ----------------
% 15.91/16.13  % SZS status Unsatisfiable
% 15.91/16.13  % SZS output start Refutation
% 15.91/16.13  
% 15.91/16.13  1 [] {+} theorem(A)| -axiom(A).
% 15.91/16.13  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 15.91/16.13  3 [] {+} -theorem(implies(implies(not(q),not(p)),implies(p,q))).
% 15.91/16.13  4 [] {+} axiom(implies(or(A,A),A)).
% 15.91/16.13  5 [] {+} axiom(implies(A,or(B,A))).
% 15.91/16.13  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 15.91/16.13  7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 15.91/16.13  8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 15.91/16.13  9 [] {-} implies(A,B)=or(not(A),B).
% 15.91/16.13  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 15.91/16.13  13 [hyper,4,1] {-} theorem(implies(or(A,A),A)).
% 15.91/16.13  14 [hyper,5,1] {-} theorem(implies(A,or(B,A))).
% 15.91/16.13  15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 15.91/16.13  20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 15.91/16.13  28 [para_into,15.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 15.91/16.13  29 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 15.91/16.13  30 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 15.91/16.13  40 [para_into,29.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 15.91/16.13  56 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 15.91/16.13  62 [hyper,56,2,15] {+} theorem(or(A,implies(or(B,A),B))).
% 15.91/16.13  63 [hyper,56,2,14] {+} theorem(or(A,implies(B,B))).
% 15.91/16.13  65 [para_into,56.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 15.91/16.13  74 [hyper,63,2,13] {+} theorem(implies(A,A)).
% 15.91/16.13  106 [hyper,40,2,74] {+} theorem(implies(A,not(not(A)))).
% 15.91/16.13  208 [hyper,28,2,74] {+} theorem(or(A,not(A))).
% 15.91/16.13  1373 [hyper,65,2,30] {-} theorem(implies(or(A,B),implies(implies(B,C),or(A,C)))).
% 15.91/16.13  3345 [hyper,1373,2,208] {-} theorem(implies(implies(not(A),B),or(A,B))).
% 15.91/16.13  3368 [hyper,1373,2,62] {+} theorem(implies(implies(implies(or(A,B),A),C),or(B,C))).
% 15.91/16.13  3399 [hyper,3345,2,106] {+} theorem(or(A,not(not(not(A))))).
% 15.91/16.13  3959 [hyper,3399,2,29] {-} theorem(implies(not(not(A)),A)).
% 15.91/16.13  3975 [hyper,3959,2,30] {-} theorem(implies(or(A,not(not(B))),or(A,B))).
% 15.91/16.13  5984 [para_into,3975.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,not(not(B))),implies(A,B))).
% 15.91/16.13  51255 [hyper,3368,2,5984,demod,11] {+} theorem(or(A,implies(implies(not(B),A),B))).
% 15.91/16.13  51659 [para_into,51255.1.1,10.1.1] {-} theorem(implies(A,implies(implies(not(B),not(A)),B))).
% 15.91/16.13  51726 [hyper,51659,2,65] {-} theorem(implies(implies(not(A),not(B)),implies(B,A))).
% 15.91/16.13  51727 [binary,51726.1,3.1] {+} $F.
% 15.91/16.13  
% 15.91/16.13  % SZS output end Refutation
% 15.91/16.13  ------------ end of proof -------------
% 15.91/16.13  
% 15.91/16.13  
% 15.91/16.13  Search stopped by max_proofs option.
% 15.91/16.13  
% 15.91/16.13  
% 15.91/16.13  Search stopped by max_proofs option.
% 15.91/16.13  
% 15.91/16.13  ============ end of search ============
% 15.91/16.13  
% 15.91/16.13  ----------- soft-scott stats ----------
% 15.91/16.13  
% 15.91/16.13  true clauses given         796      (34.5%)
% 15.91/16.13  false clauses given       1512
% 15.91/16.13  
% 15.91/16.13        FALSE     TRUE
% 15.91/16.13     9  0         2
% 15.91/16.13    10  1         540
% 15.91/16.13    11  0         1220
% 15.91/16.13    12  165       783
% 15.91/16.13    13  2350      36
% 15.91/16.13  tot:  2516      2581      (50.6% true)
% 15.91/16.13  
% 15.91/16.13  
% 15.91/16.13  Model 13 [ 1 0 56 ] (0.00 seconds, 250000 Inserts)
% 15.91/16.13  
% 15.91/16.13  That finishes the proof of the theorem.
% 15.91/16.13  
% 15.91/16.13  Process 29486 finished Sun Jul  3 10:21:16 2022
%------------------------------------------------------------------------------