TSTP Solution File: SET603+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:18 EDT 2022
% Result : Theorem 0.19s 0.56s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET603+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n024.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 : Sun Jul 10 14:41:43 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 sandbox2 on n024.cluster.edu,
% 0.12/0.35 Sun Jul 10 14:41:43 2022
% 0.12/0.35 The command was "./sos". The process ID is 21470.
% 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 24 during input processing: 0 [copy,24,flip.1] {-} A=A.
% 0.12/0.35 24 back subsumes 18.
% 0.12/0.35 24 back subsumes 17.
% 0.12/0.35 24 back subsumes 16.
% 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: 15
% 0.12/0.38 number of clauses initially in problem: 21
% 0.12/0.38 percentage of clauses intially in UL: 71
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 90
% 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: 4
% 0.12/0.38 distinct function count: 5
% 0.12/0.38 distinct constant count: 2
% 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.19/0.56
% 0.19/0.56 -------- PROOF --------
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 % SZS output start Refutation
% 0.19/0.56
% 0.19/0.56 Model 2 [ 2 0 88 ] (0.00 seconds, 7072 Inserts)
% 0.19/0.56
% 0.19/0.56 Model 3 [ 3 1 353 ] (0.00 seconds, 5400 Inserts)
% 0.19/0.56
% 0.19/0.56 Model 4 [ 5 0 240 ] (0.00 seconds, 7215 Inserts)
% 0.19/0.56
% 0.19/0.56 ----> UNIT CONFLICT at 0.19 sec ----> 546 [binary,544.1,15.1] {+} $F.
% 0.19/0.56
% 0.19/0.56 Length of proof is 6. Level of proof is 5.
% 0.19/0.56
% 0.19/0.56 ---------------- PROOF ----------------
% 0.19/0.56 % SZS status Theorem
% 0.19/0.56 % SZS output start Refutation
% 0.19/0.56
% 0.19/0.56 1 [] {+} -member($f1(A,B),A)| -member($f1(A,B),B)|A=B.
% 0.19/0.56 2 [] {+} -member(A,difference(B,C))|member(A,B).
% 0.19/0.56 4 [] {+} member(A,difference(B,C))| -member(A,B)|member(A,C).
% 0.19/0.56 5 [] {+} -member(A,empty_set).
% 0.19/0.56 15 [] {+} difference($c1,empty_set)!=$c1.
% 0.19/0.56 19 [] {-} member($f1(A,B),A)|member($f1(A,B),B)|A=B.
% 0.19/0.56 24 [] {+} A=A.
% 0.19/0.56 26 [hyper,19,4] {-} member($f1(A,B),B)|A=B|member($f1(A,B),difference(A,C))|member($f1(A,B),C).
% 0.19/0.56 31 [hyper,19,2] {-} member($f1(A,difference(B,C)),A)|A=difference(B,C)|member($f1(A,difference(B,C)),B).
% 0.19/0.56 37 [factor,31.1.3,flip.2] {-} member($f1(A,difference(A,B)),A)|difference(A,B)=A.
% 0.19/0.56 465 [para_from,37.2.1,15.1.1,unit_del,24] {-} member($f1($c1,difference($c1,empty_set)),$c1).
% 0.19/0.56 497 [hyper,465,1,26,unit_del,15,15,5] {-} member($f1($c1,difference($c1,empty_set)),difference($c1,empty_set)).
% 0.19/0.56 544 [hyper,497,1,465,flip.1] {-} difference($c1,empty_set)=$c1.
% 0.19/0.56 546 [binary,544.1,15.1] {+} $F.
% 0.19/0.56
% 0.19/0.56 % SZS output end Refutation
% 0.19/0.56 ------------ end of proof -------------
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Search stopped by max_proofs option.
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Search stopped by max_proofs option.
% 0.19/0.56
% 0.19/0.56 ============ end of search ============
% 0.19/0.56
% 0.19/0.56 ----------- soft-scott stats ----------
% 0.19/0.56
% 0.19/0.56 true clauses given 3 (20.0%)
% 0.19/0.56 false clauses given 12
% 0.19/0.56
% 0.19/0.56 FALSE TRUE
% 0.19/0.56 5 0 1
% 0.19/0.56 7 0 1
% 0.19/0.56 8 0 4
% 0.19/0.56 9 0 2
% 0.19/0.56 10 0 7
% 0.19/0.56 11 0 1
% 0.19/0.56 12 8 6
% 0.19/0.56 13 12 14
% 0.19/0.56 14 1 14
% 0.19/0.56 15 7 5
% 0.19/0.56 16 6 6
% 0.19/0.56 17 20 13
% 0.19/0.56 18 8 3
% 0.19/0.56 19 14 3
% 0.19/0.56 20 11 2
% 0.19/0.56 21 16 9
% 0.19/0.56 22 21 15
% 0.19/0.56 23 6 2
% 0.19/0.56 24 16 6
% 0.19/0.56 25 15 8
% 0.19/0.56 26 10 9
% 0.19/0.56 27 15 18
% 0.19/0.56 28 10 1
% 0.19/0.56 29 13 13
% 0.19/0.56 30 8 5
% 0.19/0.56 31 10 4
% 0.19/0.56 32 2 3
% 0.19/0.56 33 0 2
% 0.19/0.56 34 8 9
% 0.19/0.56 35 6 0
% 0.19/0.56 36 11 9
% 0.19/0.56 37 1 1
% 0.19/0.56 38 5 1
% 0.19/0.56 39 2 5
% 0.19/0.56 40 5 0
% 0.19/0.56 41 3 8
% 0.19/0.56 43 6 0
% 0.19/0.56 44 1 0
% 0.19/0.56 45 0 2
% 0.19/0.56 48 3 2
% 0.19/0.56 49 1 0
% 0.19/0.56 50 2 2
% 0.19/0.56 55 1 0
% 0.19/0.56 59 1 0
% 0.19/0.56 tot: 285 216 (43.1% true)
% 0.19/0.56
% 0.19/0.56
% 0.19/0.56 Model 4 [ 5 -8 240 ] (0.00 seconds, 7215 Inserts)
% 0.19/0.56
% 0.19/0.56 That finishes the proof of the theorem.
% 0.19/0.56
% 0.19/0.56 Process 21470 finished Sun Jul 10 14:41:43 2022
%------------------------------------------------------------------------------