TSTP Solution File: NUM603+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM603+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:55 EDT 2022
% Result : Theorem 2.25s 2.53s
% Output : Refutation 2.35s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM603+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.11 % Command : sos-script %s
% 0.10/0.32 % Computer : n023.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue Jul 5 17:35:27 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.10/0.36 ----- Otter 3.2, August 2001 -----
% 0.10/0.36 The process was started by sandbox on n023.cluster.edu,
% 0.10/0.36 Tue Jul 5 17:35:27 2022
% 0.10/0.36 The command was "./sos". The process ID is 30109.
% 0.10/0.36
% 0.10/0.36 set(prolog_style_variables).
% 0.10/0.36 set(auto).
% 0.10/0.36 dependent: set(auto1).
% 0.10/0.36 dependent: set(process_input).
% 0.10/0.36 dependent: clear(print_kept).
% 0.10/0.36 dependent: clear(print_new_demod).
% 0.10/0.36 dependent: clear(print_back_demod).
% 0.10/0.36 dependent: clear(print_back_sub).
% 0.10/0.36 dependent: set(control_memory).
% 0.10/0.36 dependent: assign(max_mem, 12000).
% 0.10/0.36 dependent: assign(pick_given_ratio, 4).
% 0.10/0.36 dependent: assign(stats_level, 1).
% 0.10/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.36 dependent: assign(sos_limit, 5000).
% 0.10/0.36 dependent: assign(max_weight, 60).
% 0.10/0.36 clear(print_given).
% 0.10/0.36
% 0.10/0.36 formula_list(usable).
% 0.10/0.36
% 0.10/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.10/0.36
% 0.10/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.10/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.10/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.10/0.36 clauses in usable.
% 0.10/0.36
% 0.10/0.36 dependent: set(knuth_bendix).
% 0.10/0.36 dependent: set(para_from).
% 0.10/0.36 dependent: set(para_into).
% 0.10/0.36 dependent: clear(para_from_right).
% 0.10/0.36 dependent: clear(para_into_right).
% 0.10/0.36 dependent: set(para_from_vars).
% 0.10/0.36 dependent: set(eq_units_both_ways).
% 0.10/0.36 dependent: set(dynamic_demod_all).
% 0.10/0.36 dependent: set(dynamic_demod).
% 0.10/0.36 dependent: set(order_eq).
% 0.10/0.36 dependent: set(back_demod).
% 0.10/0.36 dependent: set(lrpo).
% 0.10/0.36 dependent: set(hyper_res).
% 0.10/0.36 dependent: set(unit_deletion).
% 0.10/0.36 dependent: set(factor).
% 0.10/0.36
% 0.10/0.36 ------------> process usable:
% 0.10/0.36 Following clause subsumed by 139 during input processing: 0 [] {-} xK!=sz00.
% 0.10/0.36 176 back subsumes 175.
% 0.10/0.36
% 0.10/0.36 ------------> process sos:
% 0.10/0.36 Following clause subsumed by 240 during input processing: 0 [] {-} aSet0(xO).
% 0.10/0.36 Following clause subsumed by 249 during input processing: 0 [copy,249,flip.1] {-} A=A.
% 0.10/0.36 249 back subsumes 202.
% 0.10/0.36 249 back subsumes 186.
% 0.10/0.36 249 back subsumes 181.
% 0.10/0.36 249 back subsumes 180.
% 0.10/0.36 249 back subsumes 178.
% 0.10/0.36 249 back subsumes 174.
% 0.10/0.36 249 back subsumes 168.
% 0.10/0.36
% 0.10/0.36 ======= end of input processing =======
% 0.89/1.12
% 0.89/1.12 Stopped by limit on insertions
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 Failed to model usable list: disabling FINDER
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 -------------- Softie stats --------------
% 0.89/1.12
% 0.89/1.12 UPDATE_STOP: 300
% 0.89/1.12 SFINDER_TIME_LIMIT: 2
% 0.89/1.12 SHORT_CLAUSE_CUTOFF: 4
% 0.89/1.12 number of clauses in intial UL: 188
% 0.89/1.12 number of clauses initially in problem: 232
% 0.89/1.12 percentage of clauses intially in UL: 81
% 0.89/1.12 percentage of distinct symbols occuring in initial UL: 98
% 0.89/1.12 percent of all initial clauses that are short: 100
% 0.89/1.12 absolute distinct symbol count: 64
% 0.89/1.12 distinct predicate count: 10
% 0.89/1.12 distinct function count: 39
% 0.89/1.12 distinct constant count: 15
% 0.89/1.12
% 0.89/1.12 ---------- no more Softie stats ----------
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12
% 0.89/1.12 =========== start of search ===========
% 1.80/2.03
% 1.80/2.03
% 1.80/2.03 Changing weight limit from 60 to 27.
% 1.80/2.03
% 1.80/2.03 Resetting weight limit to 27 after 45 givens.
% 1.80/2.03
% 2.05/2.25
% 2.05/2.25
% 2.05/2.25 Changing weight limit from 27 to 24.
% 2.05/2.25
% 2.05/2.25 Resetting weight limit to 24 after 50 givens.
% 2.05/2.25
% 2.18/2.36
% 2.18/2.36
% 2.18/2.36 Changing weight limit from 24 to 23.
% 2.18/2.36
% 2.18/2.36 Resetting weight limit to 23 after 55 givens.
% 2.18/2.36
% 2.25/2.50
% 2.25/2.50
% 2.25/2.50 Changing weight limit from 23 to 22.
% 2.25/2.50
% 2.25/2.50 Resetting weight limit to 22 after 60 givens.
% 2.25/2.50
% 2.25/2.53
% 2.25/2.53 -------- PROOF --------
% 2.25/2.53 % SZS status Theorem
% 2.25/2.53 % SZS output start Refutation
% 2.25/2.53
% 2.25/2.53 ----> UNIT CONFLICT at 2.15 sec ----> 7739 [binary,7738.1,167.1] {-} $F.
% 2.25/2.53
% 2.25/2.53 Length of proof is 2. Level of proof is 2.
% 2.25/2.53
% 2.25/2.53 ---------------- PROOF ----------------
% 2.25/2.53 % SZS status Theorem
% 2.25/2.53 % SZS output start Refutation
% 2.25/2.53
% 2.25/2.53 47 [] {+} -aElementOf0(A,szNzAzT0)|sdtlseqdt0(sz00,A).
% 2.25/2.53 144 [] {+} -aElementOf0(A,szNzAzT0)| -aElementOf0(B,szNzAzT0)| -sdtlseqdt0(B,A)|aSubsetOf0(sdtlpdtrp0(xN,A),sdtlpdtrp0(xN,B)).
% 2.25/2.53 167 [] {+} -aSubsetOf0(sdtlpdtrp0(xN,xi),xS).
% 2.25/2.53 206 [] {-} aElementOf0(sz00,szNzAzT0).
% 2.25/2.53 226,225 [] {-} sdtlpdtrp0(xN,sz00)=xS.
% 2.25/2.53 246 [] {-} aElementOf0(xi,szNzAzT0).
% 2.25/2.53 3472 [hyper,246,47] {-} sdtlseqdt0(sz00,xi).
% 2.25/2.53 7738 [hyper,3472,144,246,206,demod,226] {-} aSubsetOf0(sdtlpdtrp0(xN,xi),xS).
% 2.25/2.53 7739 [binary,7738.1,167.1] {-} $F.
% 2.25/2.53
% 2.35/2.53 % SZS output end Refutation
% 2.35/2.53 ------------ end of proof -------------
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53
% 2.35/2.53 Search stopped by max_proofs option.
% 2.35/2.53
% 2.35/2.53 ============ end of search ============
% 2.35/2.53
% 2.35/2.53 That finishes the proof of the theorem.
% 2.35/2.53
% 2.35/2.53 Process 30109 finished Tue Jul 5 17:35:29 2022
%------------------------------------------------------------------------------