TSTP Solution File: ALG202+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n024.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.67s 0.88s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.14 % Command : sos-script %s
% 0.14/0.35 % Computer : n024.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 8 10:55:49 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.37 ----- Otter 3.2, August 2001 -----
% 0.14/0.37 The process was started by sandbox on n024.cluster.edu,
% 0.14/0.37 Wed Jun 8 10:55:49 2022
% 0.14/0.37 The command was "./sos". The process ID is 17375.
% 0.14/0.37
% 0.14/0.37 set(prolog_style_variables).
% 0.14/0.37 set(auto).
% 0.14/0.37 dependent: set(auto1).
% 0.14/0.37 dependent: set(process_input).
% 0.14/0.37 dependent: clear(print_kept).
% 0.14/0.37 dependent: clear(print_new_demod).
% 0.14/0.37 dependent: clear(print_back_demod).
% 0.14/0.37 dependent: clear(print_back_sub).
% 0.14/0.37 dependent: set(control_memory).
% 0.14/0.37 dependent: assign(max_mem, 12000).
% 0.14/0.37 dependent: assign(pick_given_ratio, 4).
% 0.14/0.37 dependent: assign(stats_level, 1).
% 0.14/0.37 dependent: assign(pick_semantic_ratio, 3).
% 0.14/0.37 dependent: assign(sos_limit, 5000).
% 0.14/0.37 dependent: assign(max_weight, 60).
% 0.14/0.37 clear(print_given).
% 0.14/0.37
% 0.14/0.37 formula_list(usable).
% 0.14/0.37
% 0.14/0.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.14/0.37
% 0.14/0.37 This is a Horn set with equality. The strategy will be
% 0.14/0.37 Knuth-Bendix and hyper_res, with positive clauses in
% 0.14/0.37 sos and nonpositive clauses in usable.
% 0.14/0.37
% 0.14/0.37 dependent: set(knuth_bendix).
% 0.14/0.37 dependent: set(para_from).
% 0.14/0.37 dependent: set(para_into).
% 0.14/0.37 dependent: clear(para_from_right).
% 0.14/0.37 dependent: clear(para_into_right).
% 0.14/0.37 dependent: set(para_from_vars).
% 0.14/0.37 dependent: set(eq_units_both_ways).
% 0.14/0.37 dependent: set(dynamic_demod_all).
% 0.14/0.37 dependent: set(dynamic_demod).
% 0.14/0.37 dependent: set(order_eq).
% 0.14/0.37 dependent: set(back_demod).
% 0.14/0.37 dependent: set(lrpo).
% 0.14/0.37 dependent: set(hyper_res).
% 0.14/0.37 dependent: clear(order_hyper).
% 0.14/0.37
% 0.14/0.37 ------------> process usable:
% 0.14/0.37
% 0.14/0.37 ------------> process sos:
% 0.14/0.37 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] {-} A=A.
% 0.14/0.37
% 0.14/0.37 ======= end of input processing =======
% 0.67/0.88
% 0.67/0.88 Stopped by limit on insertions
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88 Failed to model usable list: disabling FINDER
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88 -------------- Softie stats --------------
% 0.67/0.88
% 0.67/0.88 UPDATE_STOP: 300
% 0.67/0.88 SFINDER_TIME_LIMIT: 2
% 0.67/0.88 SHORT_CLAUSE_CUTOFF: 4
% 0.67/0.88 number of clauses in intial UL: 10
% 0.67/0.88 number of clauses initially in problem: 12
% 0.67/0.88 percentage of clauses intially in UL: 83
% 0.67/0.88 percentage of distinct symbols occuring in initial UL: 100
% 0.67/0.88 percent of all initial clauses that are short: 100
% 0.67/0.88 absolute distinct symbol count: 8
% 0.67/0.88 distinct predicate count: 3
% 0.67/0.88 distinct function count: 4
% 0.67/0.88 distinct constant count: 1
% 0.67/0.88
% 0.67/0.88 ---------- no more Softie stats ----------
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88 =========== start of search ===========
% 0.67/0.88
% 0.67/0.88 -------- PROOF --------
% 0.67/0.88 % SZS status Theorem
% 0.67/0.88 % SZS output start Refutation
% 0.67/0.88
% 0.67/0.88 ----> UNIT CONFLICT at 0.48 sec ----> 25 [binary,23.1,4.1] {-} $F.
% 0.67/0.88
% 0.67/0.88 Length of proof is 5. Level of proof is 3.
% 0.67/0.88
% 0.67/0.88 ---------------- PROOF ----------------
% 0.67/0.88 % SZS status Theorem
% 0.67/0.88 % SZS output start Refutation
% 0.67/0.88
% 0.67/0.88 3 [] {+} -sorti1(A)|op1(A,A)=A.
% 0.67/0.88 4 [] {+} op2($c1,$c1)!=$c1.
% 0.67/0.88 6 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.67/0.88 7 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 0.67/0.88 9 [] {+} -sorti2(A)|h(j(A))=A.
% 0.67/0.88 11 [] {-} sorti2($c1).
% 0.67/0.88 14,13 [hyper,11,9] {-} h(j($c1))=$c1.
% 0.67/0.88 17 [hyper,11,6] {-} sorti1(j($c1)).
% 0.67/0.88 19 [hyper,17,7,17,demod,14,14] {-} h(op1(j($c1),j($c1)))=op2($c1,$c1).
% 0.67/0.88 22,21 [hyper,17,3] {-} op1(j($c1),j($c1))=j($c1).
% 0.67/0.88 23 [back_demod,19,demod,22,14,flip.1] {-} op2($c1,$c1)=$c1.
% 0.67/0.88 25 [binary,23.1,4.1] {-} $F.
% 0.67/0.88
% 0.67/0.88 % SZS output end Refutation
% 0.67/0.88 ------------ end of proof -------------
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88 Search stopped by max_proofs option.
% 0.67/0.88
% 0.67/0.88
% 0.67/0.88 Search stopped by max_proofs option.
% 0.67/0.88
% 0.67/0.88 ============ end of search ============
% 0.67/0.88
% 0.67/0.88 That finishes the proof of the theorem.
% 0.67/0.88
% 0.67/0.88 Process 17375 finished Wed Jun 8 10:55:50 2022
%------------------------------------------------------------------------------