TSTP Solution File: SET006-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:14:00 EDT 2022
% Result : Unsatisfiable 0.52s 0.72s
% Output : Refutation 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n021.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 : Sun Jul 10 04:07:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n021.cluster.edu,
% 0.12/0.35 Sun Jul 10 04:07:37 2022
% 0.12/0.35 The command was "./sos". The process ID is 2007.
% 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=4.
% 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
% 0.12/0.35 ======= 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: 16
% 0.12/0.39 number of clauses initially in problem: 22
% 0.12/0.39 percentage of clauses intially in UL: 72
% 0.12/0.39 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.39 percent of all initial clauses that are short: 100
% 0.12/0.39 absolute distinct symbol count: 8
% 0.12/0.39 distinct predicate count: 4
% 0.12/0.39 distinct function count: 2
% 0.12/0.39 distinct constant count: 2
% 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.52/0.72
% 0.52/0.72 -------- PROOF --------
% 0.52/0.72 % SZS status Unsatisfiable
% 0.52/0.72 % SZS output start Refutation
% 0.52/0.72
% 0.52/0.72 Stopped by limit on insertions
% 0.52/0.72
% 0.52/0.72 Model 3 [ 1 1 238 ] (0.00 seconds, 250000 Inserts)
% 0.52/0.72
% 0.52/0.72 Stopped by limit on insertions
% 0.52/0.72
% 0.52/0.72 Model 4 [ 1 0 98 ] (0.00 seconds, 250000 Inserts)
% 0.52/0.72
% 0.52/0.72 Stopped by limit on insertions
% 0.52/0.72
% 0.52/0.72 ----> UNIT CONFLICT at 0.35 sec ----> 37 [binary,36.1,10.1] {-} $F.
% 0.52/0.72
% 0.52/0.72 Length of proof is 3. Level of proof is 3.
% 0.52/0.72
% 0.52/0.72 ---------------- PROOF ----------------
% 0.52/0.72 % SZS status Unsatisfiable
% 0.52/0.72 % SZS output start Refutation
% 0.52/0.72
% 0.52/0.72 2 [] {+} -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 0.52/0.72 7 [] {+} -intersection(A,B,C)| -member(D,C)|member(D,B).
% 0.52/0.72 10 [] {+} -subset(d,a).
% 0.52/0.72 17 [] {+} subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 0.52/0.72 20 [] {+} intersection(d,a,d).
% 0.52/0.72 24 [hyper,17,10] {+} member(member_of_1_not_of_2(d,a),d).
% 0.52/0.72 30 [hyper,24,7,20] {-} member(member_of_1_not_of_2(d,a),a).
% 0.52/0.72 36 [hyper,30,2] {-} subset(d,a).
% 0.52/0.72 37 [binary,36.1,10.1] {-} $F.
% 0.52/0.72
% 0.52/0.72 % SZS output end Refutation
% 0.52/0.72 ------------ end of proof -------------
% 0.52/0.72
% 0.52/0.72
% 0.52/0.72 Search stopped by max_proofs option.
% 0.52/0.72
% 0.52/0.72
% 0.52/0.72 Search stopped by max_proofs option.
% 0.52/0.72
% 0.52/0.72 ============ end of search ============
% 0.52/0.72
% 0.52/0.72 ----------- soft-scott stats ----------
% 0.52/0.72
% 0.52/0.72 true clauses given 0 (0.0%)
% 0.52/0.72 false clauses given 4
% 0.52/0.72
% 0.52/0.72 FALSE TRUE
% 0.52/0.72 8 0 1
% 0.52/0.72 10 5 1
% 0.52/0.72 11 0 3
% 0.52/0.72 13 1 1
% 0.52/0.72 16 3 0
% 0.52/0.72 tot: 9 6 (40.0% true)
% 0.52/0.72
% 0.52/0.72
% 0.52/0.72 Model 4 [ 1 -6 98 ] (0.00 seconds, 250000 Inserts)
% 0.52/0.72
% 0.52/0.72 That finishes the proof of the theorem.
% 0.52/0.72
% 0.52/0.72 Process 2007 finished Sun Jul 10 04:07:37 2022
%------------------------------------------------------------------------------