TSTP Solution File: SET947+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n018.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:02 EDT 2022
% Result : Theorem 0.38s 0.56s
% Output : Refutation 0.38s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET947+1 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n018.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 : Mon Jul 11 01:18:13 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 n018.cluster.edu,
% 0.13/0.36 Mon Jul 11 01:18:13 2022
% 0.13/0.36 The command was "./sos". The process ID is 17000.
% 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=3.
% 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 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 10
% 0.13/0.38 number of clauses initially in problem: 15
% 0.13/0.38 percentage of clauses intially in UL: 66
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 90
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 11
% 0.13/0.38 distinct predicate count: 4
% 0.13/0.38 distinct function count: 4
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.38/0.56
% 0.38/0.56 -------- PROOF --------
% 0.38/0.56 % SZS status Theorem
% 0.38/0.56 % SZS output start Refutation
% 0.38/0.56
% 0.38/0.56 Model 2 [ 9 0 73 ] (0.00 seconds, 1121 Inserts)
% 0.38/0.56
% 0.38/0.56 ----> UNIT CONFLICT at 0.19 sec ----> 706 [binary,705.1,9.1] {-} $F.
% 0.38/0.56
% 0.38/0.56 Length of proof is 4. Level of proof is 4.
% 0.38/0.56
% 0.38/0.56 ---------------- PROOF ----------------
% 0.38/0.56 % SZS status Theorem
% 0.38/0.56 % SZS output start Refutation
% 0.38/0.56
% 0.38/0.56 3 [] {+} A!=powerset(B)|in(C,A)| -subset(C,B).
% 0.38/0.56 6 [] {+} subset(A,B)| -in($f2(A,B),B).
% 0.38/0.56 7 [] {+} -in(A,B)|subset(A,union(B)).
% 0.38/0.56 9 [] {+} -subset($c3,powerset(union($c3))).
% 0.38/0.56 12 [] {-} subset(A,B)|in($f2(A,B),A).
% 0.38/0.56 15 [] {+} A=A.
% 0.38/0.56 29 [hyper,12,9] {-} in($f2($c3,powerset(union($c3))),$c3).
% 0.38/0.56 32 [hyper,29,7] {-} subset($f2($c3,powerset(union($c3))),union($c3)).
% 0.38/0.57 162 [hyper,32,3,15] {-} in($f2($c3,powerset(union($c3))),powerset(union($c3))).
% 0.38/0.57 705 [hyper,162,6] {-} subset($c3,powerset(union($c3))).
% 0.38/0.57 706 [binary,705.1,9.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 3 (11.1%)
% 0.38/0.57 false clauses given 24
% 0.38/0.57
% 0.38/0.57 FALSE TRUE
% 0.38/0.57 8 0 1
% 0.38/0.57 9 6 1
% 0.38/0.57 10 10 1
% 0.38/0.57 11 5 2
% 0.38/0.57 12 11 0
% 0.38/0.57 13 10 2
% 0.38/0.57 14 1 3
% 0.38/0.57 15 4 0
% 0.38/0.57 16 1 2
% 0.38/0.57 17 7 0
% 0.38/0.57 18 8 7
% 0.38/0.57 19 11 3
% 0.38/0.57 20 16 5
% 0.38/0.57 21 17 1
% 0.38/0.57 22 11 2
% 0.38/0.57 23 19 2
% 0.38/0.57 24 10 2
% 0.38/0.57 25 10 0
% 0.38/0.57 26 5 1
% 0.38/0.57 27 12 1
% 0.38/0.57 28 7 6
% 0.38/0.57 29 11 1
% 0.38/0.57 30 4 0
% 0.38/0.57 31 2 8
% 0.38/0.57 33 7 6
% 0.38/0.57 34 12 6
% 0.38/0.57 35 11 11
% 0.38/0.57 36 13 0
% 0.38/0.57 37 22 4
% 0.38/0.57 38 23 5
% 0.38/0.57 39 12 10
% 0.38/0.57 40 15 0
% 0.38/0.57 41 8 4
% 0.38/0.57 42 36 4
% 0.38/0.57 43 9 7
% 0.38/0.57 44 39 5
% 0.38/0.57 45 14 0
% 0.38/0.57 46 20 0
% 0.38/0.57 48 17 7
% 0.38/0.57 49 10 4
% 0.38/0.57 50 20 4
% 0.38/0.57 51 0 4
% 0.38/0.57 54 20 2
% 0.38/0.57 55 3 1
% 0.38/0.57 59 13 3
% 0.38/0.57 60 1 3
% 0.38/0.57 tot: 523 141 (21.2% true)
% 0.38/0.57
% 0.38/0.57
% 0.38/0.57 Model 2 [ 9 0 73 ] (0.00 seconds, 1121 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 17000 finished Mon Jul 11 01:18:13 2022
%------------------------------------------------------------------------------