TSTP Solution File: SEU189+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:33 EDT 2022
% Result : Theorem 0.20s 0.42s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12 % Command : sos-script %s
% 0.14/0.33 % Computer : n004.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Mon Jun 20 11:15:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35 ----- Otter 3.2, August 2001 -----
% 0.14/0.35 The process was started by sandbox2 on n004.cluster.edu,
% 0.14/0.35 Mon Jun 20 11:15:53 2022
% 0.14/0.35 The command was "./sos". The process ID is 388.
% 0.14/0.35
% 0.14/0.35 set(prolog_style_variables).
% 0.14/0.35 set(auto).
% 0.14/0.35 dependent: set(auto1).
% 0.14/0.35 dependent: set(process_input).
% 0.14/0.35 dependent: clear(print_kept).
% 0.14/0.35 dependent: clear(print_new_demod).
% 0.14/0.35 dependent: clear(print_back_demod).
% 0.14/0.35 dependent: clear(print_back_sub).
% 0.14/0.35 dependent: set(control_memory).
% 0.14/0.35 dependent: assign(max_mem, 12000).
% 0.14/0.35 dependent: assign(pick_given_ratio, 4).
% 0.14/0.35 dependent: assign(stats_level, 1).
% 0.14/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.35 dependent: assign(sos_limit, 5000).
% 0.14/0.35 dependent: assign(max_weight, 60).
% 0.14/0.35 clear(print_given).
% 0.14/0.35
% 0.14/0.35 formula_list(usable).
% 0.14/0.35
% 0.14/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.14/0.35
% 0.14/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.35 clauses in usable.
% 0.14/0.35
% 0.14/0.35 dependent: set(knuth_bendix).
% 0.14/0.35 dependent: set(para_from).
% 0.14/0.35 dependent: set(para_into).
% 0.14/0.35 dependent: clear(para_from_right).
% 0.14/0.35 dependent: clear(para_into_right).
% 0.14/0.35 dependent: set(para_from_vars).
% 0.14/0.35 dependent: set(eq_units_both_ways).
% 0.14/0.35 dependent: set(dynamic_demod_all).
% 0.14/0.35 dependent: set(dynamic_demod).
% 0.14/0.35 dependent: set(order_eq).
% 0.14/0.35 dependent: set(back_demod).
% 0.14/0.35 dependent: set(lrpo).
% 0.14/0.35 dependent: set(hyper_res).
% 0.14/0.35 dependent: set(unit_deletion).
% 0.14/0.35 dependent: set(factor).
% 0.14/0.35
% 0.14/0.35 ------------> process usable:
% 0.14/0.35
% 0.14/0.35 ------------> process sos:
% 0.14/0.35 Following clause subsumed by 26 during input processing: 0 [] {-} empty(empty_set).
% 0.14/0.35 Following clause subsumed by 34 during input processing: 0 [copy,34,flip.1] {-} A=A.
% 0.14/0.35 34 back subsumes 20.
% 0.14/0.35
% 0.14/0.35 ======= end of input processing =======
% 0.14/0.39
% 0.14/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 -------------- Softie stats --------------
% 0.14/0.39
% 0.14/0.39 UPDATE_STOP: 300
% 0.14/0.39 SFINDER_TIME_LIMIT: 2
% 0.14/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.39 number of clauses in intial UL: 19
% 0.14/0.39 number of clauses initially in problem: 33
% 0.14/0.39 percentage of clauses intially in UL: 57
% 0.14/0.39 percentage of distinct symbols occuring in initial UL: 78
% 0.14/0.39 percent of all initial clauses that are short: 100
% 0.14/0.39 absolute distinct symbol count: 14
% 0.14/0.39 distinct predicate count: 5
% 0.14/0.39 distinct function count: 3
% 0.14/0.39 distinct constant count: 6
% 0.14/0.39
% 0.14/0.39 ---------- no more Softie stats ----------
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39
% 0.14/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.39
% 0.14/0.39 Stopped by limit on number of solutions
% 0.14/0.39
% 0.14/0.39 =========== start of search ===========
% 0.20/0.42
% 0.20/0.42 -------- PROOF --------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 -----> EMPTY CLAUSE at 0.03 sec ----> 72 [back_demod,56,demod,71,52,71,50,unit_del,34,34] {-} $F.
% 0.20/0.42
% 0.20/0.42 Length of proof is 8. Level of proof is 5.
% 0.20/0.42
% 0.20/0.42 ---------------- PROOF ----------------
% 0.20/0.42 % SZS status Theorem
% 0.20/0.42 % SZS output start Refutation
% 0.20/0.42
% 0.20/0.42 6 [] {+} empty(A)| -relation(A)| -empty(relation_dom(A)).
% 0.20/0.42 7 [] {+} empty(A)| -relation(A)| -empty(relation_rng(A)).
% 0.20/0.42 14 [] {+} -empty(A)|A=B| -empty(B).
% 0.20/0.42 15 [] {+} -empty(A)|A=empty_set.
% 0.20/0.42 16 [] {+} relation_dom($c5)!=empty_set|relation_rng($c5)!=empty_set.
% 0.20/0.42 22 [] {+} empty($c1).
% 0.20/0.42 28 [] {+} relation($c5).
% 0.20/0.42 29 [] {+} relation_dom($c5)=empty_set|relation_rng($c5)=empty_set.
% 0.20/0.42 30 [] {+} relation_dom(empty_set)=empty_set.
% 0.20/0.42 32 [] {+} relation_rng(empty_set)=empty_set.
% 0.20/0.42 34 [] {+} A=A.
% 0.20/0.42 41,40 [hyper,22,15,flip.1] {+} empty_set=$c1.
% 0.20/0.42 50,49 [back_demod,32,demod,41,41] {+} relation_rng($c1)=$c1.
% 0.20/0.42 52,51 [back_demod,30,demod,41,41] {+} relation_dom($c1)=$c1.
% 0.20/0.42 53 [back_demod,29,demod,41,41] {-} relation_dom($c5)=$c1|relation_rng($c5)=$c1.
% 0.20/0.42 56 [back_demod,16,demod,41,41] {+} relation_dom($c5)!=$c1|relation_rng($c5)!=$c1.
% 0.20/0.42 63 [para_from,53.2.1,7.3.1,unit_del,28,22] {-} empty($c5)|relation_dom($c5)=$c1.
% 0.20/0.42 69 [para_from,63.2.1,6.3.1,unit_del,28,22,factor_simp] {-} empty($c5).
% 0.20/0.42 71,70 [hyper,69,14,22,flip.1] {-} $c5=$c1.
% 0.20/0.42 72 [back_demod,56,demod,71,52,71,50,unit_del,34,34] {-} $F.
% 0.20/0.42
% 0.20/0.42 % SZS output end Refutation
% 0.20/0.42 ------------ end of proof -------------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Search stopped by max_proofs option.
% 0.20/0.42
% 0.20/0.42 ============ end of search ============
% 0.20/0.42
% 0.20/0.42 ----------- soft-scott stats ----------
% 0.20/0.42
% 0.20/0.42 true clauses given 2 (25.0%)
% 0.20/0.42 false clauses given 6
% 0.20/0.42
% 0.20/0.42 FALSE TRUE
% 0.20/0.42 2 0 3
% 0.20/0.42 3 0 7
% 0.20/0.42 4 0 4
% 0.20/0.42 5 0 2
% 0.20/0.42 6 0 3
% 0.20/0.42 7 3 2
% 0.20/0.42 8 0 3
% 0.20/0.42 9 0 2
% 0.20/0.42 11 0 4
% 0.20/0.42 12 0 2
% 0.20/0.42 tot: 3 32 (91.4% true)
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 That finishes the proof of the theorem.
% 0.20/0.42
% 0.20/0.42 Process 388 finished Mon Jun 20 11:15:53 2022
%------------------------------------------------------------------------------