TSTP Solution File: SET162+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET162+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n003.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:24 EDT 2022
% Result : Theorem 0.19s 0.51s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET162+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n003.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 : Mon Jul 11 02:45:59 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n003.cluster.edu,
% 0.12/0.35 Mon Jul 11 02:45:59 2022
% 0.12/0.35 The command was "./sos". The process ID is 16281.
% 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 18 during input processing: 0 [copy,18,flip.1] {-} union(A,B)=union(B,A).
% 0.12/0.35 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} A=A.
% 0.12/0.35 23 back subsumes 17.
% 0.12/0.35 23 back subsumes 16.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.39
% 0.12/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 -------------- Softie stats --------------
% 0.12/0.39
% 0.12/0.39 UPDATE_STOP: 300
% 0.12/0.39 SFINDER_TIME_LIMIT: 2
% 0.12/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.39 number of clauses in intial UL: 15
% 0.12/0.39 number of clauses initially in problem: 21
% 0.12/0.39 percentage of clauses intially in UL: 71
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 10
% 0.12/0.39 distinct predicate count: 4
% 0.12/0.39 distinct function count: 4
% 0.12/0.39 distinct constant count: 2
% 0.12/0.39
% 0.12/0.39 ---------- no more Softie stats ----------
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39
% 0.12/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.39
% 0.12/0.39 Stopped by limit on number of solutions
% 0.12/0.39
% 0.12/0.39 =========== start of search ===========
% 0.19/0.51
% 0.19/0.51 -------- PROOF --------
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 % SZS output start Refutation
% 0.19/0.51
% 0.19/0.51 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.51
% 0.19/0.51 Stopped by limit on number of solutions
% 0.19/0.51
% 0.19/0.51 Model 4 [ 3 0 403 ] (0.00 seconds, 4646 Inserts)
% 0.19/0.51
% 0.19/0.51 Model 5 [ 6 1 459 ] (0.00 seconds, 5322 Inserts)
% 0.19/0.51
% 0.19/0.51 Model 6 [ 5 0 377 ] (0.00 seconds, 17829 Inserts)
% 0.19/0.51
% 0.19/0.51 ----> UNIT CONFLICT at 0.14 sec ----> 347 [binary,345.1,27.1] {-} $F.
% 0.19/0.51
% 0.19/0.51 Length of proof is 6. Level of proof is 5.
% 0.19/0.51
% 0.19/0.51 ---------------- PROOF ----------------
% 0.19/0.51 % SZS status Theorem
% 0.19/0.51 % SZS output start Refutation
% 0.19/0.51
% 0.19/0.51 1 [] {+} -member(A,union(B,C))|member(A,B)|member(A,C).
% 0.19/0.51 3 [] {+} member(A,union(B,C))| -member(A,C).
% 0.19/0.51 4 [] {+} -member(A,empty_set).
% 0.19/0.51 13 [] {+} A=B| -member($f3(A,B),A)| -member($f3(A,B),B).
% 0.19/0.51 14 [] {+} union($c1,empty_set)!=$c1.
% 0.19/0.51 18 [] {+} union(A,B)=union(B,A).
% 0.19/0.51 22 [] {-} A=B|member($f3(A,B),A)|member($f3(A,B),B).
% 0.19/0.51 23 [] {+} A=A.
% 0.19/0.51 27 [para_from,18.1.1,14.1.1] {+} union(empty_set,$c1)!=$c1.
% 0.19/0.51 38 [hyper,22,3] {-} A=B|member($f3(A,B),B)|member($f3(A,B),union(C,A)).
% 0.19/0.51 51 [factor,38.2.3,flip.1] {+} union(A,B)=B|member($f3(B,union(A,B)),union(A,B)).
% 0.19/0.51 252 [para_from,51.1.1,27.1.1,unit_del,23] {-} member($f3($c1,union(empty_set,$c1)),union(empty_set,$c1)).
% 0.19/0.51 298 [hyper,252,1,unit_del,4] {-} member($f3($c1,union(empty_set,$c1)),$c1).
% 0.19/0.51 345 [hyper,298,13,252,flip.1] {-} union(empty_set,$c1)=$c1.
% 0.19/0.51 347 [binary,345.1,27.1] {-} $F.
% 0.19/0.51
% 0.19/0.51 % SZS output end Refutation
% 0.19/0.51 ------------ end of proof -------------
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Search stopped by max_proofs option.
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Search stopped by max_proofs option.
% 0.19/0.51
% 0.19/0.51 ============ end of search ============
% 0.19/0.51
% 0.19/0.51 ----------- soft-scott stats ----------
% 0.19/0.51
% 0.19/0.51 true clauses given 4 (26.7%)
% 0.19/0.51 false clauses given 11
% 0.19/0.51
% 0.19/0.51 FALSE TRUE
% 0.19/0.51 8 0 6
% 0.19/0.51 9 3 4
% 0.19/0.51 10 0 7
% 0.19/0.51 11 2 7
% 0.19/0.51 12 0 14
% 0.19/0.51 13 1 14
% 0.19/0.51 14 13 13
% 0.19/0.51 15 17 14
% 0.19/0.51 16 4 1
% 0.19/0.51 17 2 2
% 0.19/0.51 18 9 2
% 0.19/0.51 19 29 14
% 0.19/0.51 20 0 9
% 0.19/0.51 21 22 4
% 0.19/0.51 22 10 14
% 0.19/0.51 23 4 8
% 0.19/0.51 24 1 0
% 0.19/0.51 25 0 3
% 0.19/0.51 26 6 0
% 0.19/0.51 27 19 15
% 0.19/0.51 28 5 6
% 0.19/0.51 32 1 3
% 0.19/0.51 tot: 148 160 (51.9% true)
% 0.19/0.51
% 0.19/0.51
% 0.19/0.51 Model 6 [ 5 0 377 ] (0.00 seconds, 17829 Inserts)
% 0.19/0.51
% 0.19/0.51 That finishes the proof of the theorem.
% 0.19/0.51
% 0.19/0.51 Process 16281 finished Mon Jul 11 02:46:00 2022
%------------------------------------------------------------------------------