TSTP Solution File: SET658+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET658+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n016.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:19:52 EDT 2022
% Result : Theorem 0.76s 0.98s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET658+3 : TPTP v8.1.0. Released v2.2.0.
% 0.12/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n016.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 21:15:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox2 on n016.cluster.edu,
% 0.12/0.36 Sat Jul 9 21:15:25 2022
% 0.12/0.36 The command was "./sos". The process ID is 23773.
% 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 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 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 84 back subsumes 72.
% 0.12/0.36 84 back subsumes 63.
% 0.12/0.36 84 back subsumes 62.
% 0.12/0.36 84 back subsumes 57.
% 0.12/0.36 84 back subsumes 56.
% 0.12/0.36 84 back subsumes 43.
% 0.12/0.36 84 back subsumes 38.
% 0.12/0.36 84 back subsumes 34.
% 0.12/0.36 84 back subsumes 29.
% 0.12/0.36 84 back subsumes 26.
% 0.12/0.36 84 back subsumes 25.
% 0.12/0.36 84 back subsumes 21.
% 0.12/0.36 84 back subsumes 16.
% 0.12/0.36 84 back subsumes 15.
% 0.12/0.36 84 back subsumes 9.
% 0.12/0.36 84 back subsumes 6.
% 0.12/0.36 84 back subsumes 5.
% 0.12/0.36 84 back subsumes 2.
% 0.12/0.36 Following clause subsumed by 86 during input processing: 0 [copy,86,flip.1] {-} A=A.
% 0.12/0.36
% 0.12/0.36 ======= 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: 63
% 0.12/0.38 number of clauses initially in problem: 67
% 0.12/0.38 percentage of clauses intially in UL: 94
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 96
% 0.12/0.38 percent of all initial clauses that are short: 98
% 0.12/0.38 absolute distinct symbol count: 31
% 0.12/0.38 distinct predicate count: 6
% 0.12/0.38 distinct function count: 21
% 0.12/0.38 distinct constant count: 4
% 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.76/0.98
% 0.76/0.98 -------- PROOF --------
% 0.76/0.98 % SZS status Theorem
% 0.76/0.98 % SZS output start Refutation
% 0.76/0.98
% 0.76/0.98 Model 2 (0.00 seconds, 0 Inserts)
% 0.76/0.98
% 0.76/0.98 Stopped by limit on number of solutions
% 0.76/0.98
% 0.76/0.98 Stopped by limit on insertions
% 0.76/0.98
% 0.76/0.98 Model 3 [ 1 3 27860 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.98
% 0.76/0.98 Stopped by limit on insertions
% 0.76/0.98
% 0.76/0.98 Model 4 [ 4 1 607 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.98
% 0.76/0.98 Stopped by limit on insertions
% 0.76/0.98
% 0.76/0.98 Stopped by limit on insertions
% 0.76/0.98
% 0.76/0.98 ----> UNIT CONFLICT at 0.60 sec ----> 100 [binary,99.1,50.1] {-} $F.
% 0.76/0.98
% 0.76/0.98 Length of proof is 2. Level of proof is 2.
% 0.76/0.98
% 0.76/0.98 ---------------- PROOF ----------------
% 0.76/0.98 % SZS status Theorem
% 0.76/0.98 % SZS output start Refutation
% 0.76/0.98
% 0.76/0.98 1 [] {+} -ilf_type(A,set_type)| -ilf_type(B,binary_relation_type)| -subset(domain_of(B),A)|ilf_type(B,relation_type(A,range_of(B))).
% 0.76/0.98 24 [] {+} -ilf_type(A,set_type)|subset(A,A).
% 0.76/0.98 50 [] {+} -ilf_type($c2,relation_type(domain_of($c2),range_of($c2))).
% 0.76/0.98 84 [] {+} ilf_type(A,set_type).
% 0.76/0.98 85 [] {+} ilf_type($c2,binary_relation_type).
% 0.76/0.98 93 [hyper,84,24] {-} subset(A,A).
% 0.76/0.98 99 [hyper,93,1,84,85] {-} ilf_type($c2,relation_type(domain_of($c2),range_of($c2))).
% 0.76/0.98 100 [binary,99.1,50.1] {-} $F.
% 0.76/0.98
% 0.76/0.98 % SZS output end Refutation
% 0.76/0.98 ------------ end of proof -------------
% 0.76/0.98
% 0.76/0.98
% 0.76/0.98 Search stopped by max_proofs option.
% 0.76/0.98
% 0.76/0.98
% 0.76/0.98 Search stopped by max_proofs option.
% 0.76/0.98
% 0.76/0.98 ============ end of search ============
% 0.76/0.98
% 0.76/0.98 ----------- soft-scott stats ----------
% 0.76/0.98
% 0.76/0.98 true clauses given 2 (28.6%)
% 0.76/0.98 false clauses given 5
% 0.76/0.98
% 0.76/0.98 FALSE TRUE
% 0.76/0.98 5 1 0
% 0.76/0.98 6 2 0
% 0.76/0.98 7 2 0
% 0.76/0.98 8 1 0
% 0.76/0.98 9 1 0
% 0.76/0.98 tot: 7 0 (0.0% true)
% 0.76/0.98
% 0.76/0.98
% 0.76/0.98 Model 4 [ 4 -15 607 ] (0.00 seconds, 250000 Inserts)
% 0.76/0.98
% 0.76/0.98 That finishes the proof of the theorem.
% 0.76/0.98
% 0.76/0.98 Process 23773 finished Sat Jul 9 21:15:26 2022
%------------------------------------------------------------------------------