TSTP Solution File: SWB002+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:31 EDT 2022
% Result : Theorem 0.61s 0.83s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWB002+4 : TPTP v8.1.0. Released v5.2.0.
% 0.10/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 1 12:25:45 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n029.cluster.edu,
% 0.13/0.36 Wed Jun 1 12:25:45 2022
% 0.13/0.36 The command was "./sos". The process ID is 23673.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set without equality. The strategy will
% 0.13/0.36 be hyperresolution, with satellites in sos and nuclei
% 0.13/0.36 in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 39 during input processing: 0 [] {-} iext(uri_rdf_type,uri_rdf_type,uri_rdf_Property).
% 0.13/0.36 Following clause subsumed by 77 during input processing: 0 [] {-} iext(uri_rdfs_range,uri_rdf_predicate,uri_rdfs_Resource).
% 0.13/0.36 29 back subsumes 14.
% 0.13/0.36 29 back subsumes 2.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 26
% 0.19/0.40 number of clauses initially in problem: 88
% 0.19/0.40 percentage of clauses intially in UL: 29
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 46
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 43
% 0.19/0.40 distinct predicate count: 6
% 0.19/0.40 distinct function count: 0
% 0.19/0.40 distinct constant count: 37
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.61/0.83
% 0.61/0.83 -------- PROOF --------
% 0.61/0.83 % SZS status Theorem
% 0.61/0.83 % SZS output start Refutation
% 0.61/0.83
% 0.61/0.83 Model 3 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 4 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 5 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 6 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 7 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 8 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 9 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 10 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 11 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 12 (0.00 seconds, 0 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Stopped by limit on insertions
% 0.61/0.83
% 0.61/0.83 Model 13 [ 2 0 422 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Model 14 (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Stopped by limit on insertions
% 0.61/0.83
% 0.61/0.83 Model 15 [ 5 1 2621 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on insertions
% 0.61/0.83
% 0.61/0.83 Model 16 [ 12 1 3101 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Model 17 (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Model 18 (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 Stopped by limit on number of solutions
% 0.61/0.83
% 0.61/0.83 Stopped by limit on insertions
% 0.61/0.83
% 0.61/0.83 Model 19 [ 3 1 1277 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 -----> EMPTY CLAUSE at 0.45 sec ----> 121 [hyper,89,28,90] {-} $F.
% 0.61/0.83
% 0.61/0.83 Length of proof is 0. Level of proof is 0.
% 0.61/0.83
% 0.61/0.83 ---------------- PROOF ----------------
% 0.61/0.83 % SZS status Theorem
% 0.61/0.83 % SZS output start Refutation
% 0.61/0.83
% 0.61/0.83 28 [] {+} -iext(uri_ex_p,A,B)| -iext(uri_ex_q,B,A).
% 0.61/0.83 89 [] {+} iext(uri_ex_p,uri_ex_s,$c1).
% 0.61/0.83 90 [] {+} iext(uri_ex_q,$c1,uri_ex_s).
% 0.61/0.83 121 [hyper,89,28,90] {-} $F.
% 0.61/0.83
% 0.61/0.83 % SZS output end Refutation
% 0.61/0.83 ------------ end of proof -------------
% 0.61/0.83
% 0.61/0.83
% 0.61/0.83 Search stopped by max_proofs option.
% 0.61/0.83
% 0.61/0.83
% 0.61/0.83 Search stopped by max_proofs option.
% 0.61/0.83
% 0.61/0.83 ============ end of search ============
% 0.61/0.83
% 0.61/0.83 ----------- soft-scott stats ----------
% 0.61/0.83
% 0.61/0.83 true clauses given 10 (35.7%)
% 0.61/0.83 false clauses given 18
% 0.61/0.83
% 0.61/0.83 FALSE TRUE
% 0.61/0.83 2 0 6
% 0.61/0.83 3 0 6
% 0.61/0.83 4 12 40
% 0.61/0.83 tot: 12 52 (81.2% true)
% 0.61/0.83
% 0.61/0.83
% 0.61/0.83 Model 19 [ 3 1 1277 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.83
% 0.61/0.83 That finishes the proof of the theorem.
% 0.61/0.83
% 0.61/0.83 Process 23673 finished Wed Jun 1 12:25:46 2022
%------------------------------------------------------------------------------