TSTP Solution File: LCL215-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL215-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:45 EDT 2022
% Result : Unsatisfiable 107.07s 107.30s
% Output : Refutation 107.07s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL215-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n012.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 4 16:24:16 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n012.cluster.edu,
% 0.12/0.35 Mon Jul 4 16:24:16 2022
% 0.12/0.35 The command was "./sos". The process ID is 17085.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/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: 11
% 0.19/0.39 percentage of clauses intially in UL: 27
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 75
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 8
% 0.19/0.39 distinct predicate count: 3
% 0.19/0.39 distinct function count: 3
% 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 ===========
% 3.31/3.51
% 3.31/3.51
% 3.31/3.51 Changing weight limit from 60 to 34.
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 3 (0.00 seconds, 0 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on number of solutions
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 4 [ 2 2 21505 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 5 [ 1 1 11773 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 6 [ 1 0 306 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 7 [ 22 0 195 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 8 [ 21 0 4628 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Model 9 [ 1 14 113895 ] (0.00 seconds, 250000 Inserts)
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Stopped by limit on insertions
% 3.31/3.51
% 3.31/3.51 Resetting weight limit to 34 after 225 givens.
% 3.31/3.51
% 3.99/4.17
% 3.99/4.17
% 3.99/4.17 Changing weight limit from 34 to 18.
% 3.99/4.17
% 3.99/4.17 Resetting weight limit to 18 after 440 givens.
% 3.99/4.17
% 4.94/5.13
% 4.94/5.13
% 4.94/5.13 Changing weight limit from 18 to 17.
% 4.94/5.13
% 4.94/5.13 Stopped by limit on insertions
% 4.94/5.13
% 4.94/5.13 Model 10 [ 1 1 1745 ] (0.00 seconds, 250000 Inserts)
% 4.94/5.13
% 4.94/5.13 Stopped by limit on insertions
% 4.94/5.13
% 4.94/5.13 Model 11 [ 1 1 714 ] (0.00 seconds, 250000 Inserts)
% 4.94/5.13
% 4.94/5.13 Resetting weight limit to 17 after 450 givens.
% 4.94/5.13
% 5.24/5.44
% 5.24/5.44
% 5.24/5.44 Changing weight limit from 17 to 15.
% 5.24/5.44
% 5.24/5.44 Modelling stopped after 300 given clauses and 0.00 seconds
% 5.24/5.44
% 5.24/5.44
% 5.24/5.44 Resetting weight limit to 15 after 495 givens.
% 5.24/5.44
% 5.66/5.89
% 5.66/5.89
% 5.66/5.89 Changing weight limit from 15 to 14.
% 5.66/5.89
% 5.66/5.89 Resetting weight limit to 14 after 590 givens.
% 5.66/5.89
% 7.18/7.37
% 7.18/7.37
% 7.18/7.37 Changing weight limit from 14 to 13.
% 7.18/7.37
% 7.18/7.37 Resetting weight limit to 13 after 1260 givens.
% 7.18/7.37
% 43.07/43.26
% 43.07/43.26
% 43.07/43.26 Changing weight limit from 13 to 14.
% 43.07/43.26
% 43.07/43.26 Resetting weight limit to 14 after 9445 givens.
% 43.07/43.26
% 107.07/107.30
% 107.07/107.30 -- HEY sandbox, WE HAVE A PROOF!! --
% 107.07/107.30
% 107.07/107.30 ----> UNIT CONFLICT at 96.59 sec ----> 461030 [binary,461029.1,3.1] {+} $F.
% 107.07/107.30
% 107.07/107.30 Length of proof is 54. Level of proof is 17.
% 107.07/107.30
% 107.07/107.30 ---------------- PROOF ----------------
% 107.07/107.30 % SZS status Unsatisfiable
% 107.07/107.30 % SZS output start Refutation
% 107.07/107.30
% 107.07/107.30 1 [] {+} theorem(A)| -axiom(A).
% 107.07/107.30 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 107.07/107.30 3 [] {+} -theorem(implies(implies(p,q),implies(or(p,q),q))).
% 107.07/107.30 4 [] {+} axiom(implies(or(A,A),A)).
% 107.07/107.30 5 [] {-} axiom(implies(A,or(B,A))).
% 107.07/107.30 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 107.07/107.30 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 107.07/107.30 8 [] {-} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 107.07/107.30 9 [] {-} implies(A,B)=or(not(A),B).
% 107.07/107.30 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 107.07/107.30 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 107.07/107.30 14 [hyper,5,1] {-} theorem(implies(A,or(B,A))).
% 107.07/107.30 16 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 107.07/107.31 17 [hyper,7,1] {-} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 107.07/107.31 21 [para_from,10.1.1,6.1.1.2] {-} axiom(implies(or(A,not(B)),implies(B,A))).
% 107.07/107.31 22 [para_from,10.1.1,14.1.1.2] {+} theorem(implies(A,implies(B,A))).
% 107.07/107.31 31 [hyper,21,1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 107.07/107.31 33 [hyper,8,1] {-} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 107.07/107.31 37 [para_into,31.1.1.1,10.1.1] {+} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 107.07/107.31 50 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 107.07/107.31 56 [para_into,17.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(or(A,implies(B,C)),implies(B,or(A,C)))).
% 107.07/107.31 57 [para_into,17.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 107.07/107.31 63 [hyper,33,2,22] {-} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 107.07/107.31 65 [hyper,33,2,16] {-} theorem(implies(or(A,or(B,C)),or(A,or(C,B)))).
% 107.07/107.31 67 [hyper,33,2,13] {-} theorem(implies(or(A,or(B,B)),or(A,B))).
% 107.07/107.31 68 [para_into,33.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B)))).
% 107.07/107.31 82 [para_into,67.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,B)),implies(A,B))).
% 107.07/107.31 90 [hyper,82,2,14] {+} theorem(implies(A,A)).
% 107.07/107.31 141 [para_into,65.1.1.1,10.1.1,demod,11] {-} theorem(implies(implies(A,or(B,C)),implies(A,or(C,B)))).
% 107.07/107.31 178 [hyper,37,2,90] {+} theorem(implies(A,not(not(A)))).
% 107.07/107.31 181 [hyper,178,2,33] {-} theorem(implies(or(A,B),or(A,not(not(B))))).
% 107.07/107.31 239 [hyper,141,2,67] {-} theorem(implies(or(A,or(B,B)),or(B,A))).
% 107.07/107.31 242 [hyper,141,2,63] {-} theorem(implies(or(A,B),or(implies(C,B),A))).
% 107.07/107.31 244 [hyper,141,2,14] {+} theorem(implies(A,or(A,B))).
% 107.07/107.31 263 [para_into,239.1.1.1.2,10.1.1,demod,11] {-} theorem(implies(or(A,implies(B,not(B))),implies(B,A))).
% 107.07/107.31 307 [hyper,244,2,33] {-} theorem(implies(or(A,B),or(A,or(B,C)))).
% 107.07/107.31 338 [hyper,307,2,141] {-} theorem(implies(or(A,B),or(or(B,C),A))).
% 107.07/107.31 366 [para_into,338.1.1.2.1,10.1.1] {-} theorem(implies(or(A,not(B)),or(implies(B,C),A))).
% 107.07/107.31 556 [hyper,50,2,90] {+} theorem(or(A,not(A))).
% 107.07/107.31 584 [hyper,556,2,366] {+} theorem(or(implies(A,B),A)).
% 107.07/107.31 624 [hyper,584,2,31] {+} theorem(implies(A,implies(not(A),B))).
% 107.07/107.31 1192 [hyper,57,2,90] {+} theorem(or(A,implies(or(A,B),B))).
% 107.07/107.31 1198 [hyper,57,2,63] {+} theorem(or(A,implies(or(A,B),implies(C,B)))).
% 107.07/107.31 2010 [hyper,624,2,33] {-} theorem(implies(or(A,B),or(A,implies(not(B),C)))).
% 107.07/107.31 4928 [hyper,2010,2,556] {-} theorem(or(A,implies(not(not(A)),B))).
% 107.07/107.31 11474 [hyper,1192,2,16] {+} theorem(or(implies(or(A,B),B),A)).
% 107.07/107.31 11570 [hyper,4928,2,263] {+} theorem(implies(not(not(A)),A)).
% 107.07/107.31 11611 [hyper,11570,2,33] {-} theorem(implies(or(A,not(not(B))),or(A,B))).
% 107.07/107.31 11629 [hyper,181,2,141,demod,11] {-} theorem(implies(or(A,B),implies(not(B),A))).
% 107.07/107.31 11634 [hyper,181,2,57] {-} theorem(or(A,implies(or(A,B),not(not(B))))).
% 107.07/107.31 11812 [hyper,11629,2,11474] {-} theorem(implies(not(A),implies(or(A,B),B))).
% 107.07/107.31 11952 [hyper,11812,2,33] {-} theorem(implies(or(A,not(B)),or(A,implies(or(B,C),C)))).
% 107.07/107.31 12085 [hyper,11611,2,82] {-} theorem(implies(or(A,not(not(A))),A)).
% 107.07/107.31 12131 [hyper,12085,2,68] {-} theorem(implies(implies(A,or(B,not(not(B)))),implies(A,B))).
% 107.07/107.31 12179 [hyper,11634,2,16] {-} theorem(or(implies(or(A,B),not(not(B))),A)).
% 107.07/107.31 13496 [hyper,12179,2,242] {-} theorem(or(implies(A,B),implies(or(B,C),not(not(C))))).
% 107.07/107.31 32907 [hyper,13496,2,56] {-} theorem(implies(or(A,B),or(implies(C,A),not(not(B))))).
% 107.07/107.31 44891 [hyper,32907,2,12131] {+} theorem(implies(or(A,implies(B,A)),implies(B,A))).
% 107.07/107.31 46829 [hyper,1198,2,16] {+} theorem(or(implies(or(A,B),implies(C,B)),A)).
% 107.07/107.31 71547 [hyper,11952,2,141] {-} theorem(implies(or(A,not(B)),or(implies(or(B,C),C),A))).
% 107.07/107.31 110050 [para_into,46829.1.1.1.1,10.1.1] {+} theorem(or(implies(implies(A,B),implies(C,B)),not(A))).
% 107.07/107.31 208433 [hyper,110050,2,71547] {-} theorem(or(implies(or(A,B),B),implies(implies(A,C),implies(D,C)))).
% 107.07/107.31 461029 [hyper,208433,2,44891] {-} theorem(implies(implies(A,B),implies(or(A,B),B))).
% 107.07/107.31 461030 [binary,461029.1,3.1] {+} $F.
% 107.07/107.31
% 107.07/107.31 % SZS output end Refutation
% 107.07/107.31 ------------ end of proof -------------
% 107.07/107.31
% 107.07/107.31
% 107.07/107.31 Search stopped by max_proofs option.
% 107.07/107.31
% 107.07/107.31
% 107.07/107.31 Search stopped by max_proofs option.
% 107.07/107.31
% 107.07/107.31 ============ end of search ============
% 107.07/107.31
% 107.07/107.31 ----------- soft-scott stats ----------
% 107.07/107.31
% 107.07/107.31 true clauses given 5601 (37.8%)
% 107.07/107.31 false clauses given 9219
% 107.07/107.31
% 107.07/107.31 FALSE TRUE
% 107.07/107.31 12 0 2499
% 107.07/107.31 13 0 1
% 107.07/107.31 14 2500 0
% 107.07/107.31 tot: 2500 2500 (50.0% true)
% 107.07/107.31
% 107.07/107.31
% 107.07/107.31 Model 11 [ 1 1 714 ] (0.01 seconds, 250000 Inserts)
% 107.07/107.31
% 107.07/107.31 That finishes the proof of the theorem.
% 107.07/107.31
% 107.07/107.31 Process 17085 finished Mon Jul 4 16:26:03 2022
%------------------------------------------------------------------------------