TSTP Solution File: ALG029+1 by SOS---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SOS---2.0
% Problem : ALG029+1 : TPTP v8.1.0. Released v2.7.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 : Thu Jul 14 18:00:55 EDT 2022
% Result : Theorem 0.15s 0.53s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : ALG029+1 : TPTP v8.1.0. Released v2.7.0.
% 0.00/0.10 % Command : sos-script %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Thu Jun 9 03:25:52 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.15/0.31 ----- Otter 3.2, August 2001 -----
% 0.15/0.31 The process was started by sandbox on n032.cluster.edu,
% 0.15/0.31 Thu Jun 9 03:25:52 2022
% 0.15/0.31 The command was "./sos". The process ID is 11805.
% 0.15/0.31
% 0.15/0.31 set(prolog_style_variables).
% 0.15/0.31 set(auto).
% 0.15/0.31 dependent: set(auto1).
% 0.15/0.31 dependent: set(process_input).
% 0.15/0.31 dependent: clear(print_kept).
% 0.15/0.31 dependent: clear(print_new_demod).
% 0.15/0.31 dependent: clear(print_back_demod).
% 0.15/0.31 dependent: clear(print_back_sub).
% 0.15/0.31 dependent: set(control_memory).
% 0.15/0.31 dependent: assign(max_mem, 12000).
% 0.15/0.31 dependent: assign(pick_given_ratio, 4).
% 0.15/0.31 dependent: assign(stats_level, 1).
% 0.15/0.31 dependent: assign(pick_semantic_ratio, 3).
% 0.15/0.31 dependent: assign(sos_limit, 5000).
% 0.15/0.31 dependent: assign(max_weight, 60).
% 0.15/0.31 clear(print_given).
% 0.15/0.31
% 0.15/0.31 formula_list(usable).
% 0.15/0.31
% 0.15/0.31 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 0.15/0.31
% 0.15/0.31 This is a Horn set with equality. The strategy will be
% 0.15/0.31 Knuth-Bendix and hyper_res, with positive clauses in
% 0.15/0.31 sos and nonpositive clauses in usable.
% 0.15/0.31
% 0.15/0.31 dependent: set(knuth_bendix).
% 0.15/0.31 dependent: set(para_from).
% 0.15/0.31 dependent: set(para_into).
% 0.15/0.31 dependent: clear(para_from_right).
% 0.15/0.31 dependent: clear(para_into_right).
% 0.15/0.31 dependent: set(para_from_vars).
% 0.15/0.31 dependent: set(eq_units_both_ways).
% 0.15/0.31 dependent: set(dynamic_demod_all).
% 0.15/0.31 dependent: set(dynamic_demod).
% 0.15/0.31 dependent: set(order_eq).
% 0.15/0.31 dependent: set(back_demod).
% 0.15/0.31 dependent: set(lrpo).
% 0.15/0.31 dependent: set(hyper_res).
% 0.15/0.31 dependent: clear(order_hyper).
% 0.15/0.31
% 0.15/0.31 ------------> process usable:
% 0.15/0.31
% 0.15/0.31 ------------> process sos:
% 0.15/0.31 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] {-} A=A.
% 0.15/0.31
% 0.15/0.31 ======= end of input processing =======
% 0.15/0.33
% 0.15/0.33 Model 1 (0.00 seconds, 0 Inserts)
% 0.15/0.33
% 0.15/0.33 Stopped by limit on number of solutions
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 -------------- Softie stats --------------
% 0.15/0.33
% 0.15/0.33 UPDATE_STOP: 300
% 0.15/0.33 SFINDER_TIME_LIMIT: 2
% 0.15/0.33 SHORT_CLAUSE_CUTOFF: 4
% 0.15/0.33 number of clauses in intial UL: 10
% 0.15/0.33 number of clauses initially in problem: 13
% 0.15/0.33 percentage of clauses intially in UL: 76
% 0.15/0.33 percentage of distinct symbols occuring in initial UL: 100
% 0.15/0.33 percent of all initial clauses that are short: 100
% 0.15/0.33 absolute distinct symbol count: 9
% 0.15/0.33 distinct predicate count: 3
% 0.15/0.33 distinct function count: 4
% 0.15/0.33 distinct constant count: 2
% 0.15/0.33
% 0.15/0.33 ---------- no more Softie stats ----------
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33
% 0.15/0.33 =========== start of search ===========
% 0.15/0.53
% 0.15/0.53 -------- PROOF --------
% 0.15/0.53 % SZS status Theorem
% 0.15/0.53 % SZS output start Refutation
% 0.15/0.53
% 0.15/0.53 Model 2 (0.00 seconds, 0 Inserts)
% 0.15/0.53
% 0.15/0.53 Stopped by limit on number of solutions
% 0.15/0.53
% 0.15/0.53 Model 3 (0.00 seconds, 0 Inserts)
% 0.15/0.53
% 0.15/0.53 Stopped by limit on number of solutions
% 0.15/0.53
% 0.15/0.53 Model 4 (0.00 seconds, 0 Inserts)
% 0.15/0.53
% 0.15/0.53 Stopped by limit on number of solutions
% 0.15/0.53
% 0.15/0.53 Stopped by limit on insertions
% 0.15/0.53
% 0.15/0.53 Model 5 [ 1 0 139 ] (0.00 seconds, 250000 Inserts)
% 0.15/0.53
% 0.15/0.53 Stopped by limit on insertions
% 0.15/0.53
% 0.15/0.53 Model 6 [ 1 1 127 ] (0.00 seconds, 250000 Inserts)
% 0.15/0.53
% 0.15/0.53 ----> UNIT CONFLICT at 0.20 sec ----> 62 [binary,60.1,4.1] {-} $F.
% 0.15/0.53
% 0.15/0.53 Length of proof is 10. Level of proof is 3.
% 0.15/0.53
% 0.15/0.53 ---------------- PROOF ----------------
% 0.15/0.53 % SZS status Theorem
% 0.15/0.53 % SZS output start Refutation
% 0.15/0.53
% 0.15/0.53 2 [] {+} -sorti2(A)| -sorti2(B)|sorti2(op2(A,B)).
% 0.15/0.53 3 [] {+} -sorti1(A)| -sorti1(B)|op1(A,B)=op1(B,A).
% 0.15/0.53 4 [] {+} op2($c2,$c1)!=op2($c1,$c2).
% 0.15/0.53 6 [] {+} -sorti2(A)|sorti1(j(A)).
% 0.15/0.53 7 [] {+} -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 0.15/0.53 8 [] {+} -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 0.15/0.53 9 [] {+} -sorti2(A)|h(j(A))=A.
% 0.15/0.53 11 [] {+} sorti2($c2).
% 0.15/0.53 12 [] {+} sorti2($c1).
% 0.15/0.53 15,14 [hyper,11,9] {+} h(j($c2))=$c2.
% 0.15/0.53 18 [hyper,11,6] {+} sorti1(j($c2)).
% 0.15/0.53 21,20 [hyper,12,9] {-} h(j($c1))=$c1.
% 0.15/0.53 27,26 [hyper,12,8,11] {+} j(op2($c1,$c2))=op1(j($c1),j($c2)).
% 0.15/0.53 28 [hyper,12,6] {+} sorti1(j($c1)).
% 0.15/0.53 31 [hyper,12,2,11] {+} sorti2(op2($c1,$c2)).
% 0.15/0.53 33,32 [hyper,31,9,demod,27] {+} h(op1(j($c1),j($c2)))=op2($c1,$c2).
% 0.15/0.53 55 [hyper,28,7,18,demod,15,21] {-} h(op1(j($c2),j($c1)))=op2($c2,$c1).
% 0.15/0.53 58,57 [hyper,28,3,18] {-} op1(j($c2),j($c1))=op1(j($c1),j($c2)).
% 0.15/0.53 60 [back_demod,55,demod,58,33,flip.1] {-} op2($c2,$c1)=op2($c1,$c2).
% 0.15/0.53 62 [binary,60.1,4.1] {-} $F.
% 0.15/0.53
% 0.15/0.53 % SZS output end Refutation
% 0.15/0.53 ------------ end of proof -------------
% 0.15/0.53
% 0.15/0.53
% 0.15/0.53 Search stopped by max_proofs option.
% 0.15/0.53
% 0.15/0.53
% 0.15/0.53 Search stopped by max_proofs option.
% 0.15/0.53
% 0.15/0.53 ============ end of search ============
% 0.15/0.53
% 0.15/0.53 ----------- soft-scott stats ----------
% 0.15/0.53
% 0.15/0.53 true clauses given 2 (28.6%)
% 0.15/0.53 false clauses given 5
% 0.15/0.53
% 0.15/0.53 FALSE TRUE
% 0.15/0.53 4 2 1
% 0.15/0.53 5 1 0
% 0.15/0.53 6 1 5
% 0.15/0.53 8 0 1
% 0.15/0.53 10 2 4
% 0.15/0.53 15 2 2
% 0.15/0.53 20 0 1
% 0.15/0.53 tot: 8 14 (63.6% true)
% 0.15/0.53
% 0.15/0.53
% 0.15/0.53 Model 6 [ 1 1 127 ] (0.00 seconds, 250000 Inserts)
% 0.15/0.53
% 0.15/0.53 That finishes the proof of the theorem.
% 0.15/0.53
% 0.15/0.53 Process 11805 finished Thu Jun 9 03:25:52 2022
%------------------------------------------------------------------------------