TSTP Solution File: SET654+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET654+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:50 EDT 2022
% Result : Theorem 0.91s 1.17s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET654+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n029.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.18/0.32 % WCLimit : 600
% 0.18/0.32 % DateTime : Sat Jul 9 16:12:00 EDT 2022
% 0.18/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n029.cluster.edu,
% 0.18/0.35 Sat Jul 9 16:12:00 2022
% 0.18/0.35 The command was "./sos". The process ID is 16310.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 72 during input processing: 0 [] {-} ilf_type($c4,set_type).
% 0.18/0.35 Following clause subsumed by 72 during input processing: 0 [] {-} ilf_type($c3,set_type).
% 0.18/0.35 Following clause subsumed by 72 during input processing: 0 [] {-} ilf_type($c2,set_type).
% 0.18/0.35 72 back subsumes 70.
% 0.18/0.35 72 back subsumes 64.
% 0.18/0.35 72 back subsumes 63.
% 0.18/0.35 72 back subsumes 57.
% 0.18/0.35 72 back subsumes 51.
% 0.18/0.35 72 back subsumes 40.
% 0.18/0.35 72 back subsumes 35.
% 0.18/0.35 72 back subsumes 32.
% 0.18/0.35 72 back subsumes 31.
% 0.18/0.35 72 back subsumes 29.
% 0.18/0.35 72 back subsumes 24.
% 0.18/0.35 72 back subsumes 20.
% 0.18/0.35 72 back subsumes 14.
% 0.18/0.35 72 back subsumes 13.
% 0.18/0.35 72 back subsumes 12.
% 0.18/0.35 72 back subsumes 9.
% 0.18/0.35 Following clause subsumed by 75 during input processing: 0 [copy,75,flip.1] {-} A=A.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.53/0.74
% 0.53/0.74 Model 1 (0.00 seconds, 0 Inserts)
% 0.53/0.74
% 0.53/0.74 Stopped by limit on number of solutions
% 0.53/0.74
% 0.53/0.74
% 0.53/0.74 -------------- Softie stats --------------
% 0.53/0.74
% 0.53/0.74 UPDATE_STOP: 300
% 0.53/0.74 SFINDER_TIME_LIMIT: 2
% 0.53/0.74 SHORT_CLAUSE_CUTOFF: 4
% 0.53/0.74 number of clauses in intial UL: 54
% 0.53/0.74 number of clauses initially in problem: 58
% 0.53/0.74 percentage of clauses intially in UL: 93
% 0.53/0.74 percentage of distinct symbols occuring in initial UL: 96
% 0.53/0.74 percent of all initial clauses that are short: 98
% 0.53/0.74 absolute distinct symbol count: 28
% 0.53/0.74 distinct predicate count: 6
% 0.53/0.74 distinct function count: 17
% 0.53/0.74 distinct constant count: 5
% 0.53/0.74
% 0.53/0.74 ---------- no more Softie stats ----------
% 0.53/0.74
% 0.53/0.74
% 0.53/0.74
% 0.53/0.74 Stopped by limit on insertions
% 0.53/0.74
% 0.53/0.74 =========== start of search ===========
% 0.91/1.17
% 0.91/1.17 -------- PROOF --------
% 0.91/1.17 % SZS status Theorem
% 0.91/1.17 % SZS output start Refutation
% 0.91/1.17
% 0.91/1.17 Stopped by limit on insertions
% 0.91/1.17
% 0.91/1.17 Stopped by limit on insertions
% 0.91/1.17
% 0.91/1.17 Model 2 [ 3 0 191 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.17
% 0.91/1.17 Stopped by limit on insertions
% 0.91/1.17
% 0.91/1.17 Model 3 [ 3 1 172 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.17
% 0.91/1.17 Stopped by limit on insertions
% 0.91/1.17
% 0.91/1.17 Model 4 [ 3 0 600 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.17
% 0.91/1.17 ----> UNIT CONFLICT at 0.80 sec ----> 97 [binary,96.1,41.1] {+} $F.
% 0.91/1.17
% 0.91/1.17 Length of proof is 3. Level of proof is 3.
% 0.91/1.17
% 0.91/1.17 ---------------- PROOF ----------------
% 0.91/1.17 % SZS status Theorem
% 0.91/1.17 % SZS output start Refutation
% 0.91/1.17
% 0.91/1.17 1 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -subset(A,B)| -subset(B,C)|subset(A,C).
% 0.91/1.17 3 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,relation_type(A,B))|subset(range_of(C),B).
% 0.91/1.17 4 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(C,A))| -subset(range_of(D),B)|ilf_type(D,relation_type(C,B)).
% 0.91/1.17 41 [] {+} -ilf_type($c1,relation_type($c2,$c3)).
% 0.91/1.17 72 [] {-} ilf_type(A,set_type).
% 0.91/1.17 73 [] {-} ilf_type($c1,relation_type($c2,$c4)).
% 0.91/1.17 74 [] {+} subset($c4,$c3).
% 0.91/1.17 88 [hyper,73,3,72,72] {+} subset(range_of($c1),$c4).
% 0.91/1.17 90 [hyper,74,1,72,72,72,88] {+} subset(range_of($c1),$c3).
% 0.91/1.17 96 [hyper,90,4,72,72,72,73] {-} ilf_type($c1,relation_type($c2,$c3)).
% 0.91/1.17 97 [binary,96.1,41.1] {+} $F.
% 0.91/1.17
% 0.91/1.17 % SZS output end Refutation
% 0.91/1.17 ------------ end of proof -------------
% 0.91/1.17
% 0.91/1.17
% 0.91/1.17 Search stopped by max_proofs option.
% 0.91/1.17
% 0.91/1.17
% 0.91/1.17 Search stopped by max_proofs option.
% 0.91/1.17
% 0.91/1.17 ============ end of search ============
% 0.91/1.17
% 0.91/1.17 ----------- soft-scott stats ----------
% 0.91/1.17
% 0.91/1.17 true clauses given 3 (33.3%)
% 0.91/1.17 false clauses given 6
% 0.91/1.17
% 0.91/1.17 FALSE TRUE
% 0.91/1.17 5 1 0
% 0.91/1.17 6 3 2
% 0.91/1.17 7 1 1
% 0.91/1.17 8 2 0
% 0.91/1.17 9 1 0
% 0.91/1.17 tot: 8 3 (27.3% true)
% 0.91/1.17
% 0.91/1.17
% 0.91/1.17 Model 4 [ 3 0 600 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.17
% 0.91/1.17 That finishes the proof of the theorem.
% 0.91/1.17
% 0.91/1.17 Process 16310 finished Sat Jul 9 16:12:01 2022
%------------------------------------------------------------------------------