↑ Up

SOS---2.0.UNS-Ref.s

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

% Computer : n007.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:29:02 EDT 2022

% Result   : Unsatisfiable 7.42s 7.59s
% Output   : Refutation 7.42s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : LCL241-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n007.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 09:27:41 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.35  ----- Otter 3.2, August 2001 -----
% 0.13/0.35  The process was started by sandbox on n007.cluster.edu,
% 0.13/0.35  Sun Jul  3 09:27:41 2022
% 0.13/0.35  The command was "./sos".  The process ID is 19553.
% 0.13/0.35  
% 0.13/0.35  set(prolog_style_variables).
% 0.13/0.35  set(auto).
% 0.13/0.35     dependent: set(auto1).
% 0.13/0.35     dependent: set(process_input).
% 0.13/0.35     dependent: clear(print_kept).
% 0.13/0.35     dependent: clear(print_new_demod).
% 0.13/0.35     dependent: clear(print_back_demod).
% 0.13/0.35     dependent: clear(print_back_sub).
% 0.13/0.35     dependent: set(control_memory).
% 0.13/0.35     dependent: assign(max_mem, 12000).
% 0.13/0.35     dependent: assign(pick_given_ratio, 4).
% 0.13/0.35     dependent: assign(stats_level, 1).
% 0.13/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35     dependent: assign(sos_limit, 5000).
% 0.13/0.35     dependent: assign(max_weight, 60).
% 0.13/0.35  clear(print_given).
% 0.13/0.35  
% 0.13/0.35  list(usable).
% 0.13/0.35  
% 0.13/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35  
% 0.13/0.35  This is a Horn set with equality.  The strategy will be
% 0.13/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.35  sos and nonpositive clauses in usable.
% 0.13/0.35  
% 0.13/0.35     dependent: set(knuth_bendix).
% 0.13/0.35     dependent: set(para_from).
% 0.13/0.35     dependent: set(para_into).
% 0.13/0.35     dependent: clear(para_from_right).
% 0.13/0.35     dependent: clear(para_into_right).
% 0.13/0.35     dependent: set(para_from_vars).
% 0.13/0.35     dependent: set(eq_units_both_ways).
% 0.13/0.35     dependent: set(dynamic_demod_all).
% 0.13/0.35     dependent: set(dynamic_demod).
% 0.13/0.35     dependent: set(order_eq).
% 0.13/0.35     dependent: set(back_demod).
% 0.13/0.35     dependent: set(lrpo).
% 0.13/0.35     dependent: set(hyper_res).
% 0.13/0.35     dependent: clear(order_hyper).
% 0.13/0.35  
% 0.13/0.35  ------------> process usable:
% 0.13/0.35  
% 0.13/0.35  ------------> process sos:
% 0.13/0.35    Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.13/0.35  
% 0.13/0.35  ======= 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: 13
% 0.19/0.40  percentage of clauses intially in UL: 23
% 0.19/0.40  percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.40  percent of all initial clauses that are short: 100
% 0.19/0.40  absolute distinct symbol count: 9
% 0.19/0.40     distinct predicate count: 3
% 0.19/0.40     distinct function count: 4
% 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 ===========
% 5.76/6.00  
% 5.76/6.00  
% 5.76/6.00  Changing weight limit from 60 to 40.
% 5.76/6.00  
% 5.76/6.00  Model 3 (0.00 seconds, 0 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on number of solutions
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 4 [ 1 1 265 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 5 [ 21 0 286 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 6 [ 21 1 300 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 7 [ 13 1 296 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 8 [ 1 1 294 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 9 [ 1 7 144669 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 10 [ 33 1 493 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 11 [ 1 1 103 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 12 [ 34 1 4095 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Model 13 (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on number of solutions
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 14 [ 3 0 130 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 15 [ 1 1 1711 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 16 [ 38 2 11089 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 17 [ 1 15 73105 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 18 [ 35 1 1018 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 19 [ 36 45 215470 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Stopped by limit on insertions
% 5.76/6.00  
% 5.76/6.00  Model 20 [ 33 1 567 ] (0.00 seconds, 250000 Inserts)
% 5.76/6.00  
% 5.76/6.00  Resetting weight limit to 40 after 310 givens.
% 5.76/6.00  
% 5.91/6.16  
% 5.91/6.16  
% 5.91/6.16  Changing weight limit from 40 to 25.
% 5.91/6.16  
% 5.91/6.16  Resetting weight limit to 25 after 330 givens.
% 5.91/6.16  
% 6.02/6.20  
% 6.02/6.20  
% 6.02/6.20  Changing weight limit from 25 to 24.
% 6.02/6.20  
% 6.02/6.20  Resetting weight limit to 24 after 335 givens.
% 6.02/6.20  
% 6.04/6.23  
% 6.04/6.23  
% 6.04/6.23  Changing weight limit from 24 to 22.
% 6.04/6.23  
% 6.04/6.23  Resetting weight limit to 22 after 340 givens.
% 6.04/6.23  
% 6.12/6.31  
% 6.12/6.31  
% 6.12/6.31  Changing weight limit from 22 to 21.
% 6.12/6.31  
% 6.12/6.31  Resetting weight limit to 21 after 350 givens.
% 6.12/6.31  
% 6.12/6.35  
% 6.12/6.35  
% 6.12/6.35  Changing weight limit from 21 to 20.
% 6.12/6.35  
% 6.12/6.35  Resetting weight limit to 20 after 360 givens.
% 6.12/6.35  
% 6.20/6.44  
% 6.20/6.44  
% 6.20/6.44  Changing weight limit from 20 to 19.
% 6.20/6.44  
% 6.20/6.44  Resetting weight limit to 19 after 385 givens.
% 6.20/6.44  
% 6.32/6.51  
% 6.32/6.51  
% 6.32/6.51  Changing weight limit from 19 to 18.
% 6.32/6.51  
% 6.32/6.51  Resetting weight limit to 18 after 405 givens.
% 6.32/6.51  
% 6.36/6.59  
% 6.36/6.59  
% 6.36/6.59  Changing weight limit from 18 to 17.
% 6.36/6.59  
% 6.36/6.59  Resetting weight limit to 17 after 425 givens.
% 6.36/6.59  
% 6.52/6.71  
% 6.52/6.71  
% 6.52/6.71  Changing weight limit from 17 to 16.
% 6.52/6.71  
% 6.52/6.71  Modelling stopped after 300 given clauses and 0.00 seconds
% 6.52/6.71  
% 6.52/6.71  
% 6.52/6.71  Resetting weight limit to 16 after 465 givens.
% 6.52/6.71  
% 7.12/7.36  
% 7.12/7.36  
% 7.12/7.36  Changing weight limit from 16 to 15.
% 7.12/7.36  
% 7.12/7.36  Resetting weight limit to 15 after 670 givens.
% 7.12/7.36  
% 7.42/7.59  
% 7.42/7.59  -------- PROOF -------- 
% 7.42/7.59  % SZS status Unsatisfiable
% 7.42/7.59  % SZS output start Refutation
% 7.42/7.59  
% 7.42/7.59  ----> UNIT CONFLICT at   7.16 sec ----> 16766 [binary,16765.1,3.1] {-} $F.
% 7.42/7.59  
% 7.42/7.59  Length of proof is 26.  Level of proof is 11.
% 7.42/7.59  
% 7.42/7.59  ---------------- PROOF ----------------
% 7.42/7.59  % SZS status Unsatisfiable
% 7.42/7.59  % SZS output start Refutation
% 7.42/7.59  
% 7.42/7.59  1 [] {+} theorem(A)| -axiom(A).
% 7.42/7.59  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 7.42/7.59  3 [] {+} -theorem(implies(and(p,q),q)).
% 7.42/7.59  4 [] {+} axiom(implies(or(A,A),A)).
% 7.42/7.59  5 [] {+} axiom(implies(A,or(B,A))).
% 7.42/7.59  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 7.42/7.59  7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 7.42/7.59  8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 7.42/7.59  9 [] {-} implies(A,B)=or(not(A),B).
% 7.42/7.59  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 7.42/7.59  12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 7.42/7.59  13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 7.42/7.59  16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 7.42/7.59  17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 7.42/7.59  18 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 7.42/7.59  19 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 7.42/7.59  26 [para_from,10.1.1,17.1.1.2] {-} theorem(implies(A,implies(B,A))).
% 7.42/7.59  28 [para_from,10.1.1,16.1.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 7.42/7.59  34 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 7.42/7.59  38 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 7.42/7.59  39 [copy,38,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 7.42/7.59  42 [para_into,18.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 7.42/7.59  43 [para_into,18.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 7.42/7.59  49 [para_into,43.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 7.42/7.59  53 [para_into,19.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 7.42/7.59  62 [para_into,49.1.1.1.2,13.1.1] {-} theorem(implies(implies(A,and(B,C)),implies(implies(B,not(C)),not(A)))).
% 7.42/7.59  132 [para_from,39.1.1,2.2.1] {-} theorem(A)| -theorem(or(and(B,C),A))| -theorem(implies(B,not(C))).
% 7.42/7.59  571 [hyper,53,2,17] {+} theorem(or(A,implies(B,B))).
% 7.42/7.59  609 [hyper,571,132,28] {+} theorem(implies(A,A)).
% 7.42/7.59  655 [hyper,609,2,62] {-} theorem(implies(implies(A,not(B)),not(and(A,B)))).
% 7.42/7.59  659 [hyper,609,2,42] {+} theorem(or(A,not(A))).
% 7.42/7.59  667 [hyper,655,2,34] {-} theorem(implies(or(A,implies(B,not(C))),or(A,not(and(B,C))))).
% 7.42/7.59  686 [hyper,659,2,26] {+} theorem(implies(A,or(B,not(B)))).
% 7.42/7.59  1383 [hyper,686,2,53] {+} theorem(or(A,implies(B,not(A)))).
% 7.42/7.59  16503 [hyper,667,2,1383] {-} theorem(or(A,not(and(B,A)))).
% 7.42/7.59  16765 [hyper,16503,2,43] {-} theorem(implies(and(A,B),B)).
% 7.42/7.59  16766 [binary,16765.1,3.1] {-} $F.
% 7.42/7.59  
% 7.42/7.59  % SZS output end Refutation
% 7.42/7.59  ------------ end of proof -------------
% 7.42/7.59  
% 7.42/7.59  
% 7.42/7.59  Search stopped by max_proofs option.
% 7.42/7.59  
% 7.42/7.59  
% 7.42/7.59  Search stopped by max_proofs option.
% 7.42/7.59  
% 7.42/7.59  ============ end of search ============
% 7.42/7.59  
% 7.42/7.59  ----------- soft-scott stats ----------
% 7.42/7.59  
% 7.42/7.59  true clauses given         259      (34.8%)
% 7.42/7.59  false clauses given        485
% 7.42/7.59  
% 7.42/7.59        FALSE     TRUE
% 7.42/7.59     8  5         2
% 7.42/7.59     9  13        110
% 7.42/7.59    10  21        508
% 7.42/7.59    11  22        584
% 7.42/7.59    12  12        1302
% 7.42/7.59    13  383       0
% 7.42/7.59    14  1175      0
% 7.42/7.59    15  1033      1
% 7.42/7.59  tot:  2664      2507      (48.5% true)
% 7.42/7.59  
% 7.42/7.59  
% 7.42/7.59  Model 20 [ 33 1 567 ] (0.00 seconds, 250000 Inserts)
% 7.42/7.59  
% 7.42/7.59  That finishes the proof of the theorem.
% 7.42/7.59  
% 7.42/7.59  Process 19553 finished Sun Jul  3 09:27:48 2022
%------------------------------------------------------------------------------