TSTP Solution File: SET929+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET929+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:21:56 EDT 2022
% Result : Theorem 0.37s 0.61s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET929+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sat Jul 9 21:46:21 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n006.cluster.edu,
% 0.12/0.36 Sat Jul 9 21:46:21 2022
% 0.12/0.36 The command was "./sos". The process ID is 9087.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.36 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/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: 10
% 0.19/0.38 number of clauses initially in problem: 17
% 0.19/0.38 percentage of clauses intially in UL: 58
% 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: 2
% 0.19/0.38 distinct constant count: 6
% 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.37/0.61
% 0.37/0.61 -------- PROOF --------
% 0.37/0.61 % SZS status Theorem
% 0.37/0.61 % SZS output start Refutation
% 0.37/0.61
% 0.37/0.61 Model 2 [ 27 1 5013 ] (0.00 seconds, 31601 Inserts)
% 0.37/0.61
% 0.37/0.61 Stopped by limit on insertions
% 0.37/0.61
% 0.37/0.61 Model 3 [ 28 12 234795 ] (0.00 seconds, 250000 Inserts)
% 0.37/0.61
% 0.37/0.61 -----> EMPTY CLAUSE at 0.23 sec ----> 51 [back_demod,8,demod,50,unit_del,17,36,45] {-} $F.
% 0.37/0.61
% 0.37/0.61 Length of proof is 6. Level of proof is 4.
% 0.37/0.61
% 0.37/0.61 ---------------- PROOF ----------------
% 0.37/0.61 % SZS status Theorem
% 0.37/0.61 % SZS output start Refutation
% 0.37/0.61
% 0.37/0.61 3 [] {+} set_difference(A,B)!=empty_set|subset(A,B).
% 0.37/0.61 4 [] {+} set_difference(A,B)=empty_set| -subset(A,B).
% 0.37/0.61 5 [] {+} -subset(unordered_pair(A,B),C)|in(A,C).
% 0.37/0.61 6 [] {+} -subset(unordered_pair(A,B),C)|in(B,C).
% 0.37/0.61 7 [] {+} subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 0.37/0.61 8 [] {+} set_difference(unordered_pair($c5,$c4),$c3)!=empty_set| -in($c5,$c3)| -in($c4,$c3).
% 0.37/0.61 15 [] {-} set_difference(unordered_pair($c5,$c4),$c3)=empty_set|in($c5,$c3).
% 0.37/0.61 16 [] {-} set_difference(unordered_pair($c5,$c4),$c3)=empty_set|in($c4,$c3).
% 0.37/0.61 17 [] {+} A=A.
% 0.37/0.61 32 [para_from,15.1.1,3.1.1,unit_del,17] {-} subset(unordered_pair($c5,$c4),$c3)|in($c5,$c3).
% 0.37/0.61 36 [hyper,32,5,factor_simp] {+} in($c5,$c3).
% 0.37/0.61 42 [para_from,16.1.1,3.1.1,unit_del,17] {-} subset(unordered_pair($c5,$c4),$c3)|in($c4,$c3).
% 0.37/0.61 45 [hyper,42,6,factor_simp] {+} in($c4,$c3).
% 0.37/0.61 47 [hyper,45,7,36] {-} subset(unordered_pair($c5,$c4),$c3).
% 0.37/0.61 50,49 [hyper,47,4] {-} set_difference(unordered_pair($c5,$c4),$c3)=empty_set.
% 0.37/0.61 51 [back_demod,8,demod,50,unit_del,17,36,45] {-} $F.
% 0.37/0.61
% 0.37/0.61 % SZS output end Refutation
% 0.37/0.61 ------------ end of proof -------------
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Search stopped by max_proofs option.
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Search stopped by max_proofs option.
% 0.37/0.61
% 0.37/0.61 ============ end of search ============
% 0.37/0.61
% 0.37/0.61 ----------- soft-scott stats ----------
% 0.37/0.61
% 0.37/0.61 true clauses given 5 (25.0%)
% 0.37/0.61 false clauses given 15
% 0.37/0.61
% 0.37/0.61 FALSE TRUE
% 0.37/0.61 5 1 1
% 0.37/0.61 7 1 0
% 0.37/0.61 9 2 0
% 0.37/0.61 13 0 1
% 0.37/0.61 tot: 4 2 (33.3% true)
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Model 3 [ 28 12 234795 ] (0.00 seconds, 250000 Inserts)
% 0.37/0.61
% 0.37/0.61 That finishes the proof of the theorem.
% 0.37/0.61
% 0.37/0.61 Process 9087 finished Sat Jul 9 21:46:21 2022
%------------------------------------------------------------------------------