TSTP Solution File: SET642+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET642+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n010.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.38s 0.57s
% Output : Refutation 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET642+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n010.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 : Sun Jul 10 09:02:15 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n010.cluster.edu,
% 0.13/0.36 Sun Jul 10 09:02:15 2022
% 0.13/0.36 The command was "./sos". The process ID is 1453.
% 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 formula_list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 0.13/0.36
% 0.13/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.36 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: set(unit_deletion).
% 0.13/0.36 dependent: set(factor).
% 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 72 during input processing: 0 [] {-} ilf_type($c4,set_type).
% 0.13/0.36 Following clause subsumed by 72 during input processing: 0 [] {-} ilf_type($c3,set_type).
% 0.13/0.36 Following clause subsumed by 72 during input processing: 0 [] {-} ilf_type($c2,set_type).
% 0.13/0.36 72 back subsumes 68.
% 0.13/0.36 72 back subsumes 62.
% 0.13/0.36 72 back subsumes 61.
% 0.13/0.36 72 back subsumes 55.
% 0.13/0.36 72 back subsumes 49.
% 0.13/0.36 72 back subsumes 36.
% 0.13/0.36 72 back subsumes 31.
% 0.13/0.36 72 back subsumes 28.
% 0.13/0.36 72 back subsumes 27.
% 0.13/0.36 72 back subsumes 25.
% 0.13/0.36 72 back subsumes 20.
% 0.13/0.36 72 back subsumes 16.
% 0.13/0.36 72 back subsumes 10.
% 0.13/0.36 72 back subsumes 7.
% 0.13/0.36 Following clause subsumed by 75 during input processing: 0 [copy,75,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.19/0.43
% 0.19/0.43 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 -------------- Softie stats --------------
% 0.19/0.43
% 0.19/0.43 UPDATE_STOP: 300
% 0.19/0.43 SFINDER_TIME_LIMIT: 2
% 0.19/0.43 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.43 number of clauses in intial UL: 56
% 0.19/0.43 number of clauses initially in problem: 60
% 0.19/0.43 percentage of clauses intially in UL: 93
% 0.19/0.43 percentage of distinct symbols occuring in initial UL: 96
% 0.19/0.43 percent of all initial clauses that are short: 98
% 0.19/0.43 absolute distinct symbol count: 26
% 0.19/0.43 distinct predicate count: 6
% 0.19/0.43 distinct function count: 15
% 0.19/0.43 distinct constant count: 5
% 0.19/0.43
% 0.19/0.43 ---------- no more Softie stats ----------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 =========== start of search ===========
% 0.38/0.57
% 0.38/0.57 -------- PROOF --------
% 0.38/0.57 % SZS status Theorem
% 0.38/0.57 % SZS output start Refutation
% 0.38/0.57
% 0.38/0.57 Stopped by limit on insertions
% 0.38/0.57
% 0.38/0.57 ----> UNIT CONFLICT at 0.19 sec ----> 92 [binary,91.1,37.1] {-} $F.
% 0.38/0.57
% 0.38/0.57 Length of proof is 2. Level of proof is 2.
% 0.38/0.57
% 0.38/0.57 ---------------- PROOF ----------------
% 0.38/0.57 % SZS status Theorem
% 0.38/0.57 % SZS output start Refutation
% 0.38/0.57
% 0.38/0.57 1 [] {+} -ilf_type(A,set_type)| -ilf_type(B,set_type)| -ilf_type(C,set_type)| -ilf_type(D,relation_type(B,C))| -subset(A,D)|subset(A,cross_product(B,C)).
% 0.38/0.57 2 [] {+} -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.38/0.57 37 [] {+} -ilf_type($c4,relation_type($c3,$c2)).
% 0.38/0.57 72 [] {+} ilf_type(A,set_type).
% 0.38/0.57 73 [] {+} ilf_type($c1,relation_type($c3,$c2)).
% 0.38/0.57 74 [] {-} subset($c4,$c1).
% 0.38/0.57 90 [hyper,73,1,72,72,72,74] {-} subset($c4,cross_product($c3,$c2)).
% 0.38/0.57 91 [hyper,90,2,72,72,72] {-} ilf_type($c4,relation_type($c3,$c2)).
% 0.38/0.57 92 [binary,91.1,37.1] {-} $F.
% 0.38/0.57
% 0.38/0.57 % SZS output end Refutation
% 0.38/0.57 ------------ end of proof -------------
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 Search stopped by max_proofs option.
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 Search stopped by max_proofs option.
% 0.38/0.57
% 0.38/0.57 ============ end of search ============
% 0.38/0.57
% 0.38/0.57 ----------- soft-scott stats ----------
% 0.38/0.57
% 0.38/0.57 true clauses given 4 (57.1%)
% 0.38/0.57 false clauses given 3
% 0.38/0.57
% 0.38/0.57 FALSE TRUE
% 0.38/0.57 5 0 2
% 0.38/0.57 6 0 2
% 0.38/0.57 7 0 3
% 0.38/0.57 8 0 1
% 0.38/0.57 9 0 1
% 0.38/0.57 tot: 0 9 (100.0% true)
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 Model 2 (0.00 seconds, 0 Inserts)
% 0.38/0.57
% 0.38/0.57 That finishes the proof of the theorem.
% 0.38/0.57
% 0.38/0.57 Process 1453 finished Sun Jul 10 09:02:15 2022
%------------------------------------------------------------------------------