TSTP Solution File: SET633+3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET633+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n005.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:40 EDT 2022
% Result : Theorem 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET633+3 : TPTP v8.1.0. Released v2.2.0.
% 0.10/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n005.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 : Sat Jul 9 22:01:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n005.cluster.edu,
% 0.13/0.36 Sat Jul 9 22:01:07 2022
% 0.13/0.36 The command was "./sos". The process ID is 6832.
% 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 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] {-} union(A,B)=union(B,A).
% 0.13/0.36 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] {-} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.13/0.36 Following clause subsumed by 23 during input processing: 0 [copy,23,flip.1] {-} A=A.
% 0.13/0.36 23 back subsumes 12.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.13/0.38
% 0.13/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.13/0.38
% 0.13/0.38 Stopped by limit on number of solutions
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 -------------- Softie stats --------------
% 0.13/0.38
% 0.13/0.38 UPDATE_STOP: 300
% 0.13/0.38 SFINDER_TIME_LIMIT: 2
% 0.13/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.13/0.38 number of clauses in intial UL: 11
% 0.13/0.38 number of clauses initially in problem: 21
% 0.13/0.38 percentage of clauses intially in UL: 52
% 0.13/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.13/0.38 percent of all initial clauses that are short: 100
% 0.13/0.38 absolute distinct symbol count: 11
% 0.13/0.38 distinct predicate count: 3
% 0.13/0.38 distinct function count: 5
% 0.13/0.38 distinct constant count: 3
% 0.13/0.38
% 0.13/0.38 ---------- no more Softie stats ----------
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38
% 0.13/0.38 =========== start of search ===========
% 0.19/0.43
% 0.19/0.43 -------- PROOF --------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 Stopped by limit on number of solutions
% 0.19/0.43
% 0.19/0.43 ----> UNIT CONFLICT at 0.05 sec ----> 54 [binary,53.1,47.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 Length of proof is 3. Level of proof is 2.
% 0.19/0.43
% 0.19/0.43 ---------------- PROOF ----------------
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 % SZS output start Refutation
% 0.19/0.43
% 0.19/0.43 1 [] {+} -subset(A,B)| -subset(C,B)|subset(union(A,C),B).
% 0.19/0.43 10 [] {+} -subset(symmetric_difference($c3,$c2),$c1).
% 0.19/0.43 13 [] {-} symmetric_difference(A,B)=union(difference(A,B),difference(B,A)).
% 0.19/0.43 15,14 [copy,13,flip.1] {-} union(difference(A,B),difference(B,A))=symmetric_difference(A,B).
% 0.19/0.43 18 [] {+} symmetric_difference(A,B)=symmetric_difference(B,A).
% 0.19/0.43 21 [] {+} subset(difference($c3,$c2),$c1).
% 0.19/0.43 22 [] {-} subset(difference($c2,$c3),$c1).
% 0.19/0.43 47 [para_from,18.1.1,10.1.1] {+} -subset(symmetric_difference($c2,$c3),$c1).
% 0.19/0.43 53 [hyper,21,1,22,demod,15] {-} subset(symmetric_difference($c2,$c3),$c1).
% 0.19/0.43 54 [binary,53.1,47.1] {-} $F.
% 0.19/0.43
% 0.19/0.43 % SZS output end Refutation
% 0.19/0.43 ------------ end of proof -------------
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Search stopped by max_proofs option.
% 0.19/0.43
% 0.19/0.43 ============ end of search ============
% 0.19/0.43
% 0.19/0.43 ----------- soft-scott stats ----------
% 0.19/0.43
% 0.19/0.43 true clauses given 2 (22.2%)
% 0.19/0.43 false clauses given 7
% 0.19/0.43
% 0.19/0.43 FALSE TRUE
% 0.19/0.43 5 0 2
% 0.19/0.43 7 0 3
% 0.19/0.43 9 0 2
% 0.19/0.43 10 0 3
% 0.19/0.43 12 0 2
% 0.19/0.43 13 1 0
% 0.19/0.43 14 0 1
% 0.19/0.43 15 1 4
% 0.19/0.43 19 0 1
% 0.19/0.43 21 0 3
% 0.19/0.43 22 0 1
% 0.19/0.43 24 0 2
% 0.19/0.43 25 0 2
% 0.19/0.43 tot: 2 26 (92.9% true)
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.43
% 0.19/0.43 That finishes the proof of the theorem.
% 0.19/0.43
% 0.19/0.43 Process 6832 finished Sat Jul 9 22:01:07 2022
%------------------------------------------------------------------------------