TSTP Solution File: SET917+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET917+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:48 EDT 2022
% Result : Theorem 0.51s 0.74s
% Output : Refutation 0.51s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET917+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n008.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 : Sun Jul 10 12:21:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n008.cluster.edu,
% 0.13/0.36 Sun Jul 10 12:21:38 2022
% 0.13/0.36 The command was "./sos". The process ID is 6922.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.13/0.36 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.20/0.40
% 0.20/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 -------------- Softie stats --------------
% 0.20/0.40
% 0.20/0.40 UPDATE_STOP: 300
% 0.20/0.40 SFINDER_TIME_LIMIT: 2
% 0.20/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.40 number of clauses in intial UL: 7
% 0.20/0.40 number of clauses initially in problem: 13
% 0.20/0.40 percentage of clauses intially in UL: 53
% 0.20/0.40 percentage of distinct symbols occuring in initial UL: 90
% 0.20/0.40 percent of all initial clauses that are short: 100
% 0.20/0.40 absolute distinct symbol count: 10
% 0.20/0.40 distinct predicate count: 4
% 0.20/0.40 distinct function count: 2
% 0.20/0.40 distinct constant count: 4
% 0.20/0.40
% 0.20/0.40 ---------- no more Softie stats ----------
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40
% 0.20/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.40
% 0.20/0.40 Stopped by limit on number of solutions
% 0.20/0.40
% 0.20/0.40 =========== start of search ===========
% 0.51/0.74
% 0.51/0.74 -------- PROOF --------
% 0.51/0.74 % SZS status Theorem
% 0.51/0.74 % SZS output start Refutation
% 0.51/0.74
% 0.51/0.74 Model 3 (0.00 seconds, 0 Inserts)
% 0.51/0.74
% 0.51/0.74 Stopped by limit on number of solutions
% 0.51/0.74
% 0.51/0.74 Model 4 (0.00 seconds, 0 Inserts)
% 0.51/0.74
% 0.51/0.74 Stopped by limit on number of solutions
% 0.51/0.74
% 0.51/0.74 Model 5 [ 2 1 220 ] (0.00 seconds, 36369 Inserts)
% 0.51/0.74
% 0.51/0.74 Stopped by limit on insertions
% 0.51/0.74
% 0.51/0.74 Model 6 [ 1 0 422 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.74
% 0.51/0.74 Stopped by limit on insertions
% 0.51/0.74
% 0.51/0.74 Model 7 [ 3 1 68 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.74
% 0.51/0.74 ----> UNIT CONFLICT at 0.34 sec ----> 24 [binary,22.1,15.1] {-} $F.
% 0.51/0.74
% 0.51/0.74 Length of proof is 3. Level of proof is 2.
% 0.51/0.74
% 0.51/0.74 ---------------- PROOF ----------------
% 0.51/0.74 % SZS status Theorem
% 0.51/0.74 % SZS output start Refutation
% 0.51/0.74
% 0.51/0.74 2 [] {+} -in(A,B)|set_intersection2(B,singleton(A))=singleton(A).
% 0.51/0.74 5 [] {+} -disjoint(singleton($c4),$c3).
% 0.51/0.74 6 [] {+} set_intersection2(singleton($c4),$c3)!=singleton($c4).
% 0.51/0.74 8 [] {+} set_intersection2(A,B)=set_intersection2(B,A).
% 0.51/0.74 11 [] {+} in(A,B)|disjoint(singleton(A),B).
% 0.51/0.74 15 [para_from,8.1.1,6.1.1] {-} set_intersection2($c3,singleton($c4))!=singleton($c4).
% 0.51/0.74 17 [hyper,11,2] {+} disjoint(singleton(A),B)|set_intersection2(B,singleton(A))=singleton(A).
% 0.51/0.74 22 [hyper,17,5] {-} set_intersection2($c3,singleton($c4))=singleton($c4).
% 0.51/0.74 24 [binary,22.1,15.1] {-} $F.
% 0.51/0.74
% 0.51/0.74 % SZS output end Refutation
% 0.51/0.74 ------------ end of proof -------------
% 0.51/0.74
% 0.51/0.74
% 0.51/0.74 Search stopped by max_proofs option.
% 0.51/0.74
% 0.51/0.74
% 0.51/0.74 Search stopped by max_proofs option.
% 0.51/0.74
% 0.51/0.74 ============ end of search ============
% 0.51/0.74
% 0.51/0.74 ----------- soft-scott stats ----------
% 0.51/0.74
% 0.51/0.74 true clauses given 1 (14.3%)
% 0.51/0.74 false clauses given 6
% 0.51/0.74
% 0.51/0.74 FALSE TRUE
% 0.51/0.74 3 0 1
% 0.51/0.74 4 1 0
% 0.51/0.74 7 1 0
% 0.51/0.74 8 1 0
% 0.51/0.74 11 1 0
% 0.51/0.74 13 0 1
% 0.51/0.74 tot: 4 2 (33.3% true)
% 0.51/0.74
% 0.51/0.74
% 0.51/0.74 Model 7 [ 3 1 68 ] (0.00 seconds, 250000 Inserts)
% 0.51/0.74
% 0.51/0.74 That finishes the proof of the theorem.
% 0.51/0.74
% 0.51/0.74 Process 6922 finished Sun Jul 10 12:21:39 2022
%------------------------------------------------------------------------------