TSTP Solution File: SET820-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET820-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:52 EDT 2022
% Result : Unsatisfiable 0.59s 0.76s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET820-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 9 18:50:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 ----- Otter 3.2, August 2001 -----
% 0.12/0.34 The process was started by sandbox2 on n005.cluster.edu,
% 0.12/0.34 Sat Jul 9 18:50:07 2022
% 0.12/0.34 The command was "./sos". The process ID is 12053.
% 0.12/0.34
% 0.12/0.34 set(prolog_style_variables).
% 0.12/0.34 set(auto).
% 0.12/0.34 dependent: set(auto1).
% 0.12/0.34 dependent: set(process_input).
% 0.12/0.34 dependent: clear(print_kept).
% 0.12/0.34 dependent: clear(print_new_demod).
% 0.12/0.34 dependent: clear(print_back_demod).
% 0.12/0.34 dependent: clear(print_back_sub).
% 0.12/0.34 dependent: set(control_memory).
% 0.12/0.34 dependent: assign(max_mem, 12000).
% 0.12/0.34 dependent: assign(pick_given_ratio, 4).
% 0.12/0.34 dependent: assign(stats_level, 1).
% 0.12/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.34 dependent: assign(sos_limit, 5000).
% 0.12/0.34 dependent: assign(max_weight, 60).
% 0.12/0.34 clear(print_given).
% 0.12/0.34
% 0.12/0.34 list(usable).
% 0.12/0.34
% 0.12/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.12/0.34
% 0.12/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.34 clauses in usable.
% 0.12/0.34
% 0.12/0.34 dependent: set(knuth_bendix).
% 0.12/0.34 dependent: set(para_from).
% 0.12/0.34 dependent: set(para_into).
% 0.12/0.34 dependent: clear(para_from_right).
% 0.12/0.34 dependent: clear(para_into_right).
% 0.12/0.34 dependent: set(para_from_vars).
% 0.12/0.34 dependent: set(eq_units_both_ways).
% 0.12/0.34 dependent: set(dynamic_demod_all).
% 0.12/0.34 dependent: set(dynamic_demod).
% 0.12/0.34 dependent: set(order_eq).
% 0.12/0.34 dependent: set(back_demod).
% 0.12/0.34 dependent: set(lrpo).
% 0.12/0.34 dependent: set(hyper_res).
% 0.12/0.34 dependent: set(unit_deletion).
% 0.12/0.34 dependent: set(factor).
% 0.12/0.34
% 0.12/0.34 ------------> process usable:
% 0.12/0.34
% 0.12/0.34 ------------> process sos:
% 0.12/0.34 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] {-} A=A.
% 0.12/0.34
% 0.12/0.34 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 4
% 0.12/0.38 number of clauses initially in problem: 7
% 0.12/0.38 percentage of clauses intially in UL: 57
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 87
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 8
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 2
% 0.12/0.38 distinct constant count: 3
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.59/0.76
% 0.59/0.76 -------- PROOF --------
% 0.59/0.76 % SZS status Unsatisfiable
% 0.59/0.76 % SZS output start Refutation
% 0.59/0.76
% 0.59/0.76 Stopped by limit on insertions
% 0.59/0.76
% 0.59/0.76 Model 2 [ 9 1 1142 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.76
% 0.59/0.76 ----> UNIT CONFLICT at 0.39 sec ----> 106 [binary,105.1,1.1] {-} $F.
% 0.59/0.76
% 0.59/0.76 Length of proof is 4. Level of proof is 4.
% 0.59/0.76
% 0.59/0.76 ---------------- PROOF ----------------
% 0.59/0.76 % SZS status Unsatisfiable
% 0.59/0.76 % SZS output start Refutation
% 0.59/0.76
% 0.59/0.76 1 [] {+} -c_in(A,c_emptyset,B).
% 0.59/0.76 2 [] {+} -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 0.59/0.76 3 [] {+} -c_in(A,B,tc_IntDef_Oint)|c_in(v_x(B),B,tc_IntDef_Oint).
% 0.59/0.76 4 [] {+} -c_in(A,B,tc_IntDef_Oint)| -v_P(v_x(B)).
% 0.59/0.76 5 [] {-} c_in(A,c_insert(A,B,C),C).
% 0.59/0.76 6 [] {+} v_P(v_a).
% 0.59/0.76 8 [hyper,5,3] {-} c_in(v_x(c_insert(A,B,tc_IntDef_Oint)),c_insert(A,B,tc_IntDef_Oint),tc_IntDef_Oint).
% 0.59/0.76 11 [hyper,8,2] {-} c_in(v_x(c_insert(A,B,tc_IntDef_Oint)),B,tc_IntDef_Oint)|v_x(c_insert(A,B,tc_IntDef_Oint))=A.
% 0.59/0.76 26 [para_from,11.2.1,4.2.1] {+} -c_in(A,c_insert(B,C,tc_IntDef_Oint),tc_IntDef_Oint)| -v_P(B)|c_in(v_x(c_insert(B,C,tc_IntDef_Oint)),C,tc_IntDef_Oint).
% 0.59/0.76 105 [hyper,26,8,6] {-} c_in(v_x(c_insert(v_a,A,tc_IntDef_Oint)),A,tc_IntDef_Oint).
% 0.59/0.76 106 [binary,105.1,1.1] {-} $F.
% 0.59/0.76
% 0.59/0.76 % SZS output end Refutation
% 0.59/0.76 ------------ end of proof -------------
% 0.59/0.76
% 0.59/0.76
% 0.59/0.76 Search stopped by max_proofs option.
% 0.59/0.76
% 0.59/0.76
% 0.59/0.76 Search stopped by max_proofs option.
% 0.59/0.76
% 0.59/0.76 ============ end of search ============
% 0.59/0.76
% 0.59/0.76 ----------- soft-scott stats ----------
% 0.59/0.76
% 0.59/0.76 true clauses given 3 (23.1%)
% 0.59/0.76 false clauses given 10
% 0.59/0.76
% 0.59/0.76 FALSE TRUE
% 0.59/0.76 20 0 1
% 0.59/0.76 22 4 1
% 0.59/0.76 24 0 2
% 0.59/0.76 25 1 2
% 0.59/0.76 26 6 0
% 0.59/0.76 27 0 1
% 0.59/0.76 28 1 1
% 0.59/0.76 29 10 0
% 0.59/0.76 30 2 0
% 0.59/0.76 31 0 1
% 0.59/0.76 32 2 1
% 0.59/0.76 33 12 0
% 0.59/0.76 35 4 0
% 0.59/0.76 36 14 8
% 0.59/0.76 37 5 1
% 0.59/0.76 39 4 2
% 0.59/0.76 40 0 1
% 0.59/0.76 tot: 65 22 (25.3% true)
% 0.59/0.76
% 0.59/0.76
% 0.59/0.76 Model 2 [ 9 -15 1142 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.76
% 0.59/0.76 That finishes the proof of the theorem.
% 0.59/0.76
% 0.59/0.76 Process 12053 finished Sat Jul 9 18:50:07 2022
%------------------------------------------------------------------------------