TSTP Solution File: SET558-6 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : SET558-6 : TPTP v8.1.0. Bugfixed v2.1.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:18:50 EDT 2022
% Result : Unsatisfiable 2.43s 2.64s
% Output : Refutation 2.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET558-6 : TPTP v8.1.0. Bugfixed v2.1.0.
% 0.12/0.12 % Command : sos-script %s
% 0.13/0.33 % Computer : n011.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun Jul 10 19:29:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.19/0.36 ----- Otter 3.2, August 2001 -----
% 0.19/0.36 The process was started by sandbox on n011.cluster.edu,
% 0.19/0.36 Sun Jul 10 19:29:56 2022
% 0.19/0.36 The command was "./sos". The process ID is 2552.
% 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 165 during input processing: 0 [copy,165,flip.1] {-} A=A.
% 0.19/0.36 165 back subsumes 74.
% 0.19/0.36
% 0.19/0.36 ======= end of input processing =======
% 0.42/0.60
% 0.42/0.60 Model 1 (0.00 seconds, 0 Inserts)
% 0.42/0.60
% 0.42/0.60 Stopped by limit on number of solutions
% 0.42/0.60
% 0.42/0.60
% 0.42/0.60 -------------- Softie stats --------------
% 0.42/0.60
% 0.42/0.60 UPDATE_STOP: 300
% 0.42/0.60 SFINDER_TIME_LIMIT: 2
% 0.42/0.60 SHORT_CLAUSE_CUTOFF: 4
% 0.42/0.60 number of clauses in intial UL: 60
% 0.42/0.60 number of clauses initially in problem: 146
% 0.42/0.60 percentage of clauses intially in UL: 41
% 0.42/0.60 percentage of distinct symbols occuring in initial UL: 63
% 0.42/0.60 percent of all initial clauses that are short: 100
% 0.42/0.60 absolute distinct symbol count: 60
% 0.42/0.60 distinct predicate count: 11
% 0.42/0.60 distinct function count: 34
% 0.42/0.60 distinct constant count: 15
% 0.42/0.60
% 0.42/0.60 ---------- no more Softie stats ----------
% 0.42/0.60
% 0.42/0.60
% 0.42/0.60
% 0.42/0.60 Stopped by limit on insertions
% 0.42/0.60
% 0.42/0.60 =========== start of search ===========
% 2.43/2.64
% 2.43/2.64 -------- PROOF --------
% 2.43/2.64 % SZS status Unsatisfiable
% 2.43/2.64 % SZS output start Refutation
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Model 2 [ 2 2 29346 ] (0.00 seconds, 250000 Inserts)
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Model 3 [ 2 3 31944 ] (0.00 seconds, 250000 Inserts)
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Model 4 [ 1 2 23886 ] (0.00 seconds, 250000 Inserts)
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Stopped by limit on insertions
% 2.43/2.64
% 2.43/2.64 Model 5 [ 6 2 18684 ] (0.00 seconds, 250000 Inserts)
% 2.43/2.64
% 2.43/2.64 ----> UNIT CONFLICT at 2.26 sec ----> 252 [binary,250.1,73.1] {+} $F.
% 2.43/2.64
% 2.43/2.64 Length of proof is 3. Level of proof is 2.
% 2.43/2.64
% 2.43/2.64 ---------------- PROOF ----------------
% 2.43/2.64 % SZS status Unsatisfiable
% 2.43/2.64 % SZS output start Refutation
% 2.43/2.64
% 2.43/2.64 47 [] {+} -operation(A)|cross_product(domain_of(domain_of(A)),domain_of(domain_of(A)))=domain_of(A).
% 2.43/2.64 51 [] {+} -compatible(A,B,C)|domain_of(domain_of(B))=domain_of(A).
% 2.43/2.64 73 [] {+} cross_product(domain_of(xh),domain_of(xh))!=domain_of(xf1).
% 2.43/2.64 163 [] {+} operation(xf1).
% 2.43/2.64 164 [] {+} compatible(xh,xf1,xf2).
% 2.43/2.64 206 [hyper,163,47] {-} cross_product(domain_of(domain_of(xf1)),domain_of(domain_of(xf1)))=domain_of(xf1).
% 2.43/2.64 248,247 [hyper,164,51] {-} domain_of(domain_of(xf1))=domain_of(xh).
% 2.43/2.64 250 [back_demod,206,demod,248,248] {-} cross_product(domain_of(xh),domain_of(xh))=domain_of(xf1).
% 2.43/2.64 252 [binary,250.1,73.1] {+} $F.
% 2.43/2.64
% 2.43/2.64 % SZS output end Refutation
% 2.43/2.64 ------------ end of proof -------------
% 2.43/2.64
% 2.43/2.64
% 2.43/2.64 Search stopped by max_proofs option.
% 2.43/2.64
% 2.43/2.64
% 2.43/2.64 Search stopped by max_proofs option.
% 2.43/2.64
% 2.43/2.64 ============ end of search ============
% 2.43/2.64
% 2.43/2.64 ----------- soft-scott stats ----------
% 2.43/2.64
% 2.43/2.64 true clauses given 1 (12.5%)
% 2.43/2.64 false clauses given 7
% 2.43/2.64
% 2.43/2.64 FALSE TRUE
% 2.43/2.64 3 0 3
% 2.43/2.64 5 7 5
% 2.43/2.64 6 4 1
% 2.43/2.64 7 4 7
% 2.43/2.64 8 12 8
% 2.43/2.64 9 4 1
% 2.43/2.64 10 5 13
% 2.43/2.64 11 5 6
% 2.43/2.64 12 1 4
% 2.43/2.64 13 6 1
% 2.43/2.64 14 3 1
% 2.43/2.64 15 1 1
% 2.43/2.64 16 2 1
% 2.43/2.64 17 1 0
% 2.43/2.64 18 0 2
% 2.43/2.64 19 0 1
% 2.43/2.64 20 0 1
% 2.43/2.64 22 1 0
% 2.43/2.64 23 0 1
% 2.43/2.64 24 0 1
% 2.43/2.64 42 1 0
% 2.43/2.64 tot: 57 58 (50.4% true)
% 2.43/2.64
% 2.43/2.64
% 2.43/2.64 Model 5 [ 6 2 18684 ] (0.00 seconds, 250000 Inserts)
% 2.43/2.64
% 2.43/2.64 That finishes the proof of the theorem.
% 2.43/2.64
% 2.43/2.64 Process 2552 finished Sun Jul 10 19:29:59 2022
%------------------------------------------------------------------------------