TSTP Solution File: SET886+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:35 EDT 2022
% Result : Theorem 0.21s 0.44s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : SET886+1 : TPTP v8.1.0. Released v3.2.0.
% 0.05/0.14 % Command : sos-script %s
% 0.14/0.36 % Computer : n009.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 08:40:22 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.21/0.38 ----- Otter 3.2, August 2001 -----
% 0.21/0.38 The process was started by sandbox2 on n009.cluster.edu,
% 0.21/0.38 Mon Jul 11 08:40:22 2022
% 0.21/0.38 The command was "./sos". The process ID is 17154.
% 0.21/0.38
% 0.21/0.38 set(prolog_style_variables).
% 0.21/0.38 set(auto).
% 0.21/0.38 dependent: set(auto1).
% 0.21/0.38 dependent: set(process_input).
% 0.21/0.38 dependent: clear(print_kept).
% 0.21/0.38 dependent: clear(print_new_demod).
% 0.21/0.38 dependent: clear(print_back_demod).
% 0.21/0.38 dependent: clear(print_back_sub).
% 0.21/0.38 dependent: set(control_memory).
% 0.21/0.38 dependent: assign(max_mem, 12000).
% 0.21/0.38 dependent: assign(pick_given_ratio, 4).
% 0.21/0.38 dependent: assign(stats_level, 1).
% 0.21/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.21/0.38 dependent: assign(sos_limit, 5000).
% 0.21/0.38 dependent: assign(max_weight, 60).
% 0.21/0.38 clear(print_given).
% 0.21/0.38
% 0.21/0.38 formula_list(usable).
% 0.21/0.38
% 0.21/0.38 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 0.21/0.38
% 0.21/0.38 This is a Horn set with equality. The strategy will be
% 0.21/0.38 Knuth-Bendix and hyper_res, with positive clauses in
% 0.21/0.38 sos and nonpositive clauses in usable.
% 0.21/0.38
% 0.21/0.38 dependent: set(knuth_bendix).
% 0.21/0.38 dependent: set(para_from).
% 0.21/0.38 dependent: set(para_into).
% 0.21/0.38 dependent: clear(para_from_right).
% 0.21/0.38 dependent: clear(para_into_right).
% 0.21/0.38 dependent: set(para_from_vars).
% 0.21/0.38 dependent: set(eq_units_both_ways).
% 0.21/0.38 dependent: set(dynamic_demod_all).
% 0.21/0.38 dependent: set(dynamic_demod).
% 0.21/0.38 dependent: set(order_eq).
% 0.21/0.38 dependent: set(back_demod).
% 0.21/0.38 dependent: set(lrpo).
% 0.21/0.38 dependent: set(hyper_res).
% 0.21/0.38 dependent: clear(order_hyper).
% 0.21/0.38
% 0.21/0.38 ------------> process usable:
% 0.21/0.38
% 0.21/0.38 ------------> process sos:
% 0.21/0.38 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.21/0.38 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.21/0.38
% 0.21/0.38 ======= end of input processing =======
% 0.21/0.41
% 0.21/0.41 Model 1 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 -------------- Softie stats --------------
% 0.21/0.41
% 0.21/0.41 UPDATE_STOP: 300
% 0.21/0.41 SFINDER_TIME_LIMIT: 2
% 0.21/0.41 SHORT_CLAUSE_CUTOFF: 4
% 0.21/0.41 number of clauses in intial UL: 1
% 0.21/0.41 number of clauses initially in problem: 10
% 0.21/0.41 percentage of clauses intially in UL: 10
% 0.21/0.41 percentage of distinct symbols occuring in initial UL: 20
% 0.21/0.41 percent of all initial clauses that are short: 100
% 0.21/0.41 absolute distinct symbol count: 10
% 0.21/0.41 distinct predicate count: 3
% 0.21/0.41 distinct function count: 2
% 0.21/0.41 distinct constant count: 5
% 0.21/0.41
% 0.21/0.41 ---------- no more Softie stats ----------
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41
% 0.21/0.41 Model 2 (0.00 seconds, 0 Inserts)
% 0.21/0.41
% 0.21/0.41 Stopped by limit on number of solutions
% 0.21/0.41
% 0.21/0.41 =========== start of search ===========
% 0.21/0.44
% 0.21/0.44 -------- PROOF --------
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 % SZS output start Refutation
% 0.21/0.44
% 0.21/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.21/0.44
% 0.21/0.44 Stopped by limit on number of solutions
% 0.21/0.44
% 0.21/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.21/0.44
% 0.21/0.44 Stopped by limit on number of solutions
% 0.21/0.44
% 0.21/0.44 Model 5 [ 1 0 285 ] (0.00 seconds, 13645 Inserts)
% 0.21/0.44
% 0.21/0.44 ----> UNIT CONFLICT at 0.04 sec ----> 44 [binary,43.1,12.1] {-} $F.
% 0.21/0.44
% 0.21/0.44 Length of proof is 11. Level of proof is 7.
% 0.21/0.44
% 0.21/0.44 ---------------- PROOF ----------------
% 0.21/0.44 % SZS status Theorem
% 0.21/0.44 % SZS output start Refutation
% 0.21/0.44
% 0.21/0.44 2 [] {-} -subset(unordered_pair(A,B),singleton(C))|A=C.
% 0.21/0.44 3 [] {-} unordered_pair($c5,$c4)!=singleton($c3).
% 0.21/0.44 4 [copy,3,flip.1] {-} singleton($c3)!=unordered_pair($c5,$c4).
% 0.21/0.44 5 [] {+} unordered_pair(A,B)=unordered_pair(B,A).
% 0.21/0.44 8 [] {-} subset(unordered_pair($c5,$c4),singleton($c3)).
% 0.21/0.44 9 [] {-} unordered_pair(A,A)=singleton(A).
% 0.21/0.44 11,10 [copy,9,flip.1] {+} singleton(A)=unordered_pair(A,A).
% 0.21/0.44 12 [] {+} A=A.
% 0.21/0.44 13 [back_demod,8,demod,11] {-} subset(unordered_pair($c5,$c4),unordered_pair($c3,$c3)).
% 0.21/0.44 14 [back_demod,4,demod,11,flip.1] {+} unordered_pair($c5,$c4)!=unordered_pair($c3,$c3).
% 0.21/0.44 15 [back_demod,2,demod,11] {+} -subset(unordered_pair(A,B),unordered_pair(C,C))|A=C.
% 0.21/0.44 24,23 [hyper,13,15] {+} $c5=$c3.
% 0.21/0.44 25 [back_demod,14,demod,24] {+} unordered_pair($c3,$c4)!=unordered_pair($c3,$c3).
% 0.21/0.44 26 [back_demod,13,demod,24] {-} subset(unordered_pair($c3,$c4),unordered_pair($c3,$c3)).
% 0.21/0.44 30 [para_into,26.1.1,5.1.1] {-} subset(unordered_pair($c4,$c3),unordered_pair($c3,$c3)).
% 0.21/0.44 36,35 [hyper,30,15] {-} $c4=$c3.
% 0.21/0.44 43 [back_demod,25,demod,36] {-} unordered_pair($c3,$c3)!=unordered_pair($c3,$c3).
% 0.21/0.44 44 [binary,43.1,12.1] {-} $F.
% 0.21/0.44
% 0.21/0.44 % SZS output end Refutation
% 0.21/0.44 ------------ end of proof -------------
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Search stopped by max_proofs option.
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Search stopped by max_proofs option.
% 0.21/0.44
% 0.21/0.44 ============ end of search ============
% 0.21/0.44
% 0.21/0.44 ----------- soft-scott stats ----------
% 0.21/0.44
% 0.21/0.44 true clauses given 3 (30.0%)
% 0.21/0.44 false clauses given 7
% 0.21/0.44
% 0.21/0.44 FALSE TRUE
% 0.21/0.44 7 0 2
% 0.21/0.44 9 0 2
% 0.21/0.44 10 0 2
% 0.21/0.44 14 0 7
% 0.21/0.44 17 0 2
% 0.21/0.44 tot: 0 15 (100.0% true)
% 0.21/0.44
% 0.21/0.44
% 0.21/0.44 Model 5 [ 1 0 285 ] (0.00 seconds, 13645 Inserts)
% 0.21/0.44
% 0.21/0.44 That finishes the proof of the theorem.
% 0.21/0.44
% 0.21/0.44 Process 17154 finished Mon Jul 11 08:40:22 2022
%------------------------------------------------------------------------------