TSTP Solution File: SET630+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:38 EDT 2022
% Result : Theorem 0.66s 0.85s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET630+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n023.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 19:25:10 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 n023.cluster.edu,
% 0.13/0.36 Sun Jul 10 19:25:10 2022
% 0.13/0.36 The command was "./sos". The process ID is 25857.
% 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=3.
% 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 25 during input processing: 0 [copy,25,flip.1] {-} union(A,B)=union(B,A).
% 0.13/0.36 Following clause subsumed by 26 during input processing: 0 [copy,26,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.13/0.36 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] {-} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.13/0.36 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] {-} A=A.
% 0.13/0.36 29 back subsumes 19.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.38
% 0.19/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.38
% 0.19/0.38 Stopped by limit on number of solutions
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 -------------- Softie stats --------------
% 0.19/0.38
% 0.19/0.38 UPDATE_STOP: 300
% 0.19/0.38 SFINDER_TIME_LIMIT: 2
% 0.19/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.38 number of clauses in intial UL: 18
% 0.19/0.38 number of clauses initially in problem: 27
% 0.19/0.38 percentage of clauses intially in UL: 66
% 0.19/0.38 percentage of distinct symbols occuring in initial UL: 91
% 0.19/0.38 percent of all initial clauses that are short: 100
% 0.19/0.38 absolute distinct symbol count: 12
% 0.19/0.38 distinct predicate count: 4
% 0.19/0.38 distinct function count: 6
% 0.19/0.38 distinct constant count: 2
% 0.19/0.38
% 0.19/0.38 ---------- no more Softie stats ----------
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38
% 0.19/0.38 =========== start of search ===========
% 0.66/0.85
% 0.66/0.85 -------- PROOF --------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 2 (0.00 seconds, 0 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Model 3 (0.00 seconds, 0 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Model 4 (0.00 seconds, 0 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 Model 5 [ 9 1 163 ] (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Model 6 (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Model 7 (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Model 8 (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 Stopped by limit on number of solutions
% 0.66/0.85
% 0.66/0.85 Stopped by limit on insertions
% 0.66/0.85
% 0.66/0.85 ----> UNIT CONFLICT at 0.46 sec ----> 183 [binary,182.1,58.1] {+} $F.
% 0.66/0.85
% 0.66/0.85 Length of proof is 9. Level of proof is 6.
% 0.66/0.85
% 0.66/0.85 ---------------- PROOF ----------------
% 0.66/0.85 % SZS status Theorem
% 0.66/0.85 % SZS output start Refutation
% 0.66/0.85
% 0.66/0.85 1 [] {+} -intersect(A,union(B,C))|intersect(A,B)|intersect(A,C).
% 0.66/0.85 10 [] {+} -disjoint(A,B)| -intersect(A,B).
% 0.66/0.85 11 [] {+} -intersect(A,B)|intersect(B,A).
% 0.66/0.85 15 [] {+} -disjoint(intersection($c2,$c1),symmetric_difference($c2,$c1)).
% 0.66/0.85 20 [] {-} symmetric_difference(A,B)=union(difference(A,B),difference(B,A)).
% 0.66/0.85 21 [copy,20,flip.1] {-} union(difference(A,B),difference(B,A))=symmetric_difference(A,B).
% 0.66/0.85 23 [] {+} disjoint(intersection(A,B),difference(A,B)).
% 0.66/0.85 24 [] {-} disjoint(A,B)|intersect(A,B).
% 0.66/0.85 26 [] {+} intersection(A,B)=intersection(B,A).
% 0.66/0.85 27 [] {+} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.66/0.85 36 [para_from,21.1.1,1.1.2] {-} -intersect(A,symmetric_difference(B,C))|intersect(A,difference(B,C))|intersect(A,difference(C,B)).
% 0.66/0.85 38 [hyper,24,11] {+} disjoint(A,B)|intersect(B,A).
% 0.66/0.85 55 [para_from,26.1.1,23.1.1] {+} disjoint(intersection(A,B),difference(B,A)).
% 0.66/0.85 58 [para_from,27.1.1,15.1.2] {+} -disjoint(intersection($c2,$c1),symmetric_difference($c1,$c2)).
% 0.66/0.85 120 [hyper,36,38] {-} intersect(A,difference(B,C))|intersect(A,difference(C,B))|disjoint(symmetric_difference(B,C),A).
% 0.66/0.85 137 [hyper,120,10,55] {-} intersect(intersection(A,B),difference(A,B))|disjoint(symmetric_difference(B,A),intersection(A,B)).
% 0.66/0.85 164 [hyper,137,10,23] {-} disjoint(symmetric_difference(A,B),intersection(B,A)).
% 0.66/0.85 182 [hyper,164,10,38] {-} disjoint(intersection(A,B),symmetric_difference(B,A)).
% 0.66/0.85 183 [binary,182.1,58.1] {+} $F.
% 0.66/0.85
% 0.66/0.85 % SZS output end Refutation
% 0.66/0.85 ------------ end of proof -------------
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Search stopped by max_proofs option.
% 0.66/0.85
% 0.66/0.85 ============ end of search ============
% 0.66/0.85
% 0.66/0.85 ----------- soft-scott stats ----------
% 0.66/0.85
% 0.66/0.85 true clauses given 4 (23.5%)
% 0.66/0.85 false clauses given 13
% 0.66/0.85
% 0.66/0.85 FALSE TRUE
% 0.66/0.85 7 0 3
% 0.66/0.85 8 0 10
% 0.66/0.85 10 0 4
% 0.66/0.85 11 0 4
% 0.66/0.85 12 0 4
% 0.66/0.85 14 2 2
% 0.66/0.85 15 3 2
% 0.66/0.85 17 4 6
% 0.66/0.85 19 2 4
% 0.66/0.85 21 4 24
% 0.66/0.85 22 0 8
% 0.66/0.85 23 0 1
% 0.66/0.85 24 0 7
% 0.66/0.85 25 2 4
% 0.66/0.85 27 0 6
% 0.66/0.85 29 6 6
% 0.66/0.85 32 4 4
% 0.66/0.85 39 0 8
% 0.66/0.85 43 0 6
% 0.66/0.85 tot: 27 113 (80.7% true)
% 0.66/0.85
% 0.66/0.85
% 0.66/0.85 Model 8 (0.00 seconds, 250000 Inserts)
% 0.66/0.85
% 0.66/0.85 That finishes the proof of the theorem.
% 0.66/0.85
% 0.66/0.85 Process 25857 finished Sun Jul 10 19:25:10 2022
%------------------------------------------------------------------------------