%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n011.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:12 EDT 2022
% Result : Theorem 2.22s 2.43s
% Output : Refutation 2.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET065+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.12 % Command : sos-script %s
% 0.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jul 10 23:57:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.36 ----- Otter 3.2, August 2001 -----
% 0.12/0.36 The process was started by sandbox on n011.cluster.edu,
% 0.12/0.36 Sun Jul 10 23:57:27 2022
% 0.12/0.36 The command was "./sos". The process ID is 22634.
% 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 formula_list(usable).
% 0.12/0.36
% 0.12/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 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 120 during input processing: 0 [copy,120,flip.1] {-} A=A.
% 0.12/0.36 120 back subsumes 69.
% 0.12/0.36
% 0.12/0.36 ======= end of input processing =======
% 0.18/0.56
% 0.18/0.56 Model 1 (0.00 seconds, 0 Inserts)
% 0.18/0.56
% 0.18/0.56 Stopped by limit on number of solutions
% 0.18/0.56
% 0.18/0.56
% 0.18/0.56 -------------- Softie stats --------------
% 0.18/0.56
% 0.18/0.56 UPDATE_STOP: 300
% 0.18/0.56 SFINDER_TIME_LIMIT: 2
% 0.18/0.56 SHORT_CLAUSE_CUTOFF: 4
% 0.18/0.56 number of clauses in intial UL: 69
% 0.18/0.56 number of clauses initially in problem: 111
% 0.18/0.56 percentage of clauses intially in UL: 62
% 0.18/0.56 percentage of distinct symbols occuring in initial UL: 82
% 0.18/0.56 percent of all initial clauses that are short: 100
% 0.18/0.56 absolute distinct symbol count: 39
% 0.18/0.56 distinct predicate count: 6
% 0.18/0.56 distinct function count: 26
% 0.18/0.56 distinct constant count: 7
% 0.18/0.56
% 0.18/0.56 ---------- no more Softie stats ----------
% 0.18/0.56
% 0.18/0.56
% 0.18/0.56
% 0.18/0.56 Stopped by limit on insertions
% 0.18/0.56
% 0.18/0.56 =========== start of search ===========
% 2.22/2.43
% 2.22/2.43 -------- PROOF --------
% 2.22/2.43 % SZS status Theorem
% 2.22/2.43 % SZS output start Refutation
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 2 [ 2 1 1518 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 3 [ 2 1 5677 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 4 [ 3 1 3155 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 Stopped by limit on insertions
% 2.22/2.43
% 2.22/2.43 Model 5 [ 4 1 13036 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 ----> UNIT CONFLICT at 2.05 sec ----> 162 [binary,161.1,68.1] {-} $F.
% 2.22/2.43
% 2.22/2.43 Length of proof is 2. Level of proof is 2.
% 2.22/2.43
% 2.22/2.43 ---------------- PROOF ----------------
% 2.22/2.43 % SZS status Theorem
% 2.22/2.43 % SZS output start Refutation
% 2.22/2.43
% 2.22/2.43 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 2.22/2.43 43 [] {+} -inductive(A)|member(null_class,A).
% 2.22/2.43 68 [] {+} -member(null_class,universal_class).
% 2.22/2.43 83 [] {+} subclass(A,universal_class).
% 2.22/2.43 109 [] {+} inductive($c1).
% 2.22/2.43 144 [hyper,109,43] {+} member(null_class,$c1).
% 2.22/2.43 161 [hyper,144,1,83] {-} member(null_class,universal_class).
% 2.22/2.43 162 [binary,161.1,68.1] {-} $F.
% 2.22/2.43
% 2.22/2.43 % SZS output end Refutation
% 2.22/2.43 ------------ end of proof -------------
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Search stopped by max_proofs option.
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Search stopped by max_proofs option.
% 2.22/2.43
% 2.22/2.43 ============ end of search ============
% 2.22/2.43
% 2.22/2.43 ----------- soft-scott stats ----------
% 2.22/2.43
% 2.22/2.43 true clauses given 0 (0.0%)
% 2.22/2.43 false clauses given 5
% 2.22/2.43
% 2.22/2.43 FALSE TRUE
% 2.22/2.43 3 1 2
% 2.22/2.43 5 2 3
% 2.22/2.43 6 2 0
% 2.22/2.43 7 4 3
% 2.22/2.43 8 7 4
% 2.22/2.43 9 1 0
% 2.22/2.43 10 2 5
% 2.22/2.43 11 1 3
% 2.22/2.43 12 0 2
% 2.22/2.43 13 3 1
% 2.22/2.43 15 0 2
% 2.22/2.43 16 1 2
% 2.22/2.43 18 0 3
% 2.22/2.43 19 0 1
% 2.22/2.43 20 0 1
% 2.22/2.43 tot: 24 32 (57.1% true)
% 2.22/2.43
% 2.22/2.43
% 2.22/2.43 Model 5 [ 4 1 13036 ] (0.00 seconds, 250000 Inserts)
% 2.22/2.43
% 2.22/2.43 That finishes the proof of the theorem.
% 2.22/2.43
% 2.22/2.43 Process 22634 finished Sun Jul 10 23:57:29 2022
%------------------------------------------------------------------------------