TSTP Solution File: SET867+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET867+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:27 EDT 2022
% Result : Theorem 0.40s 0.59s
% Output : Refutation 0.40s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET867+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 02:06:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox2 on n007.cluster.edu,
% 0.19/0.36 Mon Jul 11 02:06:32 2022
% 0.19/0.36 The command was "./sos". The process ID is 17002.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 formula_list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.19/0.40
% 0.19/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.40
% 0.19/0.40 Stopped by limit on number of solutions
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 -------------- Softie stats --------------
% 0.19/0.40
% 0.19/0.40 UPDATE_STOP: 300
% 0.19/0.40 SFINDER_TIME_LIMIT: 2
% 0.19/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.40 number of clauses in intial UL: 10
% 0.19/0.40 number of clauses initially in problem: 16
% 0.19/0.40 percentage of clauses intially in UL: 62
% 0.19/0.40 percentage of distinct symbols occuring in initial UL: 72
% 0.19/0.40 percent of all initial clauses that are short: 100
% 0.19/0.40 absolute distinct symbol count: 11
% 0.19/0.40 distinct predicate count: 3
% 0.19/0.40 distinct function count: 5
% 0.19/0.40 distinct constant count: 3
% 0.19/0.40
% 0.19/0.40 ---------- no more Softie stats ----------
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40
% 0.19/0.40 =========== start of search ===========
% 0.40/0.59
% 0.40/0.59 -------- PROOF --------
% 0.40/0.59 % SZS status Theorem
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 Stopped by limit on insertions
% 0.40/0.59
% 0.40/0.59 Model 2 [ 1 1 612 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.59
% 0.40/0.59 Model 3 [ 1 0 437 ] (0.00 seconds, 2111 Inserts)
% 0.40/0.59
% 0.40/0.59 Stopped by limit on insertions
% 0.40/0.59
% 0.40/0.59 Model 4 [ 1 1 483 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.59
% 0.40/0.59 -----> EMPTY CLAUSE at 0.20 sec ----> 140 [hyper,92,2,16] {-} $F.
% 0.40/0.59
% 0.40/0.59 Length of proof is 2. Level of proof is 2.
% 0.40/0.59
% 0.40/0.59 ---------------- PROOF ----------------
% 0.40/0.59 % SZS status Theorem
% 0.40/0.59 % SZS output start Refutation
% 0.40/0.59
% 0.40/0.59 2 [] {+} A!=empty_set| -in(B,A).
% 0.40/0.59 4 [] {+} A!=union(B)| -in(C,A)|in($f2(B,A,C),B).
% 0.40/0.59 8 [] {+} union(empty_set)!=empty_set.
% 0.40/0.59 11 [] {-} A=empty_set|in($f1(A),A).
% 0.40/0.59 16 [] {+} A=A.
% 0.40/0.59 20 [para_from,11.1.1,8.1.1,unit_del,16] {-} in($f1(union(empty_set)),union(empty_set)).
% 0.40/0.59 92 [hyper,20,4,16] {-} in($f2(empty_set,union(empty_set),$f1(union(empty_set))),empty_set).
% 0.40/0.59 140 [hyper,92,2,16] {-} $F.
% 0.40/0.59
% 0.40/0.59 % SZS output end Refutation
% 0.40/0.59 ------------ end of proof -------------
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Search stopped by max_proofs option.
% 0.40/0.59
% 0.40/0.59 ============ end of search ============
% 0.40/0.59
% 0.40/0.59 ----------- soft-scott stats ----------
% 0.40/0.59
% 0.40/0.59 true clauses given 1 (11.1%)
% 0.40/0.59 false clauses given 8
% 0.40/0.59
% 0.40/0.59 FALSE TRUE
% 0.40/0.59 9 1 0
% 0.40/0.59 10 1 0
% 0.40/0.59 11 2 2
% 0.40/0.59 12 2 0
% 0.40/0.59 13 2 3
% 0.40/0.59 14 2 0
% 0.40/0.59 15 5 3
% 0.40/0.59 16 0 3
% 0.40/0.59 17 5 2
% 0.40/0.59 18 0 8
% 0.40/0.59 19 2 1
% 0.40/0.59 20 2 9
% 0.40/0.59 21 1 0
% 0.40/0.59 22 9 4
% 0.40/0.59 23 3 8
% 0.40/0.59 24 2 1
% 0.40/0.59 25 3 2
% 0.40/0.59 26 1 0
% 0.40/0.59 27 1 1
% 0.40/0.59 28 2 0
% 0.40/0.59 29 1 4
% 0.40/0.59 31 0 1
% 0.40/0.59 32 1 0
% 0.40/0.59 34 0 5
% 0.40/0.59 35 3 3
% 0.40/0.59 36 3 2
% 0.40/0.59 tot: 54 62 (53.4% true)
% 0.40/0.59
% 0.40/0.59
% 0.40/0.59 Model 4 [ 1 -6 483 ] (0.00 seconds, 250000 Inserts)
% 0.40/0.59
% 0.40/0.59 That finishes the proof of the theorem.
% 0.40/0.59
% 0.40/0.59 Process 17002 finished Mon Jul 11 02:06:32 2022
%------------------------------------------------------------------------------