TSTP Solution File: SET622+3 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET622+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n027.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:19:32 EDT 2022

% Result   : Theorem 0.13s 0.36s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET622+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : sos-script %s
% 0.13/0.34  % Computer : n027.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 00:41:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.13/0.36  
% 0.13/0.36  -------- PROOF -------- 
% 0.13/0.36  % SZS status Unsatisfiable
% 0.13/0.36  % SZS output start Refutation
% 0.13/0.36  ----- Otter 3.2, August 2001 -----
% 0.13/0.36  The process was started by sandbox on n027.cluster.edu,
% 0.13/0.36  Sun Jul 10 00:41:17 2022
% 0.13/0.36  The command was "./sos".  The process ID is 18072.
% 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  
% 0.13/0.36  ----> UNIT CONFLICT at   0.00 sec ----> 43 [binary,42.1,41.1] {-} $F.
% 0.13/0.36  
% 0.13/0.36  Length of proof is 4.  Level of proof is 2.
% 0.13/0.36  
% 0.13/0.36  ---------------- PROOF ----------------
% 0.13/0.36  % SZS status Theorem
% 0.13/0.36  % SZS output start Refutation
% 0.13/0.36  
% 0.13/0.36  18 [] {-} difference($c3,symmetric_difference($c2,$c1))!=union(difference($c3,union($c2,$c1)),intersection(intersection($c3,$c2),$c1)).
% 0.13/0.36  19 [copy,18,flip.1] {-} union(difference($c3,union($c2,$c1)),intersection(intersection($c3,$c2),$c1))!=difference($c3,symmetric_difference($c2,$c1)).
% 0.13/0.36  25,24 [] {-} intersection(intersection(A,B),C)=intersection(A,intersection(B,C)).
% 0.13/0.36  26 [] {-} difference(A,difference(B,C))=union(difference(A,B),intersection(A,C)).
% 0.13/0.36  28,27 [copy,26,flip.1] {-} union(difference(A,B),intersection(A,C))=difference(A,difference(B,C)).
% 0.13/0.36  29 [] {-} symmetric_difference(A,B)=difference(union(A,B),intersection(A,B)).
% 0.13/0.36  31,30 [copy,29,flip.1] {-} difference(union(A,B),intersection(A,B))=symmetric_difference(A,B).
% 0.13/0.36  41 [] {-} A=A.
% 0.13/0.36  42 [back_demod,19,demod,25,28,31] {-} difference($c3,symmetric_difference($c2,$c1))!=difference($c3,symmetric_difference($c2,$c1)).
% 0.13/0.36  43 [binary,42.1,41.1] {-} $F.
% 0.13/0.36  
% 0.13/0.36  % SZS output end Refutation
% 0.13/0.36  ------------ end of proof -------------
% 0.13/0.36  
% 0.13/0.36  
% 0.13/0.36  Search stopped by max_proofs option.
% 0.13/0.36  
% 0.13/0.36  
% 0.13/0.36  Search stopped by max_proofs option.
% 0.13/0.36  
% 0.13/0.36  ============ end of search ============
% 0.13/0.36  
% 0.13/0.36  That finishes the proof of the theorem.
% 0.13/0.36  
% 0.13/0.36  Process 18072 finished Sun Jul 10 00:41:17 2022
%------------------------------------------------------------------------------