TSTP Solution File: SET864-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET864-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n008.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:26 EDT 2022
% Result : Unsatisfiable 0.13s 0.39s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SET864-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 11 02:28:08 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n008.cluster.edu,
% 0.13/0.36 Mon Jul 11 02:28:08 2022
% 0.13/0.36 The command was "./sos". The process ID is 17123.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 Stopped by limit on number of solutions
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 -------------- Softie stats --------------
% 0.13/0.39
% 0.13/0.39 UPDATE_STOP: 300
% 0.13/0.39 SFINDER_TIME_LIMIT: 2
% 0.13/0.39 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.39 number of clauses in intial UL: 4
% 0.13/0.39 number of clauses initially in problem: 7
% 0.13/0.39 percentage of clauses intially in UL: 57
% 0.13/0.39 percentage of distinct symbols occuring in initial UL: 90
% 0.13/0.39 percent of all initial clauses that are short: 85
% 0.13/0.39 absolute distinct symbol count: 10
% 0.13/0.39 distinct predicate count: 3
% 0.13/0.39 distinct function count: 4
% 0.13/0.39 distinct constant count: 3
% 0.13/0.39
% 0.13/0.39 ---------- no more Softie stats ----------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 =========== start of search ===========
% 0.13/0.39
% 0.13/0.39 -------- PROOF --------
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39 % SZS output start Refutation
% 0.13/0.39
% 0.13/0.39 -----> EMPTY CLAUSE at 0.01 sec ----> 22 [hyper,18,5,7] {-} $F.
% 0.13/0.39
% 0.13/0.39 Length of proof is 4. Level of proof is 2.
% 0.13/0.39
% 0.13/0.39 ---------------- PROOF ----------------
% 0.13/0.39 % SZS status Unsatisfiable
% 0.13/0.39 % SZS output start Refutation
% 0.13/0.39
% 0.13/0.39 1 [] {+} -c_in(A,B,tc_set(C))| -c_in(D,c_Zorn_Omaxchain(B,C),tc_set(tc_set(C)))| -c_lessequals(c_Union(D,C),A,tc_set(C))|c_Union(D,C)=A.
% 0.13/0.39 2 [] {+} c_in(v_x(A),v_S,tc_set(t_a))| -c_in(A,v_S,tc_set(t_a)).
% 0.13/0.39 3 [] {+} c_lessequals(A,v_x(A),tc_set(t_a))| -c_in(A,v_S,tc_set(t_a)).
% 0.13/0.39 4 [] {-} A!=v_x(A)| -c_in(A,v_S,tc_set(t_a)).
% 0.13/0.39 5 [copy,4,flip.1] {+} v_x(A)!=A| -c_in(A,v_S,tc_set(t_a)).
% 0.13/0.39 6 [] {-} c_in(v_c,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))).
% 0.13/0.39 7 [] {-} c_in(c_Union(v_c,t_a),v_S,tc_set(t_a)).
% 0.13/0.39 9 [hyper,7,3] {+} c_lessequals(c_Union(v_c,t_a),v_x(c_Union(v_c,t_a)),tc_set(t_a)).
% 0.13/0.39 10 [hyper,7,2] {-} c_in(v_x(c_Union(v_c,t_a)),v_S,tc_set(t_a)).
% 0.13/0.39 18 [hyper,9,1,10,6,flip.1] {+} v_x(c_Union(v_c,t_a))=c_Union(v_c,t_a).
% 0.13/0.39 22 [hyper,18,5,7] {-} $F.
% 0.13/0.39
% 0.13/0.39 % SZS output end Refutation
% 0.13/0.39 ------------ end of proof -------------
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Search stopped by max_proofs option.
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Search stopped by max_proofs option.
% 0.13/0.39
% 0.13/0.39 ============ end of search ============
% 0.13/0.39
% 0.13/0.39 ----------- soft-scott stats ----------
% 0.13/0.39
% 0.13/0.39 true clauses given 3 (37.5%)
% 0.13/0.39 false clauses given 5
% 0.13/0.39
% 0.13/0.39 FALSE TRUE
% 0.13/0.39 9 0 1
% 0.13/0.39 12 0 1
% 0.13/0.39 14 0 1
% 0.13/0.39 25 0 1
% 0.13/0.39 26 0 1
% 0.13/0.39 27 0 1
% 0.13/0.39 28 0 1
% 0.13/0.39 tot: 0 7 (100.0% true)
% 0.13/0.39
% 0.13/0.39
% 0.13/0.39 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.39
% 0.13/0.39 That finishes the proof of the theorem.
% 0.13/0.39
% 0.13/0.39 Process 17123 finished Mon Jul 11 02:28:08 2022
%------------------------------------------------------------------------------