TSTP Solution File: SET983+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n023.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:13 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET983+1 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n023.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 15:33:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox on n023.cluster.edu,
% 0.13/0.35 Sun Jul 10 15:33:10 2022
% 0.13/0.35 The command was "./sos". The process ID is 29786.
% 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=4.
% 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 14 during input processing: 0 [copy,14,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.13/0.35 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] {-} A=A.
% 0.13/0.35
% 0.13/0.35 ======= end of input processing =======
% 0.13/0.37
% 0.13/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.37
% 0.13/0.37 Stopped by limit on number of solutions
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 -------------- Softie stats --------------
% 0.13/0.37
% 0.13/0.37 UPDATE_STOP: 300
% 0.13/0.37 SFINDER_TIME_LIMIT: 2
% 0.13/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.37 number of clauses in intial UL: 10
% 0.13/0.37 number of clauses initially in problem: 25
% 0.13/0.37 percentage of clauses intially in UL: 40
% 0.13/0.37 percentage of distinct symbols occuring in initial UL: 92
% 0.13/0.37 percent of all initial clauses that are short: 100
% 0.13/0.37 absolute distinct symbol count: 13
% 0.13/0.37 distinct predicate count: 3
% 0.13/0.37 distinct function count: 3
% 0.13/0.37 distinct constant count: 7
% 0.13/0.37
% 0.13/0.37 ---------- no more Softie stats ----------
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 =========== start of search ===========
% 0.19/0.44
% 0.19/0.44 -------- PROOF --------
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 Stopped by limit on number of solutions
% 0.19/0.44
% 0.19/0.44 ----> UNIT CONFLICT at 0.07 sec ----> 171 [binary,170.1,7.1] {-} $F.
% 0.19/0.44
% 0.19/0.44 Length of proof is 2. Level of proof is 2.
% 0.19/0.44
% 0.19/0.44 ---------------- PROOF ----------------
% 0.19/0.44 % SZS status Theorem
% 0.19/0.44 % SZS output start Refutation
% 0.19/0.44
% 0.19/0.44 4 [] {+} A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 0.19/0.44 7 [] {+} -in($c7,cartesian_product2(set_intersection2($c6,$c4),set_intersection2($c5,$c3))).
% 0.19/0.44 20 [] {-} cartesian_product2(set_intersection2(A,B),set_intersection2(C,D))=set_intersection2(cartesian_product2(A,C),cartesian_product2(B,D)).
% 0.19/0.44 22,21 [copy,20,flip.1] {-} set_intersection2(cartesian_product2(A,B),cartesian_product2(C,D))=cartesian_product2(set_intersection2(A,C),set_intersection2(B,D)).
% 0.19/0.44 23 [] {-} in($c7,cartesian_product2($c6,$c5)).
% 0.19/0.44 24 [] {-} in($c7,cartesian_product2($c4,$c3)).
% 0.19/0.44 25 [] {+} A=A.
% 0.19/0.44 170 [hyper,24,4,25,23,demod,22] {-} in($c7,cartesian_product2(set_intersection2($c6,$c4),set_intersection2($c5,$c3))).
% 0.19/0.44 171 [binary,170.1,7.1] {-} $F.
% 0.19/0.44
% 0.19/0.44 % SZS output end Refutation
% 0.19/0.44 ------------ end of proof -------------
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Search stopped by max_proofs option.
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Search stopped by max_proofs option.
% 0.19/0.44
% 0.19/0.44 ============ end of search ============
% 0.19/0.44
% 0.19/0.44 ----------- soft-scott stats ----------
% 0.19/0.44
% 0.19/0.44 true clauses given 2 (25.0%)
% 0.19/0.44 false clauses given 6
% 0.19/0.44
% 0.19/0.44 FALSE TRUE
% 0.19/0.44 5 0 1
% 0.19/0.44 9 0 3
% 0.19/0.44 10 0 2
% 0.19/0.44 11 0 2
% 0.19/0.44 13 1 6
% 0.19/0.44 14 0 1
% 0.19/0.44 15 6 3
% 0.19/0.44 16 1 3
% 0.19/0.44 17 3 8
% 0.19/0.44 19 7 7
% 0.19/0.44 21 0 6
% 0.19/0.44 22 0 1
% 0.19/0.44 23 7 7
% 0.19/0.44 25 3 3
% 0.19/0.44 27 0 4
% 0.19/0.44 28 0 2
% 0.19/0.44 29 2 4
% 0.19/0.44 31 2 5
% 0.19/0.44 32 0 1
% 0.19/0.44 33 0 1
% 0.19/0.44 34 2 4
% 0.19/0.44 35 5 6
% 0.19/0.44 37 4 4
% 0.19/0.44 40 0 9
% 0.19/0.44 43 3 0
% 0.19/0.44 46 6 0
% 0.19/0.44 tot: 52 93 (64.1% true)
% 0.19/0.44
% 0.19/0.44
% 0.19/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.44
% 0.19/0.44 That finishes the proof of the theorem.
% 0.19/0.44
% 0.19/0.44 Process 29786 finished Sun Jul 10 15:33:10 2022
%------------------------------------------------------------------------------