TSTP Solution File: SEU147+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU147+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n015.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 14:27:08 EDT 2022
% Result : Theorem 13.04s 13.30s
% Output : Refutation 13.04s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU147+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : sos-script %s
% 0.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Mon Jun 20 02:25:00 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.38 ----- Otter 3.2, August 2001 -----
% 0.15/0.38 The process was started by sandbox on n015.cluster.edu,
% 0.15/0.38 Mon Jun 20 02:25:00 2022
% 0.15/0.38 The command was "./sos". The process ID is 13589.
% 0.15/0.38
% 0.15/0.38 set(prolog_style_variables).
% 0.15/0.38 set(auto).
% 0.15/0.38 dependent: set(auto1).
% 0.15/0.38 dependent: set(process_input).
% 0.15/0.38 dependent: clear(print_kept).
% 0.15/0.38 dependent: clear(print_new_demod).
% 0.15/0.38 dependent: clear(print_back_demod).
% 0.15/0.38 dependent: clear(print_back_sub).
% 0.15/0.38 dependent: set(control_memory).
% 0.15/0.38 dependent: assign(max_mem, 12000).
% 0.15/0.38 dependent: assign(pick_given_ratio, 4).
% 0.15/0.38 dependent: assign(stats_level, 1).
% 0.15/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.38 dependent: assign(sos_limit, 5000).
% 0.15/0.38 dependent: assign(max_weight, 60).
% 0.15/0.38 clear(print_given).
% 0.15/0.38
% 0.15/0.38 formula_list(usable).
% 0.15/0.38
% 0.15/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.15/0.38
% 0.15/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.15/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.15/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.15/0.38 clauses in usable.
% 0.15/0.38
% 0.15/0.38 dependent: set(knuth_bendix).
% 0.15/0.38 dependent: set(para_from).
% 0.15/0.38 dependent: set(para_into).
% 0.15/0.38 dependent: clear(para_from_right).
% 0.15/0.38 dependent: clear(para_into_right).
% 0.15/0.38 dependent: set(para_from_vars).
% 0.15/0.38 dependent: set(eq_units_both_ways).
% 0.15/0.38 dependent: set(dynamic_demod_all).
% 0.15/0.38 dependent: set(dynamic_demod).
% 0.15/0.38 dependent: set(order_eq).
% 0.15/0.38 dependent: set(back_demod).
% 0.15/0.38 dependent: set(lrpo).
% 0.15/0.38 dependent: set(hyper_res).
% 0.15/0.38 dependent: set(unit_deletion).
% 0.15/0.38 dependent: set(factor).
% 0.15/0.38
% 0.15/0.38 ------------> process usable:
% 0.15/0.38
% 0.15/0.38 ------------> process sos:
% 0.15/0.38 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.15/0.38 21 back subsumes 14.
% 0.15/0.38
% 0.15/0.38 ======= end of input processing =======
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44 Failed to model usable list: disabling FINDER
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44 -------------- Softie stats --------------
% 0.22/0.44
% 0.22/0.44 UPDATE_STOP: 300
% 0.22/0.44 SFINDER_TIME_LIMIT: 2
% 0.22/0.44 SHORT_CLAUSE_CUTOFF: 4
% 0.22/0.44 number of clauses in intial UL: 12
% 0.22/0.44 number of clauses initially in problem: 19
% 0.22/0.44 percentage of clauses intially in UL: 63
% 0.22/0.44 percentage of distinct symbols occuring in initial UL: 91
% 0.22/0.44 percent of all initial clauses that are short: 100
% 0.22/0.44 absolute distinct symbol count: 12
% 0.22/0.44 distinct predicate count: 4
% 0.22/0.44 distinct function count: 5
% 0.22/0.44 distinct constant count: 3
% 0.22/0.44
% 0.22/0.44 ---------- no more Softie stats ----------
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44
% 0.22/0.44 =========== start of search ===========
% 3.03/3.30
% 3.03/3.30
% 3.03/3.30 Changing weight limit from 60 to 47.
% 3.03/3.30
% 3.03/3.30 Resetting weight limit to 47 after 60 givens.
% 3.03/3.30
% 4.28/4.47
% 4.28/4.47
% 4.28/4.47 Changing weight limit from 47 to 43.
% 4.28/4.47
% 4.28/4.47 Resetting weight limit to 43 after 65 givens.
% 4.28/4.47
% 5.40/5.61
% 5.40/5.61
% 5.40/5.61 Changing weight limit from 43 to 38.
% 5.40/5.61
% 5.40/5.61 Resetting weight limit to 38 after 70 givens.
% 5.40/5.61
% 7.68/7.86
% 7.68/7.86
% 7.68/7.86 Changing weight limit from 38 to 35.
% 7.68/7.86
% 7.68/7.86 Resetting weight limit to 35 after 75 givens.
% 7.68/7.86
% 8.38/8.57
% 8.38/8.57
% 8.38/8.57 Changing weight limit from 35 to 34.
% 8.38/8.57
% 8.38/8.57 Resetting weight limit to 34 after 80 givens.
% 8.38/8.57
% 9.14/9.34
% 9.14/9.34
% 9.14/9.34 Changing weight limit from 34 to 33.
% 9.14/9.34
% 9.14/9.34 Resetting weight limit to 33 after 85 givens.
% 9.14/9.34
% 9.91/10.13
% 9.91/10.13
% 9.91/10.13 Changing weight limit from 33 to 30.
% 9.91/10.13
% 9.91/10.13 Resetting weight limit to 30 after 90 givens.
% 9.91/10.13
% 11.81/12.00
% 11.81/12.00
% 11.81/12.00 Changing weight limit from 30 to 28.
% 11.81/12.00
% 11.81/12.00 Resetting weight limit to 28 after 105 givens.
% 11.81/12.00
% 12.76/12.95
% 12.76/12.95
% 12.76/12.95 Changing weight limit from 28 to 26.
% 12.76/12.95
% 12.76/12.95 Resetting weight limit to 26 after 110 givens.
% 12.76/12.95
% 13.04/13.30
% 13.04/13.30 -- HEY sandbox, WE HAVE A PROOF!! --
% 13.04/13.30
% 13.04/13.30 -----> EMPTY CLAUSE at 12.90 sec ----> 12104 [hyper,12038,4,10885,unit_del,10,10] {-} $F.
% 13.04/13.30
% 13.04/13.30 Length of proof is 8. Level of proof is 6.
% 13.04/13.30
% 13.04/13.30 ---------------- PROOF ----------------
% 13.04/13.30 % SZS status Theorem
% 13.04/13.30 % SZS output start Refutation
% 13.04/13.30
% 13.04/13.30 4 [] {+} A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 13.04/13.30 5 [] {+} A!=powerset(B)| -in(C,A)|subset(C,B).
% 13.04/13.30 6 [] {+} A!=powerset(B)|in(C,A)| -subset(C,B).
% 13.04/13.30 9 [] {-} powerset(empty_set)!=singleton(empty_set).
% 13.04/13.30 10 [copy,9,flip.1] {+} singleton(empty_set)!=powerset(empty_set).
% 13.04/13.30 12 [] {+} -subset(A,empty_set)|A=empty_set.
% 13.04/13.30 15 [] {-} A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 13.04/13.30 19 [] {-} subset(A,A).
% 13.04/13.30 21 [] {-} A=A.
% 13.04/13.30 44 [para_from,15.3.1,4.2.1,factor_simp] {-} A=singleton(B)| -in(B,A)|$f1(B,A)!=B|in($f1(B,A),A).
% 13.04/13.30 56 [hyper,21,6,19] {-} in(A,powerset(A)).
% 13.04/13.30 10875 [para_into,44.3.1,15.3.1,unit_del,21,factor_simp,factor_simp] {-} A=singleton(B)| -in(B,A)|in($f1(B,A),A).
% 13.04/13.30 10885 [hyper,10875,56,flip.1] {-} singleton(A)=powerset(A)|in($f1(A,powerset(A)),powerset(A)).
% 13.04/13.30 11916 [para_from,10885.1.1,10.1.1,unit_del,21] {-} in($f1(empty_set,powerset(empty_set)),powerset(empty_set)).
% 13.04/13.30 11919 [hyper,11916,5,21] {-} subset($f1(empty_set,powerset(empty_set)),empty_set).
% 13.04/13.30 12038 [hyper,11919,12] {-} $f1(empty_set,powerset(empty_set))=empty_set.
% 13.04/13.30 12104 [hyper,12038,4,10885,unit_del,10,10] {-} $F.
% 13.04/13.30
% 13.04/13.30 % SZS output end Refutation
% 13.04/13.30 ------------ end of proof -------------
% 13.04/13.30
% 13.04/13.30
% 13.04/13.30 Search stopped by max_proofs option.
% 13.04/13.30
% 13.04/13.30
% 13.04/13.30 Search stopped by max_proofs option.
% 13.04/13.30
% 13.04/13.30 ============ end of search ============
% 13.04/13.30
% 13.04/13.30 That finishes the proof of the theorem.
% 13.04/13.30
% 13.04/13.30 Process 13589 finished Mon Jun 20 02:25:13 2022
%------------------------------------------------------------------------------