%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET078-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n027.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 0.83s 1.06s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET078-7 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.13/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sat Jul 9 19:02:32 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.20/0.36 ----- Otter 3.2, August 2001 -----
% 0.20/0.36 The process was started by sandbox on n027.cluster.edu,
% 0.20/0.36 Sat Jul 9 19:02:32 2022
% 0.20/0.36 The command was "./sos". The process ID is 28277.
% 0.20/0.36
% 0.20/0.36 set(prolog_style_variables).
% 0.20/0.36 set(auto).
% 0.20/0.36 dependent: set(auto1).
% 0.20/0.36 dependent: set(process_input).
% 0.20/0.36 dependent: clear(print_kept).
% 0.20/0.36 dependent: clear(print_new_demod).
% 0.20/0.36 dependent: clear(print_back_demod).
% 0.20/0.36 dependent: clear(print_back_sub).
% 0.20/0.36 dependent: set(control_memory).
% 0.20/0.36 dependent: assign(max_mem, 12000).
% 0.20/0.36 dependent: assign(pick_given_ratio, 4).
% 0.20/0.36 dependent: assign(stats_level, 1).
% 0.20/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.20/0.36 dependent: assign(sos_limit, 5000).
% 0.20/0.36 dependent: assign(max_weight, 60).
% 0.20/0.36 clear(print_given).
% 0.20/0.36
% 0.20/0.36 list(usable).
% 0.20/0.36
% 0.20/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.20/0.36
% 0.20/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.20/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.20/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.20/0.36 clauses in usable.
% 0.20/0.36
% 0.20/0.36 dependent: set(knuth_bendix).
% 0.20/0.36 dependent: set(para_from).
% 0.20/0.36 dependent: set(para_into).
% 0.20/0.36 dependent: clear(para_from_right).
% 0.20/0.36 dependent: clear(para_into_right).
% 0.20/0.36 dependent: set(para_from_vars).
% 0.20/0.36 dependent: set(eq_units_both_ways).
% 0.20/0.36 dependent: set(dynamic_demod_all).
% 0.20/0.36 dependent: set(dynamic_demod).
% 0.20/0.36 dependent: set(order_eq).
% 0.20/0.36 dependent: set(back_demod).
% 0.20/0.36 dependent: set(lrpo).
% 0.20/0.36 dependent: set(hyper_res).
% 0.20/0.36 dependent: set(unit_deletion).
% 0.20/0.36 dependent: set(factor).
% 0.20/0.36
% 0.20/0.36 ------------> process usable:
% 0.20/0.36
% 0.20/0.36 ------------> process sos:
% 0.20/0.36 Following clause subsumed by 90 during input processing: 0 [demod,93] {-} member(unordered_pair(A,A),universal_class).
% 0.20/0.36 Following clause subsumed by 159 during input processing: 0 [copy,159,flip.1] {-} unordered_pair(A,B)=unordered_pair(B,A).
% 0.20/0.36 Following clause subsumed by 169 during input processing: 0 [copy,169,flip.1] {-} A=A.
% 0.20/0.36 169 back subsumes 86.
% 0.20/0.36 169 back subsumes 78.
% 0.20/0.36
% 0.20/0.36 ======= end of input processing =======
% 0.42/0.61
% 0.42/0.61 Model 1 (0.00 seconds, 0 Inserts)
% 0.42/0.61
% 0.42/0.61 Stopped by limit on number of solutions
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 -------------- Softie stats --------------
% 0.42/0.61
% 0.42/0.61 UPDATE_STOP: 300
% 0.42/0.61 SFINDER_TIME_LIMIT: 2
% 0.42/0.61 SHORT_CLAUSE_CUTOFF: 4
% 0.42/0.61 number of clauses in intial UL: 66
% 0.42/0.61 number of clauses initially in problem: 149
% 0.42/0.61 percentage of clauses intially in UL: 44
% 0.42/0.61 percentage of distinct symbols occuring in initial UL: 60
% 0.42/0.61 percent of all initial clauses that are short: 100
% 0.42/0.61 absolute distinct symbol count: 50
% 0.42/0.61 distinct predicate count: 10
% 0.42/0.61 distinct function count: 30
% 0.42/0.61 distinct constant count: 10
% 0.42/0.61
% 0.42/0.61 ---------- no more Softie stats ----------
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61
% 0.42/0.61 Stopped by limit on insertions
% 0.42/0.61
% 0.42/0.61 =========== start of search ===========
% 0.83/1.06
% 0.83/1.06 -------- PROOF --------
% 0.83/1.06 % SZS status Unsatisfiable
% 0.83/1.06 % SZS output start Refutation
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 Stopped by limit on insertions
% 0.83/1.06
% 0.83/1.06 ----> UNIT CONFLICT at 0.66 sec ----> 274 [binary,273.1,170.1] {-} $F.
% 0.83/1.06
% 0.83/1.06 Length of proof is 3. Level of proof is 2.
% 0.83/1.06
% 0.83/1.06 ---------------- PROOF ----------------
% 0.83/1.06 % SZS status Unsatisfiable
% 0.83/1.06 % SZS output start Refutation
% 0.83/1.06
% 0.83/1.06 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 0.83/1.06 77 [] {-} -member(singleton(y),unordered_pair(x,singleton(y))).
% 0.83/1.06 90 [] {-} member(unordered_pair(A,B),universal_class).
% 0.83/1.06 91 [] {-} unordered_pair(A,A)=singleton(A).
% 0.83/1.06 93,92 [copy,91,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 0.83/1.06 170 [back_demod,77,demod,93,93] {+} -member(unordered_pair(y,y),unordered_pair(x,unordered_pair(y,y))).
% 0.83/1.06 273 [hyper,90,8] {-} member(unordered_pair(A,B),unordered_pair(C,unordered_pair(A,B))).
% 0.83/1.06 274 [binary,273.1,170.1] {-} $F.
% 0.83/1.06
% 0.83/1.06 % SZS output end Refutation
% 0.83/1.06 ------------ end of proof -------------
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Search stopped by max_proofs option.
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Search stopped by max_proofs option.
% 0.83/1.06
% 0.83/1.06 ============ end of search ============
% 0.83/1.06
% 0.83/1.06 ----------- soft-scott stats ----------
% 0.83/1.06
% 0.83/1.06 true clauses given 1 (16.7%)
% 0.83/1.06 false clauses given 5
% 0.83/1.06
% 0.83/1.06 FALSE TRUE
% 0.83/1.06 3 3 3
% 0.83/1.06 5 5 5
% 0.83/1.06 6 3 0
% 0.83/1.06 7 8 2
% 0.83/1.06 8 14 7
% 0.83/1.06 9 4 1
% 0.83/1.06 10 6 7
% 0.83/1.06 11 3 8
% 0.83/1.06 12 2 8
% 0.83/1.06 13 5 8
% 0.83/1.06 14 3 1
% 0.83/1.06 15 1 0
% 0.83/1.06 16 3 4
% 0.83/1.06 17 0 5
% 0.83/1.06 18 0 2
% 0.83/1.06 19 0 1
% 0.83/1.06 20 0 2
% 0.83/1.06 22 1 1
% 0.83/1.06 23 1 0
% 0.83/1.06 24 1 3
% 0.83/1.06 tot: 63 68 (51.9% true)
% 0.83/1.06
% 0.83/1.06
% 0.83/1.06 Model 1 (0.00 seconds, 0 Inserts)
% 0.83/1.06
% 0.83/1.06 That finishes the proof of the theorem.
% 0.83/1.06
% 0.83/1.06 Process 28277 finished Sat Jul 9 19:02:32 2022
%------------------------------------------------------------------------------