TSTP Solution File: SET643+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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:45 EDT 2022
% Result : Theorem 0.58s 0.74s
% Output : Refutation 0.58s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET643+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : sos-script %s
% 0.12/0.34 % Computer : n029.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 04:20:46 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.39 ----- Otter 3.2, August 2001 -----
% 0.20/0.39 The process was started by sandbox on n029.cluster.edu,
% 0.20/0.39 Sun Jul 10 04:20:46 2022
% 0.20/0.39 The command was "./sos". The process ID is 23625.
% 0.20/0.39
% 0.20/0.39 set(prolog_style_variables).
% 0.20/0.39 set(auto).
% 0.20/0.39 dependent: set(auto1).
% 0.20/0.39 dependent: set(process_input).
% 0.20/0.39 dependent: clear(print_kept).
% 0.20/0.39 dependent: clear(print_new_demod).
% 0.20/0.39 dependent: clear(print_back_demod).
% 0.20/0.39 dependent: clear(print_back_sub).
% 0.20/0.39 dependent: set(control_memory).
% 0.20/0.39 dependent: assign(max_mem, 12000).
% 0.20/0.39 dependent: assign(pick_given_ratio, 4).
% 0.20/0.39 dependent: assign(stats_level, 1).
% 0.20/0.39 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.39 dependent: assign(sos_limit, 5000).
% 0.20/0.39 dependent: assign(max_weight, 60).
% 0.20/0.39 clear(print_given).
% 0.20/0.39
% 0.20/0.39 formula_list(usable).
% 0.20/0.39
% 0.20/0.39 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=9.
% 0.20/0.39
% 0.20/0.39 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.39 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.39 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.39 clauses in usable.
% 0.20/0.39
% 0.20/0.39 dependent: set(knuth_bendix).
% 0.20/0.39 dependent: set(para_from).
% 0.20/0.39 dependent: set(para_into).
% 0.20/0.39 dependent: clear(para_from_right).
% 0.20/0.39 dependent: clear(para_into_right).
% 0.20/0.39 dependent: set(para_from_vars).
% 0.20/0.39 dependent: set(eq_units_both_ways).
% 0.20/0.39 dependent: set(dynamic_demod_all).
% 0.20/0.39 dependent: set(dynamic_demod).
% 0.20/0.39 dependent: set(order_eq).
% 0.20/0.39 dependent: set(back_demod).
% 0.20/0.39 dependent: set(lrpo).
% 0.20/0.39 dependent: set(hyper_res).
% 0.20/0.39 dependent: set(unit_deletion).
% 0.20/0.39 dependent: set(factor).
% 0.20/0.39
% 0.20/0.39 ------------> process usable:
% 0.20/0.39
% 0.20/0.39 ------------> process sos:
% 0.20/0.39 Following clause subsumed by 145 during input processing: 0 [] {-} ilf_type($c2,set_type).
% 0.20/0.39 Following clause subsumed by 145 during input processing: 0 [] {-} ilf_type($c1,set_type).
% 0.20/0.39 145 back subsumes 100.
% 0.20/0.39 145 back subsumes 99.
% 0.20/0.39 145 back subsumes 92.
% 0.20/0.39 145 back subsumes 91.
% 0.20/0.39 145 back subsumes 85.
% 0.20/0.39 145 back subsumes 77.
% 0.20/0.39 145 back subsumes 73.
% 0.20/0.39 145 back subsumes 52.
% 0.20/0.39 145 back subsumes 51.
% 0.20/0.39 145 back subsumes 50.
% 0.20/0.39 145 back subsumes 49.
% 0.20/0.39 145 back subsumes 48.
% 0.20/0.39 145 back subsumes 47.
% 0.20/0.39 145 back subsumes 38.
% 0.20/0.39 145 back subsumes 35.
% 0.20/0.39 145 back subsumes 34.
% 0.20/0.39 145 back subsumes 32.
% 0.20/0.39 145 back subsumes 27.
% 0.20/0.39 145 back subsumes 23.
% 0.20/0.39 145 back subsumes 18.
% 0.20/0.39 145 back subsumes 13.
% 0.20/0.39 145 back subsumes 9.
% 0.20/0.39 145 back subsumes 3.
% 0.20/0.39 145 back subsumes 2.
% 0.20/0.39 Following clause subsumed by 146 during input processing: 0 [copy,146,flip.1] {-} A=A.
% 0.20/0.39
% 0.20/0.39 ======= end of input processing =======
% 0.39/0.60
% 0.39/0.60 Model 1 (0.00 seconds, 0 Inserts)
% 0.39/0.60
% 0.39/0.60 Stopped by limit on number of solutions
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 -------------- Softie stats --------------
% 0.39/0.60
% 0.39/0.60 UPDATE_STOP: 300
% 0.39/0.60 SFINDER_TIME_LIMIT: 2
% 0.39/0.60 SHORT_CLAUSE_CUTOFF: 4
% 0.39/0.60 number of clauses in intial UL: 118
% 0.39/0.60 number of clauses initially in problem: 120
% 0.39/0.60 percentage of clauses intially in UL: 98
% 0.39/0.60 percentage of distinct symbols occuring in initial UL: 100
% 0.39/0.60 percent of all initial clauses that are short: 100
% 0.39/0.60 absolute distinct symbol count: 26
% 0.39/0.60 distinct predicate count: 6
% 0.39/0.60 distinct function count: 17
% 0.39/0.60 distinct constant count: 3
% 0.39/0.60
% 0.39/0.60 ---------- no more Softie stats ----------
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60
% 0.39/0.60 Stopped by limit on insertions
% 0.39/0.60
% 0.39/0.60 =========== start of search ===========
% 0.58/0.74
% 0.58/0.74 -------- PROOF --------
% 0.58/0.74 % SZS status Theorem
% 0.58/0.74 % SZS output start Refutation
% 0.58/0.74
% 0.58/0.74 Stopped by limit on insertions
% 0.58/0.74
% 0.58/0.74 Model 2 [ 3 0 556 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.74
% 0.58/0.74 ----> UNIT CONFLICT at 0.35 sec ----> 159 [binary,158.1,43.1] {-} $F.
% 0.58/0.74
% 0.58/0.74 Length of proof is 2. Level of proof is 2.
% 0.58/0.74
% 0.58/0.74 ---------------- PROOF ----------------
% 0.58/0.74 % SZS status Theorem
% 0.58/0.74 % SZS output start Refutation
% 0.58/0.74
% 0.58/0.74 1 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -subset(A,cross_product(B,C))|ilf_type(A,relation_type(B,C)).
% 0.58/0.74 21 [] {+} -ilf_type(A,set_type)|subset(A,A).
% 0.58/0.74 43 [] {+} -ilf_type(cross_product($c2,$c1),relation_type($c2,$c1)).
% 0.58/0.74 145 [] {-} ilf_type(A,set_type).
% 0.58/0.74 153 [hyper,145,21] {+} subset(A,A).
% 0.58/0.74 158 [hyper,153,1,145,145,145] {-} ilf_type(cross_product(A,B),relation_type(A,B)).
% 0.58/0.74 159 [binary,158.1,43.1] {-} $F.
% 0.58/0.74
% 0.58/0.74 % SZS output end Refutation
% 0.58/0.74 ------------ end of proof -------------
% 0.58/0.74
% 0.58/0.74
% 0.58/0.74 Search stopped by max_proofs option.
% 0.58/0.74
% 0.58/0.74
% 0.58/0.74 Search stopped by max_proofs option.
% 0.58/0.74
% 0.58/0.74 ============ end of search ============
% 0.58/0.74
% 0.58/0.74 ----------- soft-scott stats ----------
% 0.58/0.74
% 0.58/0.74 true clauses given 0 (0.0%)
% 0.58/0.74 false clauses given 2
% 0.58/0.74
% 0.58/0.74 FALSE TRUE
% 0.58/0.74 3 0 1
% 0.58/0.74 5 0 1
% 0.58/0.74 6 1 1
% 0.58/0.74 7 1 1
% 0.58/0.74 8 1 0
% 0.58/0.74 9 1 0
% 0.58/0.74 tot: 4 4 (50.0% true)
% 0.58/0.74
% 0.58/0.74
% 0.58/0.74 Model 2 [ 3 0 556 ] (0.00 seconds, 250000 Inserts)
% 0.58/0.74
% 0.58/0.74 That finishes the proof of the theorem.
% 0.58/0.74
% 0.58/0.74 Process 23625 finished Sun Jul 10 04:20:46 2022
%------------------------------------------------------------------------------