TSTP Solution File: ALG070+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG070+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : sos-script %s
% Computer : n025.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:00 EDT 2022
% Result : Theorem 0.19s 0.54s
% Output : Refutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : ALG070+1 : TPTP v8.1.0. Released v2.7.0.
% 0.10/0.12 % Command : sos-script %s
% 0.12/0.33 % Computer : n025.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 : Tue Jun 7 22:07:49 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 n025.cluster.edu,
% 0.12/0.35 Tue Jun 7 22:07:49 2022
% 0.12/0.35 The command was "./sos". The process ID is 1072.
% 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: 100
% 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 =========== start of search ===========
% 0.19/0.54
% 0.19/0.54 -------- PROOF --------
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start Refutation
% 0.19/0.54
% 0.19/0.54 Model 2 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 Model 3 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 Model 4 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 Model 5 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 Model 6 (0.00 seconds, 0 Inserts)
% 0.19/0.54
% 0.19/0.54 Stopped by limit on number of solutions
% 0.19/0.54
% 0.19/0.54 Stopped by limit on insertions
% 0.19/0.54
% 0.19/0.54 Model 7 [ 1 0 120 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.54
% 0.19/0.54 ----> UNIT CONFLICT at 0.16 sec ----> 96 [binary,94.1,4.1] {+} $F.
% 0.19/0.54
% 0.19/0.54 Length of proof is 9. Level of proof is 3.
% 0.19/0.54
% 0.19/0.54 ---------------- PROOF ----------------
% 0.19/0.54 % SZS status Theorem
% 0.19/0.54 % SZS output start Refutation
% 0.19/0.54
% 0.19/0.54 2 [] {+} -sorti2(A)| -sorti2(B)|sorti2(op2(A,B)).
% 0.19/0.54 3 [] {+} -sorti1(A)| -sorti1(B)|op1(A,A)!=B|op1(A,B)=A.
% 0.19/0.54 4 [] {+} op2($c2,$c1)!=$c2.
% 0.19/0.54 6 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.19/0.54 8 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.19/0.54 9 [] {+} -sorti2(A)|h(j(A))=A.
% 0.19/0.54 11 [] {+} sorti2($c2).
% 0.19/0.54 12 [] {+} sorti2($c1).
% 0.19/0.54 14,13 [] {+} op2($c2,$c2)=$c1.
% 0.19/0.54 17,16 [hyper,11,9] {+} h(j($c2))=$c2.
% 0.19/0.54 18 [hyper,11,8,11,demod,14,flip.1] {-} op1(j($c2),j($c2))=j($c1).
% 0.19/0.54 20 [hyper,11,6] {+} sorti1(j($c2)).
% 0.19/0.54 26,25 [hyper,12,8,11] {+} j(op2($c2,$c1))=op1(j($c2),j($c1)).
% 0.19/0.54 29 [hyper,12,6] {+} sorti1(j($c1)).
% 0.19/0.54 31 [hyper,12,2,11] {+} sorti2(op2($c2,$c1)).
% 0.19/0.54 33 [hyper,31,9,demod,26] {+} h(op1(j($c2),j($c1)))=op2($c2,$c1).
% 0.19/0.54 79,78 [hyper,18,3,20,29] {-} op1(j($c2),j($c1))=j($c2).
% 0.19/0.54 94 [back_demod,33,demod,79,17,flip.1] {-} op2($c2,$c1)=$c2.
% 0.19/0.54 96 [binary,94.1,4.1] {+} $F.
% 0.19/0.54
% 0.19/0.54 % SZS output end Refutation
% 0.19/0.54 ------------ end of proof -------------
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Search stopped by max_proofs option.
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Search stopped by max_proofs option.
% 0.19/0.54
% 0.19/0.54 ============ end of search ============
% 0.19/0.54
% 0.19/0.54 ----------- soft-scott stats ----------
% 0.19/0.54
% 0.19/0.54 true clauses given 3 (30.0%)
% 0.19/0.54 false clauses given 7
% 0.19/0.54
% 0.19/0.54 FALSE TRUE
% 0.19/0.54 4 0 1
% 0.19/0.54 5 0 1
% 0.19/0.54 6 0 11
% 0.19/0.54 8 0 4
% 0.19/0.54 10 0 6
% 0.19/0.54 15 0 8
% 0.19/0.54 20 0 4
% 0.19/0.54 tot: 0 35 (100.0% true)
% 0.19/0.54
% 0.19/0.54
% 0.19/0.54 Model 7 [ 1 0 120 ] (0.00 seconds, 250000 Inserts)
% 0.19/0.54
% 0.19/0.54 That finishes the proof of the theorem.
% 0.19/0.54
% 0.19/0.54 Process 1072 finished Tue Jun 7 22:07:49 2022
%------------------------------------------------------------------------------