TSTP Solution File: CAT011-1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT011-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n032.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:18 EDT 2022
% Result : Unsatisfiable 0.14s 0.47s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : CAT011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.10 % Command : sos-script %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 600
% 0.10/0.29 % DateTime : Sun May 29 22:18:57 EDT 2022
% 0.10/0.29 % CPUTime :
% 0.10/0.30 ----- Otter 3.2, August 2001 -----
% 0.10/0.30 The process was started by sandbox2 on n032.cluster.edu,
% 0.10/0.30 Sun May 29 22:18:57 2022
% 0.10/0.30 The command was "./sos". The process ID is 20478.
% 0.10/0.30
% 0.10/0.30 set(prolog_style_variables).
% 0.10/0.30 set(auto).
% 0.10/0.30 dependent: set(auto1).
% 0.10/0.30 dependent: set(process_input).
% 0.10/0.30 dependent: clear(print_kept).
% 0.10/0.30 dependent: clear(print_new_demod).
% 0.10/0.30 dependent: clear(print_back_demod).
% 0.10/0.30 dependent: clear(print_back_sub).
% 0.10/0.30 dependent: set(control_memory).
% 0.10/0.30 dependent: assign(max_mem, 12000).
% 0.10/0.30 dependent: assign(pick_given_ratio, 4).
% 0.10/0.30 dependent: assign(stats_level, 1).
% 0.10/0.30 dependent: assign(pick_semantic_ratio, 3).
% 0.10/0.30 dependent: assign(sos_limit, 5000).
% 0.10/0.30 dependent: assign(max_weight, 60).
% 0.10/0.30 clear(print_given).
% 0.10/0.30
% 0.10/0.30 list(usable).
% 0.10/0.30
% 0.10/0.30 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.10/0.30
% 0.10/0.30 This is a Horn set with equality. The strategy will be
% 0.10/0.30 Knuth-Bendix and hyper_res, with positive clauses in
% 0.10/0.30 sos and nonpositive clauses in usable.
% 0.10/0.30
% 0.10/0.30 dependent: set(knuth_bendix).
% 0.10/0.30 dependent: set(para_from).
% 0.10/0.30 dependent: set(para_into).
% 0.10/0.30 dependent: clear(para_from_right).
% 0.10/0.30 dependent: clear(para_into_right).
% 0.10/0.30 dependent: set(para_from_vars).
% 0.10/0.30 dependent: set(eq_units_both_ways).
% 0.10/0.30 dependent: set(dynamic_demod_all).
% 0.10/0.30 dependent: set(dynamic_demod).
% 0.10/0.30 dependent: set(order_eq).
% 0.10/0.30 dependent: set(back_demod).
% 0.10/0.30 dependent: set(lrpo).
% 0.10/0.30 dependent: set(hyper_res).
% 0.10/0.30 dependent: clear(order_hyper).
% 0.10/0.30
% 0.10/0.30 ------------> process usable:
% 0.10/0.30
% 0.10/0.30 ------------> process sos:
% 0.10/0.30 Following clause subsumed by 20 during input processing: 0 [copy,20,flip.1] {-} A=A.
% 0.10/0.30
% 0.10/0.30 ======= end of input processing =======
% 0.14/0.34
% 0.14/0.34 Model 1 (0.00 seconds, 0 Inserts)
% 0.14/0.34
% 0.14/0.34 Stopped by limit on number of solutions
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34 -------------- Softie stats --------------
% 0.14/0.34
% 0.14/0.34 UPDATE_STOP: 300
% 0.14/0.34 SFINDER_TIME_LIMIT: 2
% 0.14/0.34 SHORT_CLAUSE_CUTOFF: 4
% 0.14/0.34 number of clauses in intial UL: 13
% 0.14/0.34 number of clauses initially in problem: 20
% 0.14/0.34 percentage of clauses intially in UL: 65
% 0.14/0.34 percentage of distinct symbols occuring in initial UL: 87
% 0.14/0.34 percent of all initial clauses that are short: 100
% 0.14/0.34 absolute distinct symbol count: 8
% 0.14/0.34 distinct predicate count: 4
% 0.14/0.34 distinct function count: 3
% 0.14/0.34 distinct constant count: 1
% 0.14/0.34
% 0.14/0.34 ---------- no more Softie stats ----------
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34
% 0.14/0.34 Model 2 (0.00 seconds, 0 Inserts)
% 0.14/0.34
% 0.14/0.34 Stopped by limit on number of solutions
% 0.14/0.34
% 0.14/0.34 =========== start of search ===========
% 0.14/0.47
% 0.14/0.47 -------- PROOF --------
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start Refutation
% 0.14/0.47
% 0.14/0.47 Model 3 [ 1 0 277 ] (0.00 seconds, 9268 Inserts)
% 0.14/0.47
% 0.14/0.47 Stopped by limit on insertions
% 0.14/0.47
% 0.14/0.47 Model 4 [ 1 1 237 ] (0.00 seconds, 250000 Inserts)
% 0.14/0.47
% 0.14/0.47 Model 5 [ 1 1 17490 ] (0.00 seconds, 55292 Inserts)
% 0.14/0.47
% 0.14/0.47 Model 6 [ 1 1 863 ] (0.00 seconds, 2543 Inserts)
% 0.14/0.47
% 0.14/0.47 Model 7 [ 3 1 5051 ] (0.00 seconds, 9206 Inserts)
% 0.14/0.47
% 0.14/0.47 ----> UNIT CONFLICT at 0.14 sec ----> 41 [binary,39.1,13.1] {-} $F.
% 0.14/0.47
% 0.14/0.47 Length of proof is 2. Level of proof is 2.
% 0.14/0.47
% 0.14/0.47 ---------------- PROOF ----------------
% 0.14/0.47 % SZS status Unsatisfiable
% 0.14/0.47 % SZS output start Refutation
% 0.14/0.47
% 0.14/0.47 10 [] {+} -defined(A,B)| -identity_map(A)|product(A,B,B).
% 0.14/0.47 12 [] {+} -product(A,B,C)| -product(A,B,D)|C=D.
% 0.14/0.47 13 [] {+} domain(domain(a))!=domain(a).
% 0.14/0.47 14 [] {+} identity_map(domain(A)).
% 0.14/0.47 16 [] {+} defined(A,domain(A)).
% 0.14/0.47 18 [] {+} product(A,domain(A),A).
% 0.14/0.47 22 [hyper,16,10,14] {+} product(domain(A),domain(domain(A)),domain(domain(A))).
% 0.14/0.47 39 [hyper,22,12,18,flip.1] {-} domain(domain(A))=domain(A).
% 0.14/0.47 41 [binary,39.1,13.1] {-} $F.
% 0.14/0.47
% 0.14/0.47 % SZS output end Refutation
% 0.14/0.47 ------------ end of proof -------------
% 0.14/0.47
% 0.14/0.47
% 0.14/0.47 Search stopped by max_proofs option.
% 0.14/0.47
% 0.14/0.47
% 0.14/0.47 Search stopped by max_proofs option.
% 0.14/0.47
% 0.14/0.47 ============ end of search ============
% 0.14/0.47
% 0.14/0.47 ----------- soft-scott stats ----------
% 0.14/0.47
% 0.14/0.47 true clauses given 1 (14.3%)
% 0.14/0.47 false clauses given 6
% 0.14/0.47
% 0.14/0.47 FALSE TRUE
% 0.14/0.47 5 0 5
% 0.14/0.47 6 1 0
% 0.14/0.47 7 0 2
% 0.14/0.47 8 0 2
% 0.14/0.47 9 1 2
% 0.14/0.47 11 1 1
% 0.14/0.47 12 0 2
% 0.14/0.47 13 1 0
% 0.14/0.47 tot: 4 14 (77.8% true)
% 0.14/0.47
% 0.14/0.47
% 0.14/0.47 Model 7 [ 3 1 5051 ] (0.00 seconds, 9206 Inserts)
% 0.14/0.47
% 0.14/0.47 That finishes the proof of the theorem.
% 0.14/0.47
% 0.14/0.47 Process 20478 finished Sun May 29 22:18:57 2022
%------------------------------------------------------------------------------