%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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 14:27:37 EDT 2022
% Result : Theorem 0.70s 0.92s
% Output : Refutation 0.70s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 Jun 19 20:04:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.35 ----- Otter 3.2, August 2001 -----
% 0.18/0.35 The process was started by sandbox on n020.cluster.edu,
% 0.18/0.35 Sun Jun 19 20:04:48 2022
% 0.18/0.35 The command was "./sos". The process ID is 22320.
% 0.18/0.35
% 0.18/0.35 set(prolog_style_variables).
% 0.18/0.35 set(auto).
% 0.18/0.35 dependent: set(auto1).
% 0.18/0.35 dependent: set(process_input).
% 0.18/0.35 dependent: clear(print_kept).
% 0.18/0.35 dependent: clear(print_new_demod).
% 0.18/0.35 dependent: clear(print_back_demod).
% 0.18/0.35 dependent: clear(print_back_sub).
% 0.18/0.35 dependent: set(control_memory).
% 0.18/0.35 dependent: assign(max_mem, 12000).
% 0.18/0.35 dependent: assign(pick_given_ratio, 4).
% 0.18/0.35 dependent: assign(stats_level, 1).
% 0.18/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.18/0.35 dependent: assign(sos_limit, 5000).
% 0.18/0.35 dependent: assign(max_weight, 60).
% 0.18/0.35 clear(print_given).
% 0.18/0.35
% 0.18/0.35 formula_list(usable).
% 0.18/0.35
% 0.18/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.18/0.35
% 0.18/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.18/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.18/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.18/0.35 clauses in usable.
% 0.18/0.35
% 0.18/0.35 dependent: set(knuth_bendix).
% 0.18/0.35 dependent: set(para_from).
% 0.18/0.35 dependent: set(para_into).
% 0.18/0.35 dependent: clear(para_from_right).
% 0.18/0.35 dependent: clear(para_into_right).
% 0.18/0.35 dependent: set(para_from_vars).
% 0.18/0.35 dependent: set(eq_units_both_ways).
% 0.18/0.35 dependent: set(dynamic_demod_all).
% 0.18/0.35 dependent: set(dynamic_demod).
% 0.18/0.35 dependent: set(order_eq).
% 0.18/0.35 dependent: set(back_demod).
% 0.18/0.35 dependent: set(lrpo).
% 0.18/0.35 dependent: set(hyper_res).
% 0.18/0.35 dependent: set(unit_deletion).
% 0.18/0.35 dependent: set(factor).
% 0.18/0.35
% 0.18/0.35 ------------> process usable:
% 0.18/0.35
% 0.18/0.35 ------------> process sos:
% 0.18/0.35 Following clause subsumed by 32 during input processing: 0 [] {-} empty(empty_set).
% 0.18/0.35 41 back subsumes 29.
% 0.18/0.35 41 back subsumes 28.
% 0.18/0.35 Following clause subsumed by 43 during input processing: 0 [copy,43,flip.1] {-} A=A.
% 0.18/0.35 43 back subsumes 30.
% 0.18/0.35
% 0.18/0.35 ======= end of input processing =======
% 0.18/0.38
% 0.18/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 -------------- Softie stats --------------
% 0.18/0.38
% 0.18/0.38 UPDATE_STOP: 300
% 0.18/0.38 SFINDER_TIME_LIMIT: 2
% 0.18/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.38 number of clauses in intial UL: 27
% 0.18/0.38 number of clauses initially in problem: 40
% 0.18/0.38 percentage of clauses intially in UL: 67
% 0.18/0.38 percentage of distinct symbols occuring in initial UL: 80
% 0.18/0.38 percent of all initial clauses that are short: 100
% 0.18/0.38 absolute distinct symbol count: 20
% 0.18/0.38 distinct predicate count: 6
% 0.18/0.38 distinct function count: 7
% 0.18/0.38 distinct constant count: 7
% 0.18/0.38
% 0.18/0.38 ---------- no more Softie stats ----------
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38
% 0.18/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.18/0.38
% 0.18/0.38 Stopped by limit on number of solutions
% 0.18/0.38
% 0.18/0.38 =========== start of search ===========
% 0.70/0.92
% 0.70/0.92 -------- PROOF --------
% 0.70/0.92 % SZS status Theorem
% 0.70/0.92 % SZS output start Refutation
% 0.70/0.92
% 0.70/0.92 Model 3 (0.00 seconds, 0 Inserts)
% 0.70/0.92
% 0.70/0.92 Stopped by limit on number of solutions
% 0.70/0.92
% 0.70/0.92 Model 4 (0.00 seconds, 0 Inserts)
% 0.70/0.92
% 0.70/0.92 Stopped by limit on number of solutions
% 0.70/0.92
% 0.70/0.92 Model 5 (0.00 seconds, 0 Inserts)
% 0.70/0.92
% 0.70/0.92 Stopped by limit on number of solutions
% 0.70/0.92
% 0.70/0.92 Stopped by limit on insertions
% 0.70/0.92
% 0.70/0.92 Model 6 [ 1 0 200 ] (0.00 seconds, 141899 Inserts)
% 0.70/0.92
% 0.70/0.92 Stopped by limit on insertions
% 0.70/0.92
% 0.70/0.92 Model 7 [ 6 1 460 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92
% 0.70/0.92 Stopped by limit on insertions
% 0.70/0.92
% 0.70/0.92 Model 8 [ 3 4 26138 ] (0.00 seconds, 250000 Inserts)
% 0.70/0.92
% 0.70/0.92 Model 9 [ 2 0 1221 ] (0.00 seconds, 63705 Inserts)
% 0.70/0.92
% 0.70/0.92 ----> UNIT CONFLICT at 0.55 sec ----> 74 [binary,73.1,26.1] {-} $F.
% 0.70/0.92
% 0.70/0.92 Length of proof is 3. Level of proof is 2.
% 0.70/0.92
% 0.70/0.92 ---------------- PROOF ----------------
% 0.70/0.92 % SZS status Theorem
% 0.70/0.92 % SZS output start Refutation
% 0.70/0.92
% 0.70/0.92 3 [] {+} -relation(A)|relation(relation_dom_restriction(A,B)).
% 0.70/0.92 16 [] {+} -relation(A)| -relation(B)| -subset(A,B)|subset(relation_rng(A),relation_rng(B)).
% 0.70/0.92 24 [] {+} -relation(A)|subset(relation_dom_restriction(A,B),A).
% 0.70/0.92 26 [] {+} -subset(relation_rng(relation_dom_restriction($c5,$c6)),relation_rng($c5)).
% 0.70/0.92 42 [] {-} relation($c5).
% 0.70/0.92 60 [hyper,42,24] {-} subset(relation_dom_restriction($c5,A),$c5).
% 0.70/0.92 61 [hyper,42,3] {-} relation(relation_dom_restriction($c5,A)).
% 0.70/0.92 73 [hyper,60,16,61,42] {-} subset(relation_rng(relation_dom_restriction($c5,A)),relation_rng($c5)).
% 0.70/0.92 74 [binary,73.1,26.1] {-} $F.
% 0.70/0.92
% 0.70/0.92 % SZS output end Refutation
% 0.70/0.92 ------------ end of proof -------------
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 Search stopped by max_proofs option.
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 Search stopped by max_proofs option.
% 0.70/0.92
% 0.70/0.92 ============ end of search ============
% 0.70/0.92
% 0.70/0.92 ----------- soft-scott stats ----------
% 0.70/0.92
% 0.70/0.92 true clauses given 3 (25.0%)
% 0.70/0.92 false clauses given 9
% 0.70/0.92
% 0.70/0.92 FALSE TRUE
% 0.70/0.92 3 0 7
% 0.70/0.92 4 0 5
% 0.70/0.92 5 1 6
% 0.70/0.92 6 0 4
% 0.70/0.92 7 1 0
% 0.70/0.92 8 0 2
% 0.70/0.92 9 0 1
% 0.70/0.92 10 0 2
% 0.70/0.92 tot: 2 27 (93.1% true)
% 0.70/0.92
% 0.70/0.92
% 0.70/0.92 Model 9 [ 2 0 1221 ] (0.00 seconds, 63705 Inserts)
% 0.70/0.92
% 0.70/0.92 That finishes the proof of the theorem.
% 0.70/0.92
% 0.70/0.92 Process 22320 finished Sun Jun 19 20:04:49 2022
%------------------------------------------------------------------------------