TSTP Solution File: SWB027+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB027+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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 : Tue Jul 19 19:20:42 EDT 2022
% Result : Theorem 0.53s 0.75s
% Output : Refutation 0.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWB027+2 : TPTP v8.1.0. Released v5.2.0.
% 0.13/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n018.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 : Wed Jun 1 13:45:44 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.40 ----- Otter 3.2, August 2001 -----
% 0.13/0.40 The process was started by sandbox2 on n018.cluster.edu,
% 0.13/0.40 Wed Jun 1 13:45:44 2022
% 0.13/0.40 The command was "./sos". The process ID is 17907.
% 0.13/0.40
% 0.13/0.40 set(prolog_style_variables).
% 0.13/0.40 set(auto).
% 0.13/0.40 dependent: set(auto1).
% 0.13/0.40 dependent: set(process_input).
% 0.13/0.40 dependent: clear(print_kept).
% 0.13/0.40 dependent: clear(print_new_demod).
% 0.13/0.40 dependent: clear(print_back_demod).
% 0.13/0.40 dependent: clear(print_back_sub).
% 0.13/0.40 dependent: set(control_memory).
% 0.13/0.40 dependent: assign(max_mem, 12000).
% 0.13/0.40 dependent: assign(pick_given_ratio, 4).
% 0.13/0.40 dependent: assign(stats_level, 1).
% 0.13/0.40 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.40 dependent: assign(sos_limit, 5000).
% 0.13/0.40 dependent: assign(max_weight, 60).
% 0.13/0.40 clear(print_given).
% 0.13/0.40
% 0.13/0.40 formula_list(usable).
% 0.13/0.40
% 0.13/0.40 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.13/0.40
% 0.13/0.40 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.40 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.40 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.40 clauses in usable.
% 0.13/0.40
% 0.13/0.40 dependent: set(knuth_bendix).
% 0.13/0.40 dependent: set(para_from).
% 0.13/0.40 dependent: set(para_into).
% 0.13/0.40 dependent: clear(para_from_right).
% 0.13/0.40 dependent: clear(para_into_right).
% 0.13/0.40 dependent: set(para_from_vars).
% 0.13/0.40 dependent: set(eq_units_both_ways).
% 0.13/0.40 dependent: set(dynamic_demod_all).
% 0.13/0.40 dependent: set(dynamic_demod).
% 0.13/0.40 dependent: set(order_eq).
% 0.13/0.40 dependent: set(back_demod).
% 0.13/0.40 dependent: set(lrpo).
% 0.13/0.40 dependent: set(hyper_res).
% 0.13/0.40 dependent: set(unit_deletion).
% 0.13/0.40 dependent: set(factor).
% 0.13/0.40
% 0.13/0.40 ------------> process usable:
% 0.13/0.40
% 0.13/0.40 ------------> process sos:
% 0.13/0.40 Following clause subsumed by 147 during input processing: 0 [copy,147,flip.1] {-} A=A.
% 0.13/0.40 147 back subsumes 56.
% 0.13/0.40
% 0.13/0.40 ======= end of input processing =======
% 0.46/0.70
% 0.46/0.70 Stopped by limit on insertions
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 Failed to model usable list: disabling FINDER
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 -------------- Softie stats --------------
% 0.46/0.70
% 0.46/0.70 UPDATE_STOP: 300
% 0.46/0.70 SFINDER_TIME_LIMIT: 2
% 0.46/0.70 SHORT_CLAUSE_CUTOFF: 4
% 0.46/0.70 number of clauses in intial UL: 139
% 0.46/0.70 number of clauses initially in problem: 146
% 0.46/0.70 percentage of clauses intially in UL: 95
% 0.46/0.70 percentage of distinct symbols occuring in initial UL: 87
% 0.46/0.70 percent of all initial clauses that are short: 100
% 0.46/0.70 absolute distinct symbol count: 24
% 0.46/0.70 distinct predicate count: 4
% 0.46/0.70 distinct function count: 8
% 0.46/0.70 distinct constant count: 12
% 0.46/0.70
% 0.46/0.70 ---------- no more Softie stats ----------
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70
% 0.46/0.70 =========== start of search ===========
% 0.53/0.75
% 0.53/0.75 -------- PROOF --------
% 0.53/0.75 % SZS status Theorem
% 0.53/0.75 % SZS output start Refutation
% 0.53/0.75
% 0.53/0.75 ----> UNIT CONFLICT at 0.36 sec ----> 607 [binary,606.1,23.1] {-} $F.
% 0.53/0.75
% 0.53/0.75 Length of proof is 10. Level of proof is 8.
% 0.53/0.75
% 0.53/0.75 ---------------- PROOF ----------------
% 0.53/0.75 % SZS status Theorem
% 0.53/0.75 % SZS output start Refutation
% 0.53/0.75
% 0.53/0.75 2 [] {+} iext(uri_rdf_type,A,B)| -icext(B,A).
% 0.53/0.75 3 [] {+} -iext(uri_owl_sameAs,A,B)|A=B.
% 0.53/0.75 6 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_propertyChainAxiom,E,A)|ip(B).
% 0.53/0.75 8 [] {+} -iext(uri_rdf_first,A,B)| -iext(uri_rdf_rest,A,C)| -iext(uri_rdf_first,C,D)| -iext(uri_rdf_rest,C,uri_rdf_nil)| -iext(uri_owl_propertyChainAxiom,E,A)| -iext(B,F,G)| -iext(D,G,H)|iext(E,F,H).
% 0.53/0.75 14 [] {+} icext(uri_owl_InverseFunctionalProperty,A)| -ip(A)|iext(A,$f6(A),$f4(A)).
% 0.53/0.75 15 [] {+} icext(uri_owl_InverseFunctionalProperty,A)| -ip(A)|iext(A,$f5(A),$f4(A)).
% 0.53/0.75 16 [] {+} icext(uri_owl_InverseFunctionalProperty,A)| -ip(A)|$f6(A)!=$f5(A).
% 0.53/0.75 20 [] {+} -iext(uri_owl_inverseOf,A,B)|iext(A,C,D)| -iext(B,D,C).
% 0.53/0.75 23 [] {+} -iext(uri_rdf_type,uri_ex_p,uri_owl_InverseFunctionalProperty).
% 0.53/0.75 141 [] {-} iext(uri_owl_propertyChainAxiom,uri_owl_sameAs,$c3).
% 0.53/0.75 142 [] {-} iext(uri_rdf_first,$c3,uri_ex_p).
% 0.53/0.75 143 [] {-} iext(uri_rdf_rest,$c3,$c2).
% 0.53/0.75 144 [] {-} iext(uri_rdf_first,$c2,$c1).
% 0.53/0.75 145 [] {-} iext(uri_rdf_rest,$c2,uri_rdf_nil).
% 0.53/0.75 146 [] {-} iext(uri_owl_inverseOf,$c1,uri_ex_p).
% 0.53/0.75 174 [hyper,145,6,142,143,144,141] {-} ip(uri_ex_p).
% 0.53/0.75 193 [hyper,174,15] {-} icext(uri_owl_InverseFunctionalProperty,uri_ex_p)|iext(uri_ex_p,$f5(uri_ex_p),$f4(uri_ex_p)).
% 0.53/0.75 194 [hyper,174,14] {-} icext(uri_owl_InverseFunctionalProperty,uri_ex_p)|iext(uri_ex_p,$f6(uri_ex_p),$f4(uri_ex_p)).
% 0.53/0.75 522 [hyper,193,2,unit_del,23] {-} iext(uri_ex_p,$f5(uri_ex_p),$f4(uri_ex_p)).
% 0.53/0.75 523 [hyper,522,20,146] {-} iext($c1,$f4(uri_ex_p),$f5(uri_ex_p)).
% 0.53/0.75 544 [hyper,194,2,unit_del,23] {-} iext(uri_ex_p,$f6(uri_ex_p),$f4(uri_ex_p)).
% 0.53/0.75 565 [hyper,544,8,142,143,144,145,141,523] {-} iext(uri_owl_sameAs,$f6(uri_ex_p),$f5(uri_ex_p)).
% 0.53/0.75 587 [hyper,565,3] {-} $f6(uri_ex_p)=$f5(uri_ex_p).
% 0.53/0.75 589 [hyper,587,16,174] {-} icext(uri_owl_InverseFunctionalProperty,uri_ex_p).
% 0.53/0.75 606 [hyper,589,2] {-} iext(uri_rdf_type,uri_ex_p,uri_owl_InverseFunctionalProperty).
% 0.53/0.75 607 [binary,606.1,23.1] {-} $F.
% 0.53/0.75
% 0.53/0.75 % SZS output end Refutation
% 0.53/0.75 ------------ end of proof -------------
% 0.53/0.75
% 0.53/0.75
% 0.53/0.75 Search stopped by max_proofs option.
% 0.53/0.75
% 0.53/0.75
% 0.53/0.75 Search stopped by max_proofs option.
% 0.53/0.75
% 0.53/0.75 ============ end of search ============
% 0.53/0.75
% 0.53/0.75 That finishes the proof of the theorem.
% 0.53/0.75
% 0.53/0.75 Process 17907 finished Wed Jun 1 13:45:44 2022
%------------------------------------------------------------------------------