TSTP Solution File: CAT005-4 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.60s 0.79s
% Output : Refutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : sos-script %s
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sun May 29 17:55:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.36 ----- Otter 3.2, August 2001 -----
% 0.13/0.36 The process was started by sandbox2 on n024.cluster.edu,
% 0.13/0.36 Sun May 29 17:55:06 2022
% 0.13/0.36 The command was "./sos". The process ID is 30118.
% 0.13/0.36
% 0.13/0.36 set(prolog_style_variables).
% 0.13/0.36 set(auto).
% 0.13/0.36 dependent: set(auto1).
% 0.13/0.36 dependent: set(process_input).
% 0.13/0.36 dependent: clear(print_kept).
% 0.13/0.36 dependent: clear(print_new_demod).
% 0.13/0.36 dependent: clear(print_back_demod).
% 0.13/0.36 dependent: clear(print_back_sub).
% 0.13/0.36 dependent: set(control_memory).
% 0.13/0.36 dependent: assign(max_mem, 12000).
% 0.13/0.36 dependent: assign(pick_given_ratio, 4).
% 0.13/0.36 dependent: assign(stats_level, 1).
% 0.13/0.36 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.36 dependent: assign(sos_limit, 5000).
% 0.13/0.36 dependent: assign(max_weight, 60).
% 0.13/0.36 clear(print_given).
% 0.13/0.36
% 0.13/0.36 list(usable).
% 0.13/0.36
% 0.13/0.36 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.13/0.36
% 0.13/0.36 This is a Horn set with equality. The strategy will be
% 0.13/0.36 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.36 sos and nonpositive clauses in usable.
% 0.13/0.36
% 0.13/0.36 dependent: set(knuth_bendix).
% 0.13/0.36 dependent: set(para_from).
% 0.13/0.36 dependent: set(para_into).
% 0.13/0.36 dependent: clear(para_from_right).
% 0.13/0.36 dependent: clear(para_into_right).
% 0.13/0.36 dependent: set(para_from_vars).
% 0.13/0.36 dependent: set(eq_units_both_ways).
% 0.13/0.36 dependent: set(dynamic_demod_all).
% 0.13/0.36 dependent: set(dynamic_demod).
% 0.13/0.36 dependent: set(order_eq).
% 0.13/0.36 dependent: set(back_demod).
% 0.13/0.36 dependent: set(lrpo).
% 0.13/0.36 dependent: set(hyper_res).
% 0.13/0.36 dependent: clear(order_hyper).
% 0.13/0.36
% 0.13/0.36 ------------> process usable:
% 0.13/0.36
% 0.13/0.36 ------------> process sos:
% 0.13/0.36 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.13/0.36
% 0.13/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: 11
% 0.20/0.38 number of clauses initially in problem: 19
% 0.20/0.38 percentage of clauses intially in UL: 57
% 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: 8
% 0.20/0.38 distinct predicate count: 3
% 0.20/0.38 distinct function count: 3
% 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.60/0.79
% 0.60/0.79 -------- PROOF --------
% 0.60/0.79 % SZS status Unsatisfiable
% 0.60/0.79 % SZS output start Refutation
% 0.60/0.79
% 0.60/0.79 Model 2 (0.00 seconds, 0 Inserts)
% 0.60/0.79
% 0.60/0.79 Stopped by limit on number of solutions
% 0.60/0.79
% 0.60/0.79 Stopped by limit on insertions
% 0.60/0.79
% 0.60/0.79 Model 3 [ 1 0 477 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.79
% 0.60/0.79 Stopped by limit on insertions
% 0.60/0.79
% 0.60/0.79 Model 4 [ 1 1 207 ] (0.00 seconds, 250000 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 5 [ 1 0 133 ] (0.00 seconds, 11663 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 6 [ 1 1 11799 ] (0.00 seconds, 18327 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 7 [ 2 1 5547 ] (0.00 seconds, 43361 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 8 [ 2 0 7910 ] (0.00 seconds, 13562 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 9 [ 2 1 250 ] (0.00 seconds, 32096 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 10 [ 2 1 236 ] (0.00 seconds, 32222 Inserts)
% 0.60/0.79
% 0.60/0.79 Model 11 [ 3 0 175 ] (0.00 seconds, 246294 Inserts)
% 0.60/0.79
% 0.60/0.79 ----> UNIT CONFLICT at 0.41 sec ----> 102 [binary,100.1,37.1] {+} $F.
% 0.60/0.79
% 0.60/0.79 Length of proof is 6. Level of proof is 4.
% 0.60/0.79
% 0.60/0.79 ---------------- PROOF ----------------
% 0.60/0.79 % SZS status Unsatisfiable
% 0.60/0.79 % SZS output start Refutation
% 0.60/0.79
% 0.60/0.79 5 [] {+} -there_exists(codomain(A))|there_exists(A).
% 0.60/0.79 6 [] {+} -there_exists(compose(A,B))|there_exists(domain(A)).
% 0.60/0.79 7 [] {+} -there_exists(compose(A,B))|domain(A)=codomain(B).
% 0.60/0.79 9 [] {+} -there_exists(compose(A,d))|compose(A,d)=A.
% 0.60/0.79 11 [] {+} domain(a)!=d.
% 0.60/0.79 18,17 [] {+} compose(codomain(A),A)=A.
% 0.60/0.79 19 [] {+} there_exists(compose(a,d)).
% 0.60/0.79 34,33 [hyper,19,7] {-} domain(a)=codomain(d).
% 0.60/0.79 35 [hyper,19,6,demod,34] {+} there_exists(codomain(d)).
% 0.60/0.79 37 [back_demod,11,demod,34] {+} codomain(d)!=d.
% 0.60/0.79 55 [para_into,17.1.1,9.2.1,demod,18] {+} codomain(d)=d| -there_exists(d).
% 0.60/0.79 61 [hyper,35,5] {+} there_exists(d).
% 0.60/0.79 100 [hyper,55,61] {-} codomain(d)=d.
% 0.60/0.79 102 [binary,100.1,37.1] {+} $F.
% 0.60/0.79
% 0.60/0.79 % SZS output end Refutation
% 0.60/0.79 ------------ end of proof -------------
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Search stopped by max_proofs option.
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Search stopped by max_proofs option.
% 0.60/0.79
% 0.60/0.79 ============ end of search ============
% 0.60/0.79
% 0.60/0.79 ----------- soft-scott stats ----------
% 0.60/0.79
% 0.60/0.79 true clauses given 3 (21.4%)
% 0.60/0.79 false clauses given 11
% 0.60/0.79
% 0.60/0.79 FALSE TRUE
% 0.60/0.79 3 0 1
% 0.60/0.79 4 0 1
% 0.60/0.79 5 1 4
% 0.60/0.79 6 0 4
% 0.60/0.79 7 2 3
% 0.60/0.79 8 0 6
% 0.60/0.79 9 1 4
% 0.60/0.79 10 1 8
% 0.60/0.79 11 0 2
% 0.60/0.79 12 0 4
% 0.60/0.79 13 0 2
% 0.60/0.79 14 0 2
% 0.60/0.79 15 0 2
% 0.60/0.79 16 0 6
% 0.60/0.79 18 0 4
% 0.60/0.79 19 0 1
% 0.60/0.79 20 0 1
% 0.60/0.79 22 0 1
% 0.60/0.79 tot: 5 56 (91.8% true)
% 0.60/0.79
% 0.60/0.79
% 0.60/0.79 Model 11 [ 3 0 175 ] (0.00 seconds, 246294 Inserts)
% 0.60/0.79
% 0.60/0.79 That finishes the proof of the theorem.
% 0.60/0.79
% 0.60/0.79 Process 30118 finished Sun May 29 17:55:07 2022
%------------------------------------------------------------------------------