TSTP Solution File: SEU148+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU148+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:09 EDT 2022
% Result : Theorem 0.21s 0.43s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU148+3 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n009.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 : Sun Jun 19 12:48:52 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox2 on n009.cluster.edu,
% 0.14/0.37 Sun Jun 19 12:48:52 2022
% 0.14/0.37 The command was "./sos". The process ID is 2292.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 formula_list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.37 clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: set(unit_deletion).
% 0.14/0.37 dependent: set(factor).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 Failed to model usable list: disabling FINDER
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 -------------- Softie stats --------------
% 0.21/0.43
% 0.21/0.43 UPDATE_STOP: 300
% 0.21/0.43 SFINDER_TIME_LIMIT: 2
% 0.21/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.43 number of clauses in intial UL: 11
% 0.21/0.43 number of clauses initially in problem: 17
% 0.21/0.43 percentage of clauses intially in UL: 64
% 0.21/0.43 percentage of distinct symbols occuring in initial UL: 90
% 0.21/0.43 percent of all initial clauses that are short: 100
% 0.21/0.43 absolute distinct symbol count: 11
% 0.21/0.43 distinct predicate count: 4
% 0.21/0.43 distinct function count: 2
% 0.21/0.43 distinct constant count: 5
% 0.21/0.43
% 0.21/0.43 ---------- no more Softie stats ----------
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43
% 0.21/0.43 =========== start of search ===========
% 0.21/0.43
% 0.21/0.43 -------- PROOF --------
% 0.21/0.43 % SZS status Theorem
% 0.21/0.43 % SZS output start Refutation
% 0.21/0.43
% 0.21/0.44 ----> UNIT CONFLICT at 0.03 sec ----> 62 [binary,60.1,10.1] {-} $F.
% 0.21/0.44
% 0.21/0.44 Length of proof is 3. Level of proof is 2.
% 0.21/0.44
% 0.21/0.44 ---------------- PROOF ----------------
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 % SZS output start Refutation
% 0.21/0.44
% 0.21/0.44 2 [] {+} A!=singleton(B)| -in(C,A)|C=B.
% 0.21/0.44 3 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.21/0.44 5 [] {+} singleton(A)!=empty_set.
% 0.21/0.44 6 [] {+} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 0.21/0.44 10 [] {+} $c4!=$c3.
% 0.21/0.44 16 [] {-} subset(singleton($c4),singleton($c3)).
% 0.21/0.44 17 [] {-} A=A.
% 0.21/0.44 47 [hyper,17,3,17] {-} in(A,singleton(A)).
% 0.21/0.44 49 [hyper,16,6,unit_del,5] {-} singleton($c4)=singleton($c3).
% 0.21/0.44 60 [hyper,49,2,47] {-} $c4=$c3.
% 0.21/0.44 62 [binary,60.1,10.1] {-} $F.
% 0.21/0.44
% 0.21/0.44 % SZS output end Refutation
% 0.21/0.44 ------------ end of proof -------------
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Search stopped by max_proofs option.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Search stopped by max_proofs option.
% 0.21/0.44
% 0.21/0.44 ============ end of search ============
% 0.21/0.44
% 0.21/0.44 That finishes the proof of the theorem.
% 0.21/0.44
% 0.21/0.44 Process 2292 finished Sun Jun 19 12:48:52 2022
%------------------------------------------------------------------------------