TSTP Solution File: SET065-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET065-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n006.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:13 EDT 2022
% Result : Unsatisfiable 2.20s 2.39s
% Output : Refutation 2.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET065-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n006.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 21:58:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n006.cluster.edu,
% 0.19/0.36 Sun Jul 10 21:58:20 2022
% 0.19/0.36 The command was "./sos". The process ID is 26527.
% 0.19/0.36
% 0.19/0.36 set(prolog_style_variables).
% 0.19/0.36 set(auto).
% 0.19/0.36 dependent: set(auto1).
% 0.19/0.36 dependent: set(process_input).
% 0.19/0.36 dependent: clear(print_kept).
% 0.19/0.36 dependent: clear(print_new_demod).
% 0.19/0.36 dependent: clear(print_back_demod).
% 0.19/0.36 dependent: clear(print_back_sub).
% 0.19/0.36 dependent: set(control_memory).
% 0.19/0.36 dependent: assign(max_mem, 12000).
% 0.19/0.36 dependent: assign(pick_given_ratio, 4).
% 0.19/0.36 dependent: assign(stats_level, 1).
% 0.19/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.19/0.36 dependent: assign(sos_limit, 5000).
% 0.19/0.36 dependent: assign(max_weight, 60).
% 0.19/0.36 clear(print_given).
% 0.19/0.36
% 0.19/0.36 list(usable).
% 0.19/0.36
% 0.19/0.36 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.19/0.36
% 0.19/0.36 This ia a non-Horn set with equality. The strategy will be
% 0.19/0.36 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.19/0.36 unit deletion, with positive clauses in sos and nonpositive
% 0.19/0.36 clauses in usable.
% 0.19/0.36
% 0.19/0.36 dependent: set(knuth_bendix).
% 0.19/0.36 dependent: set(para_from).
% 0.19/0.36 dependent: set(para_into).
% 0.19/0.36 dependent: clear(para_from_right).
% 0.19/0.36 dependent: clear(para_into_right).
% 0.19/0.36 dependent: set(para_from_vars).
% 0.19/0.36 dependent: set(eq_units_both_ways).
% 0.19/0.36 dependent: set(dynamic_demod_all).
% 0.19/0.36 dependent: set(dynamic_demod).
% 0.19/0.36 dependent: set(order_eq).
% 0.19/0.36 dependent: set(back_demod).
% 0.19/0.36 dependent: set(lrpo).
% 0.19/0.36 dependent: set(hyper_res).
% 0.19/0.36 dependent: set(unit_deletion).
% 0.19/0.36 dependent: set(factor).
% 0.19/0.36
% 0.19/0.36 ------------> process usable:
% 0.19/0.36
% 0.19/0.36 ------------> process sos:
% 0.19/0.36 Following clause subsumed by 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.19/0.36 135 back subsumes 61.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.40/0.63
% 0.40/0.63 Model 1 (0.00 seconds, 0 Inserts)
% 0.40/0.63
% 0.40/0.63 Stopped by limit on number of solutions
% 0.40/0.63
% 0.40/0.63
% 0.40/0.63 -------------- Softie stats --------------
% 0.40/0.63
% 0.40/0.63 UPDATE_STOP: 300
% 0.40/0.63 SFINDER_TIME_LIMIT: 2
% 0.40/0.63 SHORT_CLAUSE_CUTOFF: 4
% 0.40/0.63 number of clauses in intial UL: 49
% 0.40/0.63 number of clauses initially in problem: 119
% 0.40/0.63 percentage of clauses intially in UL: 41
% 0.40/0.63 percentage of distinct symbols occuring in initial UL: 62
% 0.40/0.63 percent of all initial clauses that are short: 100
% 0.40/0.63 absolute distinct symbol count: 48
% 0.40/0.63 distinct predicate count: 10
% 0.40/0.63 distinct function count: 30
% 0.40/0.63 distinct constant count: 8
% 0.40/0.63
% 0.40/0.63 ---------- no more Softie stats ----------
% 0.40/0.63
% 0.40/0.63
% 0.40/0.63
% 0.40/0.63 Stopped by limit on insertions
% 0.40/0.63
% 0.40/0.63 =========== start of search ===========
% 2.20/2.39
% 2.20/2.39 -------- PROOF --------
% 2.20/2.39 % SZS status Unsatisfiable
% 2.20/2.39 % SZS output start Refutation
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Model 2 [ 13 2 12767 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Model 3 [ 12 2 12142 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Model 4 [ 15 1 4301 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 Stopped by limit on insertions
% 2.20/2.39
% 2.20/2.39 ----> UNIT CONFLICT at 2.02 sec ----> 339 [binary,338.1,60.1] {-} $F.
% 2.20/2.39
% 2.20/2.39 Length of proof is 2. Level of proof is 2.
% 2.20/2.39
% 2.20/2.39 ---------------- PROOF ----------------
% 2.20/2.39 % SZS status Unsatisfiable
% 2.20/2.39 % SZS output start Refutation
% 2.20/2.39
% 2.20/2.39 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 2.20/2.39 28 [] {+} -inductive(A)|member(null_class,A).
% 2.20/2.39 60 [] {+} -member(null_class,universal_class).
% 2.20/2.39 70 [] {-} subclass(A,universal_class).
% 2.20/2.39 109 [] {+} inductive(omega).
% 2.20/2.39 206 [hyper,109,28] {+} member(null_class,omega).
% 2.20/2.39 338 [hyper,206,1,70] {-} member(null_class,universal_class).
% 2.20/2.39 339 [binary,338.1,60.1] {-} $F.
% 2.20/2.39
% 2.20/2.39 % SZS output end Refutation
% 2.20/2.39 ------------ end of proof -------------
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Search stopped by max_proofs option.
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Search stopped by max_proofs option.
% 2.20/2.39
% 2.20/2.39 ============ end of search ============
% 2.20/2.39
% 2.20/2.39 ----------- soft-scott stats ----------
% 2.20/2.39
% 2.20/2.39 true clauses given 3 (23.1%)
% 2.20/2.39 false clauses given 10
% 2.20/2.39
% 2.20/2.39 FALSE TRUE
% 2.20/2.39 3 0 1
% 2.20/2.39 5 4 3
% 2.20/2.39 6 2 0
% 2.20/2.39 7 10 3
% 2.20/2.39 8 13 8
% 2.20/2.39 9 18 0
% 2.20/2.39 10 4 21
% 2.20/2.39 11 18 7
% 2.20/2.39 12 4 4
% 2.20/2.39 13 11 21
% 2.20/2.39 14 3 2
% 2.20/2.39 15 4 5
% 2.20/2.39 16 3 1
% 2.20/2.39 17 1 7
% 2.20/2.39 18 0 5
% 2.20/2.39 19 0 1
% 2.20/2.39 20 0 1
% 2.20/2.39 21 4 0
% 2.20/2.39 22 1 0
% 2.20/2.39 23 3 4
% 2.20/2.39 24 0 1
% 2.20/2.39 25 2 0
% 2.20/2.39 27 1 0
% 2.20/2.39 28 0 2
% 2.20/2.39 tot: 106 97 (47.8% true)
% 2.20/2.39
% 2.20/2.39
% 2.20/2.39 Model 4 [ 15 -50 4301 ] (0.00 seconds, 250000 Inserts)
% 2.20/2.39
% 2.20/2.39 That finishes the proof of the theorem.
% 2.20/2.39
% 2.20/2.39 Process 26527 finished Sun Jul 10 21:58:22 2022
%------------------------------------------------------------------------------