TSTP Solution File: SET146+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET146+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:16:16 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET146+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.14 % Command : sos-script %s
% 0.13/0.35 % Computer : n029.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 00:55:31 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox2 on n029.cluster.edu,
% 0.13/0.37 Sun Jul 10 00:55:31 2022
% 0.13/0.37 The command was "./sos". The process ID is 29360.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 formula_list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.37
% 0.13/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.37 clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: set(unit_deletion).
% 0.13/0.37 dependent: set(factor).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} intersection(A,B)=intersection(B,A).
% 0.13/0.37 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} A=A.
% 0.13/0.37 23 back subsumes 17.
% 0.13/0.37 23 back subsumes 16.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.41
% 0.20/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 -------------- Softie stats --------------
% 0.20/0.41
% 0.20/0.41 UPDATE_STOP: 300
% 0.20/0.41 SFINDER_TIME_LIMIT: 2
% 0.20/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.41 number of clauses in intial UL: 15
% 0.20/0.41 number of clauses initially in problem: 21
% 0.20/0.41 percentage of clauses intially in UL: 71
% 0.20/0.41 percentage of distinct symbols occuring in initial UL: 90
% 0.20/0.41 percent of all initial clauses that are short: 100
% 0.20/0.41 absolute distinct symbol count: 10
% 0.20/0.41 distinct predicate count: 4
% 0.20/0.41 distinct function count: 4
% 0.20/0.41 distinct constant count: 2
% 0.20/0.41
% 0.20/0.41 ---------- no more Softie stats ----------
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.41
% 0.20/0.41 Stopped by limit on number of solutions
% 0.20/0.41
% 0.20/0.41 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 Stopped by limit on number of solutions
% 0.20/0.48
% 0.20/0.48 ----> UNIT CONFLICT at 0.08 sec ----> 184 [binary,183.1,4.1] {+} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 5. Level of proof is 4.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 1 [] {+} -member(A,intersection(B,C))|member(A,B).
% 0.20/0.48 4 [] {+} -member(A,empty_set).
% 0.20/0.48 10 [] {+} -empty(A)| -member(B,A).
% 0.20/0.48 14 [] {+} intersection($c1,empty_set)!=empty_set.
% 0.20/0.48 18 [] {+} intersection(A,B)=intersection(B,A).
% 0.20/0.48 21 [] {+} empty(A)|member($f2(A),A).
% 0.20/0.48 22 [] {-} A=B|member($f3(A,B),A)|member($f3(A,B),B).
% 0.20/0.48 23 [] {+} A=A.
% 0.20/0.48 27 [para_from,18.1.1,14.1.1] {+} intersection(empty_set,$c1)!=empty_set.
% 0.20/0.48 44 [hyper,22,4] {-} A=empty_set|member($f3(A,empty_set),A).
% 0.20/0.48 114 [hyper,44,10,21] {-} A=empty_set|member($f2(A),A).
% 0.20/0.48 157 [para_from,114.1.1,27.1.1,unit_del,23] {-} member($f2(intersection(empty_set,$c1)),intersection(empty_set,$c1)).
% 0.20/0.48 183 [hyper,157,1] {-} member($f2(intersection(empty_set,$c1)),empty_set).
% 0.20/0.48 184 [binary,183.1,4.1] {+} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 5 (35.7%)
% 0.20/0.48 false clauses given 9
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 8 1 1
% 0.20/0.48 9 4 3
% 0.20/0.48 10 2 3
% 0.20/0.48 11 3 4
% 0.20/0.48 12 20 1
% 0.20/0.48 13 15 3
% 0.20/0.48 14 14 4
% 0.20/0.48 15 6 7
% 0.20/0.48 16 3 1
% 0.20/0.48 18 3 1
% 0.20/0.48 19 11 6
% 0.20/0.48 20 2 2
% 0.20/0.48 21 7 3
% 0.20/0.48 22 5 5
% 0.20/0.48 25 1 0
% 0.20/0.48 27 2 4
% 0.20/0.48 tot: 99 48 (32.7% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 29360 finished Sun Jul 10 00:55:31 2022
%------------------------------------------------------------------------------