TSTP Solution File: SET024-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET024-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n007.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:14:28 EDT 2022
% Result : Unsatisfiable 1.97s 2.16s
% Output : Refutation 1.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET024-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jul 10 14:57:32 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.38 ----- Otter 3.2, August 2001 -----
% 0.21/0.38 The process was started by sandbox2 on n007.cluster.edu,
% 0.21/0.38 Sun Jul 10 14:57:32 2022
% 0.21/0.38 The command was "./sos". The process ID is 30490.
% 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 list(usable).
% 0.21/0.38
% 0.21/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.21/0.38
% 0.21/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.21/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.21/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.21/0.38 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: set(unit_deletion).
% 0.21/0.38 dependent: set(factor).
% 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 136 during input processing: 0 [copy,136,flip.1] {-} A=A.
% 0.21/0.38 136 back subsumes 61.
% 0.21/0.38
% 0.21/0.38 ======= end of input processing =======
% 0.49/0.67
% 0.49/0.67 Model 1 (0.00 seconds, 0 Inserts)
% 0.49/0.67
% 0.49/0.67 Stopped by limit on number of solutions
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67 -------------- Softie stats --------------
% 0.49/0.67
% 0.49/0.67 UPDATE_STOP: 300
% 0.49/0.67 SFINDER_TIME_LIMIT: 2
% 0.49/0.67 SHORT_CLAUSE_CUTOFF: 4
% 0.49/0.67 number of clauses in intial UL: 48
% 0.49/0.67 number of clauses initially in problem: 120
% 0.49/0.67 percentage of clauses intially in UL: 40
% 0.49/0.67 percentage of distinct symbols occuring in initial UL: 61
% 0.49/0.67 percent of all initial clauses that are short: 100
% 0.49/0.67 absolute distinct symbol count: 49
% 0.49/0.67 distinct predicate count: 10
% 0.49/0.67 distinct function count: 30
% 0.49/0.67 distinct constant count: 9
% 0.49/0.67
% 0.49/0.67 ---------- no more Softie stats ----------
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67
% 0.49/0.67 Stopped by limit on insertions
% 0.49/0.67
% 0.49/0.67 =========== start of search ===========
% 1.97/2.16
% 1.97/2.16 -------- PROOF --------
% 1.97/2.16 % SZS status Unsatisfiable
% 1.97/2.16 % SZS output start Refutation
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 Model 2 [ 3 2 11667 ] (0.00 seconds, 250000 Inserts)
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 Model 3 [ 3 1 7078 ] (0.00 seconds, 250000 Inserts)
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 Stopped by limit on insertions
% 1.97/2.16
% 1.97/2.16 ----> UNIT CONFLICT at 1.76 sec ----> 232 [binary,231.1,137.1] {-} $F.
% 1.97/2.16
% 1.97/2.16 Length of proof is 3. Level of proof is 2.
% 1.97/2.16
% 1.97/2.16 ---------------- PROOF ----------------
% 1.97/2.16 % SZS status Unsatisfiable
% 1.97/2.16 % SZS output start Refutation
% 1.97/2.16
% 1.97/2.16 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 1.97/2.16 60 [] {-} -member(x,singleton(x)).
% 1.97/2.16 72 [] {-} unordered_pair(A,A)=singleton(A).
% 1.97/2.16 74,73 [copy,72,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 1.97/2.16 135 [] {-} member(x,universal_class).
% 1.97/2.16 137 [back_demod,60,demod,74] {+} -member(x,unordered_pair(x,x)).
% 1.97/2.16 231 [hyper,135,8] {-} member(x,unordered_pair(A,x)).
% 1.97/2.16 232 [binary,231.1,137.1] {-} $F.
% 1.97/2.16
% 1.97/2.16 % SZS output end Refutation
% 1.97/2.16 ------------ end of proof -------------
% 1.97/2.16
% 1.97/2.16
% 1.97/2.16 Search stopped by max_proofs option.
% 1.97/2.16
% 1.97/2.16
% 1.97/2.16 Search stopped by max_proofs option.
% 1.97/2.16
% 1.97/2.16 ============ end of search ============
% 1.97/2.16
% 1.97/2.16 ----------- soft-scott stats ----------
% 1.97/2.16
% 1.97/2.16 true clauses given 0 (0.0%)
% 1.97/2.16 false clauses given 7
% 1.97/2.16
% 1.97/2.16 FALSE TRUE
% 1.97/2.16 3 0 3
% 1.97/2.16 5 0 9
% 1.97/2.16 6 2 1
% 1.97/2.16 7 4 5
% 1.97/2.16 8 11 8
% 1.97/2.16 9 7 1
% 1.97/2.16 10 7 7
% 1.97/2.16 11 8 5
% 1.97/2.16 12 1 4
% 1.97/2.16 13 8 1
% 1.97/2.16 14 4 1
% 1.97/2.16 15 0 3
% 1.97/2.16 16 2 1
% 1.97/2.16 17 0 1
% 1.97/2.16 18 0 2
% 1.97/2.16 19 0 1
% 1.97/2.16 20 0 1
% 1.97/2.16 22 1 0
% 1.97/2.16 23 1 0
% 1.97/2.16 24 1 0
% 1.97/2.16 tot: 57 54 (48.6% true)
% 1.97/2.16
% 1.97/2.16
% 1.97/2.16 Model 3 [ 3 -58 7078 ] (0.00 seconds, 250000 Inserts)
% 1.97/2.16
% 1.97/2.16 That finishes the proof of the theorem.
% 1.97/2.16
% 1.97/2.16 Process 30490 finished Sun Jul 10 14:57:34 2022
%------------------------------------------------------------------------------