TSTP Solution File: SET679+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET679+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n013.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:01 EDT 2022
% Result : Theorem 2.61s 2.82s
% Output : Refutation 2.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET679+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n013.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun Jul 10 16:09:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n013.cluster.edu,
% 0.13/0.36 Sun Jul 10 16:09:14 2022
% 0.13/0.36 The command was "./sos". The process ID is 21024.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 88 during input processing: 0 [] {-} ilf_type($c2,set_type).
% 0.13/0.36 88 back subsumes 78.
% 0.13/0.36 88 back subsumes 72.
% 0.13/0.36 88 back subsumes 66.
% 0.13/0.36 88 back subsumes 65.
% 0.13/0.36 88 back subsumes 64.
% 0.13/0.36 88 back subsumes 58.
% 0.13/0.36 88 back subsumes 39.
% 0.13/0.36 88 back subsumes 35.
% 0.13/0.36 88 back subsumes 30.
% 0.13/0.36 88 back subsumes 25.
% 0.13/0.36 88 back subsumes 22.
% 0.13/0.36 88 back subsumes 21.
% 0.13/0.36 88 back subsumes 18.
% 0.13/0.36 88 back subsumes 16.
% 0.13/0.36 88 back subsumes 10.
% 0.13/0.36 Following clause subsumed by 89 during input processing: 0 [copy,89,flip.1] {-} A=A.
% 0.13/0.36 89 back subsumes 83.
% 0.13/0.36 89 back subsumes 62.
% 0.13/0.36 89 back subsumes 60.
% 0.13/0.36 89 back subsumes 59.
% 0.13/0.36 89 back subsumes 51.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.21/0.39
% 0.21/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.39
% 0.21/0.39 Stopped by limit on number of solutions
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 -------------- Softie stats --------------
% 0.21/0.39
% 0.21/0.39 UPDATE_STOP: 300
% 0.21/0.39 SFINDER_TIME_LIMIT: 2
% 0.21/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.39 number of clauses in intial UL: 63
% 0.21/0.39 number of clauses initially in problem: 68
% 0.21/0.39 percentage of clauses intially in UL: 92
% 0.21/0.39 percentage of distinct symbols occuring in initial UL: 92
% 0.21/0.39 percent of all initial clauses that are short: 100
% 0.21/0.39 absolute distinct symbol count: 26
% 0.21/0.39 distinct predicate count: 7
% 0.21/0.39 distinct function count: 14
% 0.21/0.39 distinct constant count: 5
% 0.21/0.39
% 0.21/0.39 ---------- no more Softie stats ----------
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39
% 0.21/0.39 =========== start of search ===========
% 2.61/2.82
% 2.61/2.82 -------- PROOF --------
% 2.61/2.82 % SZS status Theorem
% 2.61/2.82 % SZS output start Refutation
% 2.61/2.82
% 2.61/2.82 Model 2 (0.00 seconds, 0 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on number of solutions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 3 [ 1 0 3703 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 4 [ 3 1 334 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 5 [ 2 0 660 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 6 [ 3 0 353 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 7 [ 2 1 2172 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 8 [ 3 1 342 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 9 [ 2 0 788 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 10 [ 15 1 163 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 11 [ 4 0 155 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 12 [ 3 1 698 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 13 [ 10 1 329 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 14 [ 2 1 485 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 15 [ 2 0 4090 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 16 [ 9 0 443 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 17 [ 4 1 159 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 18 [ 9 1 590 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 19 [ 6 1 1160 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 Stopped by limit on insertions
% 2.61/2.82
% 2.61/2.82 Model 20 [ 5 0 971 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 ----> UNIT CONFLICT at 2.44 sec ----> 723 [binary,722.1,551.1] {-} $F.
% 2.61/2.82
% 2.61/2.82 Length of proof is 9. Level of proof is 4.
% 2.61/2.82
% 2.61/2.82 ---------------- PROOF ----------------
% 2.61/2.82 % SZS status Theorem
% 2.61/2.82 % SZS output start Refutation
% 2.61/2.82
% 2.61/2.82 3 [] {+} -ilf_type(A,set_type)| -member(A,empty_set).
% 2.61/2.82 6 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)|member(ordered_pair(B,C),identity_relation_of(A))| -member(B,A)|B!=C.
% 2.61/2.82 14 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)|not_equal(A,B)|A=B.
% 2.61/2.82 17 [] {+} -ilf_type(A,set_type)|empty(A)|member($f2(A),A).
% 2.61/2.82 43 [] {+} -empty($c2).
% 2.61/2.82 44 [] {+} -not_equal(identity_relation_of($c2),empty_set).
% 2.61/2.82 88 [] {-} ilf_type(A,set_type).
% 2.61/2.82 89 [] {+} A=A.
% 2.61/2.82 114 [hyper,88,17] {+} empty(A)|member($f2(A),A).
% 2.61/2.82 115 [hyper,88,14,88] {+} not_equal(A,B)|A=B.
% 2.61/2.82 260 [hyper,114,43] {+} member($f2($c2),$c2).
% 2.61/2.82 280,279 [hyper,115,44] {+} identity_relation_of($c2)=empty_set.
% 2.61/2.82 281 [back_demod,44,demod,280] {+} -not_equal(empty_set,empty_set).
% 2.61/2.82 369 [para_from,115.2.1,3.2.2,unit_del,88] {+} -member(A,B)|not_equal(empty_set,B).
% 2.61/2.82 551 [hyper,260,6,88,88,88,89,demod,280] {-} member(ordered_pair($f2($c2),$f2($c2)),empty_set).
% 2.61/2.82 717 [para_into,369.2.1,115.2.1] {-} -member(A,B)|not_equal(C,B)|not_equal(empty_set,C).
% 2.61/2.82 722 [factor,717.2.3,unit_del,281] {-} -member(A,empty_set).
% 2.61/2.82 723 [binary,722.1,551.1] {-} $F.
% 2.61/2.82
% 2.61/2.82 % SZS output end Refutation
% 2.61/2.82 ------------ end of proof -------------
% 2.61/2.82
% 2.61/2.82
% 2.61/2.82 Search stopped by max_proofs option.
% 2.61/2.82
% 2.61/2.82
% 2.61/2.82 Search stopped by max_proofs option.
% 2.61/2.82
% 2.61/2.82 ============ end of search ============
% 2.61/2.82
% 2.61/2.82 ----------- soft-scott stats ----------
% 2.61/2.82
% 2.61/2.82 true clauses given 14 (35.9%)
% 2.61/2.82 false clauses given 25
% 2.61/2.82
% 2.61/2.82 FALSE TRUE
% 2.61/2.82 5 1 1
% 2.61/2.82 6 0 8
% 2.61/2.82 7 3 11
% 2.61/2.82 8 7 13
% 2.61/2.82 9 21 18
% 2.61/2.82 10 10 6
% 2.61/2.82 11 18 4
% 2.61/2.82 12 37 7
% 2.61/2.82 13 12 5
% 2.61/2.82 14 12 6
% 2.61/2.82 15 21 20
% 2.61/2.82 16 14 14
% 2.61/2.82 17 6 1
% 2.61/2.82 18 21 1
% 2.61/2.82 19 15 0
% 2.61/2.82 20 6 0
% 2.61/2.82 21 1 0
% 2.61/2.82 22 8 0
% 2.61/2.82 23 8 1
% 2.61/2.82 26 4 0
% 2.61/2.82 27 4 0
% 2.61/2.82 tot: 229 116 (33.6% true)
% 2.61/2.82
% 2.61/2.82
% 2.61/2.82 Model 20 [ 5 0 971 ] (0.00 seconds, 250000 Inserts)
% 2.61/2.82
% 2.61/2.82 That finishes the proof of the theorem.
% 2.61/2.82
% 2.61/2.82 Process 21024 finished Sun Jul 10 16:09:17 2022
%------------------------------------------------------------------------------