TSTP Solution File: SET027-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET027-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:14:33 EDT 2022
% Result : Unsatisfiable 3.19s 3.37s
% Output : Refutation 3.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET027-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 02:22:25 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.37 ----- Otter 3.2, August 2001 -----
% 0.21/0.37 The process was started by sandbox2 on n022.cluster.edu,
% 0.21/0.37 Sun Jul 10 02:22:25 2022
% 0.21/0.37 The command was "./sos". The process ID is 16236.
% 0.21/0.37
% 0.21/0.37 set(prolog_style_variables).
% 0.21/0.37 set(auto).
% 0.21/0.37 dependent: set(auto1).
% 0.21/0.37 dependent: set(process_input).
% 0.21/0.37 dependent: clear(print_kept).
% 0.21/0.37 dependent: clear(print_new_demod).
% 0.21/0.37 dependent: clear(print_back_demod).
% 0.21/0.37 dependent: clear(print_back_sub).
% 0.21/0.37 dependent: set(control_memory).
% 0.21/0.37 dependent: assign(max_mem, 12000).
% 0.21/0.37 dependent: assign(pick_given_ratio, 4).
% 0.21/0.37 dependent: assign(stats_level, 1).
% 0.21/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.37 dependent: assign(sos_limit, 5000).
% 0.21/0.37 dependent: assign(max_weight, 60).
% 0.21/0.37 clear(print_given).
% 0.21/0.37
% 0.21/0.37 list(usable).
% 0.21/0.37
% 0.21/0.37 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.21/0.37
% 0.21/0.37 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.37 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.37 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.37 clauses in usable.
% 0.21/0.37
% 0.21/0.37 dependent: set(knuth_bendix).
% 0.21/0.37 dependent: set(para_from).
% 0.21/0.37 dependent: set(para_into).
% 0.21/0.37 dependent: clear(para_from_right).
% 0.21/0.37 dependent: clear(para_into_right).
% 0.21/0.37 dependent: set(para_from_vars).
% 0.21/0.37 dependent: set(eq_units_both_ways).
% 0.21/0.37 dependent: set(dynamic_demod_all).
% 0.21/0.37 dependent: set(dynamic_demod).
% 0.21/0.37 dependent: set(order_eq).
% 0.21/0.37 dependent: set(back_demod).
% 0.21/0.37 dependent: set(lrpo).
% 0.21/0.37 dependent: set(hyper_res).
% 0.21/0.37 dependent: set(unit_deletion).
% 0.21/0.37 dependent: set(factor).
% 0.21/0.37
% 0.21/0.37 ------------> process usable:
% 0.21/0.37
% 0.21/0.37 ------------> process sos:
% 0.21/0.37 Following clause subsumed by 137 during input processing: 0 [copy,137,flip.1] {-} A=A.
% 0.21/0.37 137 back subsumes 61.
% 0.21/0.37
% 0.21/0.37 ======= end of input processing =======
% 0.79/1.02
% 0.79/1.02 Model 1 (0.00 seconds, 0 Inserts)
% 0.79/1.02
% 0.79/1.02 Stopped by limit on number of solutions
% 0.79/1.02
% 0.79/1.02
% 0.79/1.02 -------------- Softie stats --------------
% 0.79/1.02
% 0.79/1.02 UPDATE_STOP: 300
% 0.79/1.02 SFINDER_TIME_LIMIT: 2
% 0.79/1.02 SHORT_CLAUSE_CUTOFF: 4
% 0.79/1.02 number of clauses in intial UL: 49
% 0.79/1.02 number of clauses initially in problem: 121
% 0.79/1.02 percentage of clauses intially in UL: 40
% 0.79/1.02 percentage of distinct symbols occuring in initial UL: 62
% 0.79/1.02 percent of all initial clauses that are short: 100
% 0.79/1.02 absolute distinct symbol count: 51
% 0.79/1.02 distinct predicate count: 10
% 0.79/1.02 distinct function count: 30
% 0.79/1.02 distinct constant count: 11
% 0.79/1.02
% 0.79/1.02 ---------- no more Softie stats ----------
% 0.79/1.02
% 0.79/1.02
% 0.79/1.02
% 0.79/1.02 Stopped by limit on insertions
% 0.79/1.02
% 0.79/1.02 =========== start of search ===========
% 3.19/3.37
% 3.19/3.37 -------- PROOF --------
% 3.19/3.37 % SZS status Unsatisfiable
% 3.19/3.37 % SZS output start Refutation
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Model 2 [ 3 1 11032 ] (0.00 seconds, 250000 Inserts)
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Model 3 [ 5 2 13149 ] (0.00 seconds, 250000 Inserts)
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Model 4 [ 14 2 6175 ] (0.00 seconds, 250000 Inserts)
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Model 5 [ 7 1 12369 ] (0.00 seconds, 250000 Inserts)
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 Stopped by limit on insertions
% 3.19/3.37
% 3.19/3.37 ----> UNIT CONFLICT at 2.98 sec ----> 649 [binary,648.1,60.1] {-} $F.
% 3.19/3.37
% 3.19/3.37 Length of proof is 4. Level of proof is 4.
% 3.19/3.37
% 3.19/3.37 ---------------- PROOF ----------------
% 3.19/3.37 % SZS status Unsatisfiable
% 3.19/3.37 % SZS output start Refutation
% 3.19/3.37
% 3.19/3.37 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 3.19/3.37 2 [] {+} -member(not_subclass_element(A,B),B)|subclass(A,B).
% 3.19/3.37 60 [] {+} -subclass(x,z).
% 3.19/3.37 69 [] {-} member(not_subclass_element(A,B),A)|subclass(A,B).
% 3.19/3.37 135 [] {+} subclass(x,y).
% 3.19/3.37 136 [] {-} subclass(y,z).
% 3.19/3.37 156 [hyper,69,60] {-} member(not_subclass_element(x,z),x).
% 3.19/3.37 263 [hyper,135,1,156] {-} member(not_subclass_element(x,z),y).
% 3.19/3.37 538 [hyper,263,1,136] {-} member(not_subclass_element(x,z),z).
% 3.19/3.37 648 [hyper,538,2] {-} subclass(x,z).
% 3.19/3.37 649 [binary,648.1,60.1] {-} $F.
% 3.19/3.37
% 3.19/3.37 % SZS output end Refutation
% 3.19/3.37 ------------ end of proof -------------
% 3.19/3.37
% 3.19/3.37
% 3.19/3.37 Search stopped by max_proofs option.
% 3.19/3.37
% 3.19/3.37
% 3.19/3.37 Search stopped by max_proofs option.
% 3.19/3.37
% 3.19/3.37 ============ end of search ============
% 3.19/3.37
% 3.19/3.37 ----------- soft-scott stats ----------
% 3.19/3.37
% 3.19/3.37 true clauses given 4 (17.4%)
% 3.19/3.37 false clauses given 19
% 3.19/3.37
% 3.19/3.37 FALSE TRUE
% 3.19/3.37 3 0 1
% 3.19/3.37 5 0 12
% 3.19/3.37 6 1 2
% 3.19/3.37 7 9 25
% 3.19/3.37 8 12 26
% 3.19/3.37 9 27 48
% 3.19/3.37 10 9 44
% 3.19/3.37 11 46 67
% 3.19/3.37 12 4 9
% 3.19/3.37 13 6 64
% 3.19/3.37 14 6 2
% 3.19/3.37 15 3 16
% 3.19/3.37 16 3 1
% 3.19/3.37 17 2 6
% 3.19/3.37 18 3 2
% 3.19/3.37 19 0 1
% 3.19/3.37 20 2 1
% 3.19/3.37 21 4 0
% 3.19/3.37 22 2 0
% 3.19/3.37 23 6 1
% 3.19/3.37 24 0 1
% 3.19/3.37 25 2 0
% 3.19/3.37 27 1 0
% 3.19/3.37 28 0 2
% 3.19/3.37 tot: 148 331 (69.1% true)
% 3.19/3.37
% 3.19/3.37
% 3.19/3.37 Model 5 [ 7 -77 12369 ] (0.00 seconds, 250000 Inserts)
% 3.19/3.37
% 3.19/3.37 That finishes the proof of the theorem.
% 3.19/3.37
% 3.19/3.37 Process 16236 finished Sun Jul 10 02:22:28 2022
%------------------------------------------------------------------------------