TSTP Solution File: CSR050+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CSR050+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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 : Fri Jul 15 23:21:33 EDT 2022
% Result : Theorem 0.10s 0.52s
% Output : Refutation 0.10s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : CSR050+1 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.07 % Command : sos-script %s
% 0.06/0.26 % Computer : n009.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Sat Jun 11 18:26:53 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.06/0.27 ----- Otter 3.2, August 2001 -----
% 0.06/0.27 The process was started by sandbox2 on n009.cluster.edu,
% 0.06/0.27 Sat Jun 11 18:26:53 2022
% 0.06/0.27 The command was "./sos". The process ID is 6640.
% 0.06/0.27
% 0.06/0.27 set(prolog_style_variables).
% 0.06/0.27 set(auto).
% 0.06/0.27 dependent: set(auto1).
% 0.06/0.27 dependent: set(process_input).
% 0.06/0.27 dependent: clear(print_kept).
% 0.06/0.27 dependent: clear(print_new_demod).
% 0.06/0.27 dependent: clear(print_back_demod).
% 0.06/0.27 dependent: clear(print_back_sub).
% 0.06/0.27 dependent: set(control_memory).
% 0.06/0.27 dependent: assign(max_mem, 12000).
% 0.06/0.27 dependent: assign(pick_given_ratio, 4).
% 0.06/0.27 dependent: assign(stats_level, 1).
% 0.06/0.27 dependent: assign(pick_semantic_ratio, 3).
% 0.06/0.27 dependent: assign(sos_limit, 5000).
% 0.06/0.27 dependent: assign(max_weight, 60).
% 0.06/0.27 clear(print_given).
% 0.06/0.27
% 0.06/0.27 formula_list(usable).
% 0.06/0.27
% 0.06/0.27 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 0.06/0.27
% 0.06/0.27 This is a Horn set without equality. The strategy will
% 0.06/0.27 be hyperresolution, with satellites in sos and nuclei
% 0.06/0.27 in usable.
% 0.06/0.27
% 0.06/0.27 dependent: set(hyper_res).
% 0.06/0.27 dependent: clear(order_hyper).
% 0.06/0.27
% 0.06/0.27 ------------> process usable:
% 0.06/0.27 Following clause subsumed by 28 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(B).
% 0.06/0.27 Following clause subsumed by 29 during input processing: 0 [] {-} -genlpreds(A,B)|predicate(A).
% 0.06/0.27 Following clause subsumed by 31 during input processing: 0 [] {-} -predicate(A)|genlpreds(A,A).
% 0.06/0.27 Following clause subsumed by 42 during input processing: 0 [] {-} -isa(A,B)|collection(B).
% 0.06/0.27 Following clause subsumed by 43 during input processing: 0 [] {-} -isa(A,B)|thing(A).
% 0.06/0.27 Following clause subsumed by 46 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(B).
% 0.06/0.27 Following clause subsumed by 47 during input processing: 0 [] {-} -genlmt(A,B)|microtheory(A).
% 0.06/0.27 Following clause subsumed by 49 during input processing: 0 [] {-} -microtheory(A)|genlmt(A,A).
% 0.06/0.27
% 0.06/0.27 ------------> process sos:
% 0.06/0.27
% 0.06/0.27 ======= end of input processing =======
% 0.10/0.52
% 0.10/0.52 Stopped by limit on insertions
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52 Failed to model usable list: disabling FINDER
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52 -------------- Softie stats --------------
% 0.10/0.52
% 0.10/0.52 UPDATE_STOP: 300
% 0.10/0.52 SFINDER_TIME_LIMIT: 2
% 0.10/0.52 SHORT_CLAUSE_CUTOFF: 4
% 0.10/0.52 number of clauses in intial UL: 50
% 0.10/0.52 number of clauses initially in problem: 80
% 0.10/0.52 percentage of clauses intially in UL: 62
% 0.10/0.52 percentage of distinct symbols occuring in initial UL: 54
% 0.10/0.52 percent of all initial clauses that are short: 100
% 0.10/0.52 absolute distinct symbol count: 61
% 0.10/0.52 distinct predicate count: 30
% 0.10/0.52 distinct function count: 4
% 0.10/0.52 distinct constant count: 27
% 0.10/0.52
% 0.10/0.52 ---------- no more Softie stats ----------
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52 =========== start of search ===========
% 0.10/0.52
% 0.10/0.52 -------- PROOF --------
% 0.10/0.52 % SZS status Theorem
% 0.10/0.52 % SZS output start Refutation
% 0.10/0.52
% 0.10/0.52 ----> UNIT CONFLICT at 0.22 sec ----> 143 [binary,142.1,50.1] {-} $F.
% 0.10/0.52
% 0.10/0.52 Length of proof is 8. Level of proof is 6.
% 0.10/0.52
% 0.10/0.52 ---------------- PROOF ----------------
% 0.10/0.52 % SZS status Theorem
% 0.10/0.52 % SZS output start Refutation
% 0.10/0.52
% 0.10/0.52 1 [] {+} -tptptypes_8_692(A,B)|tptptypes_7_691(B,A).
% 0.10/0.52 2 [] {+} -tptptypes_9_693(A,B)|tptptypes_8_692(A,B).
% 0.10/0.52 3 [] {+} -mtvisible(c_currentworlddatacollectormt_nonhomocentric)|tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939).
% 0.10/0.52 45 [] {+} -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 0.10/0.52 48 [] {+} -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 0.10/0.52 50 [] {+} -tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)).
% 0.10/0.52 51 [] {-} genlmt(c_ldscdemonstrationspindleheadmt,c_currentworlddatacollectormt_nonhomocentric).
% 0.10/0.52 54 [] {-} genlmt(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32),c_machinelearningspindleheadmt).
% 0.10/0.52 55 [] {-} genlmt(c_machinelearningspindleheadmt,c_miptdatabase19681997_termsmt).
% 0.10/0.52 56 [] {-} genlmt(c_miptdatabase19681997_termsmt,c_ldscgeneralcollectormt).
% 0.10/0.52 57 [] {-} genlmt(c_ldscgeneralcollectormt,c_ldscdemonstrationspindleheadmt).
% 0.10/0.52 80 [] {-} mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_memberstripodcomindygalfordtriviahtm)),c_translation_32)).
% 0.10/0.52 98 [hyper,56,48,55] {-} genlmt(c_machinelearningspindleheadmt,c_ldscgeneralcollectormt).
% 0.10/0.52 102 [hyper,57,48,51] {-} genlmt(c_ldscgeneralcollectormt,c_currentworlddatacollectormt_nonhomocentric).
% 0.10/0.52 122 [hyper,102,48,98] {-} genlmt(c_machinelearningspindleheadmt,c_currentworlddatacollectormt_nonhomocentric).
% 0.10/0.52 131 [hyper,80,45,54] {-} mtvisible(c_machinelearningspindleheadmt).
% 0.10/0.52 132 [hyper,131,45,122] {-} mtvisible(c_currentworlddatacollectormt_nonhomocentric).
% 0.10/0.52 138 [hyper,132,3] {-} tptptypes_9_693(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939).
% 0.10/0.52 141 [hyper,138,2] {-} tptptypes_8_692(f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma),c_tptpcol_16_26939).
% 0.10/0.52 142 [hyper,141,1] {-} tptptypes_7_691(c_tptpcol_16_26939,f_subcollectionofwithrelationtofn(c_ship,c_objectfoundinlocation,c_cityofbostonma)).
% 0.10/0.52 143 [binary,142.1,50.1] {-} $F.
% 0.10/0.52
% 0.10/0.52 % SZS output end Refutation
% 0.10/0.52 ------------ end of proof -------------
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52 Search stopped by max_proofs option.
% 0.10/0.52
% 0.10/0.52
% 0.10/0.52 Search stopped by max_proofs option.
% 0.10/0.52
% 0.10/0.52 ============ end of search ============
% 0.10/0.52
% 0.10/0.52 That finishes the proof of the theorem.
% 0.10/0.52
% 0.10/0.52 Process 6640 finished Sat Jun 11 18:26:53 2022
%------------------------------------------------------------------------------