TSTP Solution File: CAT001-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT001-3 : 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:16 EDT 2022
% Result : Unsatisfiable 0.12s 0.44s
% Output : Refutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : CAT001-3 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.08 % Command : sos-script %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Sun May 29 15:55:56 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.12/0.29 ----- Otter 3.2, August 2001 -----
% 0.12/0.29 The process was started by sandbox2 on n032.cluster.edu,
% 0.12/0.29 Sun May 29 15:55:56 2022
% 0.12/0.29 The command was "./sos". The process ID is 15335.
% 0.12/0.29
% 0.12/0.29 set(prolog_style_variables).
% 0.12/0.29 set(auto).
% 0.12/0.29 dependent: set(auto1).
% 0.12/0.29 dependent: set(process_input).
% 0.12/0.29 dependent: clear(print_kept).
% 0.12/0.29 dependent: clear(print_new_demod).
% 0.12/0.29 dependent: clear(print_back_demod).
% 0.12/0.29 dependent: clear(print_back_sub).
% 0.12/0.29 dependent: set(control_memory).
% 0.12/0.29 dependent: assign(max_mem, 12000).
% 0.12/0.29 dependent: assign(pick_given_ratio, 4).
% 0.12/0.29 dependent: assign(stats_level, 1).
% 0.12/0.29 dependent: assign(pick_semantic_ratio, 3).
% 0.12/0.29 dependent: assign(sos_limit, 5000).
% 0.12/0.29 dependent: assign(max_weight, 60).
% 0.12/0.29 clear(print_given).
% 0.12/0.29
% 0.12/0.29 list(usable).
% 0.12/0.29
% 0.12/0.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.12/0.29
% 0.12/0.29 This ia a non-Horn set with equality. The strategy will be
% 0.12/0.29 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.12/0.29 unit deletion, with positive clauses in sos and nonpositive
% 0.12/0.29 clauses in usable.
% 0.12/0.29
% 0.12/0.29 dependent: set(knuth_bendix).
% 0.12/0.29 dependent: set(para_from).
% 0.12/0.29 dependent: set(para_into).
% 0.12/0.29 dependent: clear(para_from_right).
% 0.12/0.29 dependent: clear(para_into_right).
% 0.12/0.29 dependent: set(para_from_vars).
% 0.12/0.29 dependent: set(eq_units_both_ways).
% 0.12/0.29 dependent: set(dynamic_demod_all).
% 0.12/0.29 dependent: set(dynamic_demod).
% 0.12/0.29 dependent: set(order_eq).
% 0.12/0.29 dependent: set(back_demod).
% 0.12/0.29 dependent: set(lrpo).
% 0.12/0.29 dependent: set(hyper_res).
% 0.12/0.29 dependent: set(unit_deletion).
% 0.12/0.29 dependent: set(factor).
% 0.12/0.29
% 0.12/0.29 ------------> process usable:
% 0.12/0.29 Following clause subsumed by 3 during input processing: 0 [] {-} -there_exists(A)| -there_exists(B)|A!=B|equivalent(A,B).
% 0.12/0.29
% 0.12/0.29 ------------> process sos:
% 0.12/0.29 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] {-} A=A.
% 0.12/0.29 31 back subsumes 15.
% 0.12/0.29
% 0.12/0.29 ======= end of input processing =======
% 0.12/0.30
% 0.12/0.30 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.30
% 0.12/0.30 Stopped by limit on number of solutions
% 0.12/0.30
% 0.12/0.30
% 0.12/0.30 -------------- Softie stats --------------
% 0.12/0.30
% 0.12/0.30 UPDATE_STOP: 300
% 0.12/0.30 SFINDER_TIME_LIMIT: 2
% 0.12/0.30 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.30 number of clauses in intial UL: 12
% 0.12/0.30 number of clauses initially in problem: 26
% 0.12/0.30 percentage of clauses intially in UL: 46
% 0.12/0.30 percentage of distinct symbols occuring in initial UL: 81
% 0.12/0.30 percent of all initial clauses that are short: 100
% 0.12/0.30 absolute distinct symbol count: 11
% 0.12/0.30 distinct predicate count: 3
% 0.12/0.30 distinct function count: 4
% 0.12/0.30 distinct constant count: 4
% 0.12/0.30
% 0.12/0.30 ---------- no more Softie stats ----------
% 0.12/0.30
% 0.12/0.30
% 0.12/0.30
% 0.12/0.30 =========== start of search ===========
% 0.12/0.44
% 0.12/0.44 -------- PROOF --------
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start Refutation
% 0.12/0.44
% 0.12/0.44 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 Model 3 (0.00 seconds, 0 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 Model 4 (0.00 seconds, 0 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 Model 5 (0.00 seconds, 0 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 Model 6 (0.00 seconds, 0 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 Stopped by limit on insertions
% 0.12/0.44
% 0.12/0.44 Model 7 [ 7 0 80 ] (0.00 seconds, 250000 Inserts)
% 0.12/0.44
% 0.12/0.44 Model 8 (0.00 seconds, 250000 Inserts)
% 0.12/0.44
% 0.12/0.44 Stopped by limit on number of solutions
% 0.12/0.44
% 0.12/0.44 ----> UNIT CONFLICT at 0.13 sec ----> 346 [binary,345.1,31.1] {-} $F.
% 0.12/0.44
% 0.12/0.44 Length of proof is 4. Level of proof is 4.
% 0.12/0.44
% 0.12/0.44 ---------------- PROOF ----------------
% 0.12/0.44 % SZS status Unsatisfiable
% 0.12/0.44 % SZS output start Refutation
% 0.12/0.44
% 0.12/0.44 13 [] {-} compose(compose(a,b),A)!=B|compose(compose(a,b),C)!=B|A=C.
% 0.12/0.44 14 [] {+} h!=g.
% 0.12/0.44 17 [] {-} compose(A,compose(B,C))=compose(compose(A,B),C).
% 0.12/0.44 19,18 [copy,17,flip.1] {-} compose(compose(A,B),C)=compose(A,compose(B,C)).
% 0.12/0.44 29 [] {-} compose(b,h)=compose(b,g).
% 0.12/0.44 31 [] {+} A=A.
% 0.12/0.44 32 [back_demod,13,demod,19,19] {-} compose(a,compose(b,A))!=B|compose(a,compose(b,C))!=B|A=C.
% 0.12/0.44 288 [para_into,32.1.1.2,29.1.1] {-} compose(a,compose(b,g))!=A|compose(a,compose(b,B))!=A|h=B.
% 0.12/0.44 345 [factor,288.1.2,unit_del,14] {-} compose(a,compose(b,g))!=A.
% 0.12/0.44 346 [binary,345.1,31.1] {-} $F.
% 0.12/0.44
% 0.12/0.44 % SZS output end Refutation
% 0.12/0.44 ------------ end of proof -------------
% 0.12/0.44
% 0.12/0.44
% 0.12/0.44 Search stopped by max_proofs option.
% 0.12/0.44
% 0.12/0.44
% 0.12/0.44 Search stopped by max_proofs option.
% 0.12/0.44
% 0.12/0.44 ============ end of search ============
% 0.12/0.44
% 0.12/0.44 ----------- soft-scott stats ----------
% 0.12/0.44
% 0.12/0.44 true clauses given 3 (18.8%)
% 0.12/0.44 false clauses given 13
% 0.12/0.44
% 0.12/0.44 FALSE TRUE
% 0.12/0.44 2 0 1
% 0.12/0.44 3 0 2
% 0.12/0.44 5 0 8
% 0.12/0.44 6 0 11
% 0.12/0.44 7 0 14
% 0.12/0.44 8 0 11
% 0.12/0.44 9 0 10
% 0.12/0.44 10 0 11
% 0.12/0.44 11 0 9
% 0.12/0.44 12 2 6
% 0.12/0.44 13 6 15
% 0.12/0.44 14 9 16
% 0.12/0.44 15 3 8
% 0.12/0.44 16 1 6
% 0.12/0.44 17 4 10
% 0.12/0.44 18 2 9
% 0.12/0.44 19 0 2
% 0.12/0.44 20 4 6
% 0.12/0.44 21 2 9
% 0.12/0.44 23 0 1
% 0.12/0.44 24 2 5
% 0.12/0.44 25 2 2
% 0.12/0.44 26 0 1
% 0.12/0.44 27 0 6
% 0.12/0.44 35 0 1
% 0.12/0.44 tot: 37 180 (82.9% true)
% 0.12/0.44
% 0.12/0.44
% 0.12/0.44 Model 8 (0.00 seconds, 250000 Inserts)
% 0.12/0.44
% 0.12/0.44 That finishes the proof of the theorem.
% 0.12/0.44
% 0.12/0.44 Process 15335 finished Sun May 29 15:55:56 2022
%------------------------------------------------------------------------------