TSTP Solution File: ALG203+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG203+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n029.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 : Thu Jul 14 18:01:15 EDT 2022
% Result : Theorem 0.72s 0.91s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ALG203+1 : TPTP v8.1.0. Released v2.7.0.
% 0.11/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n029.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 : Thu Jun 9 02:29:51 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 sandbox2 on n029.cluster.edu,
% 0.12/0.35 Thu Jun 9 02:29:51 2022
% 0.12/0.35 The command was "./sos". The process ID is 12424.
% 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 formula_list(usable).
% 0.12/0.35
% 0.12/0.35 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 0.12/0.35
% 0.12/0.35 This is a Horn set with equality. The strategy will be
% 0.12/0.35 Knuth-Bendix and hyper_res, with positive clauses in
% 0.12/0.35 sos and nonpositive 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: clear(order_hyper).
% 0.12/0.35
% 0.12/0.35 ------------> process usable:
% 0.12/0.35
% 0.12/0.35 ------------> process sos:
% 0.12/0.35 Following clause subsumed by 15 during input processing: 0 [copy,15,flip.1] {-} A=A.
% 0.12/0.35
% 0.12/0.35 ======= end of input processing =======
% 0.12/0.38
% 0.12/0.38 Model 1 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 -------------- Softie stats --------------
% 0.12/0.38
% 0.12/0.38 UPDATE_STOP: 300
% 0.12/0.38 SFINDER_TIME_LIMIT: 2
% 0.12/0.38 SHORT_CLAUSE_CUTOFF: 4
% 0.12/0.38 number of clauses in intial UL: 10
% 0.12/0.38 number of clauses initially in problem: 15
% 0.12/0.38 percentage of clauses intially in UL: 66
% 0.12/0.38 percentage of distinct symbols occuring in initial UL: 88
% 0.12/0.38 percent of all initial clauses that are short: 100
% 0.12/0.38 absolute distinct symbol count: 9
% 0.12/0.38 distinct predicate count: 3
% 0.12/0.38 distinct function count: 4
% 0.12/0.38 distinct constant count: 2
% 0.12/0.38
% 0.12/0.38 ---------- no more Softie stats ----------
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38
% 0.12/0.38 Model 2 (0.00 seconds, 0 Inserts)
% 0.12/0.38
% 0.12/0.38 Stopped by limit on number of solutions
% 0.12/0.38
% 0.12/0.38 =========== start of search ===========
% 0.72/0.91
% 0.72/0.91 -------- PROOF --------
% 0.72/0.91 % SZS status Theorem
% 0.72/0.91 % SZS output start Refutation
% 0.72/0.91
% 0.72/0.91 Model 3 (0.00 seconds, 0 Inserts)
% 0.72/0.91
% 0.72/0.91 Stopped by limit on number of solutions
% 0.72/0.91
% 0.72/0.91 Model 4 [ 1 0 592 ] (0.00 seconds, 4627 Inserts)
% 0.72/0.91
% 0.72/0.91 Stopped by limit on insertions
% 0.72/0.91
% 0.72/0.91 ----> UNIT CONFLICT at 0.54 sec ----> 51 [binary,49.1,3.1] {-} $F.
% 0.72/0.91
% 0.72/0.91 Length of proof is 8. Level of proof is 5.
% 0.72/0.91
% 0.72/0.91 ---------------- PROOF ----------------
% 0.72/0.91 % SZS status Theorem
% 0.72/0.91 % SZS output start Refutation
% 0.72/0.91
% 0.72/0.91 3 [] {+} op1($c2,$c2)!=$c2.
% 0.72/0.91 4 [] {+} -sorti2(A)|op2(A,A)!=A| -sorti2(B)|op2(B,B)=B.
% 0.72/0.91 5 [] {+} -sorti1(A)|sorti2(h(A)).
% 0.72/0.91 7 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 0.72/0.91 8 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.72/0.91 10 [] {+} -sorti1(A)|j(h(A))=A.
% 0.72/0.91 11 [] {+} sorti1($c1).
% 0.72/0.91 13,12 [] {+} op1($c1,$c1)=$c1.
% 0.72/0.91 14 [] {+} sorti1($c2).
% 0.72/0.91 15 [] {+} A=A.
% 0.72/0.91 18 [hyper,11,7,11,demod,13,flip.1] {-} op2(h($c1),h($c1))=h($c1).
% 0.72/0.91 20 [hyper,11,5] {+} sorti2(h($c1)).
% 0.72/0.91 22,21 [hyper,14,10] {+} j(h($c2))=$c2.
% 0.72/0.91 29 [hyper,14,5] {+} sorti2(h($c2)).
% 0.72/0.91 33 [para_from,18.1.1,4.2.1] {-} -sorti2(h($c1))|h($c1)!=h($c1)| -sorti2(A)|op2(A,A)=A.
% 0.72/0.91 34 [para_from,33.4.1,8.3.1.1,flip.2] {-} -sorti2(A)|op1(j(A),j(A))=j(A)| -sorti2(h($c1))|h($c1)!=h($c1).
% 0.72/0.91 47 [para_from,21.1.1,34.2.1.2,demod,22,22] {-} -sorti2(h($c2))|op1($c2,$c2)=$c2| -sorti2(h($c1))|h($c1)!=h($c1).
% 0.72/0.91 49 [hyper,29,47,20,15] {-} op1($c2,$c2)=$c2.
% 0.72/0.91 51 [binary,49.1,3.1] {-} $F.
% 0.72/0.91
% 0.72/0.91 % SZS output end Refutation
% 0.72/0.91 ------------ end of proof -------------
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91 Search stopped by max_proofs option.
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91 Search stopped by max_proofs option.
% 0.72/0.91
% 0.72/0.91 ============ end of search ============
% 0.72/0.91
% 0.72/0.91 ----------- soft-scott stats ----------
% 0.72/0.91
% 0.72/0.91 true clauses given 5 (38.5%)
% 0.72/0.91 false clauses given 8
% 0.72/0.91
% 0.72/0.91 FALSE TRUE
% 0.72/0.91 4 0 3
% 0.72/0.91 10 0 3
% 0.72/0.91 14 1 0
% 0.72/0.91 20 1 0
% 0.72/0.91 22 1 0
% 0.72/0.91 24 1 0
% 0.72/0.91 25 1 0
% 0.72/0.91 29 1 0
% 0.72/0.91 31 2 0
% 0.72/0.91 37 2 0
% 0.72/0.91 tot: 10 6 (37.5% true)
% 0.72/0.91
% 0.72/0.91
% 0.72/0.91 Model 4 [ 1 -1 592 ] (0.00 seconds, 4627 Inserts)
% 0.72/0.91
% 0.72/0.91 That finishes the proof of the theorem.
% 0.72/0.91
% 0.72/0.91 Process 12424 finished Thu Jun 9 02:29:52 2022
%------------------------------------------------------------------------------