TSTP Solution File: SWB029+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:43 EDT 2022
% Result : Theorem 1.01s 1.22s
% Output : Refutation 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% 0.02/0.11 % Command : sos-script %s
% 0.12/0.33 % Computer : n026.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 : Wed Jun 1 05:24:26 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 n026.cluster.edu,
% 0.12/0.35 Wed Jun 1 05:24:26 2022
% 0.12/0.35 The command was "./sos". The process ID is 2933.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 0.12/0.35
% 0.12/0.35 This is a non-Horn set without equality. The strategy
% 0.12/0.35 will be ordered hyper_res, ur_res, unit deletion, and
% 0.12/0.35 factoring, with satellites in sos and nuclei in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 34 back subsumes 31.
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.39
% 0.18/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.39
% 0.18/0.39 Stopped by limit on number of solutions
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 -------------- Softie stats --------------
% 0.18/0.39
% 0.18/0.39 UPDATE_STOP: 300
% 0.18/0.39 SFINDER_TIME_LIMIT: 2
% 0.18/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.39 number of clauses in intial UL: 50
% 0.18/0.39 number of clauses initially in problem: 59
% 0.18/0.39 percentage of clauses intially in UL: 84
% 0.18/0.39 percentage of distinct symbols occuring in initial UL: 66
% 0.18/0.39 percent of all initial clauses that are short: 100
% 0.18/0.39 absolute distinct symbol count: 18
% 0.18/0.39 distinct predicate count: 3
% 0.18/0.39 distinct function count: 1
% 0.18/0.39 distinct constant count: 14
% 0.18/0.39
% 0.18/0.39 ---------- no more Softie stats ----------
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39
% 0.18/0.39 =========== start of search ===========
% 1.01/1.22
% 1.01/1.22 -------- PROOF --------
% 1.01/1.22 % SZS status Theorem
% 1.01/1.22 % SZS output start Refutation
% 1.01/1.22
% 1.01/1.22 Model 2 (0.00 seconds, 0 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on number of solutions
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 3 (0.00 seconds, 0 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on number of solutions
% 1.01/1.22
% 1.01/1.22 Model 4 (0.00 seconds, 0 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on number of solutions
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 5 [ 3 0 688 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Model 6 (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on number of solutions
% 1.01/1.22
% 1.01/1.22 Model 7 (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on number of solutions
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 8 [ 1 0 851 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 9 [ 5 1 29444 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 10 [ 6 1 491 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 11 [ 1 1 447 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 12 [ 1 1 444 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 Stopped by limit on insertions
% 1.01/1.22
% 1.01/1.22 Model 13 [ 2 0 639 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 -----> EMPTY CLAUSE at 0.85 sec ----> 74 [hyper,60,5,64,65] {-} $F.
% 1.01/1.22
% 1.01/1.22 Length of proof is 3. Level of proof is 2.
% 1.01/1.22
% 1.01/1.22 ---------------- PROOF ----------------
% 1.01/1.22 % SZS status Theorem
% 1.01/1.22 % SZS output start Refutation
% 1.01/1.22
% 1.01/1.22 1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 1.01/1.22 5 [] {+} -iext(uri_owl_complementOf,A,B)| -icext(A,C)| -icext(B,C).
% 1.01/1.22 10 [] {+} -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_intersectionOf,E,A)| -icext(E,F)|icext(B,F).
% 1.01/1.22 11 [] {+} -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_intersectionOf,E,A)| -icext(E,F)|icext(D,F).
% 1.01/1.22 54 [] {+} iext(uri_rdf_type,uri_ex_w,$c4).
% 1.01/1.22 55 [] {+} iext(uri_owl_intersectionOf,$c4,$c2).
% 1.01/1.22 56 [] {+} iext(uri_rdf_first,$c2,uri_ex_A).
% 1.01/1.22 57 [] {+} iext(uri_rdf_rest,$c2,$c1).
% 1.01/1.22 58 [] {+} iext(uri_rdf_first,$c1,$c3).
% 1.01/1.22 59 [] {+} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 1.01/1.22 60 [] {+} iext(uri_owl_complementOf,$c3,uri_ex_A).
% 1.01/1.22 62 [hyper,54,1] {+} icext($c4,uri_ex_w).
% 1.01/1.22 64 [hyper,59,11,56,57,58,55,62] {+} icext($c3,uri_ex_w).
% 1.01/1.22 65 [hyper,59,10,56,57,58,55,62] {+} icext(uri_ex_A,uri_ex_w).
% 1.01/1.22 74 [hyper,60,5,64,65] {-} $F.
% 1.01/1.22
% 1.01/1.22 % SZS output end Refutation
% 1.01/1.22 ------------ end of proof -------------
% 1.01/1.22
% 1.01/1.22
% 1.01/1.22 Search stopped by max_proofs option.
% 1.01/1.22
% 1.01/1.22
% 1.01/1.22 Search stopped by max_proofs option.
% 1.01/1.22
% 1.01/1.22 ============ end of search ============
% 1.01/1.22
% 1.01/1.22 ----------- soft-scott stats ----------
% 1.01/1.22
% 1.01/1.22 true clauses given 3 (18.8%)
% 1.01/1.22 false clauses given 13
% 1.01/1.22
% 1.01/1.22 FALSE TRUE
% 1.01/1.22 2 0 1
% 1.01/1.22 4 1 1
% 1.01/1.22 12 0 2
% 1.01/1.22 tot: 1 4 (80.0% true)
% 1.01/1.22
% 1.01/1.22
% 1.01/1.22 Model 13 [ 2 0 639 ] (0.00 seconds, 250000 Inserts)
% 1.01/1.22
% 1.01/1.22 That finishes the proof of the theorem.
% 1.01/1.22
% 1.01/1.22 Process 2933 finished Wed Jun 1 05:24:27 2022
%------------------------------------------------------------------------------