TSTP Solution File: LCL189-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : LCL189-3 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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:29 EDT 2022
% Result : Unsatisfiable 0.21s 0.59s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL189-3 : TPTP v8.1.0. Released v2.3.0.
% 0.07/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n020.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 3 19:59:30 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n020.cluster.edu,
% 0.13/0.37 Sun Jul 3 19:59:30 2022
% 0.13/0.37 The command was "./sos". The process ID is 1238.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This is a Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.37 sos and nonpositive clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 2
% 0.21/0.41 number of clauses initially in problem: 11
% 0.21/0.41 percentage of clauses intially in UL: 18
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 37
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 8
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 3
% 0.21/0.41 distinct constant count: 2
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.21/0.59
% 0.21/0.59 -------- PROOF --------
% 0.21/0.59 % SZS status Unsatisfiable
% 0.21/0.59 % SZS output start Refutation
% 0.21/0.59
% 0.21/0.59 Model 3 (0.00 seconds, 0 Inserts)
% 0.21/0.59
% 0.21/0.59 Stopped by limit on number of solutions
% 0.21/0.59
% 0.21/0.59 Model 4 (0.00 seconds, 0 Inserts)
% 0.21/0.59
% 0.21/0.59 Stopped by limit on number of solutions
% 0.21/0.59
% 0.21/0.59 Model 5 (0.00 seconds, 0 Inserts)
% 0.21/0.59
% 0.21/0.59 Stopped by limit on number of solutions
% 0.21/0.59
% 0.21/0.59 ----> UNIT CONFLICT at 0.18 sec ----> 1690 [binary,1689.1,13.1] {-} $F.
% 0.21/0.59
% 0.21/0.59 Length of proof is 21. Level of proof is 14.
% 0.21/0.59
% 0.21/0.59 ---------------- PROOF ----------------
% 0.21/0.59 % SZS status Unsatisfiable
% 0.21/0.59 % SZS output start Refutation
% 0.21/0.59
% 0.21/0.59 1 [] {+} theorem(A)| -axiom(A).
% 0.21/0.59 2 [] {+} theorem(A)| -theorem(implies(B,A))| -theorem(B).
% 0.21/0.59 3 [] {-} -theorem(or(not(p),implies(implies(p,q),q))).
% 0.21/0.59 4 [] {+} axiom(implies(or(A,A),A)).
% 0.21/0.59 5 [] {+} axiom(implies(A,or(B,A))).
% 0.21/0.59 6 [] {+} axiom(implies(or(A,B),or(B,A))).
% 0.21/0.59 7 [] {+} axiom(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.21/0.59 9 [] {-} implies(A,B)=or(not(A),B).
% 0.21/0.59 11,10 [copy,9,flip.1] {+} or(not(A),B)=implies(A,B).
% 0.21/0.59 13 [back_demod,3,demod,11] {-} -theorem(implies(p,implies(implies(p,q),q))).
% 0.21/0.59 14 [hyper,4,1] {+} theorem(implies(or(A,A),A)).
% 0.21/0.59 15 [hyper,5,1] {+} theorem(implies(A,or(B,A))).
% 0.21/0.59 16 [hyper,6,1] {+} theorem(implies(or(A,B),or(B,A))).
% 0.21/0.59 21 [hyper,7,1] {+} theorem(implies(or(A,or(B,C)),or(B,or(A,C)))).
% 0.21/0.59 36 [para_into,16.1.1.1,10.1.1] {+} theorem(implies(implies(A,B),or(B,not(A)))).
% 0.21/0.59 37 [para_into,16.1.1.2,10.1.1] {+} theorem(implies(or(A,not(B)),implies(B,A))).
% 0.21/0.59 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.21/0.59 74 [hyper,36,2,15] {+} theorem(or(or(A,B),not(B))).
% 0.21/0.59 80 [hyper,74,2,15] {+} theorem(or(A,or(or(B,C),not(C)))).
% 0.21/0.59 128 [hyper,80,2,21] {+} theorem(or(or(A,B),or(C,not(B)))).
% 0.21/0.59 166 [hyper,128,2,16] {+} theorem(or(or(A,not(B)),or(C,B))).
% 0.21/0.59 196 [hyper,166,2,21] {+} theorem(or(A,or(or(B,not(C)),C))).
% 0.21/0.59 223 [hyper,196,2,14] {+} theorem(or(or(A,not(B)),B)).
% 0.21/0.59 233 [hyper,223,2,16] {+} theorem(or(A,or(B,not(A)))).
% 0.21/0.59 237 [hyper,233,2,21] {+} theorem(or(A,or(B,not(B)))).
% 0.21/0.59 248 [hyper,237,2,14] {+} theorem(or(A,not(A))).
% 0.21/0.59 255 [hyper,248,2,37] {+} theorem(implies(A,A)).
% 0.21/0.59 1521 [hyper,64,2,255] {+} theorem(or(A,implies(or(A,B),B))).
% 0.21/0.59 1689 [para_into,1521.1.1.2.1,10.1.1,demod,11] {-} theorem(implies(A,implies(implies(A,B),B))).
% 0.21/0.59 1690 [binary,1689.1,13.1] {-} $F.
% 0.21/0.59
% 0.21/0.59 % SZS output end Refutation
% 0.21/0.59 ------------ end of proof -------------
% 0.21/0.59
% 0.21/0.59
% 0.21/0.59 Search stopped by max_proofs option.
% 0.21/0.59
% 0.21/0.59
% 0.21/0.59 Search stopped by max_proofs option.
% 0.21/0.59
% 0.21/0.59 ============ end of search ============
% 0.21/0.59
% 0.21/0.59 ----------- soft-scott stats ----------
% 0.21/0.59
% 0.21/0.59 true clauses given 174 (97.2%)
% 0.21/0.59 false clauses given 5
% 0.21/0.59
% 0.21/0.59 FALSE TRUE
% 0.21/0.59 8 0 1
% 0.21/0.59 9 0 8
% 0.21/0.59 10 0 141
% 0.21/0.59 11 0 217
% 0.21/0.59 12 0 300
% 0.21/0.59 13 0 433
% 0.21/0.59 14 0 146
% 0.21/0.59 15 0 4
% 0.21/0.59 16 0 42
% 0.21/0.59 18 0 55
% 0.21/0.59 20 0 70
% 0.21/0.59 22 0 21
% 0.21/0.59 26 0 4
% 0.21/0.59 30 0 2
% 0.21/0.59 tot: 0 1444 (100.0% true)
% 0.21/0.59
% 0.21/0.59
% 0.21/0.59 Model 5 (0.00 seconds, 0 Inserts)
% 0.21/0.59
% 0.21/0.59 That finishes the proof of the theorem.
% 0.21/0.59
% 0.21/0.59 Process 1238 finished Sun Jul 3 19:59:30 2022
%------------------------------------------------------------------------------