TSTP Solution File: SEU160+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.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:17 EDT 2022
% Result : Theorem 0.20s 0.43s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n006.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 07:52:25 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.20/0.37 ----- Otter 3.2, August 2001 -----
% 0.20/0.37 The process was started by sandbox2 on n006.cluster.edu,
% 0.20/0.37 Sun Jun 19 07:52:25 2022
% 0.20/0.37 The command was "./sos". The process ID is 4484.
% 0.20/0.37
% 0.20/0.37 set(prolog_style_variables).
% 0.20/0.37 set(auto).
% 0.20/0.37 dependent: set(auto1).
% 0.20/0.37 dependent: set(process_input).
% 0.20/0.37 dependent: clear(print_kept).
% 0.20/0.37 dependent: clear(print_new_demod).
% 0.20/0.37 dependent: clear(print_back_demod).
% 0.20/0.37 dependent: clear(print_back_sub).
% 0.20/0.37 dependent: set(control_memory).
% 0.20/0.37 dependent: assign(max_mem, 12000).
% 0.20/0.37 dependent: assign(pick_given_ratio, 4).
% 0.20/0.37 dependent: assign(stats_level, 1).
% 0.20/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.37 dependent: assign(sos_limit, 5000).
% 0.20/0.37 dependent: assign(max_weight, 60).
% 0.20/0.37 clear(print_given).
% 0.20/0.37
% 0.20/0.37 formula_list(usable).
% 0.20/0.37
% 0.20/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.20/0.37
% 0.20/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.37 clauses in usable.
% 0.20/0.37
% 0.20/0.37 dependent: set(knuth_bendix).
% 0.20/0.37 dependent: set(para_from).
% 0.20/0.37 dependent: set(para_into).
% 0.20/0.37 dependent: clear(para_from_right).
% 0.20/0.37 dependent: clear(para_into_right).
% 0.20/0.37 dependent: set(para_from_vars).
% 0.20/0.37 dependent: set(eq_units_both_ways).
% 0.20/0.37 dependent: set(dynamic_demod_all).
% 0.20/0.37 dependent: set(dynamic_demod).
% 0.20/0.37 dependent: set(order_eq).
% 0.20/0.37 dependent: set(back_demod).
% 0.20/0.37 dependent: set(lrpo).
% 0.20/0.37 dependent: set(hyper_res).
% 0.20/0.37 dependent: set(unit_deletion).
% 0.20/0.37 dependent: set(factor).
% 0.20/0.37
% 0.20/0.37 ------------> process usable:
% 0.20/0.37
% 0.20/0.37 ------------> process sos:
% 0.20/0.37 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} A=A.
% 0.20/0.37
% 0.20/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 6
% 0.20/0.41 number of clauses initially in problem: 11
% 0.20/0.41 percentage of clauses intially in UL: 54
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 88
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 9
% 0.20/0.41 distinct predicate count: 3
% 0.20/0.41 distinct function count: 1
% 0.20/0.41 distinct constant count: 5
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.20/0.43
% 0.20/0.43 -------- PROOF --------
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 -----> EMPTY CLAUSE at 0.03 sec ----> 193 [back_demod,5,demod,153,153,unit_del,9,14] {-} $F.
% 0.20/0.43
% 0.20/0.43 Length of proof is 7. Level of proof is 4.
% 0.20/0.43
% 0.20/0.43 ---------------- PROOF ----------------
% 0.20/0.43 % SZS status Theorem
% 0.20/0.43 % SZS output start Refutation
% 0.20/0.43
% 0.20/0.43 2 [] {-} -subset($c4,singleton($c3))|$c4!=empty_set.
% 0.20/0.43 3 [copy,2,flip.2] {+} -subset($c4,singleton($c3))|empty_set!=$c4.
% 0.20/0.43 4 [] {-} -subset($c4,singleton($c3))|$c4!=singleton($c3).
% 0.20/0.43 5 [copy,4,flip.2] {+} -subset($c4,singleton($c3))|singleton($c3)!=$c4.
% 0.20/0.43 6 [] {+} -subset(A,singleton(B))|A=empty_set|A=singleton(B).
% 0.20/0.43 7 [] {+} subset(A,singleton(B))|A!=empty_set.
% 0.20/0.43 9 [] {+} subset(A,A).
% 0.20/0.43 12 [] {-} subset($c4,singleton($c3))|$c4=empty_set|$c4=singleton($c3).
% 0.20/0.43 13 [copy,12,flip.2,flip.3] {-} subset($c4,singleton($c3))|empty_set=$c4|singleton($c3)=$c4.
% 0.20/0.43 14 [] {+} A=A.
% 0.20/0.43 15 [hyper,13,6,factor_simp,factor_simp] {-} empty_set=$c4|singleton($c3)=$c4.
% 0.20/0.43 75 [hyper,14,7] {+} subset(empty_set,singleton(A)).
% 0.20/0.43 145 [para_into,75.1.1,15.1.1] {-} subset($c4,singleton(A))|singleton($c3)=$c4.
% 0.20/0.43 153,152 [hyper,145,3,15,factor_simp] {-} singleton($c3)=$c4.
% 0.20/0.43 193 [back_demod,5,demod,153,153,unit_del,9,14] {-} $F.
% 0.20/0.43
% 0.20/0.43 % SZS output end Refutation
% 0.20/0.43 ------------ end of proof -------------
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Search stopped by max_proofs option.
% 0.20/0.43
% 0.20/0.43 ============ end of search ============
% 0.20/0.43
% 0.20/0.43 ----------- soft-scott stats ----------
% 0.20/0.43
% 0.20/0.43 true clauses given 5 (35.7%)
% 0.20/0.43 false clauses given 9
% 0.20/0.43
% 0.20/0.43 FALSE TRUE
% 0.20/0.43 6 0 2
% 0.20/0.43 7 0 2
% 0.20/0.43 8 0 1
% 0.20/0.43 9 0 1
% 0.20/0.43 10 0 3
% 0.20/0.43 11 0 2
% 0.20/0.43 12 0 3
% 0.20/0.43 13 2 5
% 0.20/0.43 14 2 6
% 0.20/0.43 15 3 2
% 0.20/0.43 16 1 6
% 0.20/0.43 17 0 9
% 0.20/0.43 18 0 11
% 0.20/0.43 19 3 13
% 0.20/0.43 20 5 9
% 0.20/0.43 21 2 8
% 0.20/0.43 22 1 9
% 0.20/0.43 23 4 4
% 0.20/0.43 24 0 3
% 0.20/0.43 25 0 1
% 0.20/0.43 tot: 23 100 (81.3% true)
% 0.20/0.43
% 0.20/0.43
% 0.20/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.43
% 0.20/0.43 That finishes the proof of the theorem.
% 0.20/0.43
% 0.20/0.43 Process 4484 finished Sun Jun 19 07:52:25 2022
%------------------------------------------------------------------------------