TSTP Solution File: SET591+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:19:08 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET591+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.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:44:58 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 sandbox on n024.cluster.edu,
% 0.13/0.36 Sun Jul 10 12:44:58 2022
% 0.13/0.36 The command was "./sos". The process ID is 2328.
% 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=3.
% 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 18 during input processing: 0 [copy,18,flip.1] {-} A=A.
% 0.13/0.36 18 back subsumes 13.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 11
% 0.13/0.39 number of clauses initially in problem: 16
% 0.13/0.39 percentage of clauses intially in UL: 68
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 80
% 0.13/0.39 percent of all initial clauses that are short: 100
% 0.13/0.39 absolute distinct symbol count: 10
% 0.13/0.39 distinct predicate count: 4
% 0.13/0.39 distinct function count: 3
% 0.13/0.39 distinct constant count: 3
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.20/0.55
% 0.20/0.55 -------- PROOF --------
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 Model 3 [ 1 1 3369 ] (0.00 seconds, 5471 Inserts)
% 0.20/0.55
% 0.20/0.55 Stopped by limit on insertions
% 0.20/0.55
% 0.20/0.55 Model 4 [ 1 1 77 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.55
% 0.20/0.55 Stopped by limit on insertions
% 0.20/0.55
% 0.20/0.55 Model 5 [ 2 0 63 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.55
% 0.20/0.55 ----> UNIT CONFLICT at 0.17 sec ----> 83 [binary,81.1,12.1] {-} $F.
% 0.20/0.55
% 0.20/0.55 Length of proof is 5. Level of proof is 4.
% 0.20/0.55
% 0.20/0.55 ---------------- PROOF ----------------
% 0.20/0.55 % SZS status Theorem
% 0.20/0.55 % SZS output start Refutation
% 0.20/0.55
% 0.20/0.55 1 [] {+} -subset(A,B)| -member(C,A)|member(C,B).
% 0.20/0.55 4 [] {+} -member(A,difference(B,C))| -member(A,C).
% 0.20/0.55 6 [] {+} -member(A,empty_set).
% 0.20/0.55 9 [] {+} A=B| -subset(A,B)| -subset(B,A).
% 0.20/0.55 11 [] {-} $c2!=empty_set.
% 0.20/0.55 12 [copy,11,flip.1] {+} empty_set!=$c2.
% 0.20/0.55 14 [] {+} subset(A,B)|member($f1(A,B),A).
% 0.20/0.55 17 [] {+} subset($c2,difference($c1,$c2)).
% 0.20/0.55 19 [hyper,14,9,14] {-} member($f1(A,B),A)|B=A|member($f1(B,A),B).
% 0.20/0.55 28 [hyper,19,6] {+} A=empty_set|member($f1(A,empty_set),A).
% 0.20/0.55 62 [hyper,28,1,17,unit_del,12] {-} member($f1($c2,empty_set),difference($c1,$c2)).
% 0.20/0.55 81 [hyper,62,4,28,flip.1] {-} empty_set=$c2.
% 0.20/0.55 83 [binary,81.1,12.1] {-} $F.
% 0.20/0.55
% 0.20/0.55 % SZS output end Refutation
% 0.20/0.55 ------------ end of proof -------------
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Search stopped by max_proofs option.
% 0.20/0.55
% 0.20/0.55 ============ end of search ============
% 0.20/0.55
% 0.20/0.55 ----------- soft-scott stats ----------
% 0.20/0.55
% 0.20/0.55 true clauses given 2 (25.0%)
% 0.20/0.55 false clauses given 6
% 0.20/0.55
% 0.20/0.55 FALSE TRUE
% 0.20/0.55 7 0 1
% 0.20/0.55 8 0 3
% 0.20/0.55 10 0 3
% 0.20/0.55 11 3 0
% 0.20/0.55 12 1 4
% 0.20/0.55 13 1 3
% 0.20/0.55 14 1 1
% 0.20/0.55 15 2 8
% 0.20/0.55 16 1 1
% 0.20/0.55 18 0 3
% 0.20/0.55 19 1 3
% 0.20/0.55 20 0 4
% 0.20/0.55 21 0 2
% 0.20/0.55 22 0 6
% 0.20/0.55 23 0 1
% 0.20/0.55 25 0 1
% 0.20/0.55 27 0 2
% 0.20/0.55 30 0 1
% 0.20/0.55 tot: 10 47 (82.5% true)
% 0.20/0.55
% 0.20/0.55
% 0.20/0.55 Model 5 [ 2 0 63 ] (0.00 seconds, 250000 Inserts)
% 0.20/0.55
% 0.20/0.55 That finishes the proof of the theorem.
% 0.20/0.55
% 0.20/0.55 Process 2328 finished Sun Jul 10 12:44:58 2022
%------------------------------------------------------------------------------