TSTP Solution File: SET821-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET821-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:20:53 EDT 2022
% Result : Unsatisfiable 0.91s 1.12s
% Output : Refutation 0.91s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET821-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n023.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 : Mon Jul 11 02:42:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n023.cluster.edu,
% 0.12/0.35 Mon Jul 11 02:42:55 2022
% 0.12/0.35 The command was "./sos". The process ID is 13811.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.39
% 0.19/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 -------------- Softie stats --------------
% 0.19/0.39
% 0.19/0.39 UPDATE_STOP: 300
% 0.19/0.39 SFINDER_TIME_LIMIT: 2
% 0.19/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.39 number of clauses in intial UL: 5
% 0.19/0.39 number of clauses initially in problem: 11
% 0.19/0.39 percentage of clauses intially in UL: 45
% 0.19/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.39 percent of all initial clauses that are short: 100
% 0.19/0.39 absolute distinct symbol count: 11
% 0.19/0.39 distinct predicate count: 4
% 0.19/0.39 distinct function count: 3
% 0.19/0.39 distinct constant count: 4
% 0.19/0.39
% 0.19/0.39 ---------- no more Softie stats ----------
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39
% 0.19/0.39 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.39
% 0.19/0.39 Stopped by limit on number of solutions
% 0.19/0.39
% 0.19/0.39 =========== start of search ===========
% 0.91/1.12
% 0.91/1.12 -------- PROOF --------
% 0.91/1.12 % SZS status Unsatisfiable
% 0.91/1.12 % SZS output start Refutation
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 3 [ 4 1 282 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 4 [ 7 1 1171 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 Stopped by limit on insertions
% 0.91/1.12
% 0.91/1.12 Model 5 [ 7 0 1054 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 -----> EMPTY CLAUSE at 0.74 sec ----> 527 [hyper,499,2,38] {-} $F.
% 0.91/1.12
% 0.91/1.12 Length of proof is 10. Level of proof is 8.
% 0.91/1.12
% 0.91/1.12 ---------------- PROOF ----------------
% 0.91/1.12 % SZS status Unsatisfiable
% 0.91/1.12 % SZS output start Refutation
% 0.91/1.12
% 0.91/1.12 1 [] {+} -class_Orderings_Oorder(A)| -c_less(B,B,A).
% 0.91/1.12 2 [] {+} -c_in(A,B,C)| -c_in(A,c_uminus(B,tc_set(C)),C).
% 0.91/1.12 3 [] {+} -c_in(A,B,C)|c_in(A,c_insert(D,B,C),C).
% 0.91/1.12 4 [] {+} -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 0.91/1.12 5 [] {+} c_in(v_c,A,tc_IntDef_Oint)| -c_in(v_b,A,tc_IntDef_Oint)|c_in(v_a,A,tc_IntDef_Oint).
% 0.91/1.12 7 [] {-} c_in(A,c_insert(A,B,C),C).
% 0.91/1.12 8 [] {+} c_less(v_a,v_b,tc_IntDef_Oint).
% 0.91/1.12 9 [] {+} c_less(v_b,v_c,tc_IntDef_Oint).
% 0.91/1.12 10 [] {+} class_Orderings_Oorder(tc_IntDef_Oint).
% 0.91/1.12 33 [hyper,7,5] {-} c_in(v_c,c_insert(v_b,A,tc_IntDef_Oint),tc_IntDef_Oint)|c_in(v_a,c_insert(v_b,A,tc_IntDef_Oint),tc_IntDef_Oint).
% 0.91/1.12 34 [hyper,7,3] {-} c_in(A,c_insert(B,c_insert(A,C,D),D),D).
% 0.91/1.12 38 [hyper,34,3] {-} c_in(A,c_insert(B,c_insert(C,c_insert(A,D,E),E),E),E).
% 0.91/1.12 145 [hyper,33,4] {-} c_in(v_a,c_insert(v_b,A,tc_IntDef_Oint),tc_IntDef_Oint)|c_in(v_c,A,tc_IntDef_Oint)|v_c=v_b.
% 0.91/1.12 174 [para_from,145.3.1,9.1.2] {-} c_less(v_b,v_b,tc_IntDef_Oint)|c_in(v_a,c_insert(v_b,A,tc_IntDef_Oint),tc_IntDef_Oint)|c_in(v_c,A,tc_IntDef_Oint).
% 0.91/1.12 341 [hyper,174,1,10] {-} c_in(v_a,c_insert(v_b,A,tc_IntDef_Oint),tc_IntDef_Oint)|c_in(v_c,A,tc_IntDef_Oint).
% 0.91/1.12 342 [hyper,341,4,flip.3] {-} c_in(v_c,A,tc_IntDef_Oint)|c_in(v_a,A,tc_IntDef_Oint)|v_b=v_a.
% 0.91/1.12 387 [para_from,342.3.1,8.1.2] {-} c_less(v_a,v_a,tc_IntDef_Oint)|c_in(v_c,A,tc_IntDef_Oint)|c_in(v_a,A,tc_IntDef_Oint).
% 0.91/1.12 488 [hyper,387,1,10] {-} c_in(v_c,A,tc_IntDef_Oint)|c_in(v_a,A,tc_IntDef_Oint).
% 0.91/1.12 499 [hyper,488,2,7] {-} c_in(v_a,c_uminus(c_insert(v_c,A,tc_IntDef_Oint),tc_set(tc_IntDef_Oint)),tc_IntDef_Oint).
% 0.91/1.12 527 [hyper,499,2,38] {-} $F.
% 0.91/1.12
% 0.91/1.12 % SZS output end Refutation
% 0.91/1.12 ------------ end of proof -------------
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 Search stopped by max_proofs option.
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 Search stopped by max_proofs option.
% 0.91/1.12
% 0.91/1.12 ============ end of search ============
% 0.91/1.12
% 0.91/1.12 ----------- soft-scott stats ----------
% 0.91/1.12
% 0.91/1.12 true clauses given 2 (8.0%)
% 0.91/1.12 false clauses given 23
% 0.91/1.12
% 0.91/1.12 FALSE TRUE
% 0.91/1.12 10 1 0
% 0.91/1.12 11 2 0
% 0.91/1.12 13 3 0
% 0.91/1.12 14 5 0
% 0.91/1.12 15 2 6
% 0.91/1.12 16 9 0
% 0.91/1.12 17 13 1
% 0.91/1.12 18 8 0
% 0.91/1.12 19 8 2
% 0.91/1.12 20 14 1
% 0.91/1.12 21 1 1
% 0.91/1.12 22 10 4
% 0.91/1.12 23 12 1
% 0.91/1.12 24 5 3
% 0.91/1.12 25 14 7
% 0.91/1.12 26 14 3
% 0.91/1.12 27 10 7
% 0.91/1.12 28 21 1
% 0.91/1.12 29 15 2
% 0.91/1.12 30 15 4
% 0.91/1.12 31 11 2
% 0.91/1.12 32 7 3
% 0.91/1.12 33 11 5
% 0.91/1.12 34 6 4
% 0.91/1.12 35 4 2
% 0.91/1.12 36 9 4
% 0.91/1.12 37 4 2
% 0.91/1.12 38 1 2
% 0.91/1.12 39 2 4
% 0.91/1.12 40 1 0
% 0.91/1.12 41 1 1
% 0.91/1.12 42 3 3
% 0.91/1.12 44 0 3
% 0.91/1.12 45 4 1
% 0.91/1.12 48 0 1
% 0.91/1.12 50 0 1
% 0.91/1.12 51 0 1
% 0.91/1.12 53 0 1
% 0.91/1.12 54 1 0
% 0.91/1.12 56 0 1
% 0.91/1.12 57 2 0
% 0.91/1.12 59 1 0
% 0.91/1.12 60 1 0
% 0.91/1.12 tot: 251 84 (25.1% true)
% 0.91/1.12
% 0.91/1.12
% 0.91/1.12 Model 5 [ 7 -12 1054 ] (0.00 seconds, 250000 Inserts)
% 0.91/1.12
% 0.91/1.12 That finishes the proof of the theorem.
% 0.91/1.12
% 0.91/1.12 Process 13811 finished Mon Jul 11 02:42:55 2022
%------------------------------------------------------------------------------