TSTP Solution File: SET025+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET025+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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 : Tue Jul 19 05:14:29 EDT 2022
% Result : Theorem 0.70s 0.89s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET025+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.08/0.14 % Command : sos-script %s
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jul 11 09:22:10 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.15/0.38 ----- Otter 3.2, August 2001 -----
% 0.15/0.38 The process was started by sandbox on n022.cluster.edu,
% 0.15/0.38 Mon Jul 11 09:22:10 2022
% 0.15/0.38 The command was "./sos". The process ID is 29177.
% 0.15/0.38
% 0.15/0.38 set(prolog_style_variables).
% 0.15/0.38 set(auto).
% 0.15/0.38 dependent: set(auto1).
% 0.15/0.38 dependent: set(process_input).
% 0.15/0.38 dependent: clear(print_kept).
% 0.15/0.38 dependent: clear(print_new_demod).
% 0.15/0.38 dependent: clear(print_back_demod).
% 0.15/0.38 dependent: clear(print_back_sub).
% 0.15/0.38 dependent: set(control_memory).
% 0.15/0.38 dependent: assign(max_mem, 12000).
% 0.15/0.38 dependent: assign(pick_given_ratio, 4).
% 0.15/0.38 dependent: assign(stats_level, 1).
% 0.15/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.38 dependent: assign(sos_limit, 5000).
% 0.15/0.38 dependent: assign(max_weight, 60).
% 0.15/0.38 clear(print_given).
% 0.15/0.38
% 0.15/0.38 formula_list(usable).
% 0.15/0.38
% 0.15/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.15/0.38
% 0.15/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.38 clauses in usable.
% 0.15/0.38
% 0.15/0.38 dependent: set(knuth_bendix).
% 0.15/0.38 dependent: set(para_from).
% 0.15/0.38 dependent: set(para_into).
% 0.15/0.38 dependent: clear(para_from_right).
% 0.15/0.38 dependent: clear(para_into_right).
% 0.15/0.38 dependent: set(para_from_vars).
% 0.15/0.38 dependent: set(eq_units_both_ways).
% 0.15/0.38 dependent: set(dynamic_demod_all).
% 0.15/0.38 dependent: set(dynamic_demod).
% 0.15/0.38 dependent: set(order_eq).
% 0.15/0.38 dependent: set(back_demod).
% 0.15/0.38 dependent: set(lrpo).
% 0.15/0.38 dependent: set(hyper_res).
% 0.15/0.38 dependent: set(unit_deletion).
% 0.15/0.38 dependent: set(factor).
% 0.15/0.38
% 0.15/0.38 ------------> process usable:
% 0.15/0.38
% 0.15/0.38 ------------> process sos:
% 0.15/0.38 Following clause subsumed by 120 during input processing: 0 [copy,120,flip.1] {-} A=A.
% 0.15/0.38 120 back subsumes 69.
% 0.15/0.38
% 0.15/0.38 ======= end of input processing =======
% 0.70/0.88
% 0.70/0.88 Stopped by limit on insertions
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 Failed to model usable list: disabling FINDER
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 -------------- Softie stats --------------
% 0.70/0.88
% 0.70/0.88 UPDATE_STOP: 300
% 0.70/0.88 SFINDER_TIME_LIMIT: 2
% 0.70/0.88 SHORT_CLAUSE_CUTOFF: 4
% 0.70/0.88 number of clauses in intial UL: 69
% 0.70/0.88 number of clauses initially in problem: 111
% 0.70/0.88 percentage of clauses intially in UL: 62
% 0.70/0.88 percentage of distinct symbols occuring in initial UL: 82
% 0.70/0.88 percent of all initial clauses that are short: 100
% 0.70/0.88 absolute distinct symbol count: 41
% 0.70/0.88 distinct predicate count: 6
% 0.70/0.88 distinct function count: 26
% 0.70/0.88 distinct constant count: 9
% 0.70/0.88
% 0.70/0.88 ---------- no more Softie stats ----------
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88
% 0.70/0.88 =========== start of search ===========
% 0.70/0.89
% 0.70/0.89 -------- PROOF --------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 ----> UNIT CONFLICT at 0.48 sec ----> 512 [binary,511.1,68.1] {-} $F.
% 0.70/0.89
% 0.70/0.89 Length of proof is 2. Level of proof is 2.
% 0.70/0.89
% 0.70/0.89 ---------------- PROOF ----------------
% 0.70/0.89 % SZS status Theorem
% 0.70/0.89 % SZS output start Refutation
% 0.70/0.89
% 0.70/0.89 68 [] {+} -member(ordered_pair($c4,$c3),universal_class).
% 0.70/0.89 84 [] {-} member(unordered_pair(A,B),universal_class).
% 0.70/0.89 86,85 [] {-} singleton(A)=unordered_pair(A,A).
% 0.70/0.89 87 [] {-} ordered_pair(A,B)=unordered_pair(singleton(A),unordered_pair(A,singleton(B))).
% 0.70/0.89 88 [copy,87,demod,86,86,flip.1] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 0.70/0.89 511 [para_from,88.1.1,84.1.1] {-} member(ordered_pair(A,B),universal_class).
% 0.70/0.89 512 [binary,511.1,68.1] {-} $F.
% 0.70/0.89
% 0.70/0.89 % SZS output end Refutation
% 0.70/0.89 ------------ end of proof -------------
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89
% 0.70/0.89 Search stopped by max_proofs option.
% 0.70/0.89
% 0.70/0.89 ============ end of search ============
% 0.70/0.89
% 0.70/0.89 That finishes the proof of the theorem.
% 0.70/0.89
% 0.70/0.89 Process 29177 finished Mon Jul 11 09:22:10 2022
%------------------------------------------------------------------------------