TSTP Solution File: LCL237-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL237-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:00 EDT 2022
% Result : Unsatisfiable 4.95s 5.20s
% Output : Refutation 4.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL237-3 : TPTP v8.1.0. Released v2.3.0.
% 0.00/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 3 23:55:31 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.35 ----- Otter 3.2, August 2001 -----
% 0.19/0.35 The process was started by sandbox on n021.cluster.edu,
% 0.19/0.35 Sun Jul 3 23:55:31 2022
% 0.19/0.35 The command was "./sos". The process ID is 16324.
% 0.19/0.35
% 0.19/0.35 set(prolog_style_variables).
% 0.19/0.35 set(auto).
% 0.19/0.35 dependent: set(auto1).
% 0.19/0.35 dependent: set(process_input).
% 0.19/0.35 dependent: clear(print_kept).
% 0.19/0.35 dependent: clear(print_new_demod).
% 0.19/0.35 dependent: clear(print_back_demod).
% 0.19/0.35 dependent: clear(print_back_sub).
% 0.19/0.35 dependent: set(control_memory).
% 0.19/0.35 dependent: assign(max_mem, 12000).
% 0.19/0.35 dependent: assign(pick_given_ratio, 4).
% 0.19/0.35 dependent: assign(stats_level, 1).
% 0.19/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.35 dependent: assign(sos_limit, 5000).
% 0.19/0.35 dependent: assign(max_weight, 60).
% 0.19/0.35 clear(print_given).
% 0.19/0.35
% 0.19/0.35 list(usable).
% 0.19/0.35
% 0.19/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.19/0.35
% 0.19/0.35 This is a Horn set with equality. The strategy will be
% 0.19/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.19/0.35 sos and nonpositive clauses in usable.
% 0.19/0.35
% 0.19/0.35 dependent: set(knuth_bendix).
% 0.19/0.35 dependent: set(para_from).
% 0.19/0.35 dependent: set(para_into).
% 0.19/0.35 dependent: clear(para_from_right).
% 0.19/0.35 dependent: clear(para_into_right).
% 0.19/0.35 dependent: set(para_from_vars).
% 0.19/0.35 dependent: set(eq_units_both_ways).
% 0.19/0.35 dependent: set(dynamic_demod_all).
% 0.19/0.35 dependent: set(dynamic_demod).
% 0.19/0.35 dependent: set(order_eq).
% 0.19/0.35 dependent: set(back_demod).
% 0.19/0.35 dependent: set(lrpo).
% 0.19/0.35 dependent: set(hyper_res).
% 0.19/0.35 dependent: clear(order_hyper).
% 0.19/0.35
% 0.19/0.35 ------------> process usable:
% 0.19/0.35
% 0.19/0.35 ------------> process sos:
% 0.19/0.35 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.19/0.35
% 0.19/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 3
% 0.19/0.39 number of clauses initially in problem: 13
% 0.19/0.39 percentage of clauses intially in UL: 23
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 66
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 9
% 0.19/0.39 distinct predicate count: 3
% 0.19/0.39 distinct function count: 4
% 0.19/0.39 distinct constant count: 2
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 2.14/2.36
% 2.14/2.36
% 2.14/2.36 Changing weight limit from 60 to 46.
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 3 [ 12 1 170 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Model 4 (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on number of solutions
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 5 [ 6 0 72 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 6 [ 27 0 124 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 7 [ 1 1 321 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 8 [ 31 1 5255 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 9 (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on number of solutions
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 10 [ 3 1 21318 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 11 [ 34 1 776 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 12 [ 39 0 1028 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on insertions
% 2.14/2.36
% 2.14/2.36 Model 13 [ 1 0 167 ] (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Model 14 (0.00 seconds, 250000 Inserts)
% 2.14/2.36
% 2.14/2.36 Stopped by limit on number of solutions
% 2.14/2.36
% 2.14/2.36 Resetting weight limit to 46 after 390 givens.
% 2.14/2.36
% 2.90/3.11
% 2.90/3.11
% 2.90/3.11 Changing weight limit from 46 to 28.
% 2.90/3.11
% 2.90/3.11 Modelling stopped after 300 given clauses and 0.00 seconds
% 2.90/3.11
% 2.90/3.11
% 2.90/3.11 Resetting weight limit to 28 after 600 givens.
% 2.90/3.11
% 3.06/3.27
% 3.06/3.27
% 3.06/3.27 Changing weight limit from 28 to 27.
% 3.06/3.27
% 3.06/3.27 Resetting weight limit to 27 after 605 givens.
% 3.06/3.27
% 3.20/3.43
% 3.20/3.43
% 3.20/3.43 Changing weight limit from 27 to 21.
% 3.20/3.43
% 3.20/3.43 Resetting weight limit to 21 after 610 givens.
% 3.20/3.43
% 3.37/3.55
% 3.37/3.55
% 3.37/3.55 Changing weight limit from 21 to 20.
% 3.37/3.55
% 3.37/3.55 Resetting weight limit to 20 after 615 givens.
% 3.37/3.55
% 3.37/3.61
% 3.37/3.61
% 3.37/3.61 Changing weight limit from 20 to 19.
% 3.37/3.61
% 3.37/3.61 Resetting weight limit to 19 after 620 givens.
% 3.37/3.61
% 3.51/3.72
% 3.51/3.72
% 3.51/3.72 Changing weight limit from 19 to 18.
% 3.51/3.72
% 3.51/3.72 Resetting weight limit to 18 after 635 givens.
% 3.51/3.72
% 3.81/4.03
% 3.81/4.03
% 3.81/4.03 Changing weight limit from 18 to 17.
% 3.81/4.03
% 3.81/4.03 Resetting weight limit to 17 after 650 givens.
% 3.81/4.03
% 3.91/4.10
% 3.91/4.10
% 3.91/4.10 Changing weight limit from 17 to 16.
% 3.91/4.10
% 3.91/4.10 Resetting weight limit to 16 after 655 givens.
% 3.91/4.10
% 4.10/4.32
% 4.10/4.32
% 4.10/4.32 Changing weight limit from 16 to 15.
% 4.10/4.32
% 4.10/4.32 Resetting weight limit to 15 after 685 givens.
% 4.10/4.32
% 4.27/4.44
% 4.27/4.44
% 4.27/4.44 Changing weight limit from 15 to 14.
% 4.27/4.44
% 4.27/4.44 Resetting weight limit to 14 after 715 givens.
% 4.27/4.44
% 4.65/4.89
% 4.65/4.89
% 4.65/4.89 Changing weight limit from 14 to 13.
% 4.65/4.89
% 4.65/4.89 Resetting weight limit to 13 after 860 givens.
% 4.65/4.89
% 4.95/5.20
% 4.95/5.20 -------- PROOF --------
% 4.95/5.20 % SZS status Unsatisfiable
% 4.95/5.20 % SZS output start Refutation
% 4.95/5.20
% 4.95/5.20 ----> UNIT CONFLICT at 4.76 sec ----> 29316 [binary,29315.1,3.1] {+} $F.
% 4.95/5.20
% 4.95/5.20 Length of proof is 37. Level of proof is 16.
% 4.95/5.20
% 4.95/5.20 ---------------- PROOF ----------------
% 4.95/5.20 % SZS status Unsatisfiable
% 4.95/5.20 % SZS output start Refutation
% 4.95/5.20
% 4.95/5.20 1 [] {+} theorem(A)| -axiom(A).
% 4.95/5.20 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 4.95/5.20 3 [] {+} -theorem(implies(q,implies(p,and(p,q)))).
% 4.95/5.20 4 [] {+} axiom(implies(or(A,A),A)).
% 4.95/5.20 5 [] {-} axiom(implies(A,or(B,A))).
% 4.95/5.20 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 4.95/5.20 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 4.95/5.20 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 4.95/5.20 9 [] {-} implies(A,B)=or(not(A),B).
% 4.95/5.20 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 4.95/5.20 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 4.95/5.20 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 4.95/5.20 16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 4.95/5.20 17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 4.95/5.20 20 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 4.95/5.20 22 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 4.95/5.20 25 [para_from,10.1.1,16.1.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 4.95/5.20 33 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 4.95/5.20 34 [copy,33,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 4.95/5.20 35 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 4.95/5.20 38 [hyper,22,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 4.95/5.20 51 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 4.95/5.20 52 [para_into,8.1.1.2.1,10.1.1,demod,11] {-} axiom(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 4.95/5.20 96 [para_into,20.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 4.95/5.20 213 [para_into,35.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 4.95/5.20 416 [hyper,96,2,17] {+} theorem(or(or(A,B),not(B))).
% 4.95/5.20 462 [hyper,51,2,96] {+} theorem(implies(or(A,implies(B,C)),or(A,or(C,not(B))))).
% 4.95/5.20 463 [hyper,51,2,38] {+} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 4.95/5.20 465 [hyper,51,2,25] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 4.95/5.20 467 [hyper,51,2,20] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 4.95/5.20 468 [hyper,51,2,17] {-} theorem(implies(or(A,B),or(A,or(C,B)))).
% 4.95/5.20 469 [hyper,51,2,16] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 4.95/5.20 635 [hyper,468,2,416] {-} theorem(or(or(A,B),or(C,not(B)))).
% 4.95/5.20 662 [hyper,635,2,20] {-} theorem(or(or(A,not(B)),or(C,B))).
% 4.95/5.20 726 [hyper,469,2,662] {+} theorem(or(or(A,not(B)),B)).
% 4.95/5.20 738 [hyper,726,2,20] {+} theorem(or(A,or(B,not(A)))).
% 4.95/5.20 965 [para_into,52.1.1.2,34.1.1] {-} axiom(implies(implies(not(A),B),or(and(C,A),implies(C,B)))).
% 4.95/5.20 3696 [hyper,965,1] {-} theorem(implies(implies(not(A),B),or(and(C,A),implies(C,B)))).
% 4.95/5.20 25273 [hyper,463,2,738] {+} theorem(or(A,implies(A,B))).
% 4.95/5.20 25383 [hyper,25273,2,213] {+} theorem(implies(A,or(A,B))).
% 4.95/5.20 25594 [hyper,25383,2,3696,demod,11] {-} theorem(or(and(A,B),implies(A,implies(B,C)))).
% 4.95/5.20 26291 [hyper,25594,2,462] {-} theorem(or(and(A,B),or(implies(B,C),not(A)))).
% 4.95/5.20 28338 [hyper,26291,2,35] {-} theorem(or(implies(A,B),or(and(C,A),not(C)))).
% 4.95/5.20 29156 [hyper,28338,2,467,demod,11] {-} theorem(or(implies(A,B),implies(C,and(C,A)))).
% 4.95/5.20 29168 [hyper,29156,2,20] {-} theorem(or(implies(A,and(A,B)),implies(B,C))).
% 4.95/5.20 29260 [hyper,29168,2,465] {-} theorem(or(implies(A,and(A,B)),not(B))).
% 4.95/5.20 29315 [hyper,29260,2,38] {-} theorem(implies(A,implies(B,and(B,A)))).
% 4.95/5.20 29316 [binary,29315.1,3.1] {+} $F.
% 4.95/5.20
% 4.95/5.20 % SZS output end Refutation
% 4.95/5.20 ------------ end of proof -------------
% 4.95/5.20
% 4.95/5.20
% 4.95/5.20 Search stopped by max_proofs option.
% 4.95/5.20
% 4.95/5.20
% 4.95/5.20 Search stopped by max_proofs option.
% 4.95/5.20
% 4.95/5.20 ============ end of search ============
% 4.95/5.20
% 4.95/5.20 ----------- soft-scott stats ----------
% 4.95/5.20
% 4.95/5.20 true clauses given 338 (33.5%)
% 4.95/5.20 false clauses given 672
% 4.95/5.20
% 4.95/5.20 FALSE TRUE
% 4.95/5.20 8 0 6
% 4.95/5.20 9 0 72
% 4.95/5.20 10 1 502
% 4.95/5.20 11 7 647
% 4.95/5.20 12 971 1273
% 4.95/5.20 13 1521 0
% 4.95/5.20 tot: 2500 2500 (50.0% true)
% 4.95/5.20
% 4.95/5.20
% 4.95/5.20 Model 14 (0.00 seconds, 250000 Inserts)
% 4.95/5.20
% 4.95/5.20 That finishes the proof of the theorem.
% 4.95/5.20
% 4.95/5.20 Process 16324 finished Sun Jul 3 23:55:36 2022
%------------------------------------------------------------------------------