TSTP Solution File: LCL203-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL203-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:38 EDT 2022
% Result : Unsatisfiable 0.92s 1.13s
% Output : Refutation 0.92s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LCL203-3 : TPTP v8.1.0. Released v2.3.0.
% 0.10/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n005.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 02:16:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.12/0.36 Mon Jul 4 02:16:22 2022
% 0.12/0.36 The command was "./sos". The process ID is 17745.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This is a Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.36 sos and nonpositive clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: clear(order_hyper).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 2
% 0.12/0.39 number of clauses initially in problem: 11
% 0.12/0.39 percentage of clauses intially in UL: 18
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 37
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 8
% 0.12/0.39 distinct predicate count: 3
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.43/0.63
% 0.43/0.63
% 0.43/0.63 Changing weight limit from 60 to 22.
% 0.43/0.63
% 0.43/0.63 Model 3 (0.00 seconds, 0 Inserts)
% 0.43/0.63
% 0.43/0.63 Stopped by limit on number of solutions
% 0.43/0.63
% 0.43/0.63 Model 4 (0.00 seconds, 0 Inserts)
% 0.43/0.63
% 0.43/0.63 Stopped by limit on number of solutions
% 0.43/0.63
% 0.43/0.63 Model 5 (0.00 seconds, 0 Inserts)
% 0.43/0.63
% 0.43/0.63 Stopped by limit on number of solutions
% 0.43/0.63
% 0.43/0.63 Resetting weight limit to 22 after 220 givens.
% 0.43/0.63
% 0.46/0.66
% 0.46/0.66
% 0.46/0.66 Changing weight limit from 22 to 18.
% 0.46/0.66
% 0.46/0.66 Resetting weight limit to 18 after 225 givens.
% 0.46/0.66
% 0.46/0.68
% 0.46/0.68
% 0.46/0.68 Changing weight limit from 18 to 16.
% 0.46/0.68
% 0.46/0.68 Resetting weight limit to 16 after 235 givens.
% 0.46/0.68
% 0.46/0.69
% 0.46/0.69
% 0.46/0.69 Changing weight limit from 16 to 15.
% 0.46/0.69
% 0.46/0.69 Resetting weight limit to 15 after 245 givens.
% 0.46/0.69
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 Changing weight limit from 15 to 14.
% 0.46/0.70
% 0.46/0.70 Resetting weight limit to 14 after 250 givens.
% 0.46/0.70
% 0.61/0.79
% 0.61/0.79
% 0.61/0.79 Changing weight limit from 14 to 13.
% 0.61/0.79
% 0.61/0.79 Resetting weight limit to 13 after 335 givens.
% 0.61/0.79
% 0.76/0.94
% 0.76/0.94
% 0.76/0.94 Changing weight limit from 13 to 12.
% 0.76/0.94
% 0.76/0.94 Resetting weight limit to 12 after 380 givens.
% 0.76/0.94
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Changing weight limit from 12 to 13.
% 0.76/1.00
% 0.76/1.00 Resetting weight limit to 13 after 465 givens.
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00
% 0.76/1.00 Changing weight limit from 13 to 12.
% 0.76/1.00
% 0.76/1.00 Resetting weight limit to 12 after 475 givens.
% 0.76/1.00
% 0.76/1.01
% 0.76/1.01
% 0.76/1.01 Changing weight limit from 12 to 13.
% 0.76/1.01
% 0.76/1.01 Resetting weight limit to 13 after 480 givens.
% 0.76/1.01
% 0.76/1.01
% 0.76/1.01
% 0.76/1.01 Changing weight limit from 13 to 12.
% 0.76/1.01
% 0.76/1.01 Resetting weight limit to 12 after 485 givens.
% 0.76/1.01
% 0.76/1.01
% 0.76/1.01
% 0.76/1.01 Changing weight limit from 12 to 13.
% 0.76/1.01
% 0.76/1.01 Resetting weight limit to 13 after 495 givens.
% 0.76/1.01
% 0.76/1.02
% 0.76/1.02
% 0.76/1.02 Changing weight limit from 13 to 12.
% 0.76/1.02
% 0.76/1.02 Resetting weight limit to 12 after 500 givens.
% 0.76/1.02
% 0.85/1.05
% 0.85/1.05
% 0.85/1.05 Changing weight limit from 12 to 13.
% 0.85/1.05
% 0.85/1.05 Resetting weight limit to 13 after 550 givens.
% 0.85/1.05
% 0.85/1.05
% 0.85/1.05
% 0.85/1.05 Changing weight limit from 13 to 12.
% 0.85/1.05
% 0.85/1.05 Resetting weight limit to 12 after 555 givens.
% 0.85/1.05
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07 Changing weight limit from 12 to 13.
% 0.85/1.07
% 0.85/1.07 Resetting weight limit to 13 after 575 givens.
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07
% 0.85/1.07 Changing weight limit from 13 to 12.
% 0.85/1.07
% 0.85/1.07 Resetting weight limit to 12 after 580 givens.
% 0.85/1.07
% 0.92/1.13
% 0.92/1.13 -------- PROOF --------
% 0.92/1.13 % SZS status Unsatisfiable
% 0.92/1.13 % SZS output start Refutation
% 0.92/1.13
% 0.92/1.13 ----> UNIT CONFLICT at 0.72 sec ----> 8228 [binary,8227.1,13.1] {+} $F.
% 0.92/1.13
% 0.92/1.13 Length of proof is 33. Level of proof is 18.
% 0.92/1.13
% 0.92/1.13 ---------------- PROOF ----------------
% 0.92/1.13 % SZS status Unsatisfiable
% 0.92/1.13 % SZS output start Refutation
% 0.92/1.13
% 0.92/1.13 1 [] {+} theorem(A)| -axiom(A).
% 0.92/1.13 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 0.92/1.13 3 [] {-} -theorem(implies(not(or(p,q)),or(not(p),not(q)))).
% 0.92/1.13 4 [] {+} axiom(implies(or(A,A),A)).
% 0.92/1.13 5 [] {+} axiom(implies(A,or(B,A))).
% 0.92/1.13 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 0.92/1.13 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.92/1.13 8 [] {+} axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 0.92/1.13 9 [] {-} implies(A,B)=or(not(A),B).
% 0.92/1.13 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 0.92/1.13 13 [back_demod,3,demod,11] {-} -theorem(implies(not(or(p,q)),implies(p,not(q)))).
% 0.92/1.13 14 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 0.92/1.13 15 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 0.92/1.13 16 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 0.92/1.13 21 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.92/1.13 27 [para_into,15.1.1.2,10.1.1] {+} theorem(implies(A,implies(B,A))).
% 0.92/1.13 28 [hyper,8,1] {+} theorem(implies(implies(A,B),implies(or(C,A),or(C,B)))).
% 0.92/1.13 36 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 0.92/1.13 37 [para_into,16.1.1.2,10.1.1] {+} theorem(implies(or(A,not(B)),implies(B,A))).
% 0.92/1.13 64 [para_into,21.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,or(B,C)),or(B,implies(A,C)))).
% 0.92/1.13 74 [hyper,36,2,15] {+} theorem(or(or(A,B),not(B))).
% 0.92/1.13 76 [para_into,36.1.1.2,10.1.1] {+} theorem(implies(implies(A,not(B)),implies(B,not(A)))).
% 0.92/1.13 80 [hyper,74,2,15] {+} theorem(or(A,or(or(B,C),not(C)))).
% 0.92/1.13 128 [hyper,80,2,21] {+} theorem(or(or(A,B),or(C,not(B)))).
% 0.92/1.13 139 [hyper,28,2,27] {+} theorem(implies(or(A,B),or(A,implies(C,B)))).
% 0.92/1.13 166 [hyper,128,2,16] {+} theorem(or(or(A,not(B)),or(C,B))).
% 0.92/1.13 196 [hyper,166,2,21] {+} theorem(or(A,or(or(B,not(C)),C))).
% 0.92/1.13 223 [hyper,196,2,14] {+} theorem(or(or(A,not(B)),B)).
% 0.92/1.13 233 [hyper,223,2,16] {+} theorem(or(A,or(B,not(A)))).
% 0.92/1.13 237 [hyper,233,2,21] {+} theorem(or(A,or(B,not(B)))).
% 0.92/1.13 248 [hyper,237,2,14] {+} theorem(or(A,not(A))).
% 0.92/1.13 255 [hyper,248,2,37] {+} theorem(implies(A,A)).
% 0.92/1.13 256 [para_into,248.1.1,10.1.1] {+} theorem(implies(A,not(not(A)))).
% 0.92/1.13 262 [hyper,256,2,28] {+} theorem(implies(or(A,B),or(A,not(not(B))))).
% 0.92/1.13 1521 [hyper,64,2,255] {+} theorem(or(A,implies(or(A,B),B))).
% 0.92/1.13 1689 [para_into,1521.1.1.2.1,10.1.1,demod,11] {+} theorem(implies(A,implies(implies(A,B),B))).
% 0.92/1.13 1900 [hyper,1689,2,15] {+} theorem(implies(implies(implies(A,or(B,A)),C),C)).
% 0.92/1.13 2444 [para_into,139.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(A,implies(C,B)))).
% 0.92/1.13 3052 [para_into,262.1.1.1,10.1.1,demod,11] {+} theorem(implies(implies(A,B),implies(A,not(not(B))))).
% 0.92/1.13 7752 [hyper,3052,2,1900] {+} theorem(implies(A,not(not(or(B,A))))).
% 0.92/1.13 7882 [hyper,7752,2,76] {+} theorem(implies(not(or(A,B)),not(B))).
% 0.92/1.13 8227 [hyper,7882,2,2444] {-} theorem(implies(not(or(A,B)),implies(C,not(B)))).
% 0.92/1.13 8228 [binary,8227.1,13.1] {+} $F.
% 0.92/1.13
% 0.92/1.13 % SZS output end Refutation
% 0.92/1.13 ------------ end of proof -------------
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Search stopped by max_proofs option.
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Search stopped by max_proofs option.
% 0.92/1.13
% 0.92/1.13 ============ end of search ============
% 0.92/1.13
% 0.92/1.13 ----------- soft-scott stats ----------
% 0.92/1.13
% 0.92/1.13 true clauses given 628 (99.2%)
% 0.92/1.13 false clauses given 5
% 0.92/1.13
% 0.92/1.13 FALSE TRUE
% 0.92/1.13 8 0 2
% 0.92/1.13 9 0 2
% 0.92/1.13 10 0 462
% 0.92/1.13 11 0 1076
% 0.92/1.13 12 0 1110
% 0.92/1.13 tot: 0 2652 (100.0% true)
% 0.92/1.13
% 0.92/1.13
% 0.92/1.13 Model 5 (0.00 seconds, 0 Inserts)
% 0.92/1.13
% 0.92/1.13 That finishes the proof of the theorem.
% 0.92/1.13
% 0.92/1.13 Process 17745 finished Mon Jul 4 02:16:23 2022
%------------------------------------------------------------------------------