TSTP Solution File: SET799+4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET799+4 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:20:44 EDT 2022
% Result : Theorem 0.40s 0.58s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SET799+4 : TPTP v8.1.0. Released v3.2.0.
% 0.13/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 07:21:23 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.38 ----- Otter 3.2, August 2001 -----
% 0.14/0.38 The process was started by sandbox2 on n021.cluster.edu,
% 0.14/0.38 Mon Jul 11 07:21:23 2022
% 0.14/0.38 The command was "./sos". The process ID is 28773.
% 0.14/0.38
% 0.14/0.38 set(prolog_style_variables).
% 0.14/0.38 set(auto).
% 0.14/0.38 dependent: set(auto1).
% 0.14/0.38 dependent: set(process_input).
% 0.14/0.38 dependent: clear(print_kept).
% 0.14/0.38 dependent: clear(print_new_demod).
% 0.14/0.38 dependent: clear(print_back_demod).
% 0.14/0.38 dependent: clear(print_back_sub).
% 0.14/0.38 dependent: set(control_memory).
% 0.14/0.38 dependent: assign(max_mem, 12000).
% 0.14/0.38 dependent: assign(pick_given_ratio, 4).
% 0.14/0.38 dependent: assign(stats_level, 1).
% 0.14/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.38 dependent: assign(sos_limit, 5000).
% 0.14/0.38 dependent: assign(max_weight, 60).
% 0.14/0.38 clear(print_given).
% 0.14/0.38
% 0.14/0.38 formula_list(usable).
% 0.14/0.38
% 0.14/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=7.
% 0.14/0.38
% 0.14/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.38 clauses in usable.
% 0.14/0.38
% 0.14/0.38 dependent: set(knuth_bendix).
% 0.14/0.38 dependent: set(para_from).
% 0.14/0.38 dependent: set(para_into).
% 0.14/0.38 dependent: clear(para_from_right).
% 0.14/0.38 dependent: clear(para_into_right).
% 0.14/0.38 dependent: set(para_from_vars).
% 0.14/0.38 dependent: set(eq_units_both_ways).
% 0.14/0.38 dependent: set(dynamic_demod_all).
% 0.14/0.38 dependent: set(dynamic_demod).
% 0.14/0.38 dependent: set(order_eq).
% 0.14/0.38 dependent: set(back_demod).
% 0.14/0.38 dependent: set(lrpo).
% 0.14/0.38 dependent: set(hyper_res).
% 0.14/0.38 dependent: set(unit_deletion).
% 0.14/0.38 dependent: set(factor).
% 0.14/0.38
% 0.14/0.38 ------------> process usable:
% 0.14/0.38
% 0.14/0.38 ------------> process sos:
% 0.14/0.38 Following clause subsumed by 151 during input processing: 0 [copy,151,flip.1] {-} A=A.
% 0.14/0.38 151 back subsumes 119.
% 0.14/0.38
% 0.14/0.38 ======= end of input processing =======
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 Failed to model usable list: disabling FINDER
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 -------------- Softie stats --------------
% 0.22/0.48
% 0.22/0.48 UPDATE_STOP: 300
% 0.22/0.48 SFINDER_TIME_LIMIT: 2
% 0.22/0.48 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.48 number of clauses in intial UL: 117
% 0.22/0.48 number of clauses initially in problem: 148
% 0.22/0.48 percentage of clauses intially in UL: 79
% 0.22/0.48 percentage of distinct symbols occuring in initial UL: 93
% 0.22/0.48 percent of all initial clauses that are short: 100
% 0.22/0.48 absolute distinct symbol count: 49
% 0.22/0.48 distinct predicate count: 15
% 0.22/0.48 distinct function count: 27
% 0.22/0.48 distinct constant count: 7
% 0.22/0.48
% 0.22/0.48 ---------- no more Softie stats ----------
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48
% 0.22/0.48 =========== start of search ===========
% 0.40/0.58
% 0.40/0.58 -------- PROOF --------
% 0.40/0.58 % SZS status Theorem
% 0.40/0.58 % SZS output start Refutation
% 0.40/0.58
% 0.40/0.58 ----> UNIT CONFLICT at 0.18 sec ----> 1173 [binary,1172.1,113.1] {-} $F.
% 0.40/0.58
% 0.40/0.58 Length of proof is 4. Level of proof is 3.
% 0.40/0.58
% 0.40/0.58 ---------------- PROOF ----------------
% 0.40/0.58 % SZS status Theorem
% 0.40/0.58 % SZS output start Refutation
% 0.40/0.58
% 0.40/0.58 1 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.40/0.58 77 [] {+} -upper_bound(A,B,C)| -member(D,C)|apply(B,D,A).
% 0.40/0.58 101 [] {+} -least_upper_bound(A,B,C,D)|member(A,B).
% 0.40/0.58 102 [] {+} -least_upper_bound(A,B,C,D)|upper_bound(A,C,B).
% 0.40/0.58 113 [] {+} -apply($c6,$c2,$c1).
% 0.40/0.58 148 [] {-} subset($c4,$c3).
% 0.40/0.58 149 [] {-} least_upper_bound($c2,$c4,$c6,$c5).
% 0.40/0.58 150 [] {-} least_upper_bound($c1,$c3,$c6,$c5).
% 0.40/0.58 610 [hyper,149,101] {-} member($c2,$c4).
% 0.40/0.58 748 [hyper,610,1,148] {-} member($c2,$c3).
% 0.40/0.58 988 [hyper,150,102] {-} upper_bound($c1,$c6,$c3).
% 0.40/0.58 1172 [hyper,988,77,748] {-} apply($c6,$c2,$c1).
% 0.40/0.58 1173 [binary,1172.1,113.1] {-} $F.
% 0.40/0.58
% 0.40/0.58 % SZS output end Refutation
% 0.40/0.58 ------------ end of proof -------------
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 Search stopped by max_proofs option.
% 0.40/0.58
% 0.40/0.58
% 0.40/0.58 Search stopped by max_proofs option.
% 0.40/0.58
% 0.40/0.58 ============ end of search ============
% 0.40/0.58
% 0.40/0.58 That finishes the proof of the theorem.
% 0.40/0.58
% 0.40/0.58 Process 28773 finished Mon Jul 11 07:21:23 2022
%------------------------------------------------------------------------------