TSTP Solution File: NUM533+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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 : Mon Jul 18 14:19:13 EDT 2022
% Result : Theorem 0.46s 0.67s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n007.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 : Wed Jul 6 15:11:43 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 sandbox2 on n007.cluster.edu,
% 0.12/0.36 Wed Jul 6 15:11:43 2022
% 0.12/0.36 The command was "./sos". The process ID is 18767.
% 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=5.
% 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 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.12/0.36 22 back subsumes 15.
% 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: 14
% 0.12/0.39 number of clauses initially in problem: 21
% 0.12/0.39 percentage of clauses intially in UL: 66
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 92
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 13
% 0.12/0.39 distinct predicate count: 7
% 0.12/0.39 distinct function count: 2
% 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.46/0.67
% 0.46/0.67 -------- PROOF --------
% 0.46/0.67 % SZS status Theorem
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 Model 3 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Model 4 (0.00 seconds, 0 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on number of solutions
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 5 [ 1 1 105 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 6 [ 2 0 67 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 7 [ 1 0 104 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 Stopped by limit on insertions
% 0.46/0.67
% 0.46/0.67 Model 8 [ 2 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 ----> UNIT CONFLICT at 0.29 sec ----> 275 [binary,274.1,14.1] {-} $F.
% 0.46/0.67
% 0.46/0.67 Length of proof is 4. Level of proof is 4.
% 0.46/0.67
% 0.46/0.67 ---------------- PROOF ----------------
% 0.46/0.67 % SZS status Theorem
% 0.46/0.67 % SZS output start Refutation
% 0.46/0.67
% 0.46/0.67 8 [] {+} -aSet0(A)| -aSubsetOf0(B,A)| -aElementOf0(C,B)|aElementOf0(C,A).
% 0.46/0.67 9 [] {+} -aSet0(A)|aSubsetOf0(B,A)| -aSet0(B)|aElementOf0($f2(A,B),B).
% 0.46/0.67 10 [] {+} -aSet0(A)|aSubsetOf0(B,A)| -aSet0(B)| -aElementOf0($f2(A,B),A).
% 0.46/0.67 14 [] {+} -aSubsetOf0(xA,xC).
% 0.46/0.67 17 [] {+} aSet0(xA).
% 0.46/0.67 18 [] {+} aSet0(xB).
% 0.46/0.67 19 [] {+} aSet0(xC).
% 0.46/0.67 20 [] {+} aSubsetOf0(xA,xB).
% 0.46/0.67 21 [] {+} aSubsetOf0(xB,xC).
% 0.46/0.67 37 [hyper,19,9,17,unit_del,14] {+} aElementOf0($f2(xC,xA),xA).
% 0.46/0.67 252 [hyper,37,8,18,20] {-} aElementOf0($f2(xC,xA),xB).
% 0.46/0.67 264 [hyper,252,8,19,21] {+} aElementOf0($f2(xC,xA),xC).
% 0.46/0.67 274 [hyper,264,10,19,17] {-} aSubsetOf0(xA,xC).
% 0.46/0.67 275 [binary,274.1,14.1] {-} $F.
% 0.46/0.67
% 0.46/0.67 % SZS output end Refutation
% 0.46/0.67 ------------ end of proof -------------
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Search stopped by max_proofs option.
% 0.46/0.67
% 0.46/0.67 ============ end of search ============
% 0.46/0.67
% 0.46/0.67 ----------- soft-scott stats ----------
% 0.46/0.67
% 0.46/0.67 true clauses given 11 (31.4%)
% 0.46/0.67 false clauses given 24
% 0.46/0.67
% 0.46/0.67 FALSE TRUE
% 0.46/0.67 4 1 0
% 0.46/0.67 6 0 1
% 0.46/0.67 7 0 16
% 0.46/0.67 8 2 9
% 0.46/0.67 9 7 10
% 0.46/0.67 10 0 7
% 0.46/0.67 11 0 5
% 0.46/0.67 13 4 2
% 0.46/0.67 14 0 11
% 0.46/0.67 15 5 47
% 0.46/0.67 16 0 2
% 0.46/0.67 17 0 2
% 0.46/0.67 18 0 10
% 0.46/0.67 19 2 18
% 0.46/0.67 20 0 2
% 0.46/0.67 21 0 2
% 0.46/0.67 22 0 9
% 0.46/0.67 23 0 7
% 0.46/0.67 24 0 3
% 0.46/0.67 25 0 1
% 0.46/0.67 26 0 2
% 0.46/0.67 27 0 2
% 0.46/0.67 28 0 1
% 0.46/0.67 tot: 21 169 (88.9% true)
% 0.46/0.67
% 0.46/0.67
% 0.46/0.67 Model 8 [ 2 1 64 ] (0.00 seconds, 250000 Inserts)
% 0.46/0.67
% 0.46/0.67 That finishes the proof of the theorem.
% 0.46/0.67
% 0.46/0.67 Process 18767 finished Wed Jul 6 15:11:44 2022
%------------------------------------------------------------------------------