TSTP Solution File: SET621+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET621+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:31 EDT 2022
% Result : Theorem 0.19s 0.52s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET621+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n016.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 : Sat Jul 9 19:13:25 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 sandbox on n016.cluster.edu,
% 0.13/0.35 Sat Jul 9 19:13:25 2022
% 0.13/0.35 The command was "./sos". The process ID is 29774.
% 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=3.
% 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 27 during input processing: 0 [copy,27,flip.1] {-} union(A,B)=union(B,A).
% 0.13/0.35 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] {-} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.13/0.35 Following clause subsumed by 32 during input processing: 0 [copy,32,flip.1] {-} A=A.
% 0.13/0.35 32 back subsumes 19.
% 0.13/0.35 32 back subsumes 18.
% 0.13/0.35 Following clause subsumed by 23 during input processing: 0 [copy,33,flip.1] {-} difference(difference(A,B),C)=difference(A,union(B,C)).
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 16
% 0.13/0.38 number of clauses initially in problem: 28
% 0.13/0.38 percentage of clauses intially in UL: 57
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 11
% 0.13/0.38 distinct predicate count: 3
% 0.13/0.38 distinct function count: 5
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.19/0.52
% 0.19/0.52 -------- PROOF --------
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.52
% 0.19/0.52 Stopped by limit on number of solutions
% 0.19/0.52
% 0.19/0.52 Model 4 [ 1 0 263 ] (0.00 seconds, 151456 Inserts)
% 0.19/0.52
% 0.19/0.52 ----> UNIT CONFLICT at 0.14 sec ----> 199 [binary,198.1,32.1] {+} $F.
% 0.19/0.52
% 0.19/0.52 Length of proof is 6. Level of proof is 3.
% 0.19/0.52
% 0.19/0.52 ---------------- PROOF ----------------
% 0.19/0.52 % SZS status Theorem
% 0.19/0.52 % SZS output start Refutation
% 0.19/0.52
% 0.19/0.52 15 [] {-} difference(symmetric_difference($c3,$c2),$c1)!=union(difference($c3,union($c2,$c1)),difference($c2,union($c3,$c1))).
% 0.19/0.52 16 [copy,15,flip.1] {+} union(difference($c3,union($c2,$c1)),difference($c2,union($c3,$c1)))!=difference(symmetric_difference($c3,$c2),$c1).
% 0.19/0.52 20 [] {-} symmetric_difference(A,B)=union(difference(A,B),difference(B,A)).
% 0.19/0.52 22,21 [copy,20,flip.1] {-} union(difference(A,B),difference(B,A))=symmetric_difference(A,B).
% 0.19/0.52 23 [] {-} difference(difference(A,B),C)=difference(A,union(B,C)).
% 0.19/0.52 24 [] {-} difference(union(A,B),C)=union(difference(A,C),difference(B,C)).
% 0.19/0.52 25 [copy,24,flip.1] {-} union(difference(A,B),difference(C,B))=difference(union(A,C),B).
% 0.19/0.52 32 [] {+} A=A.
% 0.19/0.52 33 [copy,23,flip.1] {+} difference(A,union(B,C))=difference(difference(A,B),C).
% 0.19/0.52 76,75 [para_into,25.1.1.1,23.1.1] {-} union(difference(A,union(B,C)),difference(D,C))=difference(union(difference(A,B),D),C).
% 0.19/0.52 198 [para_from,33.1.1,16.1.1.2,demod,76,22] {-} difference(symmetric_difference($c3,$c2),$c1)!=difference(symmetric_difference($c3,$c2),$c1).
% 0.19/0.52 199 [binary,198.1,32.1] {+} $F.
% 0.19/0.52
% 0.19/0.52 % SZS output end Refutation
% 0.19/0.52 ------------ end of proof -------------
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Search stopped by max_proofs option.
% 0.19/0.52
% 0.19/0.52 ============ end of search ============
% 0.19/0.52
% 0.19/0.52 ----------- soft-scott stats ----------
% 0.19/0.52
% 0.19/0.52 true clauses given 3 (27.3%)
% 0.19/0.52 false clauses given 8
% 0.19/0.52
% 0.19/0.52 FALSE TRUE
% 0.19/0.52 7 0 2
% 0.19/0.52 9 0 1
% 0.19/0.52 10 0 3
% 0.19/0.52 11 0 3
% 0.19/0.52 12 4 4
% 0.19/0.52 13 2 1
% 0.19/0.52 14 4 1
% 0.19/0.52 15 7 5
% 0.19/0.52 16 1 0
% 0.19/0.52 17 4 4
% 0.19/0.52 18 4 2
% 0.19/0.52 19 11 1
% 0.19/0.52 20 2 0
% 0.19/0.52 21 16 4
% 0.19/0.52 22 6 3
% 0.19/0.52 24 1 3
% 0.19/0.52 25 4 4
% 0.19/0.52 26 2 0
% 0.19/0.52 27 5 11
% 0.19/0.52 29 6 2
% 0.19/0.52 31 0 2
% 0.19/0.52 35 2 0
% 0.19/0.52 47 1 0
% 0.19/0.52 tot: 82 56 (40.6% true)
% 0.19/0.52
% 0.19/0.52
% 0.19/0.52 Model 4 [ 1 -9 263 ] (0.00 seconds, 151456 Inserts)
% 0.19/0.52
% 0.19/0.52 That finishes the proof of the theorem.
% 0.19/0.52
% 0.19/0.52 Process 29774 finished Sat Jul 9 19:13:25 2022
%------------------------------------------------------------------------------