TSTP Solution File: LCL248-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL248-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:06 EDT 2022
% Result : Unsatisfiable 8.42s 8.61s
% Output : Refutation 8.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL248-3 : TPTP v8.1.0. Released v2.3.0.
% 0.08/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 4 01:20:41 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox on n029.cluster.edu,
% 0.13/0.38 Mon Jul 4 01:20:41 2022
% 0.13/0.38 The command was "./sos". The process ID is 13491.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.38
% 0.13/0.38 This is a Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.38 sos and nonpositive clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: clear(order_hyper).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 3
% 0.21/0.41 number of clauses initially in problem: 13
% 0.21/0.41 percentage of clauses intially in UL: 23
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 66
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 9
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 4
% 0.21/0.41 distinct constant count: 2
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 5.63/5.84
% 5.63/5.84
% 5.63/5.84 Changing weight limit from 60 to 34.
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 3 (0.00 seconds, 0 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on number of solutions
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 4 [ 2 0 597 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 5 [ 16 0 192 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 6 [ 22 0 159 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 7 [ 21 1 966 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 8 [ 1 0 91 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 9 [ 1 0 60 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 10 [ 1 1 79 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 11 [ 1 0 103 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 12 [ 32 2 13844 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 13 [ 33 1 265 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 14 [ 2 1 5704 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 15 [ 2 1 297 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 16 [ 35 0 54 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 17 [ 35 1 717 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 18 [ 35 1 821 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 19 [ 37 2 9904 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 20 [ 35 6 46784 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 21 [ 1 6 25451 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Stopped by limit on insertions
% 5.63/5.84
% 5.63/5.84 Model 22 [ 4 2 5264 ] (0.00 seconds, 250000 Inserts)
% 5.63/5.84
% 5.63/5.84 Resetting weight limit to 34 after 245 givens.
% 5.63/5.84
% 6.00/6.23
% 6.00/6.23
% 6.00/6.23 Changing weight limit from 34 to 26.
% 6.00/6.23
% 6.00/6.23 Resetting weight limit to 26 after 320 givens.
% 6.00/6.23
% 6.00/6.26
% 6.00/6.26
% 6.00/6.26 Changing weight limit from 26 to 25.
% 6.00/6.26
% 6.00/6.26 Resetting weight limit to 25 after 325 givens.
% 6.00/6.26
% 6.10/6.29
% 6.10/6.29
% 6.10/6.29 Changing weight limit from 25 to 24.
% 6.10/6.29
% 6.10/6.29 Resetting weight limit to 24 after 330 givens.
% 6.10/6.29
% 6.13/6.31
% 6.13/6.31
% 6.13/6.31 Changing weight limit from 24 to 22.
% 6.13/6.31
% 6.13/6.31 Resetting weight limit to 22 after 335 givens.
% 6.13/6.31
% 6.23/6.43
% 6.23/6.43
% 6.23/6.43 Changing weight limit from 22 to 20.
% 6.23/6.43
% 6.23/6.43 Resetting weight limit to 20 after 350 givens.
% 6.23/6.43
% 6.23/6.50
% 6.23/6.50
% 6.23/6.50 Changing weight limit from 20 to 19.
% 6.23/6.50
% 6.23/6.50 Resetting weight limit to 19 after 360 givens.
% 6.23/6.50
% 6.33/6.54
% 6.33/6.54
% 6.33/6.54 Changing weight limit from 19 to 18.
% 6.33/6.54
% 6.33/6.54 Resetting weight limit to 18 after 370 givens.
% 6.33/6.54
% 6.43/6.70
% 6.43/6.70
% 6.43/6.70 Changing weight limit from 18 to 16.
% 6.43/6.70
% 6.43/6.70 Resetting weight limit to 16 after 380 givens.
% 6.43/6.70
% 6.62/6.87
% 6.62/6.87
% 6.62/6.87 Changing weight limit from 16 to 15.
% 6.62/6.87
% 6.62/6.87 Resetting weight limit to 15 after 410 givens.
% 6.62/6.87
% 7.33/7.56
% 7.33/7.56
% 7.33/7.56 Changing weight limit from 15 to 14.
% 7.33/7.56
% 7.33/7.56 Stopped by limit on insertions
% 7.33/7.56
% 7.33/7.56 Model 23 [ 3 4 28339 ] (0.00 seconds, 250000 Inserts)
% 7.33/7.56
% 7.33/7.56 Resetting weight limit to 14 after 425 givens.
% 7.33/7.56
% 8.42/8.61
% 8.42/8.61
% 8.42/8.61 Changing weight limit from 14 to 15.
% 8.42/8.61
% 8.42/8.61 Stopped by limit on insertions
% 8.42/8.61
% 8.42/8.61 Stopped by limit on insertions
% 8.42/8.61
% 8.42/8.61 Model 24 [ 51 33 130572 ] (0.00 seconds, 250000 Inserts)
% 8.42/8.61
% 8.42/8.61 Resetting weight limit to 15 after 430 givens.
% 8.42/8.61
% 8.42/8.61
% 8.42/8.61 -------- PROOF --------
% 8.42/8.61 % SZS status Unsatisfiable
% 8.42/8.61 % SZS output start Refutation
% 8.42/8.61
% 8.42/8.61 ----> UNIT CONFLICT at 8.17 sec ----> 11650 [binary,11649.1,3.1] {+} $F.
% 8.42/8.61
% 8.42/8.61 Length of proof is 30. Level of proof is 13.
% 8.42/8.61
% 8.42/8.61 ---------------- PROOF ----------------
% 8.42/8.61 % SZS status Unsatisfiable
% 8.42/8.61 % SZS output start Refutation
% 8.42/8.61
% 8.42/8.61 1 [] {+} theorem(A)| -axiom(A).
% 8.42/8.61 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 8.42/8.61 3 [] {+} -theorem(implies(and(p,q),implies(p,q))).
% 8.42/8.61 4 [] {+} axiom(implies(or(A,A),A)).
% 8.42/8.61 5 [] {-} axiom(implies(A,or(B,A))).
% 8.42/8.61 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 8.42/8.61 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 8.42/8.61 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 8.42/8.61 9 [] {-} implies(A,B)=or(not(A),B).
% 8.42/8.61 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 8.42/8.61 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 8.42/8.61 14,13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 8.42/8.61 16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 8.42/8.61 17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 8.42/8.61 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 8.42/8.61 20 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 8.42/8.61 24 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 8.42/8.61 25 [para_from,10.1.1,17.1.1.2] {+} theorem(implies(A,implies(B,A))).
% 8.42/8.61 29 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 8.42/8.61 34 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 8.42/8.61 42 [hyper,24,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 8.42/8.61 52 [para_into,19.1.1.1,10.1.1] {-} theorem(implies(implies(A,B),or(B,not(A)))).
% 8.42/8.61 70 [para_into,20.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 8.42/8.61 75 [hyper,34,2,42] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 8.42/8.61 76 [hyper,34,2,25] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 8.42/8.61 79 [hyper,34,2,17] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 8.42/8.61 92 [para_into,76.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 8.42/8.61 97 [hyper,29,2,34] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 8.42/8.61 297 [hyper,70,2,17] {+} theorem(or(A,implies(B,B))).
% 8.42/8.61 318 [hyper,297,2,16] {+} theorem(implies(A,A)).
% 8.42/8.61 368 [hyper,318,2,52] {+} theorem(or(A,not(A))).
% 8.42/8.61 394 [hyper,368,2,79] {+} theorem(or(A,or(B,not(A)))).
% 8.42/8.61 395 [hyper,368,2,76] {+} theorem(or(A,implies(B,not(A)))).
% 8.42/8.61 1823 [hyper,75,2,394] {+} theorem(or(A,implies(A,B))).
% 8.42/8.61 1844 [para_into,1823.1.1,10.1.1] {-} theorem(implies(A,implies(not(A),B))).
% 8.42/8.61 1854 [hyper,1844,2,34] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 8.42/8.61 11475 [hyper,1854,2,395,demod,14] {+} theorem(or(A,implies(and(B,A),C))).
% 8.42/8.61 11522 [hyper,11475,2,97] {+} theorem(or(A,not(and(B,A)))).
% 8.42/8.61 11612 [hyper,11522,2,42] {+} theorem(implies(and(A,B),B)).
% 8.42/8.61 11649 [hyper,11612,2,92] {-} theorem(implies(and(A,B),implies(C,B))).
% 8.42/8.61 11650 [binary,11649.1,3.1] {+} $F.
% 8.42/8.61
% 8.42/8.61 % SZS output end Refutation
% 8.42/8.61 ------------ end of proof -------------
% 8.42/8.61
% 8.42/8.61
% 8.42/8.61 Search stopped by max_proofs option.
% 8.42/8.61
% 8.42/8.61
% 8.42/8.61 Search stopped by max_proofs option.
% 8.42/8.61
% 8.42/8.61 ============ end of search ============
% 8.42/8.61
% 8.42/8.61 ----------- soft-scott stats ----------
% 8.42/8.61
% 8.42/8.61 true clauses given 151 (35.1%)
% 8.42/8.61 false clauses given 279
% 8.42/8.61
% 8.42/8.61 FALSE TRUE
% 8.42/8.61 8 0 21
% 8.42/8.61 9 1 95
% 8.42/8.61 10 50 357
% 8.42/8.61 11 213 456
% 8.42/8.61 12 435 927
% 8.42/8.61 13 173 46
% 8.42/8.61 14 96 16
% 8.42/8.61 tot: 968 1918 (66.5% true)
% 8.42/8.61
% 8.42/8.61
% 8.42/8.61 Model 24 [ 51 33 130572 ] (0.00 seconds, 250000 Inserts)
% 8.42/8.61
% 8.42/8.61 That finishes the proof of the theorem.
% 8.42/8.61
% 8.42/8.61 Process 13491 finished Mon Jul 4 01:20:49 2022
%------------------------------------------------------------------------------