TSTP Solution File: CAT005-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT005-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n028.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 : Fri Jul 15 00:07:17 EDT 2022
% Result : Unsatisfiable 0.50s 0.74s
% Output : Refutation 0.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT005-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n028.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 May 29 20:48:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.35 ----- Otter 3.2, August 2001 -----
% 0.12/0.35 The process was started by sandbox2 on n028.cluster.edu,
% 0.12/0.35 Sun May 29 20:48:19 2022
% 0.12/0.35 The command was "./sos". The process ID is 6360.
% 0.12/0.35
% 0.12/0.35 set(prolog_style_variables).
% 0.12/0.35 set(auto).
% 0.12/0.35 dependent: set(auto1).
% 0.12/0.35 dependent: set(process_input).
% 0.12/0.35 dependent: clear(print_kept).
% 0.12/0.35 dependent: clear(print_new_demod).
% 0.12/0.35 dependent: clear(print_back_demod).
% 0.12/0.35 dependent: clear(print_back_sub).
% 0.12/0.35 dependent: set(control_memory).
% 0.12/0.35 dependent: assign(max_mem, 12000).
% 0.12/0.35 dependent: assign(pick_given_ratio, 4).
% 0.12/0.35 dependent: assign(stats_level, 1).
% 0.12/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.35 dependent: assign(sos_limit, 5000).
% 0.12/0.35 dependent: assign(max_weight, 60).
% 0.12/0.35 clear(print_given).
% 0.12/0.35
% 0.12/0.35 list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.35 clauses in usable.
% 0.12/0.35
% 0.12/0.35 dependent: set(knuth_bendix).
% 0.12/0.35 dependent: set(para_from).
% 0.12/0.35 dependent: set(para_into).
% 0.12/0.35 dependent: clear(para_from_right).
% 0.12/0.35 dependent: clear(para_into_right).
% 0.12/0.35 dependent: set(para_from_vars).
% 0.12/0.35 dependent: set(eq_units_both_ways).
% 0.12/0.35 dependent: set(dynamic_demod_all).
% 0.12/0.35 dependent: set(dynamic_demod).
% 0.12/0.35 dependent: set(order_eq).
% 0.12/0.35 dependent: set(back_demod).
% 0.12/0.35 dependent: set(lrpo).
% 0.12/0.35 dependent: set(hyper_res).
% 0.12/0.35 dependent: set(unit_deletion).
% 0.12/0.35 dependent: set(factor).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35 Following clause subsumed by 3 during input processing: 0 [] {-} -there_exists(A)| -there_exists(B)|A!=B|equivalent(A,B).
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] {-} A=A.
% 0.12/0.35 28 back subsumes 16.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.37
% 0.12/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.37
% 0.12/0.37 Stopped by limit on number of solutions
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 -------------- Softie stats --------------
% 0.12/0.37
% 0.12/0.37 UPDATE_STOP: 300
% 0.12/0.37 SFINDER_TIME_LIMIT: 2
% 0.12/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.37 number of clauses in intial UL: 14
% 0.12/0.37 number of clauses initially in problem: 24
% 0.12/0.37 percentage of clauses intially in UL: 58
% 0.12/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.12/0.37 percent of all initial clauses that are short: 100
% 0.12/0.37 absolute distinct symbol count: 9
% 0.12/0.37 distinct predicate count: 3
% 0.12/0.37 distinct function count: 4
% 0.12/0.37 distinct constant count: 2
% 0.12/0.37
% 0.12/0.37 ---------- no more Softie stats ----------
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37
% 0.12/0.37 =========== start of search ===========
% 0.50/0.74
% 0.50/0.74 -------- PROOF --------
% 0.50/0.74 % SZS status Unsatisfiable
% 0.50/0.74 % SZS output start Refutation
% 0.50/0.74
% 0.50/0.74 Model 2 (0.00 seconds, 0 Inserts)
% 0.50/0.74
% 0.50/0.74 Stopped by limit on number of solutions
% 0.50/0.74
% 0.50/0.74 Stopped by limit on insertions
% 0.50/0.74
% 0.50/0.74 Model 3 [ 1 0 128 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.74
% 0.50/0.74 Stopped by limit on insertions
% 0.50/0.74
% 0.50/0.74 Model 4 [ 1 4 128305 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.74
% 0.50/0.74 Stopped by limit on insertions
% 0.50/0.74
% 0.50/0.74 Model 5 [ 1 1 286 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.74
% 0.50/0.74 Stopped by limit on insertions
% 0.50/0.74
% 0.50/0.74 Model 6 [ 1 3 88888 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.74
% 0.50/0.74 -----> EMPTY CLAUSE at 0.36 sec ----> 76 [para_into,22.1.1,13.2.1,demod,23,unit_del,49,67] {-} $F.
% 0.50/0.74
% 0.50/0.74 Length of proof is 4. Level of proof is 3.
% 0.50/0.74
% 0.50/0.74 ---------------- PROOF ----------------
% 0.50/0.74 % SZS status Unsatisfiable
% 0.50/0.74 % SZS output start Refutation
% 0.50/0.74
% 0.50/0.74 5 [] {+} -there_exists(codomain(A))|there_exists(A).
% 0.50/0.74 6 [] {+} -there_exists(compose(A,B))|there_exists(domain(A)).
% 0.50/0.74 7 [] {+} -there_exists(compose(A,B))|domain(A)=codomain(B).
% 0.50/0.74 13 [] {+} -there_exists(compose(A,d))|compose(A,d)=A.
% 0.50/0.74 15 [] {+} domain(a)!=d.
% 0.50/0.74 23,22 [] {+} compose(codomain(A),A)=A.
% 0.50/0.74 27 [] {+} there_exists(compose(a,d)).
% 0.50/0.74 46,45 [hyper,27,7] {-} domain(a)=codomain(d).
% 0.50/0.74 47 [hyper,27,6,demod,46] {+} there_exists(codomain(d)).
% 0.50/0.74 49 [back_demod,15,demod,46] {-} codomain(d)!=d.
% 0.50/0.74 67 [hyper,47,5] {+} there_exists(d).
% 0.50/0.74 76 [para_into,22.1.1,13.2.1,demod,23,unit_del,49,67] {-} $F.
% 0.50/0.74
% 0.50/0.74 % SZS output end Refutation
% 0.50/0.74 ------------ end of proof -------------
% 0.50/0.74
% 0.50/0.74
% 0.50/0.74 Search stopped by max_proofs option.
% 0.50/0.74
% 0.50/0.74
% 0.50/0.74 Search stopped by max_proofs option.
% 0.50/0.74
% 0.50/0.74 ============ end of search ============
% 0.50/0.74
% 0.50/0.74 ----------- soft-scott stats ----------
% 0.50/0.74
% 0.50/0.74 true clauses given 0 (0.0%)
% 0.50/0.74 false clauses given 6
% 0.50/0.74
% 0.50/0.74 FALSE TRUE
% 0.50/0.74 2 0 1
% 0.50/0.74 3 0 2
% 0.50/0.74 4 1 0
% 0.50/0.74 5 2 3
% 0.50/0.74 6 0 5
% 0.50/0.74 7 1 0
% 0.50/0.74 8 0 2
% 0.50/0.74 9 0 1
% 0.50/0.74 10 0 2
% 0.50/0.74 11 0 2
% 0.50/0.74 12 0 3
% 0.50/0.74 13 1 5
% 0.50/0.74 14 0 1
% 0.50/0.74 15 0 2
% 0.50/0.74 18 0 3
% 0.50/0.74 25 0 1
% 0.50/0.74 tot: 5 33 (86.8% true)
% 0.50/0.74
% 0.50/0.74
% 0.50/0.74 Model 6 [ 1 3 88888 ] (0.00 seconds, 250000 Inserts)
% 0.50/0.74
% 0.50/0.74 That finishes the proof of the theorem.
% 0.50/0.74
% 0.50/0.74 Process 6360 finished Sun May 29 20:48:19 2022
%------------------------------------------------------------------------------