TSTP Solution File: SET003-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET003-1 : TPTP v8.1.0. Released v1.0.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:13:59 EDT 2022
% Result : Unsatisfiable 0.45s 0.70s
% Output : Refutation 0.45s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/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 06:26:52 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 sandbox on n009.cluster.edu,
% 0.12/0.36 Sun Jul 10 06:26:52 2022
% 0.12/0.36 The command was "./sos". The process ID is 28659.
% 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=4.
% 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
% 0.12/0.36 ======= end of input processing =======
% 0.12/0.40
% 0.12/0.40 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 -------------- Softie stats --------------
% 0.12/0.40
% 0.12/0.40 UPDATE_STOP: 300
% 0.12/0.40 SFINDER_TIME_LIMIT: 2
% 0.12/0.40 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.40 number of clauses in intial UL: 15
% 0.12/0.40 number of clauses initially in problem: 22
% 0.12/0.40 percentage of clauses intially in UL: 68
% 0.12/0.40 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.40 percent of all initial clauses that are short: 100
% 0.12/0.40 absolute distinct symbol count: 8
% 0.12/0.40 distinct predicate count: 4
% 0.12/0.40 distinct function count: 2
% 0.12/0.40 distinct constant count: 2
% 0.12/0.40
% 0.12/0.40 ---------- no more Softie stats ----------
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40
% 0.12/0.40 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.40
% 0.12/0.40 Stopped by limit on number of solutions
% 0.12/0.40
% 0.12/0.40 =========== start of search ===========
% 0.45/0.70
% 0.45/0.70 -------- PROOF --------
% 0.45/0.70 % SZS status Unsatisfiable
% 0.45/0.70 % SZS output start Refutation
% 0.45/0.70
% 0.45/0.70 Stopped by limit on insertions
% 0.45/0.70
% 0.45/0.70 Model 3 [ 1 1 269 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.70
% 0.45/0.70 Stopped by limit on insertions
% 0.45/0.70
% 0.45/0.70 Model 4 [ 4 0 99 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.70
% 0.45/0.70 Stopped by limit on insertions
% 0.45/0.70
% 0.45/0.70 ----> UNIT CONFLICT at 0.32 sec ----> 37 [binary,36.1,11.1] {-} $F.
% 0.45/0.70
% 0.45/0.70 Length of proof is 3. Level of proof is 3.
% 0.45/0.70
% 0.45/0.70 ---------------- PROOF ----------------
% 0.45/0.70 % SZS status Unsatisfiable
% 0.45/0.70 % SZS output start Refutation
% 0.45/0.70
% 0.45/0.70 2 [] {+} -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 0.45/0.70 8 [] {+} -union(A,B,C)| -member(D,B)|member(D,C).
% 0.45/0.70 11 [] {+} -subset(a,aUa).
% 0.45/0.70 16 [] {+} subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 0.45/0.70 18 [] {+} union(a,a,aUa).
% 0.45/0.70 24 [hyper,16,11] {+} member(member_of_1_not_of_2(a,aUa),a).
% 0.45/0.70 30 [hyper,24,8,18] {-} member(member_of_1_not_of_2(a,aUa),aUa).
% 0.45/0.70 36 [hyper,30,2] {-} subset(a,aUa).
% 0.45/0.70 37 [binary,36.1,11.1] {-} $F.
% 0.45/0.70
% 0.45/0.70 % SZS output end Refutation
% 0.45/0.70 ------------ end of proof -------------
% 0.45/0.70
% 0.45/0.70
% 0.45/0.70 Search stopped by max_proofs option.
% 0.45/0.70
% 0.45/0.70
% 0.45/0.70 Search stopped by max_proofs option.
% 0.45/0.70
% 0.45/0.70 ============ end of search ============
% 0.45/0.70
% 0.45/0.70 ----------- soft-scott stats ----------
% 0.45/0.70
% 0.45/0.70 true clauses given 0 (0.0%)
% 0.45/0.70 false clauses given 4
% 0.45/0.70
% 0.45/0.70 FALSE TRUE
% 0.45/0.70 8 1 0
% 0.45/0.70 10 2 3
% 0.45/0.70 11 0 3
% 0.45/0.70 13 1 1
% 0.45/0.70 16 4 0
% 0.45/0.70 22 1 0
% 0.45/0.70 tot: 9 7 (43.8% true)
% 0.45/0.70
% 0.45/0.70
% 0.45/0.70 Model 4 [ 4 -5 99 ] (0.00 seconds, 250000 Inserts)
% 0.45/0.70
% 0.45/0.70 That finishes the proof of the theorem.
% 0.45/0.70
% 0.45/0.70 Process 28659 finished Sun Jul 10 06:26:52 2022
%------------------------------------------------------------------------------