TSTP Solution File: NUM550+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM550+3 : 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:26 EDT 2022
% Result : Theorem 0.19s 0.59s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM550+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 17:14:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n028.cluster.edu,
% 0.13/0.37 Wed Jul 6 17:14:22 2022
% 0.13/0.37 The command was "./sos". The process ID is 31151.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37 Following clause subsumed by 103 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSet0(A).
% 0.13/0.37 Following clause subsumed by 104 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))| -aElementOf0(B,A)|aElementOf0(B,xS).
% 0.13/0.37 Following clause subsumed by 105 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSubsetOf0(A,xS).
% 0.13/0.37 Following clause subsumed by 106 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|sbrdtbr0(A)=xk.
% 0.13/0.37 Following clause subsumed by 109 during input processing: 0 [] {-} -aSubsetOf0(A,xS)|sbrdtbr0(A)!=xk|aElementOf0(A,slbdtsldtrb0(xS,xk)).
% 0.13/0.37 122 back subsumes 121.
% 0.13/0.37 131 back subsumes 130.
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 166 during input processing: 0 [] {-} aSet0(xQ).
% 0.13/0.37 Following clause subsumed by 176 during input processing: 0 [copy,173,flip.1] {-} xk=xk.
% 0.13/0.37 Following clause subsumed by 176 during input processing: 0 [copy,176,flip.1] {-} A=A.
% 0.13/0.37 176 back subsumes 173.
% 0.13/0.37 176 back subsumes 141.
% 0.13/0.37 176 back subsumes 136.
% 0.13/0.37 176 back subsumes 135.
% 0.13/0.37 176 back subsumes 133.
% 0.13/0.37 176 back subsumes 129.
% 0.13/0.37 176 back subsumes 123.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.19/0.58
% 0.19/0.58 Stopped by limit on insertions
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58 Failed to model usable list: disabling FINDER
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58 -------------- Softie stats --------------
% 0.19/0.58
% 0.19/0.58 UPDATE_STOP: 300
% 0.19/0.58 SFINDER_TIME_LIMIT: 2
% 0.19/0.58 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.58 number of clauses in intial UL: 140
% 0.19/0.58 number of clauses initially in problem: 163
% 0.19/0.58 percentage of clauses intially in UL: 85
% 0.19/0.58 percentage of distinct symbols occuring in initial UL: 92
% 0.19/0.58 percent of all initial clauses that are short: 100
% 0.19/0.58 absolute distinct symbol count: 40
% 0.19/0.58 distinct predicate count: 9
% 0.19/0.58 distinct function count: 22
% 0.19/0.58 distinct constant count: 9
% 0.19/0.58
% 0.19/0.58 ---------- no more Softie stats ----------
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58
% 0.19/0.58 =========== start of search ===========
% 0.19/0.59
% 0.19/0.59 -------- PROOF --------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 ----> UNIT CONFLICT at 0.20 sec ----> 372 [binary,370.1,102.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 Length of proof is 2. Level of proof is 2.
% 0.19/0.59
% 0.19/0.59 ---------------- PROOF ----------------
% 0.19/0.59 % SZS status Theorem
% 0.19/0.59 % SZS output start Refutation
% 0.19/0.59
% 0.19/0.59 91 [] {+} -aElementOf0(A,szNzAzT0)|sbrdtbr0(slbdtrb0(A))=A.
% 0.19/0.59 102 [] {+} xk!=sz00.
% 0.19/0.59 155 [] {-} aElementOf0(sz00,szNzAzT0).
% 0.19/0.59 157,156 [] {-} slbdtrb0(sz00)=slcrc0.
% 0.19/0.59 168 [] {-} sbrdtbr0(xQ)=xk.
% 0.19/0.59 175,174 [] {-} xQ=slcrc0.
% 0.19/0.59 179,178 [back_demod,168,demod,175] {-} sbrdtbr0(slcrc0)=xk.
% 0.19/0.59 370 [hyper,155,91,demod,157,179] {-} xk=sz00.
% 0.19/0.59 372 [binary,370.1,102.1] {-} $F.
% 0.19/0.59
% 0.19/0.59 % SZS output end Refutation
% 0.19/0.59 ------------ end of proof -------------
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59
% 0.19/0.59 Search stopped by max_proofs option.
% 0.19/0.59
% 0.19/0.59 ============ end of search ============
% 0.19/0.59
% 0.19/0.59 That finishes the proof of the theorem.
% 0.19/0.59
% 0.19/0.59 Process 31151 finished Wed Jul 6 17:14:22 2022
%------------------------------------------------------------------------------