TSTP Solution File: SET617+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET617+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n012.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:29 EDT 2022
% Result : Theorem 0.18s 0.41s
% Output : Refutation 0.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET617+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n012.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 : Sun Jul 10 07:57:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox on n012.cluster.edu,
% 0.12/0.35 Sun Jul 10 07:57:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 3794.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} union(A,B)=union(B,A).
% 0.12/0.35 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] {-} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.12/0.35 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] {-} A=A.
% 0.12/0.35 29 back subsumes 13.
% 0.12/0.35 29 back subsumes 12.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 11
% 0.18/0.38 number of clauses initially in problem: 26
% 0.18/0.38 percentage of clauses intially in UL: 42
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 75
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 12
% 0.18/0.38 distinct predicate count: 4
% 0.18/0.38 distinct function count: 6
% 0.18/0.38 distinct constant count: 2
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.18/0.41
% 0.18/0.41 -------- PROOF --------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 Model 4 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 Stopped by limit on number of solutions
% 0.18/0.41
% 0.18/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 47 [binary,45.1,42.1] {-} $F.
% 0.18/0.41
% 0.18/0.41 Length of proof is 5. Level of proof is 3.
% 0.18/0.41
% 0.18/0.41 ---------------- PROOF ----------------
% 0.18/0.41 % SZS status Theorem
% 0.18/0.41 % SZS output start Refutation
% 0.18/0.41
% 0.18/0.41 11 [] {+} symmetric_difference($c1,empty_set)!=$c1|symmetric_difference(empty_set,$c1)!=$c1.
% 0.18/0.41 14 [] {-} symmetric_difference(A,B)=union(difference(A,B),difference(B,A)).
% 0.18/0.41 15 [copy,14,flip.1] {-} union(difference(A,B),difference(B,A))=symmetric_difference(A,B).
% 0.18/0.41 18,17 [] {+} union(A,empty_set)=A.
% 0.18/0.41 19 [] {+} difference(A,empty_set)=A.
% 0.18/0.41 22,21 [] {+} difference(empty_set,A)=empty_set.
% 0.18/0.41 23 [] {+} union(A,B)=union(B,A).
% 0.18/0.41 29 [] {+} A=A.
% 0.18/0.41 39,38 [para_from,19.1.1,15.1.1.2,demod,22] {-} union(empty_set,A)=symmetric_difference(empty_set,A).
% 0.18/0.41 41,40 [para_from,19.1.1,15.1.1.1,demod,22,18,flip.1] {-} symmetric_difference(A,empty_set)=A.
% 0.18/0.41 42 [back_demod,11,demod,41,unit_del,29] {+} symmetric_difference(empty_set,$c1)!=$c1.
% 0.18/0.41 45 [para_into,23.1.1,17.1.1,demod,39,flip.1] {-} symmetric_difference(empty_set,A)=A.
% 0.18/0.41 47 [binary,45.1,42.1] {-} $F.
% 0.18/0.41
% 0.18/0.41 % SZS output end Refutation
% 0.18/0.41 ------------ end of proof -------------
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Search stopped by max_proofs option.
% 0.18/0.41
% 0.18/0.41 ============ end of search ============
% 0.18/0.41
% 0.18/0.41 ----------- soft-scott stats ----------
% 0.18/0.41
% 0.18/0.41 true clauses given 1 (16.7%)
% 0.18/0.41 false clauses given 5
% 0.18/0.41
% 0.18/0.41 FALSE TRUE
% 0.18/0.41 3 0 1
% 0.18/0.41 5 1 1
% 0.18/0.41 6 1 0
% 0.18/0.41 7 2 0
% 0.18/0.41 8 0 1
% 0.18/0.41 11 0 3
% 0.18/0.41 13 0 2
% 0.18/0.41 19 2 0
% 0.18/0.41 25 2 0
% 0.18/0.41 tot: 8 8 (50.0% true)
% 0.18/0.41
% 0.18/0.41
% 0.18/0.41 Model 5 (0.00 seconds, 0 Inserts)
% 0.18/0.41
% 0.18/0.41 That finishes the proof of the theorem.
% 0.18/0.41
% 0.18/0.41 Process 3794 finished Sun Jul 10 07:57:43 2022
%------------------------------------------------------------------------------