TSTP Solution File: SET839-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:21:07 EDT 2022
% Result : Unsatisfiable 0.41s 0.59s
% Output : Refutation 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n009.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 : Sun Jul 10 14:08:07 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 n009.cluster.edu,
% 0.12/0.36 Sun Jul 10 14:08:07 2022
% 0.12/0.36 The command was "./sos". The process ID is 22058.
% 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 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 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 9 during input processing: 0 [copy,9,flip.1] {-} A=A.
% 0.12/0.36 9 back subsumes 6.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 5
% 0.19/0.43 number of clauses initially in problem: 8
% 0.19/0.43 percentage of clauses intially in UL: 62
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.43 percent of all initial clauses that are short: 100
% 0.19/0.43 absolute distinct symbol count: 9
% 0.19/0.43 distinct predicate count: 3
% 0.19/0.43 distinct function count: 3
% 0.19/0.43 distinct constant count: 3
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 0.41/0.59
% 0.41/0.59 -------- PROOF --------
% 0.41/0.59 % SZS status Unsatisfiable
% 0.41/0.59 % SZS output start Refutation
% 0.41/0.59
% 0.41/0.59 Stopped by limit on insertions
% 0.41/0.59
% 0.41/0.59 ----> UNIT CONFLICT at 0.20 sec ----> 139 [binary,138.1,7.1] {-} $F.
% 0.41/0.59
% 0.41/0.59 Length of proof is 4. Level of proof is 4.
% 0.41/0.59
% 0.41/0.59 ---------------- PROOF ----------------
% 0.41/0.59 % SZS status Unsatisfiable
% 0.41/0.59 % SZS output start Refutation
% 0.41/0.59
% 0.41/0.59 1 [] {+} -c_lessequals(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))).
% 0.41/0.59 2 [] {+} c_lessequals(A,B,tc_set(t_a))| -c_in(B,v_S,tc_set(t_a))| -c_in(A,v_S,tc_set(t_a)).
% 0.41/0.59 3 [] {+} -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lessequals(A,B,tc_set(C)).
% 0.41/0.59 4 [] {+} -c_lessequals(A,B,tc_set(C))| -c_lessequals(B,A,tc_set(C))|B=A.
% 0.41/0.59 7 [] {+} c_in(A,c_insert(A,B,C),C).
% 0.41/0.59 8 [] {-} c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lessequals(A,B,tc_set(C)).
% 0.41/0.59 12 [hyper,8,1] {-} c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_S,tc_set(t_a)).
% 0.41/0.59 16 [hyper,12,2,12] {-} c_lessequals(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)).
% 0.41/0.59 85 [hyper,16,4,16] {-} c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a))=c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)).
% 0.41/0.59 138 [para_from,85.1.1,3.1.1,unit_del,1] {-} -c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)).
% 0.41/0.59 139 [binary,138.1,7.1] {-} $F.
% 0.41/0.59
% 0.41/0.59 % SZS output end Refutation
% 0.41/0.59 ------------ end of proof -------------
% 0.41/0.59
% 0.41/0.59
% 0.41/0.59 Search stopped by max_proofs option.
% 0.41/0.59
% 0.41/0.59
% 0.41/0.59 Search stopped by max_proofs option.
% 0.41/0.59
% 0.41/0.59 ============ end of search ============
% 0.41/0.59
% 0.41/0.59 ----------- soft-scott stats ----------
% 0.41/0.59
% 0.41/0.59 true clauses given 2 (25.0%)
% 0.41/0.59 false clauses given 6
% 0.41/0.59
% 0.41/0.59 FALSE TRUE
% 0.41/0.59 22 2 0
% 0.41/0.59 23 4 3
% 0.41/0.59 24 4 6
% 0.41/0.59 25 1 0
% 0.41/0.59 26 2 2
% 0.41/0.59 27 8 0
% 0.41/0.59 28 3 0
% 0.41/0.59 29 5 5
% 0.41/0.59 30 2 0
% 0.41/0.59 31 6 9
% 0.41/0.59 32 2 6
% 0.41/0.59 33 0 2
% 0.41/0.59 35 11 1
% 0.41/0.59 36 1 1
% 0.41/0.59 37 7 0
% 0.41/0.59 39 1 1
% 0.41/0.59 40 2 2
% 0.41/0.59 42 0 2
% 0.41/0.59 43 3 0
% 0.41/0.59 51 2 0
% 0.41/0.59 tot: 66 40 (37.7% true)
% 0.41/0.59
% 0.41/0.59
% 0.41/0.59 Model 2 (0.00 seconds, 0 Inserts)
% 0.41/0.59
% 0.41/0.59 That finishes the proof of the theorem.
% 0.41/0.59
% 0.41/0.59 Process 22058 finished Sun Jul 10 14:08:07 2022
%------------------------------------------------------------------------------