TSTP Solution File: SET879+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET879+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:32 EDT 2022
% Result : Theorem 0.36s 0.54s
% Output : Refutation 0.36s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET879+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n023.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 17:48:55 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 sandbox2 on n023.cluster.edu,
% 0.12/0.35 Sun Jul 10 17:48:55 2022
% 0.12/0.35 The command was "./sos". The process ID is 27773.
% 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 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 9
% 0.12/0.37 number of clauses initially in problem: 13
% 0.12/0.37 percentage of clauses intially in UL: 69
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 90
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 10
% 0.12/0.37 distinct predicate count: 3
% 0.12/0.37 distinct function count: 3
% 0.12/0.37 distinct constant count: 4
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.36/0.54
% 0.36/0.54 -------- PROOF --------
% 0.36/0.54 % SZS status Theorem
% 0.36/0.54 % SZS output start Refutation
% 0.36/0.54
% 0.36/0.54 Stopped by limit on insertions
% 0.36/0.54
% 0.36/0.54 Model 2 [ 1 1 74 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 Stopped by limit on insertions
% 0.36/0.54
% 0.36/0.54 Model 3 [ 1 1 72 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 -----> EMPTY CLAUSE at 0.17 sec ----> 154 [hyper,141,5,61] {-} $F.
% 0.36/0.54
% 0.36/0.54 Length of proof is 6. Level of proof is 3.
% 0.36/0.54
% 0.36/0.54 ---------------- PROOF ----------------
% 0.36/0.54 % SZS status Theorem
% 0.36/0.54 % SZS output start Refutation
% 0.36/0.54
% 0.36/0.54 1 [] {+} -in(A,B)| -in(B,A).
% 0.36/0.54 2 [] {+} A!=singleton(B)| -in(C,A)|C=B.
% 0.36/0.54 3 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.36/0.54 5 [] {+} set_difference(singleton(A),B)!=singleton(A)| -in(A,B).
% 0.36/0.54 7 [] {+} set_difference(singleton($c4),singleton($c3))=singleton($c4)|$c4!=$c3.
% 0.36/0.54 8 [] {+} set_difference(singleton($c4),singleton($c3))!=singleton($c4)|$c4=$c3.
% 0.36/0.54 9 [factor,1.1.2] {+} -in(A,A).
% 0.36/0.54 11 [] {-} set_difference(singleton(A),B)=singleton(A)|in(A,B).
% 0.36/0.54 13 [] {+} A=A.
% 0.36/0.54 39,38 [hyper,11,9] {+} set_difference(singleton(A),A)=singleton(A).
% 0.36/0.54 48 [para_from,11.1.1,8.1.1,unit_del,13] {-} $c4=$c3|in($c4,singleton($c3)).
% 0.36/0.54 61 [hyper,13,3,38,demod,39] {+} in(A,singleton(A)).
% 0.36/0.54 126,125 [hyper,48,2,13,factor_simp] {-} $c4=$c3.
% 0.36/0.54 141 [back_demod,7,demod,126,126,126,unit_del,13] {-} set_difference(singleton($c3),singleton($c3))=singleton($c3).
% 0.36/0.54 154 [hyper,141,5,61] {-} $F.
% 0.36/0.54
% 0.36/0.54 % SZS output end Refutation
% 0.36/0.54 ------------ end of proof -------------
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Search stopped by max_proofs option.
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Search stopped by max_proofs option.
% 0.36/0.54
% 0.36/0.54 ============ end of search ============
% 0.36/0.54
% 0.36/0.54 ----------- soft-scott stats ----------
% 0.36/0.54
% 0.36/0.54 true clauses given 2 (20.0%)
% 0.36/0.54 false clauses given 8
% 0.36/0.54
% 0.36/0.54 FALSE TRUE
% 0.36/0.54 9 1 1
% 0.36/0.54 10 0 1
% 0.36/0.54 11 1 1
% 0.36/0.54 12 0 1
% 0.36/0.54 13 1 2
% 0.36/0.54 14 1 3
% 0.36/0.54 17 4 2
% 0.36/0.54 18 2 1
% 0.36/0.54 19 2 0
% 0.36/0.54 20 1 1
% 0.36/0.54 21 4 0
% 0.36/0.54 22 3 5
% 0.36/0.54 23 1 2
% 0.36/0.54 24 1 3
% 0.36/0.54 25 1 0
% 0.36/0.54 27 2 2
% 0.36/0.54 28 2 1
% 0.36/0.54 29 2 5
% 0.36/0.54 30 0 3
% 0.36/0.54 31 0 1
% 0.36/0.54 32 0 1
% 0.36/0.54 33 1 0
% 0.36/0.54 34 4 0
% 0.36/0.54 35 2 1
% 0.36/0.54 36 7 1
% 0.36/0.54 37 5 5
% 0.36/0.54 38 2 0
% 0.36/0.54 40 1 1
% 0.36/0.54 41 1 3
% 0.36/0.54 42 1 1
% 0.36/0.54 44 4 4
% 0.36/0.54 46 0 1
% 0.36/0.54 48 5 4
% 0.36/0.54 50 1 0
% 0.36/0.54 51 0 3
% 0.36/0.54 53 0 2
% 0.36/0.54 57 0 2
% 0.36/0.54 59 1 0
% 0.36/0.54 60 0 1
% 0.36/0.54 tot: 64 65 (50.4% true)
% 0.36/0.54
% 0.36/0.54
% 0.36/0.54 Model 3 [ 1 -6 72 ] (0.00 seconds, 250000 Inserts)
% 0.36/0.54
% 0.36/0.54 That finishes the proof of the theorem.
% 0.36/0.54
% 0.36/0.54 Process 27773 finished Sun Jul 10 17:48:55 2022
%------------------------------------------------------------------------------