TSTP Solution File: NUM610+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM610+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 14:20:01 EDT 2022
% Result : Theorem 1.27s 1.49s
% Output : Refutation 1.27s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM610+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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 Jul 6 16:49:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.37 ----- Otter 3.2, August 2001 -----
% 0.12/0.37 The process was started by sandbox on n021.cluster.edu,
% 0.12/0.37 Wed Jul 6 16:49:48 2022
% 0.12/0.37 The command was "./sos". The process ID is 14476.
% 0.12/0.37
% 0.12/0.37 set(prolog_style_variables).
% 0.12/0.37 set(auto).
% 0.12/0.37 dependent: set(auto1).
% 0.12/0.37 dependent: set(process_input).
% 0.12/0.37 dependent: clear(print_kept).
% 0.12/0.37 dependent: clear(print_new_demod).
% 0.12/0.37 dependent: clear(print_back_demod).
% 0.12/0.37 dependent: clear(print_back_sub).
% 0.12/0.37 dependent: set(control_memory).
% 0.12/0.37 dependent: assign(max_mem, 12000).
% 0.12/0.37 dependent: assign(pick_given_ratio, 4).
% 0.12/0.37 dependent: assign(stats_level, 1).
% 0.12/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.37 dependent: assign(sos_limit, 5000).
% 0.12/0.37 dependent: assign(max_weight, 60).
% 0.12/0.37 clear(print_given).
% 0.12/0.37
% 0.12/0.37 formula_list(usable).
% 0.12/0.37
% 0.12/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.12/0.37
% 0.12/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.37 clauses in usable.
% 0.12/0.37
% 0.12/0.37 dependent: set(knuth_bendix).
% 0.12/0.37 dependent: set(para_from).
% 0.12/0.37 dependent: set(para_into).
% 0.12/0.37 dependent: clear(para_from_right).
% 0.12/0.37 dependent: clear(para_into_right).
% 0.12/0.37 dependent: set(para_from_vars).
% 0.12/0.37 dependent: set(eq_units_both_ways).
% 0.12/0.37 dependent: set(dynamic_demod_all).
% 0.12/0.37 dependent: set(dynamic_demod).
% 0.12/0.37 dependent: set(order_eq).
% 0.12/0.37 dependent: set(back_demod).
% 0.12/0.37 dependent: set(lrpo).
% 0.12/0.37 dependent: set(hyper_res).
% 0.12/0.37 dependent: set(unit_deletion).
% 0.12/0.37 dependent: set(factor).
% 0.12/0.37
% 0.12/0.37 ------------> process usable:
% 0.12/0.37 Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.12/0.37 177 back subsumes 176.
% 0.12/0.37
% 0.12/0.37 ------------> process sos:
% 0.12/0.37 Following clause subsumed by 241 during input processing: 0 [] {-} aSet0(xO).
% 0.12/0.37 Following clause subsumed by 262 during input processing: 0 [copy,262,flip.1] {-} A=A.
% 0.12/0.37 262 back subsumes 203.
% 0.12/0.37 262 back subsumes 187.
% 0.12/0.37 262 back subsumes 182.
% 0.12/0.37 262 back subsumes 181.
% 0.12/0.37 262 back subsumes 179.
% 0.12/0.37 262 back subsumes 175.
% 0.12/0.37 262 back subsumes 169.
% 0.12/0.37
% 0.12/0.37 ======= end of input processing =======
% 0.89/1.10
% 0.89/1.10 Stopped by limit on insertions
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10 Failed to model usable list: disabling FINDER
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10 -------------- Softie stats --------------
% 0.89/1.10
% 0.89/1.10 UPDATE_STOP: 300
% 0.89/1.10 SFINDER_TIME_LIMIT: 2
% 0.89/1.10 SHORT_CLAUSE_CUTOFF: 4
% 0.89/1.10 number of clauses in intial UL: 189
% 0.89/1.10 number of clauses initially in problem: 242
% 0.89/1.10 percentage of clauses intially in UL: 78
% 0.89/1.10 percentage of distinct symbols occuring in initial UL: 98
% 0.89/1.10 percent of all initial clauses that are short: 100
% 0.89/1.10 absolute distinct symbol count: 65
% 0.89/1.10 distinct predicate count: 10
% 0.89/1.10 distinct function count: 39
% 0.89/1.10 distinct constant count: 16
% 0.89/1.10
% 0.89/1.10 ---------- no more Softie stats ----------
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10
% 0.89/1.10 =========== start of search ===========
% 1.27/1.49
% 1.27/1.49 -------- PROOF --------
% 1.27/1.49 % SZS status Theorem
% 1.27/1.49 % SZS output start Refutation
% 1.27/1.49
% 1.27/1.49 ----> UNIT CONFLICT at 1.11 sec ----> 4570 [binary,4569.1,168.1] {-} $F.
% 1.27/1.49
% 1.27/1.49 Length of proof is 2. Level of proof is 2.
% 1.27/1.49
% 1.27/1.49 ---------------- PROOF ----------------
% 1.27/1.49 % SZS status Theorem
% 1.27/1.49 % SZS output start Refutation
% 1.27/1.49
% 1.27/1.49 7 [] {+} -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 1.27/1.49 14 [] {+} -aSet0(A)| -aSet0(B)| -aSet0(C)| -aSubsetOf0(A,B)| -aSubsetOf0(B,C)|aSubsetOf0(A,C).
% 1.27/1.49 168 [] {+} -aSubsetOf0(xP,xO).
% 1.27/1.49 241 [] {-} aSet0(xO).
% 1.27/1.49 248 [] {-} aSubsetOf0(xQ,xO).
% 1.27/1.49 255 [] {-} aSet0(xP).
% 1.27/1.49 261 [] {-} aSubsetOf0(xP,xQ).
% 1.27/1.49 3101 [hyper,248,7,241] {-} aSet0(xQ).
% 1.27/1.49 4569 [hyper,261,14,255,3101,241,248] {-} aSubsetOf0(xP,xO).
% 1.27/1.49 4570 [binary,4569.1,168.1] {-} $F.
% 1.27/1.49
% 1.27/1.49 % SZS output end Refutation
% 1.27/1.49 ------------ end of proof -------------
% 1.27/1.49
% 1.27/1.49
% 1.27/1.49 Search stopped by max_proofs option.
% 1.27/1.49
% 1.27/1.49
% 1.27/1.49 Search stopped by max_proofs option.
% 1.27/1.49
% 1.27/1.49 ============ end of search ============
% 1.27/1.49
% 1.27/1.49 That finishes the proof of the theorem.
% 1.27/1.49
% 1.27/1.49 Process 14476 finished Wed Jul 6 16:49:50 2022
%------------------------------------------------------------------------------