TSTP Solution File: LCL210-3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : LCL210-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n003.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:42 EDT 2022

% Result   : Unsatisfiable 3.67s 3.89s
% Output   : Refutation 3.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : LCL210-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.12  % Command  : sos-script %s
% 0.11/0.33  % Computer : n003.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Sun Jul  3 01:16:24 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.11/0.35  ----- Otter 3.2, August 2001 -----
% 0.11/0.35  The process was started by sandbox on n003.cluster.edu,
% 0.11/0.35  Sun Jul  3 01:16:24 2022
% 0.11/0.35  The command was "./sos".  The process ID is 3620.
% 0.11/0.35  
% 0.11/0.35  set(prolog_style_variables).
% 0.11/0.35  set(auto).
% 0.11/0.35     dependent: set(auto1).
% 0.11/0.35     dependent: set(process_input).
% 0.11/0.35     dependent: clear(print_kept).
% 0.11/0.35     dependent: clear(print_new_demod).
% 0.11/0.35     dependent: clear(print_back_demod).
% 0.11/0.35     dependent: clear(print_back_sub).
% 0.11/0.35     dependent: set(control_memory).
% 0.11/0.35     dependent: assign(max_mem, 12000).
% 0.11/0.35     dependent: assign(pick_given_ratio, 4).
% 0.11/0.35     dependent: assign(stats_level, 1).
% 0.11/0.35     dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35     dependent: assign(sos_limit, 5000).
% 0.11/0.35     dependent: assign(max_weight, 60).
% 0.11/0.35  clear(print_given).
% 0.11/0.35  
% 0.11/0.35  list(usable).
% 0.11/0.35  
% 0.11/0.35  SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.11/0.35  
% 0.11/0.35  This is a Horn set with equality.  The strategy will be
% 0.11/0.35  Knuth-Bendix and hyper_res, with positive clauses in
% 0.11/0.35  sos and nonpositive clauses in usable.
% 0.11/0.35  
% 0.11/0.35     dependent: set(knuth_bendix).
% 0.11/0.35     dependent: set(para_from).
% 0.11/0.35     dependent: set(para_into).
% 0.11/0.35     dependent: clear(para_from_right).
% 0.11/0.35     dependent: clear(para_into_right).
% 0.11/0.35     dependent: set(para_from_vars).
% 0.11/0.35     dependent: set(eq_units_both_ways).
% 0.11/0.35     dependent: set(dynamic_demod_all).
% 0.11/0.35     dependent: set(dynamic_demod).
% 0.11/0.35     dependent: set(order_eq).
% 0.11/0.35     dependent: set(back_demod).
% 0.11/0.35     dependent: set(lrpo).
% 0.11/0.35     dependent: set(hyper_res).
% 0.11/0.35     dependent: clear(order_hyper).
% 0.11/0.35  
% 0.11/0.35  ------------> process usable:
% 0.11/0.35  
% 0.11/0.35  ------------> process sos:
% 0.11/0.35    Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.11/0.35  
% 0.11/0.35  ======= end of input processing =======
% 0.11/0.38  
% 0.11/0.38  Model 1 (0.00 seconds, 0 Inserts)
% 0.11/0.38  
% 0.11/0.38  Stopped by limit on number of solutions
% 0.11/0.38  
% 0.11/0.38  
% 0.11/0.38  -------------- Softie stats --------------
% 0.11/0.38  
% 0.11/0.38  UPDATE_STOP: 300
% 0.11/0.38  SFINDER_TIME_LIMIT: 2
% 0.11/0.38  SHORT_CLAUSE_CUTOFF: 4
% 0.11/0.38  number of clauses in intial UL: 3
% 0.11/0.38  number of clauses initially in problem: 11
% 0.11/0.38  percentage of clauses intially in UL: 27
% 0.11/0.38  percentage of distinct symbols occuring in initial UL: 87
% 0.11/0.38  percent of all initial clauses that are short: 100
% 0.11/0.38  absolute distinct symbol count: 8
% 0.11/0.38     distinct predicate count: 3
% 0.11/0.38     distinct function count: 3
% 0.11/0.38     distinct constant count: 2
% 0.11/0.38  
% 0.11/0.38  ---------- no more Softie stats ----------
% 0.11/0.38  
% 0.11/0.38  
% 0.11/0.38  
% 0.11/0.38  Model 2 (0.00 seconds, 0 Inserts)
% 0.11/0.38  
% 0.11/0.38  Stopped by limit on number of solutions
% 0.11/0.38  
% 0.11/0.38  =========== start of search ===========
% 2.73/2.91  
% 2.73/2.91  
% 2.73/2.91  Changing weight limit from 60 to 36.
% 2.73/2.91  
% 2.73/2.91  Model 3 (0.00 seconds, 0 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on number of solutions
% 2.73/2.91  
% 2.73/2.91  Model 4 (0.00 seconds, 0 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on number of solutions
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 5 [ 1 2 38636 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 6 [ 1 1 8052 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 7 [ 21 2 17929 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 8 [ 1 1 1982 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 9 [ 22 2 27658 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 10 [ 1 1 1451 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 11 [ 1 1 8542 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 12 [ 22 0 1967 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Stopped by limit on insertions
% 2.73/2.91  
% 2.73/2.91  Model 13 [ 1 3 33513 ] (0.00 seconds, 250000 Inserts)
% 2.73/2.91  
% 2.73/2.91  Resetting weight limit to 36 after 315 givens.
% 2.73/2.91  
% 2.76/2.99  
% 2.76/2.99  
% 2.76/2.99  Changing weight limit from 36 to 32.
% 2.76/2.99  
% 2.76/2.99  Resetting weight limit to 32 after 335 givens.
% 2.76/2.99  
% 2.83/3.01  
% 2.83/3.01  
% 2.83/3.01  Changing weight limit from 32 to 28.
% 2.83/3.01  
% 2.83/3.01  Resetting weight limit to 28 after 340 givens.
% 2.83/3.01  
% 2.90/3.10  
% 2.90/3.10  
% 2.90/3.10  Changing weight limit from 28 to 26.
% 2.90/3.10  
% 2.90/3.10  Resetting weight limit to 26 after 350 givens.
% 2.90/3.10  
% 2.90/3.16  
% 2.90/3.16  
% 2.90/3.16  Changing weight limit from 26 to 24.
% 2.90/3.16  
% 2.90/3.16  Resetting weight limit to 24 after 360 givens.
% 2.90/3.16  
% 3.07/3.25  
% 3.07/3.25  
% 3.07/3.25  Changing weight limit from 24 to 22.
% 3.07/3.25  
% 3.07/3.25  Resetting weight limit to 22 after 370 givens.
% 3.07/3.25  
% 3.07/3.29  
% 3.07/3.29  
% 3.07/3.29  Changing weight limit from 22 to 20.
% 3.07/3.29  
% 3.07/3.29  Resetting weight limit to 20 after 380 givens.
% 3.07/3.29  
% 3.14/3.38  
% 3.14/3.38  
% 3.14/3.38  Changing weight limit from 20 to 18.
% 3.14/3.38  
% 3.14/3.38  Resetting weight limit to 18 after 405 givens.
% 3.14/3.38  
% 3.31/3.49  
% 3.31/3.49  
% 3.31/3.49  Changing weight limit from 18 to 16.
% 3.31/3.49  
% 3.31/3.49  Resetting weight limit to 16 after 415 givens.
% 3.31/3.49  
% 3.45/3.61  
% 3.45/3.61  
% 3.45/3.61  Changing weight limit from 16 to 15.
% 3.45/3.61  
% 3.45/3.61  Resetting weight limit to 15 after 450 givens.
% 3.45/3.61  
% 3.67/3.89  
% 3.67/3.89  -------- PROOF -------- 
% 3.67/3.89  % SZS status Unsatisfiable
% 3.67/3.89  % SZS output start Refutation
% 3.67/3.89  
% 3.67/3.89  Modelling stopped after 300 given clauses and 0.00 seconds
% 3.67/3.89  
% 3.67/3.89  
% 3.67/3.89  ----> UNIT CONFLICT at   3.50 sec ----> 11484 [binary,11483.1,3.1] {+} $F.
% 3.67/3.89  
% 3.67/3.89  Length of proof is 18.  Level of proof is 8.
% 3.67/3.89  
% 3.67/3.89  ---------------- PROOF ----------------
% 3.67/3.89  % SZS status Unsatisfiable
% 3.67/3.89  % SZS output start Refutation
% 3.67/3.89  
% 3.67/3.89  1 [] {+} theorem(A)| -axiom(A).
% 3.67/3.89  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 3.67/3.89  3 [] {+} -theorem(implies(not(p),implies(or(p,q),q))).
% 3.67/3.89  4 [] {+} axiom(implies(or(A,A),A)).
% 3.67/3.89  5 [] {+} axiom(implies(A,or(B,A))).
% 3.67/3.89  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 3.67/3.89  7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 3.67/3.89  8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 3.67/3.89  9 [] {-} implies(A,B)=or(not(A),B).
% 3.67/3.89  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 3.67/3.89  13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 3.67/3.89  14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 3.67/3.89  15 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 3.67/3.89  20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 3.67/3.89  24 [para_into,15.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 3.67/3.89  27 [para_into,24.1.1.1,10.1.1] {-} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 3.67/3.89  28 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 3.67/3.89  46 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 3.67/3.89  56 [hyper,28,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 3.67/3.89  91 [para_into,56.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 3.67/3.89  176 [hyper,91,2,14] {+} theorem(implies(A,A)).
% 3.67/3.89  180 [hyper,176,2,27] {+} theorem(implies(A,not(not(A)))).
% 3.67/3.89  203 [hyper,180,2,28] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 3.67/3.89  619 [hyper,46,2,176] {+} theorem(or(A,implies(or(A,B),B))).
% 3.67/3.89  4508 [hyper,619,2,15] {+} theorem(or(implies(or(A,B),B),A)).
% 3.67/3.89  11444 [hyper,4508,2,203] {-} theorem(or(implies(or(A,B),B),not(not(A)))).
% 3.67/3.89  11483 [hyper,11444,2,24] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 3.67/3.89  11484 [binary,11483.1,3.1] {+} $F.
% 3.67/3.89  
% 3.67/3.89  % SZS output end Refutation
% 3.67/3.89  ------------ end of proof -------------
% 3.67/3.89  
% 3.67/3.89  
% 3.67/3.89  Search stopped by max_proofs option.
% 3.67/3.89  
% 3.67/3.89  
% 3.67/3.89  Search stopped by max_proofs option.
% 3.67/3.89  
% 3.67/3.89  ============ end of search ============
% 3.67/3.89  
% 3.67/3.89  ----------- soft-scott stats ----------
% 3.67/3.89  
% 3.67/3.89  true clauses given         201      (37.4%)
% 3.67/3.89  false clauses given        337
% 3.67/3.89  
% 3.67/3.89        FALSE     TRUE
% 3.67/3.89     8  0         18
% 3.67/3.89     9  0         134
% 3.67/3.89    10  0         533
% 3.67/3.89    11  1         448
% 3.67/3.89    12  131       1054
% 3.67/3.89    13  683       378
% 3.67/3.89    14  998       12
% 3.67/3.89    15  703       3
% 3.67/3.89  tot:  2516      2580      (50.6% true)
% 3.67/3.89  
% 3.67/3.89  
% 3.67/3.89  Model 13 [ 1 3 33513 ] (0.00 seconds, 250000 Inserts)
% 3.67/3.89  
% 3.67/3.89  That finishes the proof of the theorem.
% 3.67/3.89  
% 3.67/3.89  Process 3620 finished Sun Jul  3 01:16:27 2022
%------------------------------------------------------------------------------