TSTP Solution File: SET078-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET078-6 : TPTP v8.1.0. Bugfixed v2.1.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:15:26 EDT 2022
% Result : Unsatisfiable 1.41s 1.62s
% Output : Refutation 1.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SET078-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.07/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n028.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 22:40:13 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox on n028.cluster.edu,
% 0.13/0.36 Sun Jul 10 22:40:13 2022
% 0.13/0.36 The command was "./sos". The process ID is 13081.
% 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 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 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 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.13/0.36 135 back subsumes 61.
% 0.13/0.36
% 0.13/0.36 ======= end of input processing =======
% 0.60/0.80
% 0.60/0.80 Model 1 (0.00 seconds, 0 Inserts)
% 0.60/0.80
% 0.60/0.80 Stopped by limit on number of solutions
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 -------------- Softie stats --------------
% 0.60/0.80
% 0.60/0.80 UPDATE_STOP: 300
% 0.60/0.80 SFINDER_TIME_LIMIT: 2
% 0.60/0.80 SHORT_CLAUSE_CUTOFF: 4
% 0.60/0.80 number of clauses in intial UL: 48
% 0.60/0.80 number of clauses initially in problem: 119
% 0.60/0.80 percentage of clauses intially in UL: 40
% 0.60/0.80 percentage of distinct symbols occuring in initial UL: 60
% 0.60/0.80 percent of all initial clauses that are short: 100
% 0.60/0.80 absolute distinct symbol count: 50
% 0.60/0.80 distinct predicate count: 10
% 0.60/0.80 distinct function count: 30
% 0.60/0.80 distinct constant count: 10
% 0.60/0.80
% 0.60/0.80 ---------- no more Softie stats ----------
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80
% 0.60/0.80 Stopped by limit on insertions
% 0.60/0.80
% 0.60/0.80 =========== start of search ===========
% 1.41/1.62
% 1.41/1.62 -------- PROOF --------
% 1.41/1.62 % SZS status Unsatisfiable
% 1.41/1.62 % SZS output start Refutation
% 1.41/1.62
% 1.41/1.62 Stopped by limit on insertions
% 1.41/1.62
% 1.41/1.62 Model 2 [ 1 1 10806 ] (0.00 seconds, 250000 Inserts)
% 1.41/1.62
% 1.41/1.62 Stopped by limit on insertions
% 1.41/1.62
% 1.41/1.62 Model 3 [ 3 1 8094 ] (0.00 seconds, 250000 Inserts)
% 1.41/1.62
% 1.41/1.62 Stopped by limit on insertions
% 1.41/1.62
% 1.41/1.62 Stopped by limit on insertions
% 1.41/1.62
% 1.41/1.62 Model 4 [ 2 1 5416 ] (0.00 seconds, 250000 Inserts)
% 1.41/1.62
% 1.41/1.62 ----> UNIT CONFLICT at 1.24 sec ----> 209 [binary,208.1,136.1] {+} $F.
% 1.41/1.62
% 1.41/1.62 Length of proof is 3. Level of proof is 2.
% 1.41/1.62
% 1.41/1.62 ---------------- PROOF ----------------
% 1.41/1.62 % SZS status Unsatisfiable
% 1.41/1.62 % SZS output start Refutation
% 1.41/1.62
% 1.41/1.62 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 1.41/1.62 60 [] {-} -member(singleton(y),unordered_pair(x,singleton(y))).
% 1.41/1.62 71 [] {-} member(unordered_pair(A,B),universal_class).
% 1.41/1.62 72 [] {-} unordered_pair(A,A)=singleton(A).
% 1.41/1.62 74,73 [copy,72,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 1.41/1.62 136 [back_demod,60,demod,74,74] {+} -member(unordered_pair(y,y),unordered_pair(x,unordered_pair(y,y))).
% 1.41/1.62 208 [hyper,71,8] {-} member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))).
% 1.41/1.62 209 [binary,208.1,136.1] {+} $F.
% 1.41/1.62
% 1.41/1.62 % SZS output end Refutation
% 1.41/1.62 ------------ end of proof -------------
% 1.41/1.62
% 1.41/1.62
% 1.41/1.62 Search stopped by max_proofs option.
% 1.41/1.62
% 1.41/1.62
% 1.41/1.62 Search stopped by max_proofs option.
% 1.41/1.62
% 1.41/1.62 ============ end of search ============
% 1.41/1.62
% 1.41/1.62 ----------- soft-scott stats ----------
% 1.41/1.62
% 1.41/1.62 true clauses given 0 (0.0%)
% 1.41/1.62 false clauses given 6
% 1.41/1.62
% 1.41/1.62 FALSE TRUE
% 1.41/1.62 3 1 2
% 1.41/1.62 5 1 7
% 1.41/1.62 6 1 2
% 1.41/1.62 7 3 4
% 1.41/1.62 8 7 11
% 1.41/1.62 9 2 3
% 1.41/1.62 10 5 6
% 1.41/1.62 11 1 10
% 1.41/1.62 12 2 2
% 1.41/1.62 13 4 1
% 1.41/1.62 14 2 2
% 1.41/1.62 15 1 0
% 1.41/1.62 16 3 0
% 1.41/1.62 17 1 0
% 1.41/1.62 18 0 2
% 1.41/1.62 19 1 0
% 1.41/1.62 20 0 1
% 1.41/1.62 22 1 0
% 1.41/1.62 23 1 0
% 1.41/1.62 24 0 1
% 1.41/1.62 tot: 37 54 (59.3% true)
% 1.41/1.62
% 1.41/1.62
% 1.41/1.62 Model 4 [ 2 -31 5416 ] (0.00 seconds, 250000 Inserts)
% 1.41/1.62
% 1.41/1.62 That finishes the proof of the theorem.
% 1.41/1.62
% 1.41/1.62 Process 13081 finished Sun Jul 10 22:40:14 2022
%------------------------------------------------------------------------------