TSTP Solution File: SET985+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n004.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:22:13 EDT 2022
% Result : Theorem 0.19s 0.41s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET985+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n004.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 : Mon Jul 11 06:20:22 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 sandbox on n004.cluster.edu,
% 0.12/0.35 Mon Jul 11 06:20:22 2022
% 0.12/0.35 The command was "./sos". The process ID is 11874.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 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 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= 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: 9
% 0.12/0.38 number of clauses initially in problem: 15
% 0.12/0.38 percentage of clauses intially in UL: 60
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 81
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 11
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 1
% 0.12/0.38 distinct constant count: 7
% 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 Model 2 (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 =========== start of search ===========
% 0.19/0.41
% 0.19/0.41 -------- PROOF --------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 Stopped by limit on number of solutions
% 0.19/0.41
% 0.19/0.41 ----> UNIT CONFLICT at 0.04 sec ----> 161 [binary,160.1,8.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 Length of proof is 6. Level of proof is 6.
% 0.19/0.41
% 0.19/0.41 ---------------- PROOF ----------------
% 0.19/0.41 % SZS status Theorem
% 0.19/0.41 % SZS output start Refutation
% 0.19/0.41
% 0.19/0.41 2 [] {+} cartesian_product2(A,B)!=empty_set|A=empty_set|B=empty_set.
% 0.19/0.41 5 [] {+} -subset(cartesian_product2(A,B),cartesian_product2(C,D))|cartesian_product2(A,B)=empty_set|subset(A,C).
% 0.19/0.41 6 [] {+} -subset(cartesian_product2(A,B),cartesian_product2(C,D))|cartesian_product2(A,B)=empty_set|subset(B,D).
% 0.19/0.41 7 [] {+} -empty($c6).
% 0.19/0.41 8 [] {+} -subset($c5,$c3).
% 0.19/0.41 10 [] {+} empty(empty_set).
% 0.19/0.41 13 [] {-} subset(cartesian_product2($c6,$c5),cartesian_product2($c4,$c3))|subset(cartesian_product2($c5,$c6),cartesian_product2($c3,$c4)).
% 0.19/0.41 14 [] {+} subset(empty_set,A).
% 0.19/0.41 20 [hyper,13,6,unit_del,8] {-} subset(cartesian_product2($c5,$c6),cartesian_product2($c3,$c4))|cartesian_product2($c6,$c5)=empty_set.
% 0.19/0.41 50 [hyper,20,5,unit_del,8] {-} cartesian_product2($c6,$c5)=empty_set|cartesian_product2($c5,$c6)=empty_set.
% 0.19/0.41 75 [hyper,50,2,flip.2,flip.3] {-} cartesian_product2($c5,$c6)=empty_set|empty_set=$c6|empty_set=$c5.
% 0.19/0.41 91 [hyper,75,2,factor_simp,factor_simp] {-} empty_set=$c6|empty_set=$c5.
% 0.19/0.41 97,96 [para_from,91.1.1,10.1.1,unit_del,7] {-} empty_set=$c5.
% 0.19/0.41 160 [back_demod,14,demod,97] {-} subset($c5,A).
% 0.19/0.41 161 [binary,160.1,8.1] {-} $F.
% 0.19/0.41
% 0.19/0.41 % SZS output end Refutation
% 0.19/0.41 ------------ end of proof -------------
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Search stopped by max_proofs option.
% 0.19/0.41
% 0.19/0.41 ============ end of search ============
% 0.19/0.41
% 0.19/0.41 ----------- soft-scott stats ----------
% 0.19/0.41
% 0.19/0.41 true clauses given 3 (25.0%)
% 0.19/0.41 false clauses given 9
% 0.19/0.41
% 0.19/0.41 FALSE TRUE
% 0.19/0.41 12 5 0
% 0.19/0.41 13 2 2
% 0.19/0.41 15 6 0
% 0.19/0.41 17 8 0
% 0.19/0.41 18 4 0
% 0.19/0.41 19 3 0
% 0.19/0.41 20 10 2
% 0.19/0.41 21 2 0
% 0.19/0.41 22 4 4
% 0.19/0.41 tot: 44 8 (15.4% true)
% 0.19/0.41
% 0.19/0.41
% 0.19/0.41 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.41
% 0.19/0.41 That finishes the proof of the theorem.
% 0.19/0.41
% 0.19/0.41 Process 11874 finished Mon Jul 11 06:20:22 2022
%------------------------------------------------------------------------------