TSTP Solution File: CAT012-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT012-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n020.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.59s 0.81s
% Output : Refutation 0.59s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT012-3 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n020.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 15:47:39 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 sandbox on n020.cluster.edu,
% 0.12/0.35 Sun May 29 15:47:39 2022
% 0.12/0.35 The command was "./sos". The process ID is 20142.
% 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 26 during input processing: 0 [copy,26,flip.1] {-} A=A.
% 0.12/0.35 26 back subsumes 14.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.19/0.37
% 0.19/0.37 Model 1 (0.00 seconds, 0 Inserts)
% 0.19/0.37
% 0.19/0.37 Stopped by limit on number of solutions
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 -------------- Softie stats --------------
% 0.19/0.37
% 0.19/0.37 UPDATE_STOP: 300
% 0.19/0.37 SFINDER_TIME_LIMIT: 2
% 0.19/0.37 SHORT_CLAUSE_CUTOFF: 4
% 0.19/0.37 number of clauses in intial UL: 12
% 0.19/0.37 number of clauses initially in problem: 22
% 0.19/0.37 percentage of clauses intially in UL: 54
% 0.19/0.37 percentage of distinct symbols occuring in initial UL: 100
% 0.19/0.37 percent of all initial clauses that are short: 100
% 0.19/0.37 absolute distinct symbol count: 8
% 0.19/0.37 distinct predicate count: 3
% 0.19/0.37 distinct function count: 4
% 0.19/0.37 distinct constant count: 1
% 0.19/0.37
% 0.19/0.37 ---------- no more Softie stats ----------
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37
% 0.19/0.37 =========== start of search ===========
% 0.59/0.81
% 0.59/0.81 -------- PROOF --------
% 0.59/0.81 % SZS status Unsatisfiable
% 0.59/0.81 % SZS output start Refutation
% 0.59/0.81
% 0.59/0.81 Model 2 (0.00 seconds, 0 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on number of solutions
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 3 [ 1 0 111 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 4 [ 1 0 53 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 5 [ 3 0 88 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 6 [ 2 1 274 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 7 [ 1 0 271 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 Stopped by limit on insertions
% 0.59/0.81
% 0.59/0.81 Model 8 [ 3 1 483 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 ----> UNIT CONFLICT at 0.43 sec ----> 86 [binary,84.1,13.1] {-} $F.
% 0.59/0.81
% 0.59/0.81 Length of proof is 3. Level of proof is 2.
% 0.59/0.81
% 0.59/0.81 ---------------- PROOF ----------------
% 0.59/0.81 % SZS status Unsatisfiable
% 0.59/0.81 % SZS output start Refutation
% 0.59/0.81
% 0.59/0.81 4 [] {+} -there_exists(domain(A))|there_exists(A).
% 0.59/0.81 7 [] {+} -there_exists(compose(A,B))|domain(A)=codomain(B).
% 0.59/0.81 13 [] {+} codomain(domain(a))!=domain(a).
% 0.59/0.81 18 [] {+} compose(A,domain(A))=A.
% 0.59/0.81 25 [] {+} there_exists(domain(a)).
% 0.59/0.81 37 [hyper,25,4] {+} there_exists(a).
% 0.59/0.81 56 [para_from,18.1.1,7.1.1,flip.2] {+} -there_exists(A)|codomain(domain(A))=domain(A).
% 0.59/0.81 84 [hyper,56,37] {-} codomain(domain(a))=domain(a).
% 0.59/0.81 86 [binary,84.1,13.1] {-} $F.
% 0.59/0.81
% 0.59/0.81 % SZS output end Refutation
% 0.59/0.81 ------------ end of proof -------------
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Search stopped by max_proofs option.
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Search stopped by max_proofs option.
% 0.59/0.81
% 0.59/0.81 ============ end of search ============
% 0.59/0.81
% 0.59/0.81 ----------- soft-scott stats ----------
% 0.59/0.81
% 0.59/0.81 true clauses given 2 (20.0%)
% 0.59/0.81 false clauses given 8
% 0.59/0.81
% 0.59/0.81 FALSE TRUE
% 0.59/0.81 4 2 0
% 0.59/0.81 5 3 1
% 0.59/0.81 6 4 5
% 0.59/0.81 7 1 1
% 0.59/0.81 8 0 2
% 0.59/0.81 9 0 2
% 0.59/0.81 10 2 1
% 0.59/0.81 11 0 3
% 0.59/0.81 12 1 4
% 0.59/0.81 13 1 4
% 0.59/0.81 14 1 0
% 0.59/0.81 15 0 2
% 0.59/0.81 17 0 1
% 0.59/0.81 18 1 3
% 0.59/0.81 25 0 1
% 0.59/0.81 tot: 16 30 (65.2% true)
% 0.59/0.81
% 0.59/0.81
% 0.59/0.81 Model 8 [ 3 1 483 ] (0.00 seconds, 250000 Inserts)
% 0.59/0.81
% 0.59/0.81 That finishes the proof of the theorem.
% 0.59/0.81
% 0.59/0.81 Process 20142 finished Sun May 29 15:47:39 2022
%------------------------------------------------------------------------------