TSTP Solution File: SEU230+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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 14:27:57 EDT 2022
% Result : Theorem 0.49s 0.67s
% Output : Refutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU230+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jun 18 20:00:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n006.cluster.edu,
% 0.12/0.36 Sat Jun 18 20:00:55 2022
% 0.12/0.36 The command was "./sos". The process ID is 2005.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} empty(empty_set).
% 0.12/0.36 Following clause subsumed by 37 during input processing: 0 [] {-} empty(empty_set).
% 0.12/0.36 Following clause subsumed by 38 during input processing: 0 [] {-} relation(empty_set).
% 0.12/0.36 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.12/0.36 Following clause subsumed by 61 during input processing: 0 [copy,61,flip.1] {-} A=A.
% 0.12/0.36 61 back subsumes 30.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Failed to model usable list: disabling FINDER
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 25
% 0.19/0.43 number of clauses initially in problem: 62
% 0.19/0.43 percentage of clauses intially in UL: 40
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 56
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 25
% 0.19/0.43 distinct predicate count: 8
% 0.19/0.43 distinct function count: 6
% 0.19/0.43 distinct constant count: 11
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 0.49/0.67
% 0.49/0.67 -------- PROOF --------
% 0.49/0.67 % SZS status Theorem
% 0.49/0.67 % SZS output start Refutation
% 0.49/0.67
% 0.49/0.67 ----> UNIT CONFLICT at 0.28 sec ----> 2936 [binary,2935.1,62.1] {-} $F.
% 0.49/0.67
% 0.49/0.67 Length of proof is 3. Level of proof is 2.
% 0.49/0.67
% 0.49/0.67 ---------------- PROOF ----------------
% 0.49/0.67 % SZS status Theorem
% 0.49/0.67 % SZS output start Refutation
% 0.49/0.67
% 0.49/0.67 6 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.49/0.67 10 [] {+} A!=set_union2(B,C)|in(D,A)| -in(D,C).
% 0.49/0.67 19 [] {-} -in($c10,succ($c10)).
% 0.49/0.67 33,32 [] {-} succ(A)=set_union2(A,singleton(A)).
% 0.49/0.67 41,40 [] {-} set_union2(A,A)=A.
% 0.49/0.67 61 [] {-} A=A.
% 0.49/0.67 62 [back_demod,19,demod,33] {-} -in($c10,set_union2($c10,singleton($c10))).
% 0.49/0.67 628 [hyper,40,6,40,demod,41,41] {-} in(A,singleton(A)).
% 0.49/0.67 2935 [hyper,628,10,61] {-} in(A,set_union2(B,singleton(A))).
% 0.49/0.67 2936 [binary,2935.1,62.1] {-} $F.
% 0.49/0.67
% 0.49/0.67 % SZS output end Refutation
% 0.49/0.67 ------------ end of proof -------------
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67 Search stopped by max_proofs option.
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67 Search stopped by max_proofs option.
% 0.49/0.67
% 0.49/0.67 ============ end of search ============
% 0.49/0.67
% 0.49/0.67 That finishes the proof of the theorem.
% 0.49/0.67
% 0.49/0.67 Process 2005 finished Sat Jun 18 20:00:56 2022
%------------------------------------------------------------------------------