TSTP Solution File: LCL186-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL186-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:27 EDT 2022
% Result : Unsatisfiable 4.67s 4.89s
% Output : Refutation 4.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL186-3 : TPTP v8.1.0. Released v2.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 11:18:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.35 Sat Jul 2 11:18:52 2022
% 0.12/0.35 The command was "./sos". The process ID is 1240.
% 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 ===========
% 2.87/3.13
% 2.87/3.13
% 2.87/3.13 Changing weight limit from 60 to 36.
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 3 [ 12 0 132 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Model 4 (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on number of solutions
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 5 [ 1 1 11029 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 6 [ 1 1 10149 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 7 [ 1 1 9651 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 8 [ 24 9 95273 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 9 [ 1 3 27471 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 10 [ 1 2 15508 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 11 [ 1 0 84 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Stopped by limit on insertions
% 2.87/3.13
% 2.87/3.13 Model 12 [ 1 1 4701 ] (0.00 seconds, 250000 Inserts)
% 2.87/3.13
% 2.87/3.13 Resetting weight limit to 36 after 225 givens.
% 2.87/3.13
% 3.48/3.69
% 3.48/3.69
% 3.48/3.69 Changing weight limit from 36 to 32.
% 3.48/3.69
% 3.48/3.69 Resetting weight limit to 32 after 300 givens.
% 3.48/3.69
% 3.48/3.72
% 3.48/3.72
% 3.48/3.72 Changing weight limit from 32 to 28.
% 3.48/3.72
% 3.48/3.72 Resetting weight limit to 28 after 305 givens.
% 3.48/3.72
% 3.57/3.76
% 3.57/3.76
% 3.57/3.76 Changing weight limit from 28 to 26.
% 3.57/3.76
% 3.57/3.76 Resetting weight limit to 26 after 310 givens.
% 3.57/3.76
% 3.70/3.88
% 3.70/3.88
% 3.70/3.88 Changing weight limit from 26 to 22.
% 3.70/3.88
% 3.70/3.88 Resetting weight limit to 22 after 315 givens.
% 3.70/3.88
% 3.70/3.92
% 3.70/3.92
% 3.70/3.92 Changing weight limit from 22 to 21.
% 3.70/3.92
% 3.70/3.92 Resetting weight limit to 21 after 320 givens.
% 3.70/3.92
% 3.78/3.98
% 3.78/3.98
% 3.78/3.98 Changing weight limit from 21 to 20.
% 3.78/3.98
% 3.78/3.98 Resetting weight limit to 20 after 325 givens.
% 3.78/3.98
% 3.91/4.11
% 3.91/4.11
% 3.91/4.11 Changing weight limit from 20 to 19.
% 3.91/4.11
% 3.91/4.11 Resetting weight limit to 19 after 335 givens.
% 3.91/4.11
% 4.16/4.36
% 4.16/4.36
% 4.16/4.36 Changing weight limit from 19 to 18.
% 4.16/4.36
% 4.16/4.36 Resetting weight limit to 18 after 380 givens.
% 4.16/4.36
% 4.67/4.89
% 4.67/4.89 -------- PROOF --------
% 4.67/4.89 % SZS status Unsatisfiable
% 4.67/4.89 % SZS output start Refutation
% 4.67/4.89
% 4.67/4.89 Stopped by limit on insertions
% 4.67/4.89
% 4.67/4.89 Model 13 [ 4 1 2841 ] (0.00 seconds, 250000 Inserts)
% 4.67/4.89
% 4.67/4.89 ----> UNIT CONFLICT at 4.50 sec ----> 11849 [binary,11848.1,3.1] {-} $F.
% 4.67/4.89
% 4.67/4.89 Length of proof is 20. Level of proof is 11.
% 4.67/4.89
% 4.67/4.89 ---------------- PROOF ----------------
% 4.67/4.89 % SZS status Unsatisfiable
% 4.67/4.89 % SZS output start Refutation
% 4.67/4.89
% 4.67/4.89 1 [] {+} theorem(A)| -axiom(A).
% 4.67/4.89 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 4.67/4.89 3 [] {+} -theorem(implies(not(p),implies(p,q))).
% 4.67/4.89 4 [] {+} axiom(implies(or(A,A),A)).
% 4.67/4.89 5 [] {-} axiom(implies(A,or(B,A))).
% 4.67/4.89 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 4.67/4.89 7 [] {-} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 4.67/4.89 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 4.67/4.89 9 [] {-} implies(A,B)=or(not(A),B).
% 4.67/4.89 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 4.67/4.89 13 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 4.67/4.89 14 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 4.67/4.89 16 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 4.67/4.89 17 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 4.67/4.89 19 [para_from,10.1.1,7.1.1.2.2,demod,11] {-} axiom(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 4.67/4.89 26 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 4.67/4.89 27 [para_into,16.1.1.2,10.1.1] {-} theorem(implies(or(A,not(B)),implies(B,A))).
% 4.67/4.89 31 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 4.67/4.89 54 [hyper,19,1] {-} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 4.67/4.89 60 [hyper,54,2,14] {+} theorem(or(A,implies(B,B))).
% 4.67/4.89 62 [para_into,54.1.1.1.2,10.1.1,demod,11] {+} theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C)))).
% 4.67/4.89 75 [hyper,60,2,13] {+} theorem(implies(A,A)).
% 4.67/4.89 237 [hyper,26,2,75] {+} theorem(or(A,not(A))).
% 4.67/4.89 266 [hyper,237,2,14] {+} theorem(or(A,or(B,not(B)))).
% 4.67/4.89 331 [hyper,31,2,27] {-} theorem(implies(or(A,or(B,not(C))),or(A,implies(C,B)))).
% 4.67/4.89 496 [hyper,266,2,17] {+} theorem(or(A,or(B,not(A)))).
% 4.67/4.89 11749 [hyper,331,2,496] {+} theorem(or(A,implies(A,B))).
% 4.67/4.89 11816 [para_into,11749.1.1,10.1.1] {+} theorem(implies(A,implies(not(A),B))).
% 4.67/4.89 11848 [hyper,11816,2,62] {-} theorem(implies(not(A),implies(A,B))).
% 4.67/4.89 11849 [binary,11848.1,3.1] {-} $F.
% 4.67/4.89
% 4.67/4.89 % SZS output end Refutation
% 4.67/4.89 ------------ end of proof -------------
% 4.67/4.89
% 4.67/4.89
% 4.67/4.89 Search stopped by max_proofs option.
% 4.67/4.89
% 4.67/4.89
% 4.67/4.89 Search stopped by max_proofs option.
% 4.67/4.89
% 4.67/4.89 ============ end of search ============
% 4.67/4.89
% 4.67/4.89 ----------- soft-scott stats ----------
% 4.67/4.89
% 4.67/4.89 true clauses given 124 (31.8%)
% 4.67/4.89 false clauses given 266
% 4.67/4.89
% 4.67/4.89 FALSE TRUE
% 4.67/4.89 6 1 1
% 4.67/4.89 8 3 0
% 4.67/4.89 9 6 50
% 4.67/4.89 10 63 134
% 4.67/4.89 11 30 117
% 4.67/4.89 12 181 372
% 4.67/4.89 13 158 267
% 4.67/4.89 14 480 460
% 4.67/4.89 15 403 512
% 4.67/4.89 16 800 167
% 4.67/4.89 17 306 145
% 4.67/4.89 18 69 144
% 4.67/4.89 tot: 2500 2369 (48.7% true)
% 4.67/4.89
% 4.67/4.89
% 4.67/4.89 Model 13 [ 4 1 2841 ] (0.00 seconds, 250000 Inserts)
% 4.67/4.89
% 4.67/4.89 That finishes the proof of the theorem.
% 4.67/4.89
% 4.67/4.89 Process 1240 finished Sat Jul 2 11:18:57 2022
%------------------------------------------------------------------------------