%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET977+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:11 EDT 2022
% Result : Theorem 0.57s 0.74s
% Output : Refutation 0.57s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET977+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : sos-script %s
% 0.11/0.32 % Computer : n004.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sat Jul 9 22:38:52 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.11/0.34 ----- Otter 3.2, August 2001 -----
% 0.11/0.34 The process was started by sandbox on n004.cluster.edu,
% 0.11/0.34 Sat Jul 9 22:38:52 2022
% 0.11/0.34 The command was "./sos". The process ID is 17213.
% 0.11/0.34
% 0.11/0.34 set(prolog_style_variables).
% 0.11/0.34 set(auto).
% 0.11/0.34 dependent: set(auto1).
% 0.11/0.34 dependent: set(process_input).
% 0.11/0.34 dependent: clear(print_kept).
% 0.11/0.34 dependent: clear(print_new_demod).
% 0.11/0.34 dependent: clear(print_back_demod).
% 0.11/0.34 dependent: clear(print_back_sub).
% 0.11/0.34 dependent: set(control_memory).
% 0.11/0.34 dependent: assign(max_mem, 12000).
% 0.11/0.34 dependent: assign(pick_given_ratio, 4).
% 0.11/0.34 dependent: assign(stats_level, 1).
% 0.11/0.34 dependent: assign(pick_semantic_ratio, 3).
% 0.11/0.34 dependent: assign(sos_limit, 5000).
% 0.11/0.34 dependent: assign(max_weight, 60).
% 0.11/0.34 clear(print_given).
% 0.11/0.34
% 0.11/0.34 formula_list(usable).
% 0.11/0.34
% 0.11/0.34 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 0.11/0.34
% 0.11/0.34 This ia a non-Horn set with equality. The strategy will be
% 0.11/0.34 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.11/0.34 unit deletion, with positive clauses in sos and nonpositive
% 0.11/0.34 clauses in usable.
% 0.11/0.34
% 0.11/0.34 dependent: set(knuth_bendix).
% 0.11/0.34 dependent: set(para_from).
% 0.11/0.34 dependent: set(para_into).
% 0.11/0.34 dependent: clear(para_from_right).
% 0.11/0.34 dependent: clear(para_into_right).
% 0.11/0.34 dependent: set(para_from_vars).
% 0.11/0.34 dependent: set(eq_units_both_ways).
% 0.11/0.34 dependent: set(dynamic_demod_all).
% 0.11/0.34 dependent: set(dynamic_demod).
% 0.11/0.34 dependent: set(order_eq).
% 0.11/0.34 dependent: set(back_demod).
% 0.11/0.34 dependent: set(lrpo).
% 0.11/0.34 dependent: set(hyper_res).
% 0.11/0.34 dependent: set(unit_deletion).
% 0.11/0.34 dependent: set(factor).
% 0.11/0.34
% 0.11/0.34 ------------> process usable:
% 0.11/0.34
% 0.11/0.34 ------------> process sos:
% 0.11/0.34 Following clause subsumed by 14 during input processing: 0 [copy,14,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.11/0.34 Following clause subsumed by 22 during input processing: 0 [copy,22,flip.1] {-} A=A.
% 0.11/0.34
% 0.11/0.34 ======= end of input processing =======
% 0.50/0.68
% 0.50/0.68 Stopped by limit on insertions
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 Failed to model usable list: disabling FINDER
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 -------------- Softie stats --------------
% 0.50/0.68
% 0.50/0.68 UPDATE_STOP: 300
% 0.50/0.68 SFINDER_TIME_LIMIT: 2
% 0.50/0.68 SHORT_CLAUSE_CUTOFF: 4
% 0.50/0.68 number of clauses in intial UL: 12
% 0.50/0.68 number of clauses initially in problem: 20
% 0.50/0.68 percentage of clauses intially in UL: 60
% 0.50/0.68 percentage of distinct symbols occuring in initial UL: 69
% 0.50/0.68 percent of all initial clauses that are short: 100
% 0.50/0.68 absolute distinct symbol count: 13
% 0.50/0.68 distinct predicate count: 3
% 0.50/0.68 distinct function count: 5
% 0.50/0.68 distinct constant count: 5
% 0.50/0.68
% 0.50/0.68 ---------- no more Softie stats ----------
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68
% 0.50/0.68 =========== start of search ===========
% 0.57/0.74
% 0.57/0.74 -------- PROOF --------
% 0.57/0.74 % SZS status Theorem
% 0.57/0.74 % SZS output start Refutation
% 0.57/0.74
% 0.57/0.74 ----> UNIT CONFLICT at 0.37 sec ----> 1163 [binary,1161.1,12.1] {-} $F.
% 0.57/0.74
% 0.57/0.74 Length of proof is 5. Level of proof is 3.
% 0.57/0.74
% 0.57/0.74 ---------------- PROOF ----------------
% 0.57/0.74 % SZS status Theorem
% 0.57/0.74 % SZS output start Refutation
% 0.57/0.74
% 0.57/0.74 2 [] {+} A!=empty_set| -in(B,A).
% 0.57/0.74 7 [] {+} in(ordered_pair(A,B),cartesian_product2(singleton(C),D))|A!=C| -in(B,D).
% 0.57/0.74 10 [] {+} in(ordered_pair(A,B),cartesian_product2(C,singleton(D)))| -in(A,C)|B!=D.
% 0.57/0.74 11 [] {-} $c4!=empty_set.
% 0.57/0.74 12 [copy,11,flip.1] {+} empty_set!=$c4.
% 0.57/0.74 15 [] {-} A=empty_set|in($f1(A),A).
% 0.57/0.74 21 [] {-} cartesian_product2(singleton($c3),$c4)=empty_set|cartesian_product2($c4,singleton($c3))=empty_set.
% 0.57/0.74 22 [] {-} A=A.
% 0.57/0.74 29 [hyper,15,10,22] {-} A=empty_set|in(ordered_pair($f1(A),B),cartesian_product2(A,singleton(B))).
% 0.57/0.74 31 [hyper,15,7,22] {-} A=empty_set|in(ordered_pair(B,$f1(A)),cartesian_product2(singleton(B),A)).
% 0.57/0.74 662 [hyper,29,2,21,unit_del,12] {-} cartesian_product2(singleton($c3),$c4)=empty_set.
% 0.57/0.74 1161 [hyper,31,2,662,flip.1] {-} empty_set=$c4.
% 0.57/0.74 1163 [binary,1161.1,12.1] {-} $F.
% 0.57/0.74
% 0.57/0.74 % SZS output end Refutation
% 0.57/0.74 ------------ end of proof -------------
% 0.57/0.74
% 0.57/0.74
% 0.57/0.74 Search stopped by max_proofs option.
% 0.57/0.74
% 0.57/0.74
% 0.57/0.74 Search stopped by max_proofs option.
% 0.57/0.74
% 0.57/0.74 ============ end of search ============
% 0.57/0.74
% 0.57/0.74 That finishes the proof of the theorem.
% 0.57/0.74
% 0.57/0.74 Process 17213 finished Sat Jul 9 22:38:53 2022
%------------------------------------------------------------------------------