TSTP Solution File: CAT019-3 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n026.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:21 EDT 2022
% Result : Unsatisfiable 0.20s 0.47s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : CAT019-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.13 % Command : sos-script %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sun May 29 19:58:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35 ----- Otter 3.2, August 2001 -----
% 0.13/0.35 The process was started by sandbox2 on n026.cluster.edu,
% 0.13/0.35 Sun May 29 19:58:55 2022
% 0.13/0.35 The command was "./sos". The process ID is 4683.
% 0.13/0.35
% 0.13/0.35 set(prolog_style_variables).
% 0.13/0.35 set(auto).
% 0.13/0.35 dependent: set(auto1).
% 0.13/0.35 dependent: set(process_input).
% 0.13/0.35 dependent: clear(print_kept).
% 0.13/0.35 dependent: clear(print_new_demod).
% 0.13/0.35 dependent: clear(print_back_demod).
% 0.13/0.35 dependent: clear(print_back_sub).
% 0.13/0.35 dependent: set(control_memory).
% 0.13/0.35 dependent: assign(max_mem, 12000).
% 0.13/0.35 dependent: assign(pick_given_ratio, 4).
% 0.13/0.35 dependent: assign(stats_level, 1).
% 0.13/0.35 dependent: assign(pick_semantic_ratio, 3).
% 0.13/0.35 dependent: assign(sos_limit, 5000).
% 0.13/0.35 dependent: assign(max_weight, 60).
% 0.13/0.35 clear(print_given).
% 0.13/0.35
% 0.13/0.35 list(usable).
% 0.13/0.35
% 0.13/0.35 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 0.13/0.35
% 0.13/0.35 This ia a non-Horn set with equality. The strategy will be
% 0.13/0.35 Knuth-Bendix, ordered hyper_res, ur_res, factoring, and
% 0.13/0.35 unit deletion, with positive clauses in sos and nonpositive
% 0.13/0.35 clauses in usable.
% 0.13/0.35
% 0.13/0.35 dependent: set(knuth_bendix).
% 0.13/0.35 dependent: set(para_from).
% 0.13/0.35 dependent: set(para_into).
% 0.13/0.35 dependent: clear(para_from_right).
% 0.13/0.35 dependent: clear(para_into_right).
% 0.13/0.35 dependent: set(para_from_vars).
% 0.13/0.35 dependent: set(eq_units_both_ways).
% 0.13/0.35 dependent: set(dynamic_demod_all).
% 0.13/0.35 dependent: set(dynamic_demod).
% 0.13/0.35 dependent: set(order_eq).
% 0.13/0.35 dependent: set(back_demod).
% 0.13/0.35 dependent: set(lrpo).
% 0.13/0.35 dependent: set(hyper_res).
% 0.13/0.35 dependent: set(unit_deletion).
% 0.13/0.35 dependent: set(factor).
% 0.13/0.35
% 0.13/0.35 ------------> process usable:
% 0.13/0.35 Following clause subsumed by 3 during input processing: 0 [] {-} -there_exists(A)| -there_exists(B)|A!=B|equivalent(A,B).
% 0.13/0.35
% 0.13/0.35 ------------> process sos:
% 0.13/0.35 Following clause subsumed by 28 during input processing: 0 [copy,28,flip.1] {-} A=A.
% 0.13/0.35 28 back subsumes 17.
% 0.13/0.35
% 0.13/0.35 ======= 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: 14
% 0.20/0.38 number of clauses initially in problem: 23
% 0.20/0.38 percentage of clauses intially in UL: 60
% 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: 9
% 0.20/0.38 distinct predicate count: 3
% 0.20/0.38 distinct function count: 4
% 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.20/0.47
% 0.20/0.47 -------- PROOF --------
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Refutation
% 0.20/0.47
% 0.20/0.47 Model 2 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 3 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 4 (0.00 seconds, 0 Inserts)
% 0.20/0.47
% 0.20/0.47 Stopped by limit on number of solutions
% 0.20/0.47
% 0.20/0.47 Model 5 [ 2 1 524 ] (0.00 seconds, 784 Inserts)
% 0.20/0.47
% 0.20/0.47 Model 6 [ 2 0 184 ] (0.00 seconds, 351 Inserts)
% 0.20/0.47
% 0.20/0.47 ----> UNIT CONFLICT at 0.10 sec ----> 312 [binary,310.1,16.1] {-} $F.
% 0.20/0.47
% 0.20/0.48 Length of proof is 9. Level of proof is 6.
% 0.20/0.48
% 0.20/0.48 ---------------- PROOF ----------------
% 0.20/0.48 % SZS status Unsatisfiable
% 0.20/0.48 % SZS output start Refutation
% 0.20/0.48
% 0.20/0.48 13 [] {+} -there_exists(A)|a!=A|b=A.
% 0.20/0.48 14 [] {+} -there_exists(A)|a=A|b!=A.
% 0.20/0.48 15 [] {-} a!=b.
% 0.20/0.48 16 [copy,15,flip.1] {+} b!=a.
% 0.20/0.48 24,23 [] {+} compose(codomain(A),A)=A.
% 0.20/0.48 25 [] {+} there_exists(f1(A,B))|A=B.
% 0.20/0.48 26 [] {-} A=f1(A,B)|B=f1(A,B)|A=B.
% 0.20/0.48 27 [copy,26,flip.1,flip.2] {+} f1(A,B)=A|f1(A,B)=B|A=B.
% 0.20/0.48 28 [] {+} A=A.
% 0.20/0.48 65 [para_from,25.2.1,23.1.1,demod,24] {+} A=B|there_exists(f1(B,A)).
% 0.20/0.48 90 [hyper,27,16] {-} f1(b,a)=b|f1(b,a)=a.
% 0.20/0.48 234 [para_from,90.1.1,65.2.1,unit_del,16] {-} there_exists(b)|f1(b,a)=a.
% 0.20/0.48 235 [para_from,90.2.1,65.2.1,unit_del,16] {-} there_exists(a)|f1(b,a)=b.
% 0.20/0.48 291,290 [hyper,234,14,28,unit_del,16] {-} f1(b,a)=a.
% 0.20/0.48 292 [back_demod,235,demod,291,unit_del,16] {-} there_exists(a).
% 0.20/0.48 310 [hyper,292,13,28] {-} b=a.
% 0.20/0.48 312 [binary,310.1,16.1] {-} $F.
% 0.20/0.48
% 0.20/0.48 % SZS output end Refutation
% 0.20/0.48 ------------ end of proof -------------
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Search stopped by max_proofs option.
% 0.20/0.48
% 0.20/0.48 ============ end of search ============
% 0.20/0.48
% 0.20/0.48 ----------- soft-scott stats ----------
% 0.20/0.48
% 0.20/0.48 true clauses given 2 (15.4%)
% 0.20/0.48 false clauses given 11
% 0.20/0.48
% 0.20/0.48 FALSE TRUE
% 0.20/0.48 3 1 0
% 0.20/0.48 5 1 1
% 0.20/0.48 6 0 4
% 0.20/0.48 7 1 3
% 0.20/0.48 8 2 7
% 0.20/0.48 9 4 8
% 0.20/0.48 10 4 11
% 0.20/0.48 11 1 15
% 0.20/0.48 12 1 12
% 0.20/0.48 13 6 12
% 0.20/0.48 14 16 4
% 0.20/0.48 15 4 11
% 0.20/0.48 16 3 8
% 0.20/0.48 17 6 9
% 0.20/0.48 18 2 9
% 0.20/0.48 19 0 2
% 0.20/0.48 20 7 3
% 0.20/0.48 21 0 7
% 0.20/0.48 22 1 1
% 0.20/0.48 23 0 2
% 0.20/0.48 24 2 11
% 0.20/0.48 25 1 2
% 0.20/0.48 26 1 3
% 0.20/0.48 27 2 6
% 0.20/0.48 28 1 5
% 0.20/0.48 29 11 1
% 0.20/0.48 30 0 2
% 0.20/0.48 32 0 3
% 0.20/0.48 33 3 0
% 0.20/0.48 34 1 2
% 0.20/0.48 35 0 1
% 0.20/0.48 36 1 0
% 0.20/0.48 39 3 3
% 0.20/0.48 43 5 2
% 0.20/0.48 59 1 0
% 0.20/0.48 tot: 92 170 (64.9% true)
% 0.20/0.48
% 0.20/0.48
% 0.20/0.48 Model 6 [ 2 -4 184 ] (0.00 seconds, 351 Inserts)
% 0.20/0.48
% 0.20/0.48 That finishes the proof of the theorem.
% 0.20/0.48
% 0.20/0.48 Process 4683 finished Sun May 29 19:58:55 2022
%------------------------------------------------------------------------------