TSTP Solution File: NUM551+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM551+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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.44s 0.67s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM551+3 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.12 % Command : sos-script %s
% 0.11/0.33 % Computer : n014.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Tue Jul 5 16:10:08 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.11/0.35 ----- Otter 3.2, August 2001 -----
% 0.11/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.11/0.35 Tue Jul 5 16:10:08 2022
% 0.11/0.35 The command was "./sos". The process ID is 28135.
% 0.11/0.35
% 0.11/0.35 set(prolog_style_variables).
% 0.11/0.35 set(auto).
% 0.11/0.35 dependent: set(auto1).
% 0.11/0.35 dependent: set(process_input).
% 0.11/0.35 dependent: clear(print_kept).
% 0.11/0.35 dependent: clear(print_new_demod).
% 0.11/0.35 dependent: clear(print_back_demod).
% 0.11/0.35 dependent: clear(print_back_sub).
% 0.11/0.35 dependent: set(control_memory).
% 0.11/0.35 dependent: assign(max_mem, 12000).
% 0.11/0.35 dependent: assign(pick_given_ratio, 4).
% 0.11/0.35 dependent: assign(stats_level, 1).
% 0.11/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.35 dependent: assign(sos_limit, 5000).
% 0.11/0.35 dependent: assign(max_weight, 60).
% 0.11/0.35 clear(print_given).
% 0.11/0.35
% 0.11/0.35 formula_list(usable).
% 0.11/0.35
% 0.11/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 0.11/0.35
% 0.11/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.35 clauses in usable.
% 0.11/0.35
% 0.11/0.35 dependent: set(knuth_bendix).
% 0.11/0.35 dependent: set(para_from).
% 0.11/0.35 dependent: set(para_into).
% 0.11/0.35 dependent: clear(para_from_right).
% 0.11/0.35 dependent: clear(para_into_right).
% 0.11/0.35 dependent: set(para_from_vars).
% 0.11/0.35 dependent: set(eq_units_both_ways).
% 0.11/0.35 dependent: set(dynamic_demod_all).
% 0.11/0.35 dependent: set(dynamic_demod).
% 0.11/0.35 dependent: set(order_eq).
% 0.11/0.35 dependent: set(back_demod).
% 0.11/0.35 dependent: set(lrpo).
% 0.11/0.35 dependent: set(hyper_res).
% 0.11/0.35 dependent: set(unit_deletion).
% 0.11/0.35 dependent: set(factor).
% 0.11/0.35
% 0.11/0.35 ------------> process usable:
% 0.11/0.35 Following clause subsumed by 103 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSet0(A).
% 0.11/0.35 Following clause subsumed by 104 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))| -aElementOf0(B,A)|aElementOf0(B,xS).
% 0.11/0.35 Following clause subsumed by 105 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|aSubsetOf0(A,xS).
% 0.11/0.35 Following clause subsumed by 106 during input processing: 0 [] {-} -aElementOf0(A,slbdtsldtrb0(xS,xk))|sbrdtbr0(A)=xk.
% 0.11/0.35 Following clause subsumed by 109 during input processing: 0 [] {-} -aSubsetOf0(A,xS)|sbrdtbr0(A)!=xk|aElementOf0(A,slbdtsldtrb0(xS,xk)).
% 0.11/0.35 132 back subsumes 131.
% 0.11/0.35
% 0.11/0.35 ------------> process sos:
% 0.11/0.35 Following clause subsumed by 167 during input processing: 0 [] {-} aSet0(xQ).
% 0.11/0.35 Following clause subsumed by 176 during input processing: 0 [copy,174,flip.1] {-} xk=xk.
% 0.11/0.35 Following clause subsumed by 176 during input processing: 0 [copy,176,flip.1] {-} A=A.
% 0.11/0.35 176 back subsumes 174.
% 0.11/0.35 176 back subsumes 142.
% 0.11/0.35 176 back subsumes 137.
% 0.11/0.35 176 back subsumes 136.
% 0.11/0.35 176 back subsumes 134.
% 0.11/0.35 176 back subsumes 130.
% 0.11/0.35 176 back subsumes 124.
% 0.11/0.35
% 0.11/0.35 ======= end of input processing =======
% 0.34/0.55
% 0.34/0.55 Stopped by limit on insertions
% 0.34/0.55
% 0.34/0.55
% 0.34/0.55 Failed to model usable list: disabling FINDER
% 0.34/0.55
% 0.34/0.55
% 0.34/0.55
% 0.34/0.55 -------------- Softie stats --------------
% 0.34/0.55
% 0.34/0.55 UPDATE_STOP: 300
% 0.34/0.55 SFINDER_TIME_LIMIT: 2
% 0.34/0.55 SHORT_CLAUSE_CUTOFF: 4
% 0.34/0.55 number of clauses in intial UL: 143
% 0.34/0.55 number of clauses initially in problem: 165
% 0.34/0.55 percentage of clauses intially in UL: 86
% 0.34/0.55 percentage of distinct symbols occuring in initial UL: 92
% 0.34/0.55 percent of all initial clauses that are short: 100
% 0.34/0.55 absolute distinct symbol count: 41
% 0.34/0.55 distinct predicate count: 9
% 0.34/0.55 distinct function count: 22
% 0.34/0.55 distinct constant count: 10
% 0.34/0.55
% 0.34/0.55 ---------- no more Softie stats ----------
% 0.34/0.55
% 0.34/0.55
% 0.34/0.55
% 0.34/0.55 =========== start of search ===========
% 0.44/0.67
% 0.44/0.67 -------- PROOF --------
% 0.44/0.67 % SZS status Theorem
% 0.44/0.67 % SZS output start Refutation
% 0.44/0.67
% 0.44/0.67 -----> EMPTY CLAUSE at 0.30 sec ----> 1951 [hyper,1847,123,175] {-} $F.
% 0.44/0.67
% 0.44/0.67 Length of proof is 1. Level of proof is 1.
% 0.44/0.67
% 0.44/0.67 ---------------- PROOF ----------------
% 0.44/0.67 % SZS status Theorem
% 0.44/0.67 % SZS output start Refutation
% 0.44/0.67
% 0.44/0.67 1 [] {+} -aSet0(A)| -aElementOf0(B,A)|aElement0(B).
% 0.44/0.67 123 [] {+} -aElement0(A)| -aElementOf0(A,xQ).
% 0.44/0.67 167 [] {-} aSet0(xQ).
% 0.44/0.67 175 [] {-} aElementOf0($c2,xQ).
% 0.44/0.67 1847 [hyper,175,1,167] {-} aElement0($c2).
% 0.44/0.67 1951 [hyper,1847,123,175] {-} $F.
% 0.44/0.67
% 0.44/0.67 % SZS output end Refutation
% 0.44/0.67 ------------ end of proof -------------
% 0.44/0.67
% 0.44/0.67
% 0.44/0.67 Search stopped by max_proofs option.
% 0.44/0.67
% 0.44/0.67
% 0.44/0.67 Search stopped by max_proofs option.
% 0.44/0.67
% 0.44/0.67 ============ end of search ============
% 0.44/0.67
% 0.44/0.67 That finishes the proof of the theorem.
% 0.44/0.67
% 0.44/0.67 Process 28135 finished Tue Jul 5 16:10:08 2022
%------------------------------------------------------------------------------