%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET025-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n022.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:30 EDT 2022
% Result : Unsatisfiable 1.80s 2.00s
% Output : Refutation 1.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET025-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 06:01:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n022.cluster.edu,
% 0.12/0.36 Sun Jul 10 06:01:40 2022
% 0.12/0.36 The command was "./sos". The process ID is 10705.
% 0.12/0.36
% 0.12/0.36 set(prolog_style_variables).
% 0.12/0.36 set(auto).
% 0.12/0.36 dependent: set(auto1).
% 0.12/0.36 dependent: set(process_input).
% 0.12/0.36 dependent: clear(print_kept).
% 0.12/0.36 dependent: clear(print_new_demod).
% 0.12/0.36 dependent: clear(print_back_demod).
% 0.12/0.36 dependent: clear(print_back_sub).
% 0.12/0.36 dependent: set(control_memory).
% 0.12/0.36 dependent: assign(max_mem, 12000).
% 0.12/0.36 dependent: assign(pick_given_ratio, 4).
% 0.12/0.36 dependent: assign(stats_level, 1).
% 0.12/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.36 dependent: assign(sos_limit, 5000).
% 0.12/0.36 dependent: assign(max_weight, 60).
% 0.12/0.36 clear(print_given).
% 0.12/0.36
% 0.12/0.36 list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.12/0.36
% 0.12/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.36 clauses in usable.
% 0.12/0.36
% 0.12/0.36 dependent: set(knuth_bendix).
% 0.12/0.36 dependent: set(para_from).
% 0.12/0.36 dependent: set(para_into).
% 0.12/0.36 dependent: clear(para_from_right).
% 0.12/0.36 dependent: clear(para_into_right).
% 0.12/0.36 dependent: set(para_from_vars).
% 0.12/0.36 dependent: set(eq_units_both_ways).
% 0.12/0.36 dependent: set(dynamic_demod_all).
% 0.12/0.36 dependent: set(dynamic_demod).
% 0.12/0.36 dependent: set(order_eq).
% 0.12/0.36 dependent: set(back_demod).
% 0.12/0.36 dependent: set(lrpo).
% 0.12/0.36 dependent: set(hyper_res).
% 0.12/0.36 dependent: set(unit_deletion).
% 0.12/0.36 dependent: set(factor).
% 0.12/0.36
% 0.12/0.36 ------------> process usable:
% 0.12/0.36
% 0.12/0.36 ------------> process sos:
% 0.12/0.36 Following clause subsumed by 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.12/0.36 135 back subsumes 61.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.62/0.80
% 0.62/0.80 Model 1 (0.00 seconds, 0 Inserts)
% 0.62/0.80
% 0.62/0.80 Stopped by limit on number of solutions
% 0.62/0.80
% 0.62/0.80
% 0.62/0.80 -------------- Softie stats --------------
% 0.62/0.80
% 0.62/0.80 UPDATE_STOP: 300
% 0.62/0.80 SFINDER_TIME_LIMIT: 2
% 0.62/0.80 SHORT_CLAUSE_CUTOFF: 4
% 0.62/0.80 number of clauses in intial UL: 49
% 0.62/0.80 number of clauses initially in problem: 119
% 0.62/0.80 percentage of clauses intially in UL: 41
% 0.62/0.80 percentage of distinct symbols occuring in initial UL: 64
% 0.62/0.80 percent of all initial clauses that are short: 100
% 0.62/0.80 absolute distinct symbol count: 50
% 0.62/0.80 distinct predicate count: 10
% 0.62/0.80 distinct function count: 30
% 0.62/0.80 distinct constant count: 10
% 0.62/0.80
% 0.62/0.80 ---------- no more Softie stats ----------
% 0.62/0.80
% 0.62/0.80
% 0.62/0.80
% 0.62/0.80 Stopped by limit on insertions
% 0.62/0.80
% 0.62/0.80 =========== start of search ===========
% 1.80/2.00
% 1.80/2.00 -------- PROOF --------
% 1.80/2.00 % SZS status Unsatisfiable
% 1.80/2.00 % SZS output start Refutation
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 Model 2 [ 2 3 18280 ] (0.00 seconds, 250000 Inserts)
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 Model 3 [ 1 1 6757 ] (0.00 seconds, 250000 Inserts)
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 Stopped by limit on insertions
% 1.80/2.00
% 1.80/2.00 ----> UNIT CONFLICT at 1.61 sec ----> 491 [binary,490.1,60.1] {-} $F.
% 1.80/2.00
% 1.80/2.00 Length of proof is 3. Level of proof is 3.
% 1.80/2.00
% 1.80/2.00 ---------------- PROOF ----------------
% 1.80/2.00 % SZS status Unsatisfiable
% 1.80/2.00 % SZS output start Refutation
% 1.80/2.00
% 1.80/2.00 60 [] {+} -member(ordered_pair(x,y),universal_class).
% 1.80/2.00 71 [] {-} member(unordered_pair(A,B),universal_class).
% 1.80/2.00 72 [] {-} unordered_pair(A,A)=singleton(A).
% 1.80/2.00 74,73 [copy,72,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 1.80/2.00 75 [] {-} unordered_pair(singleton(A),unordered_pair(A,singleton(B)))=ordered_pair(A,B).
% 1.80/2.00 76 [copy,75,demod,74,74] {-} unordered_pair(unordered_pair(A,A),unordered_pair(A,unordered_pair(B,B)))=ordered_pair(A,B).
% 1.80/2.00 490 [para_from,76.1.1,71.1.1] {-} member(ordered_pair(A,B),universal_class).
% 1.80/2.00 491 [binary,490.1,60.1] {-} $F.
% 1.80/2.00
% 1.80/2.00 % SZS output end Refutation
% 1.80/2.00 ------------ end of proof -------------
% 1.80/2.00
% 1.80/2.00
% 1.80/2.00 Search stopped by max_proofs option.
% 1.80/2.00
% 1.80/2.00
% 1.80/2.00 Search stopped by max_proofs option.
% 1.80/2.00
% 1.80/2.00 ============ end of search ============
% 1.80/2.00
% 1.80/2.00 ----------- soft-scott stats ----------
% 1.80/2.00
% 1.80/2.00 true clauses given 2 (18.2%)
% 1.80/2.00 false clauses given 9
% 1.80/2.00
% 1.80/2.00 FALSE TRUE
% 1.80/2.00 3 0 2
% 1.80/2.00 5 0 8
% 1.80/2.00 6 0 4
% 1.80/2.00 7 3 8
% 1.80/2.00 8 8 11
% 1.80/2.00 9 12 6
% 1.80/2.00 10 11 8
% 1.80/2.00 11 15 13
% 1.80/2.00 12 7 13
% 1.80/2.00 13 10 7
% 1.80/2.00 14 12 10
% 1.80/2.00 15 7 12
% 1.80/2.00 16 6 8
% 1.80/2.00 17 2 14
% 1.80/2.00 18 0 5
% 1.80/2.00 19 0 7
% 1.80/2.00 20 2 2
% 1.80/2.00 21 4 4
% 1.80/2.00 22 2 0
% 1.80/2.00 23 3 2
% 1.80/2.00 24 2 0
% 1.80/2.00 27 0 23
% 1.80/2.00 29 1 10
% 1.80/2.00 30 0 6
% 1.80/2.00 31 2 10
% 1.80/2.00 32 0 11
% 1.80/2.00 33 0 3
% 1.80/2.00 34 0 9
% 1.80/2.00 36 0 1
% 1.80/2.00 37 0 1
% 1.80/2.00 39 0 1
% 1.80/2.00 46 0 2
% 1.80/2.00 48 0 4
% 1.80/2.00 50 0 2
% 1.80/2.00 55 0 1
% 1.80/2.00 57 0 2
% 1.80/2.00 59 0 1
% 1.80/2.00 tot: 109 231 (67.9% true)
% 1.80/2.00
% 1.80/2.00
% 1.80/2.00 Model 3 [ 1 -62 6757 ] (0.00 seconds, 250000 Inserts)
% 1.80/2.00
% 1.80/2.00 That finishes the proof of the theorem.
% 1.80/2.00
% 1.80/2.00 Process 10705 finished Sun Jul 10 06:01:42 2022
%------------------------------------------------------------------------------