TSTP Solution File: LCL234-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL234-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:58 EDT 2022
% Result : Unsatisfiable 11.08s 11.30s
% Output : Refutation 11.08s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL234-3 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 2 21:10:50 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n011.cluster.edu,
% 0.14/0.36 Sat Jul 2 21:10:50 2022
% 0.14/0.36 The command was "./sos". The process ID is 20628.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.36
% 0.14/0.36 This is a Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.36 sos and nonpositive clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: clear(order_hyper).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 3
% 0.14/0.40 number of clauses initially in problem: 13
% 0.14/0.40 percentage of clauses intially in UL: 23
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 66
% 0.14/0.40 percent of all initial clauses that are short: 100
% 0.14/0.40 absolute distinct symbol count: 9
% 0.14/0.40 distinct predicate count: 3
% 0.14/0.40 distinct function count: 4
% 0.14/0.40 distinct constant count: 2
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 3.50/3.69
% 3.50/3.69
% 3.50/3.69 Changing weight limit from 60 to 32.
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 3 (0.00 seconds, 0 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on number of solutions
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 4 [ 1 1 498 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 5 [ 21 1 338 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 6 [ 32 0 149 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 7 [ 3 0 392 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 8 [ 30 1 1775 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 9 [ 1 0 106 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Model 10 (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on number of solutions
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 11 [ 1 2 22102 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 12 [ 44 1 9080 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 13 [ 43 0 103 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 14 [ 4 0 101 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 15 [ 2 7 79670 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Model 16 [ 3 0 296 ] (0.00 seconds, 250000 Inserts)
% 3.50/3.69
% 3.50/3.69 Stopped by limit on insertions
% 3.50/3.69
% 3.50/3.69 Resetting weight limit to 32 after 210 givens.
% 3.50/3.69
% 5.16/5.38
% 5.16/5.38
% 5.16/5.38 Changing weight limit from 32 to 33.
% 5.16/5.38
% 5.16/5.38 Stopped by limit on insertions
% 5.16/5.38
% 5.16/5.38 Model 17 [ 48 12 61108 ] (0.00 seconds, 250000 Inserts)
% 5.16/5.38
% 5.16/5.38 Stopped by limit on insertions
% 5.16/5.38
% 5.16/5.38 Model 18 [ 2 4 34049 ] (0.00 seconds, 250000 Inserts)
% 5.16/5.38
% 5.16/5.38 Stopped by limit on insertions
% 5.16/5.38
% 5.16/5.38 Stopped by limit on insertions
% 5.16/5.38
% 5.16/5.38 Model 19 [ 39 3 12627 ] (0.00 seconds, 250000 Inserts)
% 5.16/5.38
% 5.16/5.38 Resetting weight limit to 33 after 215 givens.
% 5.16/5.38
% 5.75/5.92
% 5.75/5.92
% 5.75/5.92 Changing weight limit from 33 to 32.
% 5.75/5.92
% 5.75/5.92 Stopped by limit on insertions
% 5.75/5.92
% 5.75/5.92 Model 20 [ 3 1 362 ] (0.00 seconds, 250000 Inserts)
% 5.75/5.92
% 5.75/5.92 Resetting weight limit to 32 after 220 givens.
% 5.75/5.92
% 8.96/9.20
% 8.96/9.20
% 8.96/9.20 Changing weight limit from 32 to 24.
% 8.96/9.20
% 8.96/9.20 Stopped by limit on insertions
% 8.96/9.20
% 8.96/9.20 Model 21 [ 6 1 1934 ] (0.00 seconds, 250000 Inserts)
% 8.96/9.20
% 8.96/9.20 Stopped by limit on insertions
% 8.96/9.20
% 8.96/9.20 Model 22 [ 42 4 11211 ] (0.00 seconds, 250000 Inserts)
% 8.96/9.20
% 8.96/9.20 Stopped by limit on insertions
% 8.96/9.20
% 8.96/9.20 Model 23 [ 12 41 170325 ] (0.00 seconds, 250000 Inserts)
% 8.96/9.20
% 8.96/9.20 Resetting weight limit to 24 after 395 givens.
% 8.96/9.20
% 9.05/9.22
% 9.05/9.22
% 9.05/9.22 Changing weight limit from 24 to 23.
% 9.05/9.22
% 9.05/9.22 Resetting weight limit to 23 after 400 givens.
% 9.05/9.22
% 9.05/9.24
% 9.05/9.24
% 9.05/9.24 Changing weight limit from 23 to 22.
% 9.05/9.24
% 9.05/9.24 Resetting weight limit to 22 after 405 givens.
% 9.05/9.24
% 9.15/9.39
% 9.15/9.39
% 9.15/9.39 Changing weight limit from 22 to 20.
% 9.15/9.39
% 9.15/9.39 Resetting weight limit to 20 after 410 givens.
% 9.15/9.39
% 9.24/9.48
% 9.24/9.48
% 9.24/9.48 Changing weight limit from 20 to 19.
% 9.24/9.48
% 9.24/9.48 Resetting weight limit to 19 after 420 givens.
% 9.24/9.48
% 9.33/9.51
% 9.33/9.51
% 9.33/9.51 Changing weight limit from 19 to 18.
% 9.33/9.51
% 9.33/9.51 Resetting weight limit to 18 after 425 givens.
% 9.33/9.51
% 9.41/9.59
% 9.41/9.59
% 9.41/9.59 Changing weight limit from 18 to 17.
% 9.41/9.59
% 9.41/9.59 Resetting weight limit to 17 after 430 givens.
% 9.41/9.59
% 9.45/9.63
% 9.45/9.63
% 9.45/9.63 Changing weight limit from 17 to 16.
% 9.45/9.63
% 9.45/9.63 Resetting weight limit to 16 after 435 givens.
% 9.45/9.63
% 9.64/9.87
% 9.64/9.87
% 9.64/9.87 Changing weight limit from 16 to 15.
% 9.64/9.87
% 9.64/9.87 Modelling stopped after 300 given clauses and 0.00 seconds
% 9.64/9.87
% 9.64/9.87
% 9.64/9.87 Resetting weight limit to 15 after 475 givens.
% 9.64/9.87
% 9.82/9.98
% 9.82/9.98
% 9.82/9.98 Changing weight limit from 15 to 14.
% 9.82/9.98
% 9.82/9.98 Resetting weight limit to 14 after 510 givens.
% 9.82/9.98
% 10.16/10.41
% 10.16/10.41
% 10.16/10.41 Changing weight limit from 14 to 13.
% 10.16/10.41
% 10.16/10.41 Resetting weight limit to 13 after 650 givens.
% 10.16/10.41
% 11.08/11.30
% 11.08/11.30 -- HEY sandbox, WE HAVE A PROOF!! --
% 11.08/11.30
% 11.08/11.30 ----> UNIT CONFLICT at 10.79 sec ----> 29006 [binary,29005.1,3.1] {+} $F.
% 11.08/11.30
% 11.08/11.30 Length of proof is 39. Level of proof is 20.
% 11.08/11.30
% 11.08/11.30 ---------------- PROOF ----------------
% 11.08/11.30 % SZS status Unsatisfiable
% 11.08/11.30 % SZS output start Refutation
% 11.08/11.30
% 11.08/11.30 1 [] {+} theorem(A)| -axiom(A).
% 11.08/11.30 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 11.08/11.30 3 [] {+} -theorem(implies(p,implies(q,and(p,q)))).
% 11.08/11.30 4 [] {+} axiom(implies(or(A,A),A)).
% 11.08/11.30 5 [] {-} axiom(implies(A,or(B,A))).
% 11.08/11.30 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 11.08/11.30 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 11.08/11.30 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 11.08/11.30 9 [] {-} implies(A,B)=or(not(A),B).
% 11.08/11.30 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 11.08/11.30 12 [] {-} and(A,B)=not(or(not(A),not(B))).
% 11.08/11.30 13 [copy,12,demod,11,flip.1] {-} not(implies(A,not(B)))=and(A,B).
% 11.08/11.30 16 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 11.08/11.30 17 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 11.08/11.30 19 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 11.08/11.30 20 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 11.08/11.30 28 [para_from,10.1.1,16.1.1.1] {+} theorem(implies(implies(A,not(A)),not(A))).
% 11.08/11.30 34 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 11.08/11.30 35 [para_into,8.1.1.2.1,10.1.1,demod,11] {-} axiom(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 11.08/11.30 38 [para_into,19.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 11.08/11.30 39 [para_into,19.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 11.08/11.30 43 [para_from,13.1.1,10.1.1.1] {-} or(and(A,B),C)=implies(implies(A,not(B)),C).
% 11.08/11.30 44 [copy,43,flip.1] {-} implies(implies(A,not(B)),C)=or(and(A,B),C).
% 11.08/11.30 69 [para_into,20.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 11.08/11.30 70 [para_into,20.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 11.08/11.30 106 [para_from,44.1.1,35.1.1.2] {-} axiom(implies(implies(not(A),B),or(and(C,A),implies(C,B)))).
% 11.08/11.30 120 [para_from,44.1.1,2.2.1] {-} theorem(A)| -theorem(or(and(B,C),A))| -theorem(implies(B,not(C))).
% 11.08/11.30 229 [hyper,34,2,39] {+} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 11.08/11.30 230 [hyper,34,2,28] {+} theorem(implies(or(A,implies(B,not(B))),or(A,not(B)))).
% 11.08/11.30 233 [hyper,34,2,19] {+} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 11.08/11.30 323 [hyper,38,2,34] {+} theorem(implies(or(A,implies(B,C)),or(A,or(C,not(B))))).
% 11.08/11.30 533 [hyper,106,1] {-} theorem(implies(implies(not(A),B),or(and(C,A),implies(C,B)))).
% 11.08/11.30 1049 [para_into,69.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 11.08/11.30 1534 [hyper,70,2,17] {+} theorem(or(A,implies(B,B))).
% 11.08/11.30 1538 [hyper,1534,120,28] {+} theorem(implies(A,A)).
% 11.08/11.30 2258 [hyper,1538,2,38] {+} theorem(or(A,not(A))).
% 11.08/11.30 2470 [hyper,2258,2,17] {+} theorem(or(A,or(B,not(B)))).
% 11.08/11.30 3463 [hyper,2470,2,20] {+} theorem(or(A,or(B,not(A)))).
% 11.08/11.30 19546 [hyper,229,2,3463] {+} theorem(or(A,implies(A,B))).
% 11.08/11.30 19800 [hyper,19546,2,69] {+} theorem(implies(A,or(A,B))).
% 11.08/11.30 20177 [para_into,19800.1.1.2,10.1.1] {+} theorem(implies(not(A),implies(A,B))).
% 11.08/11.30 24996 [hyper,533,2,20177] {-} theorem(or(and(A,B),implies(A,implies(B,C)))).
% 11.08/11.30 25016 [hyper,24996,2,323] {-} theorem(or(and(A,B),or(implies(B,C),not(A)))).
% 11.08/11.30 25574 [hyper,25016,2,20] {-} theorem(or(implies(A,B),or(and(C,A),not(C)))).
% 11.08/11.30 25887 [hyper,25574,2,233,demod,11] {-} theorem(or(implies(A,B),implies(C,and(C,A)))).
% 11.08/11.30 25901 [hyper,25887,2,19] {-} theorem(or(implies(A,and(A,B)),implies(B,C))).
% 11.08/11.30 25966 [hyper,25901,2,230] {-} theorem(or(implies(A,and(A,B)),not(B))).
% 11.08/11.30 25990 [hyper,25966,2,39] {-} theorem(implies(A,implies(B,and(B,A)))).
% 11.08/11.30 29005 [hyper,1049,2,25990] {-} theorem(implies(A,implies(B,and(A,B)))).
% 11.08/11.30 29006 [binary,29005.1,3.1] {+} $F.
% 11.08/11.30
% 11.08/11.30 % SZS output end Refutation
% 11.08/11.30 ------------ end of proof -------------
% 11.08/11.30
% 11.08/11.30
% 11.08/11.30 Search stopped by max_proofs option.
% 11.08/11.30
% 11.08/11.30
% 11.08/11.30 Search stopped by max_proofs option.
% 11.08/11.30
% 11.08/11.30 ============ end of search ============
% 11.08/11.30
% 11.08/11.30 ----------- soft-scott stats ----------
% 11.08/11.30
% 11.08/11.30 true clauses given 363 (32.1%)
% 11.08/11.30 false clauses given 768
% 11.08/11.30
% 11.08/11.30 FALSE TRUE
% 11.08/11.30 9 0 46
% 11.08/11.30 10 0 512
% 11.08/11.30 11 6 741
% 11.08/11.30 12 1288 1202
% 11.08/11.30 13 1213 1
% 11.08/11.30 tot: 2507 2502 (50.0% true)
% 11.08/11.30
% 11.08/11.30
% 11.08/11.30 Model 23 [ 12 41 170325 ] (0.00 seconds, 250000 Inserts)
% 11.08/11.30
% 11.08/11.30 That finishes the proof of the theorem.
% 11.08/11.30
% 11.08/11.30 Process 20628 finished Sat Jul 2 21:11:01 2022
%------------------------------------------------------------------------------