TSTP Solution File: NUM606+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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:19:57 EDT 2022
% Result : Theorem 2.14s 2.34s
% Output : Refutation 2.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n028.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 Jul 6 02:14:36 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.38 ----- Otter 3.2, August 2001 -----
% 0.19/0.38 The process was started by sandbox on n028.cluster.edu,
% 0.19/0.38 Wed Jul 6 02:14:36 2022
% 0.19/0.38 The command was "./sos". The process ID is 13487.
% 0.19/0.38
% 0.19/0.38 set(prolog_style_variables).
% 0.19/0.38 set(auto).
% 0.19/0.38 dependent: set(auto1).
% 0.19/0.38 dependent: set(process_input).
% 0.19/0.38 dependent: clear(print_kept).
% 0.19/0.38 dependent: clear(print_new_demod).
% 0.19/0.38 dependent: clear(print_back_demod).
% 0.19/0.38 dependent: clear(print_back_sub).
% 0.19/0.38 dependent: set(control_memory).
% 0.19/0.38 dependent: assign(max_mem, 12000).
% 0.19/0.38 dependent: assign(pick_given_ratio, 4).
% 0.19/0.38 dependent: assign(stats_level, 1).
% 0.19/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.38 dependent: assign(sos_limit, 5000).
% 0.19/0.38 dependent: assign(max_weight, 60).
% 0.19/0.38 clear(print_given).
% 0.19/0.38
% 0.19/0.38 formula_list(usable).
% 0.19/0.38
% 0.19/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.19/0.38
% 0.19/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.38 clauses in usable.
% 0.19/0.38
% 0.19/0.38 dependent: set(knuth_bendix).
% 0.19/0.38 dependent: set(para_from).
% 0.19/0.38 dependent: set(para_into).
% 0.19/0.38 dependent: clear(para_from_right).
% 0.19/0.38 dependent: clear(para_into_right).
% 0.19/0.38 dependent: set(para_from_vars).
% 0.19/0.38 dependent: set(eq_units_both_ways).
% 0.19/0.38 dependent: set(dynamic_demod_all).
% 0.19/0.38 dependent: set(dynamic_demod).
% 0.19/0.38 dependent: set(order_eq).
% 0.19/0.38 dependent: set(back_demod).
% 0.19/0.38 dependent: set(lrpo).
% 0.19/0.38 dependent: set(hyper_res).
% 0.19/0.38 dependent: set(unit_deletion).
% 0.19/0.38 dependent: set(factor).
% 0.19/0.38
% 0.19/0.38 ------------> process usable:
% 0.19/0.38 Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.19/0.38 177 back subsumes 176.
% 0.19/0.38
% 0.19/0.38 ------------> process sos:
% 0.19/0.38 Following clause subsumed by 241 during input processing: 0 [] {-} aSet0(xO).
% 0.19/0.38 Following clause subsumed by 249 during input processing: 0 [copy,249,flip.1] {-} A=A.
% 0.19/0.38 249 back subsumes 203.
% 0.19/0.38 249 back subsumes 187.
% 0.19/0.38 249 back subsumes 182.
% 0.19/0.38 249 back subsumes 181.
% 0.19/0.38 249 back subsumes 179.
% 0.19/0.38 249 back subsumes 175.
% 0.19/0.38 249 back subsumes 169.
% 0.19/0.38
% 0.19/0.38 ======= end of input processing =======
% 0.84/1.08
% 0.84/1.08 Stopped by limit on insertions
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 Failed to model usable list: disabling FINDER
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 -------------- Softie stats --------------
% 0.84/1.08
% 0.84/1.08 UPDATE_STOP: 300
% 0.84/1.08 SFINDER_TIME_LIMIT: 2
% 0.84/1.08 SHORT_CLAUSE_CUTOFF: 4
% 0.84/1.08 number of clauses in intial UL: 189
% 0.84/1.08 number of clauses initially in problem: 232
% 0.84/1.08 percentage of clauses intially in UL: 81
% 0.84/1.08 percentage of distinct symbols occuring in initial UL: 100
% 0.84/1.08 percent of all initial clauses that are short: 100
% 0.84/1.08 absolute distinct symbol count: 63
% 0.84/1.08 distinct predicate count: 10
% 0.84/1.08 distinct function count: 39
% 0.84/1.08 distinct constant count: 14
% 0.84/1.08
% 0.84/1.08 ---------- no more Softie stats ----------
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08
% 0.84/1.08 =========== start of search ===========
% 1.45/1.64
% 1.45/1.64
% 1.45/1.64 Changing weight limit from 60 to 34.
% 1.45/1.64
% 1.45/1.64 Resetting weight limit to 34 after 40 givens.
% 1.45/1.64
% 1.70/1.95
% 1.70/1.95
% 1.70/1.95 Changing weight limit from 34 to 27.
% 1.70/1.95
% 1.70/1.95 Resetting weight limit to 27 after 45 givens.
% 1.70/1.95
% 2.02/2.21
% 2.02/2.21
% 2.02/2.21 Changing weight limit from 27 to 24.
% 2.02/2.21
% 2.02/2.21 Resetting weight limit to 24 after 50 givens.
% 2.02/2.21
% 2.12/2.30
% 2.12/2.30
% 2.12/2.30 Changing weight limit from 24 to 23.
% 2.12/2.30
% 2.12/2.30 Resetting weight limit to 23 after 55 givens.
% 2.12/2.30
% 2.14/2.34
% 2.14/2.34 -------- PROOF --------
% 2.14/2.34 % SZS status Theorem
% 2.14/2.34 % SZS output start Refutation
% 2.14/2.34
% 2.14/2.34 ----> UNIT CONFLICT at 1.95 sec ----> 7439 [binary,7438.1,168.1] {-} $F.
% 2.14/2.34
% 2.14/2.34 Length of proof is 4. Level of proof is 3.
% 2.14/2.34
% 2.14/2.34 ---------------- PROOF ----------------
% 2.14/2.34 % SZS status Theorem
% 2.14/2.34 % SZS output start Refutation
% 2.14/2.34
% 2.14/2.34 7 [] {+} -aSet0(A)| -aSubsetOf0(B,A)|aSet0(B).
% 2.14/2.34 14 [] {+} -aSet0(A)| -aSet0(B)| -aSet0(C)| -aSubsetOf0(A,B)| -aSubsetOf0(B,C)|aSubsetOf0(A,C).
% 2.14/2.34 168 [] {+} -aSubsetOf0(xQ,szNzAzT0).
% 2.14/2.34 205 [] {-} aSet0(szNzAzT0).
% 2.14/2.34 213 [] {-} aSubsetOf0(xS,szNzAzT0).
% 2.14/2.34 241 [] {-} aSet0(xO).
% 2.14/2.34 246 [] {-} aSubsetOf0(xO,xS).
% 2.14/2.34 248 [] {-} aSubsetOf0(xQ,xO).
% 2.14/2.34 1825 [hyper,213,7,205] {-} aSet0(xS).
% 2.14/2.34 2687 [hyper,246,14,241,1825,205,213] {-} aSubsetOf0(xO,szNzAzT0).
% 2.14/2.34 3150 [hyper,248,7,241] {-} aSet0(xQ).
% 2.14/2.34 7438 [hyper,2687,14,3150,241,205,248] {-} aSubsetOf0(xQ,szNzAzT0).
% 2.14/2.34 7439 [binary,7438.1,168.1] {-} $F.
% 2.14/2.34
% 2.14/2.34 % SZS output end Refutation
% 2.14/2.34 ------------ end of proof -------------
% 2.14/2.34
% 2.14/2.34
% 2.14/2.34 Search stopped by max_proofs option.
% 2.14/2.34
% 2.14/2.34
% 2.14/2.34 Search stopped by max_proofs option.
% 2.14/2.34
% 2.14/2.34 ============ end of search ============
% 2.14/2.34
% 2.14/2.34 That finishes the proof of the theorem.
% 2.14/2.34
% 2.14/2.34 Process 13487 finished Wed Jul 6 02:14:38 2022
%------------------------------------------------------------------------------