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

View Problem - Process Solution

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

% Computer : n015.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.62s 7.82s
% Output   : Refutation 7.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : LCL240-3 : TPTP v8.1.0. Released v2.3.0.
% 0.11/0.12  % Command  : sos-script %s
% 0.12/0.33  % Computer : n015.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sun Jul  3 07:28:45 EDT 2022
% 0.19/0.33  % CPUTime  : 
% 0.19/0.36  ----- Otter 3.2, August 2001 -----
% 0.19/0.36  The process was started by sandbox2 on n015.cluster.edu,
% 0.19/0.36  Sun Jul  3 07:28:45 2022
% 0.19/0.36  The command was "./sos".  The process ID is 2288.
% 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 15 during input processing: 0 [copy,15,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: 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 ===========
% 2.92/3.11  
% 2.92/3.11  
% 2.92/3.11  Changing weight limit from 60 to 48.
% 2.92/3.11  
% 2.92/3.11  Model 3 (0.00 seconds, 0 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on number of solutions
% 2.92/3.11  
% 2.92/3.11  Model 4 (0.00 seconds, 0 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on number of solutions
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 5 [ 13 1 393 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 6 [ 22 1 1711 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 7 [ 24 1 100 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 8 [ 1 0 248 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 9 [ 30 8 85339 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on insertions
% 2.92/3.11  
% 2.92/3.11  Model 10 [ 33 27 237084 ] (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Model 11 (0.00 seconds, 250000 Inserts)
% 2.92/3.11  
% 2.92/3.11  Stopped by limit on number of solutions
% 2.92/3.11  
% 2.92/3.11  Resetting weight limit to 48 after 320 givens.
% 2.92/3.11  
% 3.56/3.78  
% 3.56/3.78  
% 3.56/3.78  Changing weight limit from 48 to 40.
% 3.56/3.78  
% 3.56/3.78  Resetting weight limit to 40 after 390 givens.
% 3.56/3.78  
% 3.56/3.81  
% 3.56/3.81  
% 3.56/3.81  Changing weight limit from 40 to 37.
% 3.56/3.81  
% 3.56/3.81  Resetting weight limit to 37 after 395 givens.
% 3.56/3.81  
% 3.64/3.84  
% 3.64/3.84  
% 3.64/3.84  Changing weight limit from 37 to 36.
% 3.64/3.84  
% 3.64/3.84  Resetting weight limit to 36 after 400 givens.
% 3.64/3.84  
% 3.81/4.01  
% 3.81/4.01  
% 3.81/4.01  Changing weight limit from 36 to 32.
% 3.81/4.01  
% 3.81/4.01  Resetting weight limit to 32 after 405 givens.
% 3.81/4.01  
% 3.99/4.26  
% 3.99/4.26  
% 3.99/4.26  Changing weight limit from 32 to 26.
% 3.99/4.26  
% 3.99/4.26  Resetting weight limit to 26 after 410 givens.
% 3.99/4.26  
% 4.16/4.40  
% 4.16/4.40  
% 4.16/4.40  Changing weight limit from 26 to 25.
% 4.16/4.40  
% 4.16/4.40  Resetting weight limit to 25 after 420 givens.
% 4.16/4.40  
% 4.23/4.43  
% 4.23/4.43  
% 4.23/4.43  Changing weight limit from 25 to 24.
% 4.23/4.43  
% 4.23/4.43  Resetting weight limit to 24 after 425 givens.
% 4.23/4.43  
% 4.40/4.57  
% 4.40/4.57  
% 4.40/4.57  Changing weight limit from 24 to 23.
% 4.40/4.57  
% 4.40/4.57  Modelling stopped after 300 given clauses and 0.00 seconds
% 4.40/4.57  
% 4.40/4.57  
% 4.40/4.57  Resetting weight limit to 23 after 435 givens.
% 4.40/4.57  
% 4.54/4.78  
% 4.54/4.78  
% 4.54/4.78  Changing weight limit from 23 to 22.
% 4.54/4.78  
% 4.54/4.78  Resetting weight limit to 22 after 450 givens.
% 4.54/4.78  
% 4.69/4.90  
% 4.69/4.90  
% 4.69/4.90  Changing weight limit from 22 to 21.
% 4.69/4.90  
% 4.69/4.90  Resetting weight limit to 21 after 470 givens.
% 4.69/4.90  
% 4.76/4.98  
% 4.76/4.98  
% 4.76/4.98  Changing weight limit from 21 to 20.
% 4.76/4.98  
% 4.76/4.98  Resetting weight limit to 20 after 480 givens.
% 4.76/4.98  
% 5.04/5.30  
% 5.04/5.30  
% 5.04/5.30  Changing weight limit from 20 to 19.
% 5.04/5.30  
% 5.04/5.30  Resetting weight limit to 19 after 535 givens.
% 5.04/5.30  
% 5.21/5.41  
% 5.21/5.41  
% 5.21/5.41  Changing weight limit from 19 to 18.
% 5.21/5.41  
% 5.21/5.41  Resetting weight limit to 18 after 555 givens.
% 5.21/5.41  
% 5.44/5.68  
% 5.44/5.68  
% 5.44/5.68  Changing weight limit from 18 to 17.
% 5.44/5.68  
% 5.44/5.68  Resetting weight limit to 17 after 595 givens.
% 5.44/5.68  
% 5.52/5.78  
% 5.52/5.78  
% 5.52/5.78  Changing weight limit from 17 to 16.
% 5.52/5.78  
% 5.52/5.78  Resetting weight limit to 16 after 600 givens.
% 5.52/5.78  
% 6.04/6.25  
% 6.04/6.25  
% 6.04/6.25  Changing weight limit from 16 to 15.
% 6.04/6.25  
% 6.04/6.25  Resetting weight limit to 15 after 695 givens.
% 6.04/6.25  
% 7.62/7.82  
% 7.62/7.82  -------- PROOF -------- 
% 7.62/7.82  % SZS status Unsatisfiable
% 7.62/7.82  % SZS output start Refutation
% 7.62/7.82  
% 7.62/7.82  ----> UNIT CONFLICT at   7.24 sec ----> 22659 [binary,22658.1,3.1] {+} $F.
% 7.62/7.82  
% 7.62/7.82  Length of proof is 29.  Level of proof is 15.
% 7.62/7.82  
% 7.62/7.82  ---------------- PROOF ----------------
% 7.62/7.82  % SZS status Unsatisfiable
% 7.62/7.82  % SZS output start Refutation
% 7.62/7.82  
% 7.62/7.82  1 [] {+} theorem(A)| -axiom(A).
% 7.62/7.82  2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 7.62/7.82  3 [] {+} -theorem(implies(and(p,q),p)).
% 7.62/7.82  4 [] {+} axiom(implies(or(A,A),A)).
% 7.62/7.82  5 [] {+} axiom(implies(A,or(B,A))).
% 7.62/7.82  6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 7.62/7.82  7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 7.62/7.82  8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 7.62/7.82  9 [] {-} implies(A,B)=or(not(A),B).
% 7.62/7.82  11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 7.62/7.82  12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 7.62/7.82  13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 7.62/7.82  16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 7.62/7.82  17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 7.62/7.82  18 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 7.62/7.82  20 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 7.62/7.82  23 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 7.62/7.82  26 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 7.62/7.82  32 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 7.62/7.82  33 [copy,32,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 7.62/7.82  34 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 7.62/7.82  36 [hyper,20,1] {+} theorem(implies(or(A,not(B)),implies(B,A))).
% 7.62/7.82  58 [para_into,18.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 7.62/7.82  108 [para_into,23.1.1.2,32.1.1] {-} theorem(implies(or(A,or(and(B,C),D)),implies(implies(B,not(C)),or(A,D)))).
% 7.62/7.82  259 [hyper,34,2,18] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 7.62/7.82  262 [para_into,34.1.1.1,33.1.1] {-} theorem(implies(or(and(A,B),C),implies(or(D,implies(A,not(B))),or(D,C)))).
% 7.62/7.82  419 [para_into,108.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(and(B,C),D)),implies(implies(B,not(C)),implies(A,D)))).
% 7.62/7.82  730 [hyper,419,2,18] {-} theorem(implies(implies(A,not(B)),implies(or(C,and(A,B)),C))).
% 7.62/7.82  731 [hyper,419,2,17] {+} theorem(implies(implies(A,not(B)),implies(C,C))).
% 7.62/7.82  751 [hyper,730,2,26] {-} theorem(implies(or(A,and(implies(B,not(B)),B)),A)).
% 7.62/7.82  784 [para_into,751.1.1.1,10.1.1] {-} theorem(implies(implies(A,and(implies(B,not(B)),B)),not(A))).
% 7.62/7.82  1310 [hyper,731,2,784] {+} theorem(implies(A,A)).
% 7.62/7.82  1365 [hyper,1310,2,58] {+} theorem(or(A,not(A))).
% 7.62/7.82  1559 [hyper,1365,2,262] {-} theorem(implies(or(A,implies(B,not(C))),or(A,not(and(B,C))))).
% 7.62/7.82  1562 [hyper,1365,2,17] {+} theorem(or(A,or(B,not(B)))).
% 7.62/7.82  2180 [hyper,1562,2,23] {+} theorem(or(A,or(B,not(A)))).
% 7.62/7.82  13527 [hyper,259,2,2180,demod,11] {+} theorem(or(A,implies(A,B))).
% 7.62/7.82  22514 [hyper,1559,2,13527] {-} theorem(or(A,not(and(A,B)))).
% 7.62/7.82  22658 [hyper,22514,2,36] {-} theorem(implies(and(A,B),A)).
% 7.62/7.82  22659 [binary,22658.1,3.1] {+} $F.
% 7.62/7.82  
% 7.62/7.82  % SZS output end Refutation
% 7.62/7.82  ------------ end of proof -------------
% 7.62/7.82  
% 7.62/7.82  
% 7.62/7.82  Search stopped by max_proofs option.
% 7.62/7.82  
% 7.62/7.82  
% 7.62/7.82  Search stopped by max_proofs option.
% 7.62/7.82  
% 7.62/7.82  ============ end of search ============
% 7.62/7.82  
% 7.62/7.82  ----------- soft-scott stats ----------
% 7.62/7.82  
% 7.62/7.82  true clauses given         363      (35.2%)
% 7.62/7.82  false clauses given        669
% 7.62/7.82  
% 7.62/7.82        FALSE     TRUE
% 7.62/7.82     7  1         0
% 7.62/7.82     9  5         81
% 7.62/7.82    10  1         496
% 7.62/7.82    11  0         673
% 7.62/7.82    12  0         1255
% 7.62/7.82    13  308       0
% 7.62/7.82    14  1237      1
% 7.62/7.82    15  964       0
% 7.62/7.82  tot:  2516      2506      (49.9% true)
% 7.62/7.82  
% 7.62/7.82  
% 7.62/7.82  Model 11 (0.00 seconds, 250000 Inserts)
% 7.62/7.82  
% 7.62/7.82  That finishes the proof of the theorem.
% 7.62/7.82  
% 7.62/7.82  Process 2288 finished Sun Jul  3 07:28:52 2022
%------------------------------------------------------------------------------