TSTP Solution File: SET975+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET975+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n014.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:10 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET975+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n014.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 12:58:50 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n014.cluster.edu,
% 0.13/0.35 Sun Jul 10 12:58:50 2022
% 0.13/0.35 The command was "./sos". The process ID is 10076.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 formula_list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.13/0.35 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Failed to model usable list: disabling FINDER
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 -------------- Softie stats --------------
% 0.20/0.42
% 0.20/0.42 UPDATE_STOP: 300
% 0.20/0.42 SFINDER_TIME_LIMIT: 2
% 0.20/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42 number of clauses in intial UL: 12
% 0.20/0.42 number of clauses initially in problem: 20
% 0.20/0.42 percentage of clauses intially in UL: 60
% 0.20/0.42 percentage of distinct symbols occuring in initial UL: 85
% 0.20/0.42 percent of all initial clauses that are short: 100
% 0.20/0.42 absolute distinct symbol count: 14
% 0.20/0.42 distinct predicate count: 3
% 0.20/0.42 distinct function count: 5
% 0.20/0.42 distinct constant count: 6
% 0.20/0.42
% 0.20/0.42 ---------- no more Softie stats ----------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 =========== start of search ===========
% 0.20/0.48
% 0.20/0.48 -------- PROOF --------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 -----> EMPTY CLAUSE at 0.10 sec ----> 819 [hyper,226,259,251] {-} $F.
% 0.20/0.48
% 0.20/0.48 Length of proof is 6. Level of proof is 3.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Theorem
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 2 [] {+} A!=singleton(B)| -in(C,A)|C=B.
% 0.20/0.48 3 [] {+} A!=singleton(B)|in(C,A)|C!=B.
% 0.20/0.48 6 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(A,C).
% 0.20/0.48 7 [] {+} -in(ordered_pair(A,B),cartesian_product2(C,D))|in(B,D).
% 0.20/0.48 8 [] {+} in(ordered_pair(A,B),cartesian_product2(C,D))| -in(A,C)| -in(B,D).
% 0.20/0.48 10 [] {+} -in(ordered_pair($c6,$c5),cartesian_product2(singleton($c4),$c3))|$c6!=$c4| -in($c5,$c3).
% 0.20/0.48 19 [] {-} in(ordered_pair($c6,$c5),cartesian_product2(singleton($c4),$c3))|$c6=$c4.
% 0.20/0.48 20 [] {-} in(ordered_pair($c6,$c5),cartesian_product2(singleton($c4),$c3))|in($c5,$c3).
% 0.20/0.48 21 [] {-} A=A.
% 0.20/0.48 26 [hyper,21,3,21] {-} in(A,singleton(A)).
% 0.20/0.48 149 [hyper,19,6] {-} $c6=$c4|in($c6,singleton($c4)).
% 0.20/0.48 208,207 [hyper,149,2,21,factor_simp] {-} $c6=$c4.
% 0.20/0.48 226 [back_demod,10,demod,208,208,unit_del,21] {-} -in(ordered_pair($c4,$c5),cartesian_product2(singleton($c4),$c3))| -in($c5,$c3).
% 0.20/0.48 251 [hyper,20,7,factor_simp] {-} in($c5,$c3).
% 0.20/0.48 259 [hyper,251,8,26] {-} in(ordered_pair(A,$c5),cartesian_product2(singleton(A),$c3)).
% 0.20/0.48 819 [hyper,226,259,251] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 10076 finished Sun Jul 10 12:58:50 2022
%------------------------------------------------------------------------------