TSTP Solution File: SET891+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET891+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:21:37 EDT 2022
% Result : Theorem 0.12s 0.35s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET891+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : sos-script %s
% 0.12/0.33 % Computer : n007.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 15:40:02 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.35
% 0.12/0.35 -------- PROOF --------
% 0.12/0.35 % SZS status Unsatisfiable
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n007.cluster.edu,
% 0.12/0.35 Sun Jul 10 15:40:02 2022
% 0.12/0.35 The command was "./sos". The process ID is 8738.
% 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=1, equality=1, symmetry=0, max_lits=2.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive 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: clear(order_hyper).
% 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 5 during input processing: 0 [copy,5,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.35 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] {-} set_union2(A,B)=set_union2(B,A).
% 0.12/0.35
% 0.12/0.35 ----> UNIT CONFLICT at 0.00 sec ----> 16 [binary,15.1,14.1] {-} $F.
% 0.12/0.35
% 0.12/0.35 Length of proof is 2. Level of proof is 1.
% 0.12/0.35
% 0.12/0.35 ---------------- PROOF ----------------
% 0.12/0.35 % SZS status Theorem
% 0.12/0.35 % SZS output start Refutation
% 0.12/0.35
% 0.12/0.35 4 [] {-} union(unordered_pair(singleton($c4),singleton($c3)))!=unordered_pair($c4,$c3).
% 0.12/0.35 10,9 [] {-} union(unordered_pair(A,B))=set_union2(A,B).
% 0.12/0.35 12 [] {-} unordered_pair(A,B)=set_union2(singleton(A),singleton(B)).
% 0.12/0.35 14 [back_demod,4,demod,10] {-} set_union2(singleton($c4),singleton($c3))!=unordered_pair($c4,$c3).
% 0.12/0.35 15 [copy,12,flip.1] {-} set_union2(singleton(A),singleton(B))=unordered_pair(A,B).
% 0.12/0.35 16 [binary,15.1,14.1] {-} $F.
% 0.12/0.35
% 0.12/0.35 % SZS output end Refutation
% 0.12/0.35 ------------ end of proof -------------
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 Search stopped by max_proofs option.
% 0.12/0.35
% 0.12/0.35
% 0.12/0.35 Search stopped by max_proofs option.
% 0.12/0.35
% 0.12/0.35 ============ end of search ============
% 0.12/0.35
% 0.12/0.35 That finishes the proof of the theorem.
% 0.12/0.35
% 0.12/0.35 Process 8738 finished Sun Jul 10 15:40:02 2022
%------------------------------------------------------------------------------