TSTP Solution File: SET877+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET877+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:31 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET877+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n008.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 : Sun Jul 10 19:52:08 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 n008.cluster.edu,
% 0.12/0.36 Sun Jul 10 19:52:08 2022
% 0.12/0.36 The command was "./sos". The process ID is 23869.
% 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 9 during input processing: 0 [copy,9,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.36 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= 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: 8
% 0.12/0.39 number of clauses initially in problem: 16
% 0.12/0.39 percentage of clauses intially in UL: 50
% 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: 3
% 0.12/0.39 distinct function count: 3
% 0.12/0.39 distinct constant count: 4
% 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.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.03 sec ----> 97 [binary,95.1,7.1] {+} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 3. Level of proof is 3.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 2 [] {+} A!=singleton(B)| -in(C,A)|C=B.
% 0.19/0.41 5 [] {+} set_intersection2(A,singleton(B))!=singleton(B)|in(B,A).
% 0.19/0.41 7 [] {+} $c4!=$c3.
% 0.19/0.41 9 [] {+} set_intersection2(A,B)=set_intersection2(B,A).
% 0.19/0.41 14 [] {-} set_intersection2(singleton($c4),singleton($c3))=singleton($c4).
% 0.19/0.41 16 [] {+} A=A.
% 0.19/0.41 32 [para_into,14.1.1,9.1.1] {-} set_intersection2(singleton($c3),singleton($c4))=singleton($c4).
% 0.19/0.41 35 [hyper,32,5] {-} in($c4,singleton($c3)).
% 0.19/0.41 95 [hyper,16,2,35] {-} $c4=$c3.
% 0.19/0.41 97 [binary,95.1,7.1] {+} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 2 (22.2%)
% 0.19/0.41 false clauses given 7
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 4 0 1
% 0.19/0.41 8 0 1
% 0.19/0.41 9 0 2
% 0.19/0.41 10 0 2
% 0.19/0.41 11 2 1
% 0.19/0.41 13 1 2
% 0.19/0.41 14 1 3
% 0.19/0.41 15 11 1
% 0.19/0.41 17 2 2
% 0.19/0.41 18 3 0
% 0.19/0.41 19 6 2
% 0.19/0.41 21 8 2
% 0.19/0.41 22 4 2
% 0.19/0.41 23 1 0
% 0.19/0.41 24 1 1
% 0.19/0.41 25 0 2
% 0.19/0.41 27 1 0
% 0.19/0.41 28 1 0
% 0.19/0.41 29 6 0
% 0.19/0.41 tot: 48 24 (33.3% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 23869 finished Sun Jul 10 19:52:08 2022
%------------------------------------------------------------------------------