TSTP Solution File: CAT013-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n021.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:19 EDT 2022
% Result : Unsatisfiable 0.37s 0.61s
% Output : Refutation 0.37s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : CAT013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : sos-script %s
% 0.13/0.35 % Computer : n021.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 May 29 21:54:58 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.13/0.37 ----- Otter 3.2, August 2001 -----
% 0.13/0.37 The process was started by sandbox on n021.cluster.edu,
% 0.13/0.37 Sun May 29 21:54:58 2022
% 0.13/0.37 The command was "./sos". The process ID is 1307.
% 0.13/0.37
% 0.13/0.37 set(prolog_style_variables).
% 0.13/0.37 set(auto).
% 0.13/0.37 dependent: set(auto1).
% 0.13/0.37 dependent: set(process_input).
% 0.13/0.37 dependent: clear(print_kept).
% 0.13/0.37 dependent: clear(print_new_demod).
% 0.13/0.37 dependent: clear(print_back_demod).
% 0.13/0.37 dependent: clear(print_back_sub).
% 0.13/0.37 dependent: set(control_memory).
% 0.13/0.37 dependent: assign(max_mem, 12000).
% 0.13/0.37 dependent: assign(pick_given_ratio, 4).
% 0.13/0.37 dependent: assign(stats_level, 1).
% 0.13/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.37 dependent: assign(sos_limit, 5000).
% 0.13/0.37 dependent: assign(max_weight, 60).
% 0.13/0.37 clear(print_given).
% 0.13/0.37
% 0.13/0.37 list(usable).
% 0.13/0.37
% 0.13/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.13/0.37
% 0.13/0.37 This is a Horn set with equality. The strategy will be
% 0.13/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.13/0.37 sos and nonpositive clauses in usable.
% 0.13/0.37
% 0.13/0.37 dependent: set(knuth_bendix).
% 0.13/0.37 dependent: set(para_from).
% 0.13/0.37 dependent: set(para_into).
% 0.13/0.37 dependent: clear(para_from_right).
% 0.13/0.37 dependent: clear(para_into_right).
% 0.13/0.37 dependent: set(para_from_vars).
% 0.13/0.37 dependent: set(eq_units_both_ways).
% 0.13/0.37 dependent: set(dynamic_demod_all).
% 0.13/0.37 dependent: set(dynamic_demod).
% 0.13/0.37 dependent: set(order_eq).
% 0.13/0.37 dependent: set(back_demod).
% 0.13/0.37 dependent: set(lrpo).
% 0.13/0.37 dependent: set(hyper_res).
% 0.13/0.37 dependent: clear(order_hyper).
% 0.13/0.37
% 0.13/0.37 ------------> process usable:
% 0.13/0.37
% 0.13/0.37 ------------> process sos:
% 0.13/0.37 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.13/0.37
% 0.13/0.37 ======= end of input processing =======
% 0.20/0.42
% 0.20/0.42 Model 1 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 -------------- Softie stats --------------
% 0.20/0.42
% 0.20/0.42 UPDATE_STOP: 300
% 0.20/0.42 SFINDER_TIME_LIMIT: 2
% 0.20/0.42 SHORT_CLAUSE_CUTOFF: 4
% 0.20/0.42 number of clauses in intial UL: 13
% 0.20/0.42 number of clauses initially in problem: 20
% 0.20/0.42 percentage of clauses intially in UL: 65
% 0.20/0.42 percentage of distinct symbols occuring in initial UL: 100
% 0.20/0.42 percent of all initial clauses that are short: 100
% 0.20/0.42 absolute distinct symbol count: 8
% 0.20/0.42 distinct predicate count: 4
% 0.20/0.42 distinct function count: 3
% 0.20/0.42 distinct constant count: 1
% 0.20/0.42
% 0.20/0.42 ---------- no more Softie stats ----------
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42
% 0.20/0.42 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.42
% 0.20/0.42 Stopped by limit on number of solutions
% 0.20/0.42
% 0.20/0.42 =========== start of search ===========
% 0.37/0.61
% 0.37/0.61 -------- PROOF --------
% 0.37/0.61 % SZS status Unsatisfiable
% 0.37/0.61 % SZS output start Refutation
% 0.37/0.61
% 0.37/0.61 Model 3 (0.00 seconds, 0 Inserts)
% 0.37/0.61
% 0.37/0.61 Stopped by limit on number of solutions
% 0.37/0.61
% 0.37/0.61 Model 4 [ 1 1 90 ] (0.00 seconds, 232740 Inserts)
% 0.37/0.61
% 0.37/0.61 Model 5 [ 1 1 220 ] (0.00 seconds, 83169 Inserts)
% 0.37/0.61
% 0.37/0.61 Model 6 [ 1 1 6946 ] (0.00 seconds, 27480 Inserts)
% 0.37/0.61
% 0.37/0.61 Model 7 [ 1 1 25634 ] (0.00 seconds, 43162 Inserts)
% 0.37/0.61
% 0.37/0.61 Model 8 [ 2 1 6920 ] (0.00 seconds, 46714 Inserts)
% 0.37/0.61
% 0.37/0.61 ----> UNIT CONFLICT at 0.22 sec ----> 45 [binary,43.1,13.1] {+} $F.
% 0.37/0.61
% 0.37/0.61 Length of proof is 2. Level of proof is 2.
% 0.37/0.61
% 0.37/0.61 ---------------- PROOF ----------------
% 0.37/0.61 % SZS status Unsatisfiable
% 0.37/0.61 % SZS output start Refutation
% 0.37/0.61
% 0.37/0.61 10 [] {+} -defined(A,B)| -identity_map(A)|product(A,B,B).
% 0.37/0.61 12 [] {+} -product(A,B,C)| -product(A,B,D)|C=D.
% 0.37/0.61 13 [] {+} domain(codomain(a))!=codomain(a).
% 0.37/0.61 15 [] {+} identity_map(codomain(A)).
% 0.37/0.61 16 [] {+} defined(A,domain(A)).
% 0.37/0.61 18 [] {+} product(A,domain(A),A).
% 0.37/0.61 23 [hyper,16,10,15] {+} product(codomain(A),domain(codomain(A)),domain(codomain(A))).
% 0.37/0.61 43 [hyper,23,12,18,flip.1] {-} domain(codomain(A))=codomain(A).
% 0.37/0.61 45 [binary,43.1,13.1] {+} $F.
% 0.37/0.61
% 0.37/0.61 % SZS output end Refutation
% 0.37/0.61 ------------ end of proof -------------
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Search stopped by max_proofs option.
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Search stopped by max_proofs option.
% 0.37/0.61
% 0.37/0.61 ============ end of search ============
% 0.37/0.61
% 0.37/0.61 ----------- soft-scott stats ----------
% 0.37/0.61
% 0.37/0.61 true clauses given 1 (12.5%)
% 0.37/0.61 false clauses given 7
% 0.37/0.61
% 0.37/0.61 FALSE TRUE
% 0.37/0.61 5 3 3
% 0.37/0.61 6 1 1
% 0.37/0.61 7 1 1
% 0.37/0.61 8 0 2
% 0.37/0.61 9 2 1
% 0.37/0.61 11 1 1
% 0.37/0.61 12 0 2
% 0.37/0.61 13 1 1
% 0.37/0.61 tot: 9 12 (57.1% true)
% 0.37/0.61
% 0.37/0.61
% 0.37/0.61 Model 8 [ 2 1 6920 ] (0.00 seconds, 46714 Inserts)
% 0.37/0.61
% 0.37/0.61 That finishes the proof of the theorem.
% 0.37/0.61
% 0.37/0.61 Process 1307 finished Sun May 29 21:54:58 2022
%------------------------------------------------------------------------------