TSTP Solution File: SWB025+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:41 EDT 2022
% Result : Theorem 2.12s 2.30s
% Output : Refutation 2.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWB025+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n021.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 : Wed Jun 1 08:23:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.39 ----- Otter 3.2, August 2001 -----
% 0.19/0.39 The process was started by sandbox2 on n021.cluster.edu,
% 0.19/0.39 Wed Jun 1 08:23:30 2022
% 0.19/0.39 The command was "./sos". The process ID is 21685.
% 0.19/0.39
% 0.19/0.39 set(prolog_style_variables).
% 0.19/0.39 set(auto).
% 0.19/0.39 dependent: set(auto1).
% 0.19/0.39 dependent: set(process_input).
% 0.19/0.39 dependent: clear(print_kept).
% 0.19/0.39 dependent: clear(print_new_demod).
% 0.19/0.39 dependent: clear(print_back_demod).
% 0.19/0.39 dependent: clear(print_back_sub).
% 0.19/0.39 dependent: set(control_memory).
% 0.19/0.39 dependent: assign(max_mem, 12000).
% 0.19/0.39 dependent: assign(pick_given_ratio, 4).
% 0.19/0.39 dependent: assign(stats_level, 1).
% 0.19/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.39 dependent: assign(sos_limit, 5000).
% 0.19/0.39 dependent: assign(max_weight, 60).
% 0.19/0.39 clear(print_given).
% 0.19/0.39
% 0.19/0.39 formula_list(usable).
% 0.19/0.39
% 0.19/0.39 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=9.
% 0.19/0.39
% 0.19/0.39 This is a non-Horn set without equality. The strategy
% 0.19/0.39 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.39 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.39
% 0.19/0.39 dependent: set(hyper_res).
% 0.19/0.39 dependent: set(factor).
% 0.19/0.39 dependent: set(unit_deletion).
% 0.19/0.39
% 0.19/0.39 ------------> process usable:
% 0.19/0.39
% 0.19/0.39 ------------> process sos:
% 0.19/0.39
% 0.19/0.39 ======= end of input processing =======
% 0.19/0.48
% 0.19/0.48 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 -------------- Softie stats --------------
% 0.19/0.48
% 0.19/0.48 UPDATE_STOP: 300
% 0.19/0.48 SFINDER_TIME_LIMIT: 2
% 0.19/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.48 number of clauses in intial UL: 130
% 0.19/0.48 number of clauses initially in problem: 145
% 0.19/0.48 percentage of clauses intially in UL: 89
% 0.19/0.48 percentage of distinct symbols occuring in initial UL: 70
% 0.19/0.48 percent of all initial clauses that are short: 100
% 0.19/0.48 absolute distinct symbol count: 24
% 0.19/0.48 distinct predicate count: 2
% 0.19/0.48 distinct function count: 5
% 0.19/0.48 distinct constant count: 17
% 0.19/0.48
% 0.19/0.48 ---------- no more Softie stats ----------
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48
% 0.19/0.48 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.48
% 0.19/0.48 Stopped by limit on number of solutions
% 0.19/0.48
% 0.19/0.48 =========== start of search ===========
% 2.12/2.30
% 2.12/2.30 -------- PROOF --------
% 2.12/2.30 % SZS status Theorem
% 2.12/2.30 % SZS output start Refutation
% 2.12/2.30
% 2.12/2.30 Model 3 (0.00 seconds, 0 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Model 4 (0.00 seconds, 0 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Model 5 (0.00 seconds, 0 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Model 6 (0.00 seconds, 0 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 7 [ 1 1 889 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Model 8 (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on number of solutions
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 9 [ 1 1 1113 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 10 [ 1 2 1187 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 11 [ 2 1 2264 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 12 [ 1 1 3837 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 13 [ 1 1 2392 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 14 [ 2 5 54913 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 15 [ 1 2 5686 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 16 [ 4 2 4676 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 17 [ 2 2 2764 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 18 [ 2 2 9005 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 19 [ 2 2 2024 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 Stopped by limit on insertions
% 2.12/2.30
% 2.12/2.30 Model 20 [ 2 2 4996 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 -----> EMPTY CLAUSE at 1.91 sec ----> 181 [hyper,179,14,180] {-} $F.
% 2.12/2.30
% 2.12/2.30 Length of proof is 3. Level of proof is 2.
% 2.12/2.30
% 2.12/2.30 ---------------- PROOF ----------------
% 2.12/2.30 % SZS status Theorem
% 2.12/2.30 % SZS output start Refutation
% 2.12/2.30
% 2.12/2.30 4 [] {+} -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).
% 2.12/2.30 11 [] {+} -iext(uri_owl_inverseOf,A,B)|iext(A,C,D)| -iext(B,D,C).
% 2.12/2.30 14 [] {+} -iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly)| -iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice).
% 2.12/2.30 131 [] {+} iext(uri_owl_propertyChainAxiom,uri_ex_hasUncle,$c5).
% 2.12/2.30 132 [] {+} iext(uri_rdf_first,$c5,uri_ex_hasCousin).
% 2.12/2.30 133 [] {+} iext(uri_rdf_rest,$c5,$c4).
% 2.12/2.30 134 [] {+} iext(uri_rdf_first,$c4,uri_ex_hasFather).
% 2.12/2.30 135 [] {+} iext(uri_rdf_rest,$c4,uri_rdf_nil).
% 2.12/2.30 136 [] {+} iext(uri_owl_propertyChainAxiom,uri_ex_hasCousin,$c3).
% 2.12/2.30 137 [] {+} iext(uri_rdf_first,$c3,uri_ex_hasUncle).
% 2.12/2.30 138 [] {+} iext(uri_rdf_rest,$c3,$c2).
% 2.12/2.30 139 [] {+} iext(uri_rdf_first,$c2,$c1).
% 2.12/2.30 140 [] {+} iext(uri_rdf_rest,$c2,uri_rdf_nil).
% 2.12/2.30 141 [] {+} iext(uri_owl_inverseOf,$c1,uri_ex_hasFather).
% 2.12/2.30 142 [] {+} iext(uri_ex_hasFather,uri_ex_alice,uri_ex_dave).
% 2.12/2.30 143 [] {+} iext(uri_ex_hasCousin,uri_ex_alice,uri_ex_bob).
% 2.12/2.30 144 [] {+} iext(uri_ex_hasFather,uri_ex_bob,uri_ex_charly).
% 2.12/2.30 145 [] {+} iext(uri_ex_hasUncle,uri_ex_bob,uri_ex_dave).
% 2.12/2.30 162 [hyper,141,11,142] {+} iext($c1,uri_ex_dave,uri_ex_alice).
% 2.12/2.30 179 [hyper,144,4,132,133,134,135,131,143] {+} iext(uri_ex_hasUncle,uri_ex_alice,uri_ex_charly).
% 2.12/2.30 180 [hyper,162,4,137,138,139,140,136,145] {+} iext(uri_ex_hasCousin,uri_ex_bob,uri_ex_alice).
% 2.12/2.30 181 [hyper,179,14,180] {-} $F.
% 2.12/2.30
% 2.12/2.30 % SZS output end Refutation
% 2.12/2.30 ------------ end of proof -------------
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Search stopped by max_proofs option.
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Search stopped by max_proofs option.
% 2.12/2.30
% 2.12/2.30 ============ end of search ============
% 2.12/2.30
% 2.12/2.30 ----------- soft-scott stats ----------
% 2.12/2.30
% 2.12/2.30 true clauses given 5 (20.8%)
% 2.12/2.30 false clauses given 19
% 2.12/2.30
% 2.12/2.30 FALSE TRUE
% 2.12/2.30 18 0 12
% 2.12/2.30 20 0 14
% 2.12/2.30 tot: 0 26 (100.0% true)
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Model 20 [ 2 2 4996 ] (0.00 seconds, 250000 Inserts)
% 2.12/2.30
% 2.12/2.30 That finishes the proof of the theorem.
% 2.12/2.30
% 2.12/2.30 Process 21685 finished Wed Jun 1 08:23:32 2022
%------------------------------------------------------------------------------