TSTP Solution File: SET912+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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:45 EDT 2022
% Result : Theorem 0.61s 0.84s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET912+1 : TPTP v8.1.0. Released v3.2.0.
% 0.00/0.10 % Command : sos-script %s
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 600
% 0.09/0.30 % DateTime : Sun Jul 10 05:04:13 EDT 2022
% 0.09/0.30 % CPUTime :
% 0.14/0.32 ----- Otter 3.2, August 2001 -----
% 0.14/0.32 The process was started by sandbox2 on n024.cluster.edu,
% 0.14/0.32 Sun Jul 10 05:04:13 2022
% 0.14/0.32 The command was "./sos". The process ID is 5832.
% 0.14/0.32
% 0.14/0.32 set(prolog_style_variables).
% 0.14/0.32 set(auto).
% 0.14/0.32 dependent: set(auto1).
% 0.14/0.32 dependent: set(process_input).
% 0.14/0.32 dependent: clear(print_kept).
% 0.14/0.32 dependent: clear(print_new_demod).
% 0.14/0.32 dependent: clear(print_back_demod).
% 0.14/0.32 dependent: clear(print_back_sub).
% 0.14/0.32 dependent: set(control_memory).
% 0.14/0.32 dependent: assign(max_mem, 12000).
% 0.14/0.32 dependent: assign(pick_given_ratio, 4).
% 0.14/0.32 dependent: assign(stats_level, 1).
% 0.14/0.32 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.32 dependent: assign(sos_limit, 5000).
% 0.14/0.32 dependent: assign(max_weight, 60).
% 0.14/0.32 clear(print_given).
% 0.14/0.32
% 0.14/0.32 formula_list(usable).
% 0.14/0.32
% 0.14/0.32 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.32
% 0.14/0.32 This is a Horn set with equality. The strategy will be
% 0.14/0.32 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.32 sos and nonpositive clauses in usable.
% 0.14/0.32
% 0.14/0.32 dependent: set(knuth_bendix).
% 0.14/0.32 dependent: set(para_from).
% 0.14/0.32 dependent: set(para_into).
% 0.14/0.32 dependent: clear(para_from_right).
% 0.14/0.32 dependent: clear(para_into_right).
% 0.14/0.32 dependent: set(para_from_vars).
% 0.14/0.32 dependent: set(eq_units_both_ways).
% 0.14/0.32 dependent: set(dynamic_demod_all).
% 0.14/0.32 dependent: set(dynamic_demod).
% 0.14/0.32 dependent: set(order_eq).
% 0.14/0.32 dependent: set(back_demod).
% 0.14/0.32 dependent: set(lrpo).
% 0.14/0.32 dependent: set(hyper_res).
% 0.14/0.32 dependent: clear(order_hyper).
% 0.14/0.32
% 0.14/0.32 ------------> process usable:
% 0.14/0.32
% 0.14/0.32 ------------> process sos:
% 0.14/0.32 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.14/0.32 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] {-} set_intersection2(A,B)=set_intersection2(B,A).
% 0.14/0.32 Following clause subsumed by 16 during input processing: 0 [copy,16,flip.1] {-} A=A.
% 0.14/0.32
% 0.14/0.32 ======= end of input processing =======
% 0.14/0.34
% 0.14/0.34 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.34
% 0.14/0.34 Stopped by limit on number of solutions
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34 -------------- Softie stats --------------
% 0.14/0.34
% 0.14/0.34 UPDATE_STOP: 300
% 0.14/0.34 SFINDER_TIME_LIMIT: 2
% 0.14/0.34 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.34 number of clauses in intial UL: 7
% 0.14/0.34 number of clauses initially in problem: 16
% 0.14/0.34 percentage of clauses intially in UL: 43
% 0.14/0.34 percentage of distinct symbols occuring in initial UL: 90
% 0.14/0.34 percent of all initial clauses that are short: 100
% 0.14/0.34 absolute distinct symbol count: 11
% 0.14/0.34 distinct predicate count: 4
% 0.14/0.34 distinct function count: 2
% 0.14/0.34 distinct constant count: 5
% 0.14/0.34
% 0.14/0.34 ---------- no more Softie stats ----------
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34 =========== start of search ===========
% 0.61/0.84
% 0.61/0.84 -------- PROOF --------
% 0.61/0.84 % SZS status Theorem
% 0.61/0.84 % SZS output start Refutation
% 0.61/0.84
% 0.61/0.84 Model 2 [ 1 1 105 ] (0.00 seconds, 3345 Inserts)
% 0.61/0.84
% 0.61/0.84 Model 3 [ 1 0 96 ] (0.00 seconds, 3552 Inserts)
% 0.61/0.84
% 0.61/0.84 Stopped by limit on insertions
% 0.61/0.84
% 0.61/0.84 Model 4 [ 2 2 65783 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.84
% 0.61/0.84 Stopped by limit on insertions
% 0.61/0.84
% 0.61/0.84 Model 5 [ 2 1 17820 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.84
% 0.61/0.84 Stopped by limit on insertions
% 0.61/0.84
% 0.61/0.84 Model 6 [ 2 1 74 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.84
% 0.61/0.84 Model 7 [ 12 4 107013 ] (0.00 seconds, 176728 Inserts)
% 0.61/0.84
% 0.61/0.84 Stopped by limit on insertions
% 0.61/0.84
% 0.61/0.84 Model 8 [ 13 0 94 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.84
% 0.61/0.84 ----> UNIT CONFLICT at 0.50 sec ----> 36 [binary,34.1,7.1] {-} $F.
% 0.61/0.84
% 0.61/0.84 Length of proof is 2. Level of proof is 2.
% 0.61/0.84
% 0.61/0.84 ---------------- PROOF ----------------
% 0.61/0.84 % SZS status Theorem
% 0.61/0.84 % SZS output start Refutation
% 0.61/0.84
% 0.61/0.84 3 [] {+} -subset(A,B)|set_intersection2(A,B)=A.
% 0.61/0.84 6 [] {+} subset(unordered_pair(A,B),C)| -in(A,C)| -in(B,C).
% 0.61/0.84 7 [] {+} set_intersection2(unordered_pair($c5,$c3),$c4)!=unordered_pair($c5,$c3).
% 0.61/0.84 14 [] {+} in($c5,$c4).
% 0.61/0.84 15 [] {+} in($c3,$c4).
% 0.61/0.84 22 [hyper,15,6,14] {-} subset(unordered_pair($c5,$c3),$c4).
% 0.61/0.84 34 [hyper,22,3] {-} set_intersection2(unordered_pair($c5,$c3),$c4)=unordered_pair($c5,$c3).
% 0.61/0.84 36 [binary,34.1,7.1] {-} $F.
% 0.61/0.84
% 0.61/0.84 % SZS output end Refutation
% 0.61/0.84 ------------ end of proof -------------
% 0.61/0.84
% 0.61/0.84
% 0.61/0.84 Search stopped by max_proofs option.
% 0.61/0.84
% 0.61/0.84
% 0.61/0.84 Search stopped by max_proofs option.
% 0.61/0.84
% 0.61/0.84 ============ end of search ============
% 0.61/0.84
% 0.61/0.84 ----------- soft-scott stats ----------
% 0.61/0.84
% 0.61/0.84 true clauses given 3 (21.4%)
% 0.61/0.84 false clauses given 11
% 0.61/0.84
% 0.61/0.84 FALSE TRUE
% 0.61/0.84 5 1 0
% 0.61/0.84 7 3 0
% 0.61/0.84 8 0 1
% 0.61/0.84 9 1 3
% 0.61/0.84 tot: 5 4 (44.4% true)
% 0.61/0.84
% 0.61/0.84
% 0.61/0.84 Model 8 [ 13 0 94 ] (0.00 seconds, 250000 Inserts)
% 0.61/0.84
% 0.61/0.84 That finishes the proof of the theorem.
% 0.61/0.84
% 0.61/0.84 Process 5832 finished Sun Jul 10 05:04:14 2022
%------------------------------------------------------------------------------