TSTP Solution File: SWB014+2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:36 EDT 2022
% Result : Theorem 0.69s 0.93s
% Output : Refutation 0.69s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWB014+2 : TPTP v8.1.0. Released v5.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n022.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:42:07 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n022.cluster.edu,
% 0.19/0.36 Wed Jun 1 08:42:07 2022
% 0.19/0.36 The command was "./sos". The process ID is 30668.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=11.
% 0.19/0.36
% 0.19/0.36 This is a non-Horn set without equality. The strategy
% 0.19/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.19/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36 33 back subsumes 30.
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.42
% 0.19/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 -------------- Softie stats --------------
% 0.19/0.42
% 0.19/0.42 UPDATE_STOP: 300
% 0.19/0.42 SFINDER_TIME_LIMIT: 2
% 0.19/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42 number of clauses in intial UL: 44
% 0.19/0.42 number of clauses initially in problem: 52
% 0.19/0.42 percentage of clauses intially in UL: 84
% 0.19/0.42 percentage of distinct symbols occuring in initial UL: 68
% 0.19/0.42 percent of all initial clauses that are short: 100
% 0.19/0.42 absolute distinct symbol count: 16
% 0.19/0.42 distinct predicate count: 3
% 0.19/0.42 distinct function count: 1
% 0.19/0.42 distinct constant count: 12
% 0.19/0.42
% 0.19/0.42 ---------- no more Softie stats ----------
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.42
% 0.19/0.42 Stopped by limit on number of solutions
% 0.19/0.42
% 0.19/0.42 =========== start of search ===========
% 0.69/0.93
% 0.69/0.93 -------- PROOF --------
% 0.69/0.93 % SZS status Theorem
% 0.69/0.93 % SZS output start Refutation
% 0.69/0.93
% 0.69/0.93 Model 3 (0.00 seconds, 0 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on number of solutions
% 0.69/0.93
% 0.69/0.93 Model 4 (0.00 seconds, 0 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on number of solutions
% 0.69/0.93
% 0.69/0.93 Model 5 (0.00 seconds, 0 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on number of solutions
% 0.69/0.93
% 0.69/0.93 Stopped by limit on insertions
% 0.69/0.93
% 0.69/0.93 Model 6 [ 1 0 445 ] (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 Model 7 (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on number of solutions
% 0.69/0.93
% 0.69/0.93 Model 8 (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on number of solutions
% 0.69/0.93
% 0.69/0.93 Stopped by limit on insertions
% 0.69/0.93
% 0.69/0.93 Stopped by limit on insertions
% 0.69/0.93
% 0.69/0.93 Model 9 [ 1 1 320 ] (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 Stopped by limit on insertions
% 0.69/0.93
% 0.69/0.93 Model 10 [ 3 0 511 ] (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 -----> EMPTY CLAUSE at 0.54 sec ----> 68 [hyper,66,12,47] {-} $F.
% 0.69/0.93
% 0.69/0.93 Length of proof is 5. Level of proof is 5.
% 0.69/0.93
% 0.69/0.93 ---------------- PROOF ----------------
% 0.69/0.93 % SZS status Theorem
% 0.69/0.93 % SZS output start Refutation
% 0.69/0.93
% 0.69/0.93 1 [] {+} -iext(uri_rdf_type,A,B)|icext(B,A).
% 0.69/0.93 2 [] {+} iext(uri_rdf_type,A,B)| -icext(B,A).
% 0.69/0.93 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_unionOf,E,A)| -icext(E,F)|icext(B,F)|icext(D,F).
% 0.69/0.93 12 [] {+} -iext(uri_rdf_type,uri_ex_harry,A)| -iext(uri_rdf_type,A,uri_ex_Species).
% 0.69/0.93 46 [] {+} iext(uri_rdf_type,uri_ex_Eagle,uri_ex_Species).
% 0.69/0.93 47 [] {+} iext(uri_rdf_type,uri_ex_Falcon,uri_ex_Species).
% 0.69/0.93 48 [] {+} iext(uri_rdf_type,uri_ex_harry,$c3).
% 0.69/0.93 49 [] {+} iext(uri_owl_unionOf,$c3,$c2).
% 0.69/0.93 50 [] {+} iext(uri_rdf_first,$c2,uri_ex_Eagle).
% 0.69/0.93 51 [] {+} iext(uri_rdf_rest,$c2,$c1).
% 0.69/0.93 52 [] {+} iext(uri_rdf_first,$c1,uri_ex_Falcon).
% 0.69/0.93 53 [] {-} iext(uri_rdf_rest,$c1,uri_rdf_nil).
% 0.69/0.93 56 [hyper,48,1] {+} icext($c3,uri_ex_harry).
% 0.69/0.93 57 [hyper,53,6,50,51,52,49,56] {-} icext(uri_ex_Eagle,uri_ex_harry)|icext(uri_ex_Falcon,uri_ex_harry).
% 0.69/0.93 63 [hyper,57,2] {-} icext(uri_ex_Falcon,uri_ex_harry)|iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle).
% 0.69/0.93 65 [hyper,63,2] {-} iext(uri_rdf_type,uri_ex_harry,uri_ex_Eagle)|iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon).
% 0.69/0.93 66 [hyper,65,12,46] {+} iext(uri_rdf_type,uri_ex_harry,uri_ex_Falcon).
% 0.69/0.93 68 [hyper,66,12,47] {-} $F.
% 0.69/0.93
% 0.69/0.93 % SZS output end Refutation
% 0.69/0.93 ------------ end of proof -------------
% 0.69/0.93
% 0.69/0.93
% 0.69/0.93 Search stopped by max_proofs option.
% 0.69/0.93
% 0.69/0.93
% 0.69/0.93 Search stopped by max_proofs option.
% 0.69/0.93
% 0.69/0.93 ============ end of search ============
% 0.69/0.93
% 0.69/0.93 ----------- soft-scott stats ----------
% 0.69/0.93
% 0.69/0.93 true clauses given 5 (26.3%)
% 0.69/0.93 false clauses given 14
% 0.69/0.93
% 0.69/0.93 FALSE TRUE
% 0.69/0.93 4 1 0
% 0.69/0.93 20 0 2
% 0.69/0.93 tot: 1 2 (66.7% true)
% 0.69/0.93
% 0.69/0.93
% 0.69/0.93 Model 10 [ 3 0 511 ] (0.00 seconds, 250000 Inserts)
% 0.69/0.93
% 0.69/0.93 That finishes the proof of the theorem.
% 0.69/0.93
% 0.69/0.93 Process 30668 finished Wed Jun 1 08:42:07 2022
%------------------------------------------------------------------------------