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