TSTP Solution File: SET951+1 by SOS---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SOS---2.0
% Problem  : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : sos-script %s

% Computer : n028.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:03 EDT 2022

% Result   : Theorem 13.48s 13.68s
% Output   : Refutation 13.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET951+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13  % Command  : sos-script %s
% 0.12/0.34  % Computer : n028.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 23:58:26 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.12/0.36  ----- Otter 3.2, August 2001 -----
% 0.12/0.36  The process was started by sandbox on n028.cluster.edu,
% 0.12/0.36  Sat Jul  9 23:58:26 2022
% 0.12/0.36  The command was "./sos".  The process ID is 26969.
% 0.12/0.36  
% 0.12/0.36  set(prolog_style_variables).
% 0.12/0.36  set(auto).
% 0.12/0.36     dependent: set(auto1).
% 0.12/0.36     dependent: set(process_input).
% 0.12/0.36     dependent: clear(print_kept).
% 0.12/0.36     dependent: clear(print_new_demod).
% 0.12/0.36     dependent: clear(print_back_demod).
% 0.12/0.36     dependent: clear(print_back_sub).
% 0.12/0.36     dependent: set(control_memory).
% 0.12/0.36     dependent: assign(max_mem, 12000).
% 0.12/0.36     dependent: assign(pick_given_ratio, 4).
% 0.12/0.36     dependent: assign(stats_level, 1).
% 0.12/0.36     dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36     dependent: assign(sos_limit, 5000).
% 0.12/0.36     dependent: assign(max_weight, 60).
% 0.12/0.36  clear(print_given).
% 0.12/0.36  
% 0.12/0.36  formula_list(usable).
% 0.12/0.36  
% 0.12/0.36  SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36  
% 0.12/0.36  This ia a non-Horn set with equality.  The strategy will be
% 0.12/0.36  Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36  unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36  clauses in usable.
% 0.12/0.36  
% 0.12/0.36     dependent: set(knuth_bendix).
% 0.12/0.36     dependent: set(para_from).
% 0.12/0.36     dependent: set(para_into).
% 0.12/0.36     dependent: clear(para_from_right).
% 0.12/0.36     dependent: clear(para_into_right).
% 0.12/0.36     dependent: set(para_from_vars).
% 0.12/0.36     dependent: set(eq_units_both_ways).
% 0.12/0.36     dependent: set(dynamic_demod_all).
% 0.12/0.36     dependent: set(dynamic_demod).
% 0.12/0.36     dependent: set(order_eq).
% 0.12/0.36     dependent: set(back_demod).
% 0.12/0.36     dependent: set(lrpo).
% 0.12/0.36     dependent: set(hyper_res).
% 0.12/0.36     dependent: set(unit_deletion).
% 0.12/0.36     dependent: set(factor).
% 0.12/0.36  
% 0.12/0.36  ------------> process usable:
% 0.12/0.36  
% 0.12/0.36  ------------> process sos:
% 0.12/0.36    Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.12/0.36    Following clause subsumed by 30 during input processing: 0 [copy,30,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.12/0.36    Following clause subsumed by 44 during input processing: 0 [copy,44,flip.1] {-} A=A.
% 0.12/0.36  
% 0.12/0.36  ======= end of input processing =======
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  Failed to model usable list: disabling FINDER
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  -------------- Softie stats --------------
% 0.19/0.42  
% 0.19/0.42  UPDATE_STOP: 300
% 0.19/0.42  SFINDER_TIME_LIMIT: 2
% 0.19/0.42  SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.42  number of clauses in intial UL: 23
% 0.19/0.42  number of clauses initially in problem: 41
% 0.19/0.42  percentage of clauses intially in UL: 56
% 0.19/0.42  percentage of distinct symbols occuring in initial UL: 76
% 0.19/0.42  percent of all initial clauses that are short: 100
% 0.19/0.42  absolute distinct symbol count: 21
% 0.19/0.42     distinct predicate count: 3
% 0.19/0.42     distinct function count: 11
% 0.19/0.42     distinct constant count: 7
% 0.19/0.42  
% 0.19/0.42  ---------- no more Softie stats ----------
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  
% 0.19/0.42  =========== start of search ===========
% 2.35/2.55  
% 2.35/2.55  
% 2.35/2.55  Changing weight limit from 60 to 45.
% 2.35/2.55  
% 2.35/2.55  Resetting weight limit to 45 after 55 givens.
% 2.35/2.55  
% 3.05/3.25  
% 3.05/3.25  
% 3.05/3.25  Changing weight limit from 45 to 35.
% 3.05/3.25  
% 3.05/3.25  Resetting weight limit to 35 after 60 givens.
% 3.05/3.25  
% 3.36/3.59  
% 3.36/3.59  
% 3.36/3.59  Changing weight limit from 35 to 33.
% 3.36/3.59  
% 3.36/3.59  Resetting weight limit to 33 after 65 givens.
% 3.36/3.59  
% 3.60/3.79  
% 3.60/3.79  
% 3.60/3.79  Changing weight limit from 33 to 32.
% 3.60/3.79  
% 3.60/3.79  Resetting weight limit to 32 after 70 givens.
% 3.60/3.79  
% 3.79/4.03  
% 3.79/4.03  
% 3.79/4.03  Changing weight limit from 32 to 31.
% 3.79/4.03  
% 3.79/4.03  Resetting weight limit to 31 after 75 givens.
% 3.79/4.03  
% 3.94/4.14  
% 3.94/4.14  
% 3.94/4.14  Changing weight limit from 31 to 30.
% 3.94/4.14  
% 3.94/4.14  Resetting weight limit to 30 after 80 givens.
% 3.94/4.14  
% 4.06/4.27  
% 4.06/4.27  
% 4.06/4.27  Changing weight limit from 30 to 29.
% 4.06/4.27  
% 4.06/4.27  Resetting weight limit to 29 after 85 givens.
% 4.06/4.27  
% 4.31/4.50  
% 4.31/4.50  
% 4.31/4.50  Changing weight limit from 29 to 28.
% 4.31/4.50  
% 4.31/4.50  Resetting weight limit to 28 after 95 givens.
% 4.31/4.50  
% 4.44/4.63  
% 4.44/4.63  
% 4.44/4.63  Changing weight limit from 28 to 27.
% 4.44/4.63  
% 4.44/4.63  Resetting weight limit to 27 after 100 givens.
% 4.44/4.63  
% 4.79/4.97  
% 4.79/4.97  
% 4.79/4.97  Changing weight limit from 27 to 26.
% 4.79/4.97  
% 4.79/4.97  Resetting weight limit to 26 after 105 givens.
% 4.79/4.97  
% 5.09/5.34  
% 5.09/5.34  
% 5.09/5.34  Changing weight limit from 26 to 25.
% 5.09/5.34  
% 5.09/5.34  Resetting weight limit to 25 after 110 givens.
% 5.09/5.34  
% 5.24/5.45  
% 5.24/5.45  
% 5.24/5.45  Changing weight limit from 25 to 24.
% 5.24/5.45  
% 5.24/5.45  Resetting weight limit to 24 after 115 givens.
% 5.24/5.45  
% 5.56/5.76  
% 5.56/5.76  
% 5.56/5.76  Changing weight limit from 24 to 23.
% 5.56/5.76  
% 5.56/5.76  Resetting weight limit to 23 after 140 givens.
% 5.56/5.76  
% 6.27/6.48  
% 6.27/6.48  
% 6.27/6.48  Changing weight limit from 23 to 22.
% 6.27/6.48  
% 6.27/6.48  Resetting weight limit to 22 after 165 givens.
% 6.27/6.48  
% 6.31/6.52  
% 6.31/6.52  
% 6.31/6.52  Changing weight limit from 22 to 21.
% 6.31/6.52  
% 6.31/6.52  Resetting weight limit to 21 after 170 givens.
% 6.31/6.52  
% 6.59/6.80  
% 6.59/6.80  
% 6.59/6.80  Changing weight limit from 21 to 20.
% 6.59/6.80  
% 6.59/6.80  Resetting weight limit to 20 after 200 givens.
% 6.59/6.80  
% 7.36/7.54  
% 7.36/7.54  
% 7.36/7.54  Changing weight limit from 20 to 19.
% 7.36/7.54  
% 7.36/7.54  Resetting weight limit to 19 after 270 givens.
% 7.36/7.54  
% 12.48/12.69  
% 12.48/12.69  
% 12.48/12.69  Changing weight limit from 19 to 18.
% 12.48/12.69  
% 12.48/12.69  Modelling stopped after 300 given clauses and 0.00 seconds
% 12.48/12.69  
% 12.48/12.69  
% 12.48/12.69  Resetting weight limit to 18 after 830 givens.
% 12.48/12.69  
% 13.48/13.68  
% 13.48/13.68  -- HEY sandbox, WE HAVE A PROOF!! -- 
% 13.48/13.68  
% 13.48/13.68  -----> EMPTY CLAUSE at  13.17 sec ----> 27464 [hyper,26311,90,370,24169] {-} $F.
% 13.48/13.68  
% 13.48/13.68  Length of proof is 19.  Level of proof is 6.
% 13.48/13.68  
% 13.48/13.68  ---------------- PROOF ----------------
% 13.48/13.68  % SZS status Theorem
% 13.48/13.68  % SZS output start Refutation
% 13.48/13.68  
% 13.48/13.68  2 [] {+} A!=cartesian_product2(B,C)| -in(D,A)|in($f2(B,C,A,D),B).
% 13.48/13.68  3 [] {+} A!=cartesian_product2(B,C)| -in(D,A)|in($f1(B,C,A,D),C).
% 13.48/13.68  4 [] {-} A!=cartesian_product2(B,C)| -in(D,A)|D=ordered_pair($f2(B,C,A,D),$f1(B,C,A,D)).
% 13.48/13.68  5 [copy,4,flip.3] {+} A!=cartesian_product2(B,C)| -in(D,A)|ordered_pair($f2(B,C,A,D),$f1(B,C,A,D))=D.
% 13.48/13.68  9 [] {+} A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 13.48/13.68  10 [] {+} A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 13.48/13.68  14 [] {-} $c7!=ordered_pair(A,B)| -in(A,set_intersection2($c6,$c4))| -in(B,set_intersection2($c5,$c3)).
% 13.48/13.68  15 [copy,14,flip.1] {+} ordered_pair(A,B)!=$c7| -in(A,set_intersection2($c6,$c4))| -in(B,set_intersection2($c5,$c3)).
% 13.48/13.68  16 [] {+} ordered_pair(A,B)!=ordered_pair(C,D)|A=C.
% 13.48/13.68  17 [] {+} ordered_pair(A,B)!=ordered_pair(C,D)|B=D.
% 13.48/13.68  30 [] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 13.48/13.68  43 [] {-} in($c7,set_intersection2(cartesian_product2($c6,$c5),cartesian_product2($c4,$c3))).
% 13.48/13.68  44 [] {-} A=A.
% 13.48/13.68  90 [para_from,30.1.1,15.3.2] {-} ordered_pair(A,B)!=$c7| -in(A,set_intersection2($c6,$c4))| -in(B,set_intersection2($c3,$c5)).
% 13.48/13.68  192 [hyper,43,9,44] {-} in($c7,cartesian_product2($c4,$c3)).
% 13.48/13.68  193 [hyper,43,9,30] {-} in($c7,cartesian_product2($c6,$c5)).
% 13.48/13.68  305 [hyper,192,5,44] {-} ordered_pair($f2($c4,$c3,cartesian_product2($c4,$c3),$c7),$f1($c4,$c3,cartesian_product2($c4,$c3),$c7))=$c7.
% 13.48/13.68  307 [hyper,192,3,44] {-} in($f1($c4,$c3,cartesian_product2($c4,$c3),$c7),$c3).
% 13.48/13.68  308 [hyper,192,2,44] {-} in($f2($c4,$c3,cartesian_product2($c4,$c3),$c7),$c4).
% 13.48/13.68  370 [hyper,193,5,44] {-} ordered_pair($f2($c6,$c5,cartesian_product2($c6,$c5),$c7),$f1($c6,$c5,cartesian_product2($c6,$c5),$c7))=$c7.
% 13.48/13.68  372 [hyper,193,3,44] {-} in($f1($c6,$c5,cartesian_product2($c6,$c5),$c7),$c5).
% 13.48/13.68  373 [hyper,193,2,44] {-} in($f2($c6,$c5,cartesian_product2($c6,$c5),$c7),$c6).
% 13.48/13.68  821 [para_into,307.1.1,17.2.1] {-} in(A,$c3)|ordered_pair(B,$f1($c4,$c3,cartesian_product2($c4,$c3),$c7))!=ordered_pair(C,A).
% 13.48/13.68  1112 [para_into,308.1.1,16.2.1] {-} in(A,$c4)|ordered_pair($f2($c4,$c3,cartesian_product2($c4,$c3),$c7),B)!=ordered_pair(A,C).
% 13.48/13.68  24148 [para_into,821.2.1,305.1.1,flip.2] {-} in(A,$c3)|ordered_pair(B,A)!=$c7.
% 13.48/13.68  24149 [hyper,24148,370] {-} in($f1($c6,$c5,cartesian_product2($c6,$c5),$c7),$c3).
% 13.48/13.68  24169 [hyper,24149,10,30,372] {-} in($f1($c6,$c5,cartesian_product2($c6,$c5),$c7),set_intersection2($c3,$c5)).
% 13.48/13.68  26300 [para_into,1112.2.1,305.1.1,flip.2] {-} in(A,$c4)|ordered_pair(A,B)!=$c7.
% 13.48/13.68  26301 [hyper,26300,370] {-} in($f2($c6,$c5,cartesian_product2($c6,$c5),$c7),$c4).
% 13.48/13.68  26311 [hyper,26301,10,44,373] {-} in($f2($c6,$c5,cartesian_product2($c6,$c5),$c7),set_intersection2($c6,$c4)).
% 13.48/13.68  27464 [hyper,26311,90,370,24169] {-} $F.
% 13.48/13.68  
% 13.48/13.68  % SZS output end Refutation
% 13.48/13.68  ------------ end of proof -------------
% 13.48/13.68  
% 13.48/13.68  
% 13.48/13.68  Search stopped by max_proofs option.
% 13.48/13.68  
% 13.48/13.68  
% 13.48/13.68  Search stopped by max_proofs option.
% 13.48/13.68  
% 13.48/13.68  ============ end of search ============
% 13.48/13.68  
% 13.48/13.68  That finishes the proof of the theorem.
% 13.48/13.68  
% 13.48/13.68  Process 26969 finished Sat Jul  9 23:58:40 2022
%------------------------------------------------------------------------------