TSTP Solution File: LCL249-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL249-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n017.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 29.74s 29.98s
% Output : Refutation 29.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LCL249-3 : TPTP v8.1.0. Released v2.3.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n017.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 19:28:26 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 n017.cluster.edu,
% 0.13/0.35 Sun Jul 3 19:28:26 2022
% 0.13/0.35 The command was "./sos". The process ID is 29493.
% 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.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 3
% 0.13/0.39 number of clauses initially in problem: 13
% 0.13/0.39 percentage of clauses intially in UL: 23
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 70
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 10
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 4
% 0.13/0.39 distinct constant count: 3
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 2.74/2.97
% 2.74/2.97
% 2.74/2.97 Changing weight limit from 60 to 42.
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 3 (0.00 seconds, 0 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on number of solutions
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 4 [ 2 1 379 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 5 [ 21 0 332 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 6 [ 7 0 131 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Model 7 (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on number of solutions
% 2.74/2.97
% 2.74/2.97 Model 8 (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on number of solutions
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 9 [ 35 1 120 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 10 [ 1 0 1434 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 11 [ 34 5 126456 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 12 [ 33 0 635 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 13 [ 33 1 9777 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 14 [ 1 1 1528 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on insertions
% 2.74/2.97
% 2.74/2.97 Model 15 [ 45 5 71398 ] (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Model 16 (0.00 seconds, 250000 Inserts)
% 2.74/2.97
% 2.74/2.97 Stopped by limit on number of solutions
% 2.74/2.97
% 2.74/2.97 Resetting weight limit to 42 after 315 givens.
% 2.74/2.97
% 3.35/3.53
% 3.35/3.53
% 3.35/3.53 Changing weight limit from 42 to 40.
% 3.35/3.53
% 3.35/3.53 Resetting weight limit to 40 after 400 givens.
% 3.35/3.53
% 3.35/3.55
% 3.35/3.55
% 3.35/3.55 Changing weight limit from 40 to 38.
% 3.35/3.55
% 3.35/3.55 Resetting weight limit to 38 after 405 givens.
% 3.35/3.55
% 3.44/3.63
% 3.44/3.63
% 3.44/3.63 Changing weight limit from 38 to 28.
% 3.44/3.63
% 3.44/3.63 Resetting weight limit to 28 after 410 givens.
% 3.44/3.63
% 3.44/3.65
% 3.44/3.65
% 3.44/3.65 Changing weight limit from 28 to 27.
% 3.44/3.65
% 3.44/3.65 Resetting weight limit to 27 after 415 givens.
% 3.44/3.65
% 3.44/3.68
% 3.44/3.68
% 3.44/3.68 Changing weight limit from 27 to 26.
% 3.44/3.68
% 3.44/3.68 Resetting weight limit to 26 after 420 givens.
% 3.44/3.68
% 3.63/3.80
% 3.63/3.80
% 3.63/3.80 Changing weight limit from 26 to 24.
% 3.63/3.80
% 3.63/3.80 Resetting weight limit to 24 after 430 givens.
% 3.63/3.80
% 3.65/3.82
% 3.65/3.82
% 3.65/3.82 Changing weight limit from 24 to 23.
% 3.65/3.82
% 3.65/3.82 Modelling stopped after 300 given clauses and 0.00 seconds
% 3.65/3.82
% 3.65/3.82
% 3.65/3.82 Resetting weight limit to 23 after 435 givens.
% 3.65/3.82
% 3.67/3.89
% 3.67/3.89
% 3.67/3.89 Changing weight limit from 23 to 22.
% 3.67/3.89
% 3.67/3.89 Resetting weight limit to 22 after 445 givens.
% 3.67/3.89
% 3.75/3.95
% 3.75/3.95
% 3.75/3.95 Changing weight limit from 22 to 21.
% 3.75/3.95
% 3.75/3.95 Resetting weight limit to 21 after 460 givens.
% 3.75/3.95
% 3.82/4.06
% 3.82/4.06
% 3.82/4.06 Changing weight limit from 21 to 20.
% 3.82/4.06
% 3.82/4.06 Resetting weight limit to 20 after 490 givens.
% 3.82/4.06
% 3.97/4.17
% 3.97/4.17
% 3.97/4.17 Changing weight limit from 20 to 19.
% 3.97/4.17
% 3.97/4.17 Resetting weight limit to 19 after 530 givens.
% 3.97/4.17
% 3.97/4.20
% 3.97/4.20
% 3.97/4.20 Changing weight limit from 19 to 18.
% 3.97/4.20
% 3.97/4.20 Resetting weight limit to 18 after 545 givens.
% 3.97/4.20
% 4.23/4.39
% 4.23/4.39
% 4.23/4.39 Changing weight limit from 18 to 17.
% 4.23/4.39
% 4.23/4.39 Resetting weight limit to 17 after 630 givens.
% 4.23/4.39
% 4.34/4.52
% 4.34/4.52
% 4.34/4.52 Changing weight limit from 17 to 16.
% 4.34/4.52
% 4.34/4.52 Resetting weight limit to 16 after 675 givens.
% 4.34/4.52
% 4.63/4.88
% 4.63/4.88
% 4.63/4.88 Changing weight limit from 16 to 15.
% 4.63/4.88
% 4.63/4.88 Resetting weight limit to 15 after 715 givens.
% 4.63/4.88
% 5.54/5.72
% 5.54/5.72
% 5.54/5.72 Changing weight limit from 15 to 14.
% 5.54/5.72
% 5.54/5.72 Resetting weight limit to 14 after 960 givens.
% 5.54/5.72
% 5.93/6.15
% 5.93/6.15
% 5.93/6.15 Changing weight limit from 14 to 13.
% 5.93/6.15
% 5.93/6.15 Resetting weight limit to 13 after 1040 givens.
% 5.93/6.15
% 6.93/7.17
% 6.93/7.17
% 6.93/7.17 Changing weight limit from 13 to 12.
% 6.93/7.17
% 6.93/7.17 Resetting weight limit to 12 after 1475 givens.
% 6.93/7.17
% 29.74/29.98
% 29.74/29.98 -- HEY sandbox, WE HAVE A PROOF!! --
% 29.74/29.98
% 29.74/29.98 ----> UNIT CONFLICT at 26.30 sec ----> 66327 [binary,66326.1,3.1] {+} $F.
% 29.74/29.98
% 29.74/29.98 Length of proof is 32. Level of proof is 14.
% 29.74/29.98
% 29.74/29.98 ---------------- PROOF ----------------
% 29.74/29.98 % SZS status Unsatisfiable
% 29.74/29.98 % SZS output start Refutation
% 29.74/29.98
% 29.74/29.98 1 [] {+} theorem(A)| -axiom(A).
% 29.74/29.98 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 29.74/29.98 3 [] {+} -theorem(implies(implies(p,r),implies(and(p,q),r))).
% 29.74/29.98 4 [] {+} axiom(implies(or(A,A),A)).
% 29.74/29.98 5 [] {-} axiom(implies(A,or(B,A))).
% 29.74/29.98 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 29.74/29.98 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 29.74/29.98 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 29.74/29.98 9 [] {-} implies(A,B)=or(not(A),B).
% 29.74/29.98 11,10 [copy,9,flip.1] {-} or(not(A),B)=implies(A,B).
% 29.74/29.98 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 29.74/29.98 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 29.74/29.98 16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 29.74/29.98 17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 29.74/29.98 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 29.74/29.98 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 29.74/29.98 33 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 29.74/29.98 34 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 29.74/29.98 38 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 29.74/29.98 39 [copy,38,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 29.74/29.98 62 [para_from,39.1.1,8.1.1.1] {-} axiom(implies(or(and(A,B),C),implies(or(D,implies(A,not(B))),or(D,C)))).
% 29.74/29.98 70 [para_into,19.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 29.74/29.98 72 [para_into,19.1.1.2,10.1.1] {+} theorem(implies(or(A,not(B)),implies(B,A))).
% 29.74/29.98 89 [para_into,20.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 29.74/29.98 91 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 29.74/29.98 93 [para_into,20.1.1.2,38.1.1] {-} theorem(implies(or(A,or(and(B,C),D)),implies(implies(B,not(C)),or(A,D)))).
% 29.74/29.98 338 [hyper,62,1] {-} theorem(implies(or(and(A,B),C),implies(or(D,implies(A,not(B))),or(D,C)))).
% 29.74/29.98 382 [para_into,93.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)))).
% 29.74/29.98 400 [hyper,34,2,17] {+} theorem(implies(or(A,B),or(A,or(C,B)))).
% 29.74/29.98 703 [hyper,382,2,17] {+} theorem(implies(implies(A,not(B)),implies(C,C))).
% 29.74/29.98 939 [hyper,72,2,34] {+} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 29.74/29.98 1179 [hyper,703,2,33] {+} theorem(implies(A,A)).
% 29.74/29.98 1237 [hyper,1179,2,70] {+} theorem(or(A,not(A))).
% 29.74/29.98 1278 [hyper,1237,2,338] {-} theorem(implies(or(A,implies(B,not(C))),or(A,not(and(B,C))))).
% 29.74/29.98 2737 [para_into,89.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 29.74/29.98 2887 [hyper,91,2,1179] {+} theorem(or(A,implies(or(A,B),B))).
% 29.74/29.98 6886 [hyper,2887,2,19] {+} theorem(or(implies(or(A,B),B),A)).
% 29.74/29.98 15187 [hyper,400,2,6886] {+} theorem(or(implies(or(A,B),B),or(C,A))).
% 29.74/29.98 36513 [hyper,15187,2,939,demod,11] {+} theorem(or(implies(implies(A,B),B),implies(A,C))).
% 29.74/29.98 66306 [hyper,36513,2,1278] {-} theorem(or(implies(implies(A,B),B),not(and(A,C)))).
% 29.74/29.98 66319 [hyper,66306,2,72] {-} theorem(implies(and(A,B),implies(implies(A,C),C))).
% 29.74/29.98 66326 [hyper,66319,2,2737] {-} theorem(implies(implies(A,B),implies(and(A,C),B))).
% 29.74/29.98 66327 [binary,66326.1,3.1] {+} $F.
% 29.74/29.98
% 29.74/29.98 % SZS output end Refutation
% 29.74/29.98 ------------ end of proof -------------
% 29.74/29.98
% 29.74/29.98
% 29.74/29.98 Search stopped by max_proofs option.
% 29.74/29.98
% 29.74/29.98
% 29.74/29.98 Search stopped by max_proofs option.
% 29.74/29.98
% 29.74/29.98 ============ end of search ============
% 29.74/29.98
% 29.74/29.98 ----------- soft-scott stats ----------
% 29.74/29.98
% 29.74/29.98 true clauses given 2237 (35.9%)
% 29.74/29.98 false clauses given 3998
% 29.74/29.98
% 29.74/29.98 FALSE TRUE
% 29.74/29.98 10 0 471
% 29.74/29.98 11 0 1849
% 29.74/29.98 12 2497 180
% 29.74/29.98 tot: 2497 2500 (50.0% true)
% 29.74/29.98
% 29.74/29.98
% 29.74/29.98 Model 16 (0.00 seconds, 250000 Inserts)
% 29.74/29.98
% 29.74/29.98 That finishes the proof of the theorem.
% 29.74/29.98
% 29.74/29.98 Process 29493 finished Sun Jul 3 19:28:56 2022
%------------------------------------------------------------------------------