TSTP Solution File: SET662+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:19:53 EDT 2022
% Result : Theorem 3.52s 3.70s
% Output : Refutation 3.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET662+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n003.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 03:38:59 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox on n003.cluster.edu,
% 0.14/0.36 Sun Jul 10 03:38:59 2022
% 0.14/0.36 The command was "./sos". The process ID is 9310.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 formula_list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.14/0.36
% 0.14/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.14/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.14/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.14/0.36 clauses in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(knuth_bendix).
% 0.14/0.36 dependent: set(para_from).
% 0.14/0.36 dependent: set(para_into).
% 0.14/0.36 dependent: clear(para_from_right).
% 0.14/0.36 dependent: clear(para_into_right).
% 0.14/0.36 dependent: set(para_from_vars).
% 0.14/0.36 dependent: set(eq_units_both_ways).
% 0.14/0.36 dependent: set(dynamic_demod_all).
% 0.14/0.36 dependent: set(dynamic_demod).
% 0.14/0.36 dependent: set(order_eq).
% 0.14/0.36 dependent: set(back_demod).
% 0.14/0.36 dependent: set(lrpo).
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36 Following clause subsumed by 67 during input processing: 0 [] {-} ilf_type($c2,set_type).
% 0.14/0.36 Following clause subsumed by 67 during input processing: 0 [] {-} ilf_type($c1,set_type).
% 0.14/0.36 67 back subsumes 63.
% 0.14/0.36 67 back subsumes 57.
% 0.14/0.36 67 back subsumes 56.
% 0.14/0.36 67 back subsumes 51.
% 0.14/0.36 67 back subsumes 42.
% 0.14/0.36 67 back subsumes 36.
% 0.14/0.36 67 back subsumes 31.
% 0.14/0.36 67 back subsumes 28.
% 0.14/0.36 67 back subsumes 27.
% 0.14/0.36 67 back subsumes 23.
% 0.14/0.36 67 back subsumes 19.
% 0.14/0.36 67 back subsumes 16.
% 0.14/0.36 67 back subsumes 11.
% 0.14/0.36 67 back subsumes 6.
% 0.14/0.36 Following clause subsumed by 68 during input processing: 0 [copy,68,flip.1] {-} A=A.
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.14/0.40
% 0.14/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 -------------- Softie stats --------------
% 0.14/0.40
% 0.14/0.40 UPDATE_STOP: 300
% 0.14/0.40 SFINDER_TIME_LIMIT: 2
% 0.14/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.40 number of clauses in intial UL: 49
% 0.14/0.40 number of clauses initially in problem: 53
% 0.14/0.40 percentage of clauses intially in UL: 92
% 0.14/0.40 percentage of distinct symbols occuring in initial UL: 96
% 0.14/0.40 percent of all initial clauses that are short: 98
% 0.14/0.40 absolute distinct symbol count: 26
% 0.14/0.40 distinct predicate count: 7
% 0.14/0.40 distinct function count: 15
% 0.14/0.40 distinct constant count: 4
% 0.14/0.40
% 0.14/0.40 ---------- no more Softie stats ----------
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40
% 0.14/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.40
% 0.14/0.40 Stopped by limit on number of solutions
% 0.14/0.40
% 0.14/0.40 =========== start of search ===========
% 3.52/3.70
% 3.52/3.70 -------- PROOF --------
% 3.52/3.70 % SZS status Theorem
% 3.52/3.70 % SZS output start Refutation
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 3 [ 2 1 1373 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 4 [ 3 0 1155 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 5 [ 3 1 3420 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 6 [ 2 1 29611 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 7 [ 8 1 8428 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 8 [ 8 0 5150 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 9 [ 4 1 1175 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 10 [ 2 0 4536 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 11 [ 14 1 5402 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 12 [ 23 0 192 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 13 [ 12 1 1026 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 14 [ 2 1 7822 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 15 [ 25 1 1659 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 16 [ 33 0 754 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 17 [ 20 1 944 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 18 [ 2 1 1820 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 19 [ 28 0 1417 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 20 [ 21 0 180 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 21 [ 5 1 1058 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Stopped by limit on insertions
% 3.52/3.70
% 3.52/3.70 Model 22 [ 17 1 3293 ] (0.00 seconds, 250000 Inserts)
% 3.52/3.70
% 3.52/3.70 ----> UNIT CONFLICT at 3.32 sec ----> 941 [binary,940.1,37.1] {-} $F.
% 3.52/3.70
% 3.52/3.70 Length of proof is 6. Level of proof is 6.
% 3.52/3.70
% 3.52/3.70 ---------------- PROOF ----------------
% 3.52/3.70 % SZS status Theorem
% 3.52/3.70 % SZS output start Refutation
% 3.52/3.70
% 3.52/3.70 2 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,subset_type(cross_product(A,B)))|ilf_type(C,relation_type(A,B)).
% 3.53/3.70 8 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)|ilf_type(B,subset_type(A))| -ilf_type(B,member_type(power_set(A))).
% 3.53/3.70 15 [] {+} -ilf_type(A,set_type)| -empty(A)| -ilf_type(B,set_type)| -member(B,A).
% 3.53/3.70 20 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)|member(A,power_set(B))|member($f5(A,B),A).
% 3.53/3.70 22 [] {+} -ilf_type(A,set_type)| -empty(power_set(A)).
% 3.53/3.70 25 [] {+} -ilf_type(A,set_type)|empty(B)| -ilf_type(B,set_type)|ilf_type(A,member_type(B))| -member(A,B).
% 3.53/3.70 37 [] {+} -ilf_type(empty_set,relation_type($c2,$c1)).
% 3.53/3.70 65 [] {+} empty(empty_set).
% 3.53/3.70 67 [] {-} ilf_type(A,set_type).
% 3.53/3.70 75 [hyper,67,20,67] {+} member(A,power_set(B))|member($f5(A,B),A).
% 3.53/3.70 116 [hyper,75,15,67,65,67] {-} member(empty_set,power_set(A)).
% 3.53/3.70 123 [hyper,116,25,67,67] {+} empty(power_set(A))|ilf_type(empty_set,member_type(power_set(A))).
% 3.53/3.70 937 [hyper,123,22,67] {-} ilf_type(empty_set,member_type(power_set(A))).
% 3.53/3.70 938 [hyper,937,8,67,67] {+} ilf_type(empty_set,subset_type(A)).
% 3.53/3.70 940 [hyper,938,2,67,67] {-} ilf_type(empty_set,relation_type(A,B)).
% 3.53/3.70 941 [binary,940.1,37.1] {-} $F.
% 3.53/3.70
% 3.53/3.70 % SZS output end Refutation
% 3.53/3.70 ------------ end of proof -------------
% 3.53/3.70
% 3.53/3.70
% 3.53/3.70 Search stopped by max_proofs option.
% 3.53/3.70
% 3.53/3.70
% 3.53/3.70 Search stopped by max_proofs option.
% 3.53/3.70
% 3.53/3.70 ============ end of search ============
% 3.53/3.70
% 3.53/3.70 ----------- soft-scott stats ----------
% 3.53/3.70
% 3.53/3.70 true clauses given 12 (21.8%)
% 3.53/3.70 false clauses given 43
% 3.53/3.70
% 3.53/3.70 FALSE TRUE
% 3.53/3.70 8 0 1
% 3.53/3.70 9 1 2
% 3.53/3.70 10 3 4
% 3.53/3.70 11 1 2
% 3.53/3.70 12 5 5
% 3.53/3.70 13 5 3
% 3.53/3.70 14 10 6
% 3.53/3.70 15 7 8
% 3.53/3.70 16 7 12
% 3.53/3.70 17 8 12
% 3.53/3.70 18 6 10
% 3.53/3.70 19 4 14
% 3.53/3.70 20 3 15
% 3.53/3.70 21 4 17
% 3.53/3.70 22 3 14
% 3.53/3.70 23 6 18
% 3.53/3.70 24 5 14
% 3.53/3.70 25 4 19
% 3.53/3.70 26 1 16
% 3.53/3.70 27 2 15
% 3.53/3.70 28 2 15
% 3.53/3.70 29 4 9
% 3.53/3.70 30 1 7
% 3.53/3.70 31 4 6
% 3.53/3.70 32 1 9
% 3.53/3.70 33 0 4
% 3.53/3.70 34 0 14
% 3.53/3.70 35 0 11
% 3.53/3.70 36 0 7
% 3.53/3.70 37 0 3
% 3.53/3.70 38 0 4
% 3.53/3.70 39 0 5
% 3.53/3.70 40 0 3
% 3.53/3.70 41 0 3
% 3.53/3.70 42 0 1
% 3.53/3.70 43 0 5
% 3.53/3.70 45 1 2
% 3.53/3.70 46 0 2
% 3.53/3.70 47 0 1
% 3.53/3.70 48 0 3
% 3.53/3.70 49 0 3
% 3.53/3.70 51 0 1
% 3.53/3.70 54 0 1
% 3.53/3.70 55 0 1
% 3.53/3.70 56 0 1
% 3.53/3.70 59 0 1
% 3.53/3.70 tot: 98 329 (77.0% true)
% 3.53/3.70
% 3.53/3.70
% 3.53/3.70 Model 22 [ 17 1 3293 ] (0.00 seconds, 250000 Inserts)
% 3.53/3.70
% 3.53/3.70 That finishes the proof of the theorem.
% 3.53/3.70
% 3.53/3.70 Process 9310 finished Sun Jul 10 03:39:02 2022
%------------------------------------------------------------------------------