TSTP Solution File: SET942+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET942+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:22:01 EDT 2022
% Result : Theorem 0.50s 0.70s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET942+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 20:21:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n014.cluster.edu,
% 0.13/0.35 Sun Jul 10 20:21:20 2022
% 0.13/0.35 The command was "./sos". The process ID is 27880.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.39
% 0.20/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 -------------- Softie stats --------------
% 0.20/0.39
% 0.20/0.39 UPDATE_STOP: 300
% 0.20/0.39 SFINDER_TIME_LIMIT: 2
% 0.20/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.39 number of clauses in intial UL: 11
% 0.20/0.39 number of clauses initially in problem: 18
% 0.20/0.39 percentage of clauses intially in UL: 61
% 0.20/0.39 percentage of distinct symbols occuring in initial UL: 84
% 0.20/0.39 percent of all initial clauses that are short: 100
% 0.20/0.39 absolute distinct symbol count: 13
% 0.20/0.39 distinct predicate count: 4
% 0.20/0.39 distinct function count: 5
% 0.20/0.39 distinct constant count: 4
% 0.20/0.39
% 0.20/0.39 ---------- no more Softie stats ----------
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39
% 0.20/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.39
% 0.20/0.39 Stopped by limit on number of solutions
% 0.20/0.39
% 0.20/0.39 =========== start of search ===========
% 0.50/0.70
% 0.50/0.70 -------- PROOF --------
% 0.50/0.70 % SZS status Theorem
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 3 [ 1 0 1199 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 Model 4 [ 1 1 2004 ] (0.00 seconds, 8413 Inserts)
% 0.50/0.70
% 0.50/0.70 Stopped by limit on insertions
% 0.50/0.70
% 0.50/0.70 Model 5 [ 2 1 523 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 ----> UNIT CONFLICT at 0.33 sec ----> 882 [binary,881.1,9.1] {-} $F.
% 0.50/0.70
% 0.50/0.70 Length of proof is 6. Level of proof is 5.
% 0.50/0.70
% 0.50/0.70 ---------------- PROOF ----------------
% 0.50/0.70 % SZS status Theorem
% 0.50/0.70 % SZS output start Refutation
% 0.50/0.70
% 0.50/0.70 2 [] {+} -subset(A,B)| -in(C,A)|in(C,B).
% 0.50/0.70 3 [] {+} subset(A,B)| -in($f1(A,B),B).
% 0.50/0.70 4 [] {+} A!=union(B)| -in(C,A)|in(C,$f2(B,A,C)).
% 0.50/0.70 5 [] {+} A!=union(B)| -in(C,A)|in($f2(B,A,C),B).
% 0.50/0.70 6 [] {+} A!=union(B)|in(C,A)| -in(C,D)| -in(D,B).
% 0.50/0.70 9 [] {+} -subset(union($c4),union($c3)).
% 0.50/0.70 12 [] {+} subset(A,B)|in($f1(A,B),A).
% 0.50/0.70 17 [] {+} subset($c4,$c3).
% 0.50/0.70 18 [] {+} A=A.
% 0.50/0.70 19 [hyper,12,9] {-} in($f1(union($c4),union($c3)),union($c4)).
% 0.50/0.70 70 [hyper,19,5,18] {-} in($f2($c4,union($c4),$f1(union($c4),union($c3))),$c4).
% 0.50/0.70 71 [hyper,19,4,18] {-} in($f1(union($c4),union($c3)),$f2($c4,union($c4),$f1(union($c4),union($c3)))).
% 0.50/0.70 96 [hyper,70,2,17] {+} in($f2($c4,union($c4),$f1(union($c4),union($c3))),$c3).
% 0.50/0.70 814 [hyper,71,6,18,96] {-} in($f1(union($c4),union($c3)),union($c3)).
% 0.50/0.70 881 [hyper,814,3] {-} subset(union($c4),union($c3)).
% 0.50/0.70 882 [binary,881.1,9.1] {-} $F.
% 0.50/0.70
% 0.50/0.70 % SZS output end Refutation
% 0.50/0.70 ------------ end of proof -------------
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Search stopped by max_proofs option.
% 0.50/0.70
% 0.50/0.70 ============ end of search ============
% 0.50/0.70
% 0.50/0.70 ----------- soft-scott stats ----------
% 0.50/0.70
% 0.50/0.70 true clauses given 7 (29.2%)
% 0.50/0.70 false clauses given 17
% 0.50/0.70
% 0.50/0.70 FALSE TRUE
% 0.50/0.70 12 0 1
% 0.50/0.70 13 0 1
% 0.50/0.70 14 0 4
% 0.50/0.70 15 1 1
% 0.50/0.70 16 4 3
% 0.50/0.70 17 3 5
% 0.50/0.70 18 2 4
% 0.50/0.70 19 6 6
% 0.50/0.70 20 5 18
% 0.50/0.70 21 9 9
% 0.50/0.70 22 11 25
% 0.50/0.70 23 5 26
% 0.50/0.70 24 23 39
% 0.50/0.70 25 20 52
% 0.50/0.70 26 16 24
% 0.50/0.70 27 39 39
% 0.50/0.70 28 18 39
% 0.50/0.70 29 1 40
% 0.50/0.70 30 24 32
% 0.50/0.70 31 9 24
% 0.50/0.70 32 9 17
% 0.50/0.70 33 4 13
% 0.50/0.70 34 10 17
% 0.50/0.70 35 6 9
% 0.50/0.70 36 8 13
% 0.50/0.70 37 4 7
% 0.50/0.70 38 1 3
% 0.50/0.70 39 3 15
% 0.50/0.70 40 4 6
% 0.50/0.70 41 2 5
% 0.50/0.70 42 1 5
% 0.50/0.70 43 0 4
% 0.50/0.70 44 0 7
% 0.50/0.70 45 1 14
% 0.50/0.70 46 1 6
% 0.50/0.70 47 1 3
% 0.50/0.70 48 2 6
% 0.50/0.70 49 2 3
% 0.50/0.70 50 0 2
% 0.50/0.70 51 0 9
% 0.50/0.70 52 1 2
% 0.50/0.70 53 0 3
% 0.50/0.70 54 0 2
% 0.50/0.70 56 0 2
% 0.50/0.70 58 0 1
% 0.50/0.70 60 1 0
% 0.50/0.70 tot: 257 566 (68.8% true)
% 0.50/0.70
% 0.50/0.70
% 0.50/0.70 Model 5 [ 2 1 523 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.70
% 0.50/0.70 That finishes the proof of the theorem.
% 0.50/0.70
% 0.50/0.70 Process 27880 finished Sun Jul 10 20:21:20 2022
%------------------------------------------------------------------------------