TSTP Solution File: SET080-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET080-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n009.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:27 EDT 2022
% Result : Unsatisfiable 1.93s 2.17s
% Output : Refutation 1.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET080-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 11:24:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.38 ----- Otter 3.2, August 2001 -----
% 0.13/0.38 The process was started by sandbox on n009.cluster.edu,
% 0.13/0.38 Sun Jul 10 11:24:37 2022
% 0.13/0.38 The command was "./sos". The process ID is 1123.
% 0.13/0.38
% 0.13/0.38 set(prolog_style_variables).
% 0.13/0.38 set(auto).
% 0.13/0.38 dependent: set(auto1).
% 0.13/0.38 dependent: set(process_input).
% 0.13/0.38 dependent: clear(print_kept).
% 0.13/0.38 dependent: clear(print_new_demod).
% 0.13/0.38 dependent: clear(print_back_demod).
% 0.13/0.38 dependent: clear(print_back_sub).
% 0.13/0.38 dependent: set(control_memory).
% 0.13/0.38 dependent: assign(max_mem, 12000).
% 0.13/0.38 dependent: assign(pick_given_ratio, 4).
% 0.13/0.38 dependent: assign(stats_level, 1).
% 0.13/0.38 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.38 dependent: assign(sos_limit, 5000).
% 0.13/0.38 dependent: assign(max_weight, 60).
% 0.13/0.38 clear(print_given).
% 0.13/0.38
% 0.13/0.38 list(usable).
% 0.13/0.38
% 0.13/0.38 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 0.13/0.38
% 0.13/0.38 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.38 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.38 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.38 clauses in usable.
% 0.13/0.38
% 0.13/0.38 dependent: set(knuth_bendix).
% 0.13/0.38 dependent: set(para_from).
% 0.13/0.38 dependent: set(para_into).
% 0.13/0.38 dependent: clear(para_from_right).
% 0.13/0.38 dependent: clear(para_into_right).
% 0.13/0.38 dependent: set(para_from_vars).
% 0.13/0.38 dependent: set(eq_units_both_ways).
% 0.13/0.38 dependent: set(dynamic_demod_all).
% 0.13/0.38 dependent: set(dynamic_demod).
% 0.13/0.38 dependent: set(order_eq).
% 0.13/0.38 dependent: set(back_demod).
% 0.13/0.38 dependent: set(lrpo).
% 0.13/0.38 dependent: set(hyper_res).
% 0.13/0.38 dependent: set(unit_deletion).
% 0.13/0.38 dependent: set(factor).
% 0.13/0.38
% 0.13/0.38 ------------> process usable:
% 0.13/0.38
% 0.13/0.38 ------------> process sos:
% 0.13/0.38 Following clause subsumed by 135 during input processing: 0 [copy,135,flip.1] {-} A=A.
% 0.13/0.38 135 back subsumes 61.
% 0.13/0.38
% 0.13/0.38 ======= end of input processing =======
% 0.58/0.79
% 0.58/0.79 Model 1 (0.00 seconds, 0 Inserts)
% 0.58/0.79
% 0.58/0.79 Stopped by limit on number of solutions
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 -------------- Softie stats --------------
% 0.58/0.79
% 0.58/0.79 UPDATE_STOP: 300
% 0.58/0.79 SFINDER_TIME_LIMIT: 2
% 0.58/0.79 SHORT_CLAUSE_CUTOFF: 4
% 0.58/0.79 number of clauses in intial UL: 48
% 0.58/0.79 number of clauses initially in problem: 119
% 0.58/0.79 percentage of clauses intially in UL: 40
% 0.58/0.79 percentage of distinct symbols occuring in initial UL: 62
% 0.58/0.79 percent of all initial clauses that are short: 100
% 0.58/0.79 absolute distinct symbol count: 48
% 0.58/0.79 distinct predicate count: 10
% 0.58/0.79 distinct function count: 30
% 0.58/0.79 distinct constant count: 8
% 0.58/0.79
% 0.58/0.79 ---------- no more Softie stats ----------
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79
% 0.58/0.79 Stopped by limit on insertions
% 0.58/0.79
% 0.58/0.79 =========== start of search ===========
% 1.93/2.17
% 1.93/2.17 -------- PROOF --------
% 1.93/2.17 % SZS status Unsatisfiable
% 1.93/2.17 % SZS output start Refutation
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Model 2 [ 1 1 3074 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Model 3 [ 14 0 2065 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Stopped by limit on insertions
% 1.93/2.17
% 1.93/2.17 Model 4 [ 9 2 31911 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.17
% 1.93/2.17 ----> UNIT CONFLICT at 1.77 sec ----> 273 [binary,272.1,136.1] {-} $F.
% 1.93/2.17
% 1.93/2.17 Length of proof is 5. Level of proof is 3.
% 1.93/2.17
% 1.93/2.17 ---------------- PROOF ----------------
% 1.93/2.17 % SZS status Unsatisfiable
% 1.93/2.17 % SZS output start Refutation
% 1.93/2.17
% 1.93/2.17 1 [] {+} -subclass(A,B)| -member(C,A)|member(C,B).
% 1.93/2.17 8 [] {+} -member(A,universal_class)|member(A,unordered_pair(B,A)).
% 1.93/2.17 28 [] {+} -inductive(A)|member(null_class,A).
% 1.93/2.17 60 [] {-} -member(null_class,singleton(null_class)).
% 1.93/2.17 70 [] {-} subclass(A,universal_class).
% 1.93/2.17 72 [] {-} unordered_pair(A,A)=singleton(A).
% 1.93/2.17 74,73 [copy,72,flip.1] {-} singleton(A)=unordered_pair(A,A).
% 1.93/2.17 109 [] {+} inductive(omega).
% 1.93/2.17 136 [back_demod,60,demod,74] {-} -member(null_class,unordered_pair(null_class,null_class)).
% 1.93/2.17 163 [hyper,109,28] {-} member(null_class,omega).
% 1.93/2.17 248 [hyper,163,1,70] {+} member(null_class,universal_class).
% 1.93/2.17 272 [hyper,248,8] {-} member(null_class,unordered_pair(A,null_class)).
% 1.93/2.17 273 [binary,272.1,136.1] {-} $F.
% 1.93/2.17
% 1.93/2.17 % SZS output end Refutation
% 1.93/2.17 ------------ end of proof -------------
% 1.93/2.17
% 1.93/2.17
% 1.93/2.17 Search stopped by max_proofs option.
% 1.93/2.17
% 1.93/2.17
% 1.93/2.17 Search stopped by max_proofs option.
% 1.93/2.17
% 1.93/2.17 ============ end of search ============
% 1.93/2.17
% 1.93/2.17 ----------- soft-scott stats ----------
% 1.93/2.17
% 1.93/2.17 true clauses given 0 (0.0%)
% 1.93/2.17 false clauses given 9
% 1.93/2.17
% 1.93/2.17 FALSE TRUE
% 1.93/2.17 3 0 2
% 1.93/2.17 5 6 3
% 1.93/2.17 6 3 0
% 1.93/2.17 7 9 3
% 1.93/2.17 8 14 10
% 1.93/2.17 9 10 2
% 1.93/2.17 10 6 12
% 1.93/2.17 11 2 16
% 1.93/2.17 12 2 2
% 1.93/2.17 13 5 14
% 1.93/2.17 14 4 2
% 1.93/2.17 15 0 5
% 1.93/2.17 16 2 1
% 1.93/2.17 17 1 1
% 1.93/2.17 18 0 2
% 1.93/2.17 19 0 1
% 1.93/2.17 20 0 1
% 1.93/2.17 22 1 0
% 1.93/2.17 23 1 0
% 1.93/2.17 24 0 1
% 1.93/2.17 tot: 66 78 (54.2% true)
% 1.93/2.17
% 1.93/2.17
% 1.93/2.17 Model 4 [ 9 2 31911 ] (0.00 seconds, 250000 Inserts)
% 1.93/2.17
% 1.93/2.17 That finishes the proof of the theorem.
% 1.93/2.17
% 1.93/2.17 Process 1123 finished Sun Jul 10 11:24:39 2022
%------------------------------------------------------------------------------