TSTP Solution File: TOP005-2 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.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 : Thu Jul 21 21:34:49 EDT 2022
% Result : Unsatisfiable 0.20s 0.45s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : TOP005-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun May 29 12:27:54 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.36 ----- Otter 3.2, August 2001 -----
% 0.14/0.36 The process was started by sandbox2 on n020.cluster.edu,
% 0.14/0.36 Sun May 29 12:27:54 2022
% 0.14/0.36 The command was "./sos". The process ID is 2538.
% 0.14/0.36
% 0.14/0.36 set(prolog_style_variables).
% 0.14/0.36 set(auto).
% 0.14/0.36 dependent: set(auto1).
% 0.14/0.36 dependent: set(process_input).
% 0.14/0.36 dependent: clear(print_kept).
% 0.14/0.36 dependent: clear(print_new_demod).
% 0.14/0.36 dependent: clear(print_back_demod).
% 0.14/0.36 dependent: clear(print_back_sub).
% 0.14/0.36 dependent: set(control_memory).
% 0.14/0.36 dependent: assign(max_mem, 12000).
% 0.14/0.36 dependent: assign(pick_given_ratio, 4).
% 0.14/0.36 dependent: assign(stats_level, 1).
% 0.14/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.36 dependent: assign(sos_limit, 5000).
% 0.14/0.36 dependent: assign(max_weight, 60).
% 0.14/0.36 clear(print_given).
% 0.14/0.36
% 0.14/0.36 list(usable).
% 0.14/0.36
% 0.14/0.36 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 0.14/0.36
% 0.14/0.36 This is a non-Horn set without equality. The strategy
% 0.14/0.36 will be ordered hyper_res, ur_res, unit deletion, and
% 0.14/0.36 factoring, with satellites in sos and nuclei in usable.
% 0.14/0.36
% 0.14/0.36 dependent: set(hyper_res).
% 0.14/0.36 dependent: set(factor).
% 0.14/0.36 dependent: set(unit_deletion).
% 0.14/0.36
% 0.14/0.36 ------------> process usable:
% 0.14/0.36
% 0.14/0.36 ------------> process sos:
% 0.14/0.36
% 0.14/0.36 ======= end of input processing =======
% 0.20/0.38
% 0.20/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.38
% 0.20/0.38 Stopped by limit on number of solutions
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 -------------- Softie stats --------------
% 0.20/0.38
% 0.20/0.38 UPDATE_STOP: 300
% 0.20/0.38 SFINDER_TIME_LIMIT: 2
% 0.20/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.38 number of clauses in intial UL: 10
% 0.20/0.38 number of clauses initially in problem: 12
% 0.20/0.38 percentage of clauses intially in UL: 83
% 0.20/0.38 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.38 percent of all initial clauses that are short: 100
% 0.20/0.38 absolute distinct symbol count: 11
% 0.20/0.38 distinct predicate count: 4
% 0.20/0.38 distinct function count: 5
% 0.20/0.38 distinct constant count: 2
% 0.20/0.38
% 0.20/0.38 ---------- no more Softie stats ----------
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38
% 0.20/0.38 =========== start of search ===========
% 0.20/0.45
% 0.20/0.45 -------- PROOF --------
% 0.20/0.45 % SZS status Unsatisfiable
% 0.20/0.45 % SZS output start Refutation
% 0.20/0.45
% 0.20/0.45 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.45
% 0.20/0.45 Stopped by limit on number of solutions
% 0.20/0.45
% 0.20/0.45 -----> EMPTY CLAUSE at 0.07 sec ----> 265 [hyper,260,6,51,49,unit_del,10,10,10] {-} $F.
% 0.20/0.45
% 0.20/0.45 Length of proof is 9. Level of proof is 5.
% 0.20/0.45
% 0.20/0.45 ---------------- PROOF ----------------
% 0.20/0.45 % SZS status Unsatisfiable
% 0.20/0.45 % SZS output start Refutation
% 0.20/0.45
% 0.20/0.45 1 [] {+} -element_of_set(A,union_of_members(B))|element_of_set(A,f1(B,A)).
% 0.20/0.45 2 [] {+} -element_of_set(A,union_of_members(B))|element_of_collection(f1(B,A),B).
% 0.20/0.45 3 [] {+} -element_of_collection(A,top_of_basis(B))| -element_of_set(C,A)|element_of_set(C,f10(B,A,C)).
% 0.20/0.45 4 [] {+} -element_of_collection(A,top_of_basis(B))| -element_of_set(C,A)|element_of_collection(f10(B,A,C),B).
% 0.20/0.45 5 [] {+} -element_of_collection(A,top_of_basis(B))| -element_of_set(C,A)|subset_sets(f10(B,A,C),A).
% 0.20/0.45 6 [] {+} element_of_collection(A,top_of_basis(B))| -element_of_set(f11(B,A),C)| -element_of_collection(C,B)| -subset_sets(C,A).
% 0.20/0.45 8 [] {+} -subset_sets(A,B)| -element_of_collection(B,C)|subset_sets(A,union_of_members(C)).
% 0.20/0.45 9 [] {+} -subset_collections(A,B)| -element_of_collection(C,A)|element_of_collection(C,B).
% 0.20/0.45 10 [] {+} -element_of_collection(union_of_members(g),top_of_basis(f)).
% 0.20/0.45 11 [] {+} element_of_collection(A,top_of_basis(B))|element_of_set(f11(B,A),A).
% 0.20/0.45 12 [] {+} subset_collections(g,top_of_basis(f)).
% 0.20/0.45 14 [hyper,11,2] {-} element_of_collection(union_of_members(A),top_of_basis(B))|element_of_collection(f1(A,f11(B,union_of_members(A))),A).
% 0.20/0.45 15 [hyper,11,1] {-} element_of_collection(union_of_members(A),top_of_basis(B))|element_of_set(f11(B,union_of_members(A)),f1(A,f11(B,union_of_members(A)))).
% 0.20/0.45 16 [hyper,14,10] {-} element_of_collection(f1(g,f11(f,union_of_members(g))),g).
% 0.20/0.45 21 [hyper,14,9,12] {-} element_of_collection(union_of_members(g),top_of_basis(A))|element_of_collection(f1(g,f11(A,union_of_members(g))),top_of_basis(f)).
% 0.20/0.45 27 [hyper,16,9,12] {-} element_of_collection(f1(g,f11(f,union_of_members(g))),top_of_basis(f)).
% 0.20/0.45 35 [hyper,27,5,15,unit_del,10] {+} subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),f1(g,f11(f,union_of_members(g)))).
% 0.20/0.45 49 [hyper,21,4,15,factor_simp] {-} element_of_collection(union_of_members(g),top_of_basis(A))|element_of_collection(f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g))),f).
% 0.20/0.45 51 [hyper,21,3,15,factor_simp] {-} element_of_collection(union_of_members(g),top_of_basis(A))|element_of_set(f11(A,union_of_members(g)),f10(f,f1(g,f11(A,union_of_members(g))),f11(A,union_of_members(g)))).
% 0.20/0.45 260 [hyper,35,8,16] {-} subset_sets(f10(f,f1(g,f11(f,union_of_members(g))),f11(f,union_of_members(g))),union_of_members(g)).
% 0.20/0.45 265 [hyper,260,6,51,49,unit_del,10,10,10] {-} $F.
% 0.20/0.45
% 0.20/0.45 % SZS output end Refutation
% 0.20/0.45 ------------ end of proof -------------
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Search stopped by max_proofs option.
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Search stopped by max_proofs option.
% 0.20/0.45
% 0.20/0.45 ============ end of search ============
% 0.20/0.45
% 0.20/0.45 ----------- soft-scott stats ----------
% 0.20/0.45
% 0.20/0.45 true clauses given 6 (15.8%)
% 0.20/0.45 false clauses given 32
% 0.20/0.45
% 0.20/0.45 FALSE TRUE
% 0.20/0.45 16 1 0
% 0.20/0.45 19 0 2
% 0.20/0.45 23 1 0
% 0.20/0.45 24 6 2
% 0.20/0.45 25 7 2
% 0.20/0.45 26 5 1
% 0.20/0.45 27 8 0
% 0.20/0.45 28 6 0
% 0.20/0.45 29 9 0
% 0.20/0.45 30 8 4
% 0.20/0.45 31 16 3
% 0.20/0.45 32 11 1
% 0.20/0.45 33 8 0
% 0.20/0.45 34 8 1
% 0.20/0.45 35 4 6
% 0.20/0.45 36 9 2
% 0.20/0.45 37 5 3
% 0.20/0.45 38 1 1
% 0.20/0.45 39 4 2
% 0.20/0.45 40 7 1
% 0.20/0.45 41 9 0
% 0.20/0.45 42 1 1
% 0.20/0.45 43 2 2
% 0.20/0.45 44 1 2
% 0.20/0.45 45 1 2
% 0.20/0.45 46 1 0
% 0.20/0.45 47 1 0
% 0.20/0.45 48 3 3
% 0.20/0.45 49 0 2
% 0.20/0.45 50 1 0
% 0.20/0.45 51 1 0
% 0.20/0.45 52 1 2
% 0.20/0.45 53 0 1
% 0.20/0.45 55 0 1
% 0.20/0.45 56 0 1
% 0.20/0.45 57 1 0
% 0.20/0.45 58 1 1
% 0.20/0.45 60 2 2
% 0.20/0.45 tot: 150 51 (25.4% true)
% 0.20/0.45
% 0.20/0.45
% 0.20/0.45 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.45
% 0.20/0.45 That finishes the proof of the theorem.
% 0.20/0.45
% 0.20/0.45 Process 2538 finished Sun May 29 12:27:54 2022
%------------------------------------------------------------------------------