TSTP Solution File: ALG202+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-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 : 300s
% DateTime : Wed Jul 27 12:46:17 EDT 2022
% Result : Theorem 1.99s 2.15s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 12 RR)
% Number of literals : 17 ( 8 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ sorti1(A)
| op1(A,A) = A ),
file('ALG202+1.p',unknown),
[] ).
cnf(4,axiom,
op2(dollar_c1,dollar_c1) != dollar_c1,
file('ALG202+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ sorti2(A)
| sorti1(j(A)) ),
file('ALG202+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ sorti1(A)
| ~ sorti1(B)
| h(op1(A,B)) = op2(h(A),h(B)) ),
file('ALG202+1.p',unknown),
[] ).
cnf(9,axiom,
( ~ sorti2(A)
| h(j(A)) = A ),
file('ALG202+1.p',unknown),
[] ).
cnf(12,axiom,
sorti2(dollar_c1),
file('ALG202+1.p',unknown),
[] ).
cnf(14,plain,
h(j(dollar_c1)) = dollar_c1,
inference(hyper,[status(thm)],[12,9]),
[iquote('hyper,12,9')] ).
cnf(17,plain,
sorti1(j(dollar_c1)),
inference(hyper,[status(thm)],[12,6]),
[iquote('hyper,12,6')] ).
cnf(19,plain,
h(op1(j(dollar_c1),j(dollar_c1))) = op2(dollar_c1,dollar_c1),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[17,7,17]),14,14]),
[iquote('hyper,17,7,17,demod,14,14')] ).
cnf(22,plain,
op1(j(dollar_c1),j(dollar_c1)) = j(dollar_c1),
inference(hyper,[status(thm)],[17,3]),
[iquote('hyper,17,3')] ).
cnf(23,plain,
op2(dollar_c1,dollar_c1) = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),22,14])]),
[iquote('back_demod,19,demod,22,14,flip.1')] ).
cnf(25,plain,
$false,
inference(binary,[status(thm)],[23,4]),
[iquote('binary,23.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ALG202+1 : TPTP v8.1.0. Released v2.7.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 03:51:45 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.99/2.15 ----- Otter 3.3f, August 2004 -----
% 1.99/2.15 The process was started by sandbox on n025.cluster.edu,
% 1.99/2.15 Wed Jul 27 03:51:45 2022
% 1.99/2.15 The command was "./otter". The process ID is 12291.
% 1.99/2.15
% 1.99/2.15 set(prolog_style_variables).
% 1.99/2.15 set(auto).
% 1.99/2.15 dependent: set(auto1).
% 1.99/2.15 dependent: set(process_input).
% 1.99/2.15 dependent: clear(print_kept).
% 1.99/2.15 dependent: clear(print_new_demod).
% 1.99/2.15 dependent: clear(print_back_demod).
% 1.99/2.15 dependent: clear(print_back_sub).
% 1.99/2.15 dependent: set(control_memory).
% 1.99/2.15 dependent: assign(max_mem, 12000).
% 1.99/2.15 dependent: assign(pick_given_ratio, 4).
% 1.99/2.15 dependent: assign(stats_level, 1).
% 1.99/2.15 dependent: assign(max_seconds, 10800).
% 1.99/2.15 clear(print_given).
% 1.99/2.15
% 1.99/2.15 formula_list(usable).
% 1.99/2.15 all A (A=A).
% 1.99/2.15 all U (sorti1(U)-> (all V (sorti1(V)->sorti1(op1(U,V))))).
% 1.99/2.15 all U (sorti2(U)-> (all V (sorti2(V)->sorti2(op2(U,V))))).
% 1.99/2.15 all U (sorti1(U)->op1(U,U)=U).
% 1.99/2.15 -(all U (sorti2(U)->op2(U,U)=U)).
% 1.99/2.15 -((all U (sorti1(U)->sorti2(h(U))))& (all V (sorti2(V)->sorti1(j(V))))-> -((all W (sorti1(W)-> (all X (sorti1(X)->h(op1(W,X))=op2(h(W),h(X))))))& (all Y (sorti2(Y)-> (all Z (sorti2(Z)->j(op2(Y,Z))=op1(j(Y),j(Z))))))& (all X1 (sorti2(X1)->h(j(X1))=X1))& (all X2 (sorti1(X2)->j(h(X2))=X2)))).
% 1.99/2.15 end_of_list.
% 1.99/2.15
% 1.99/2.15 -------> usable clausifies to:
% 1.99/2.15
% 1.99/2.15 list(usable).
% 1.99/2.15 0 [] A=A.
% 1.99/2.15 0 [] -sorti1(U)| -sorti1(V)|sorti1(op1(U,V)).
% 1.99/2.15 0 [] -sorti2(U)| -sorti2(V)|sorti2(op2(U,V)).
% 1.99/2.15 0 [] -sorti1(U)|op1(U,U)=U.
% 1.99/2.15 0 [] sorti2($c1).
% 1.99/2.15 0 [] op2($c1,$c1)!=$c1.
% 1.99/2.15 0 [] -sorti1(U)|sorti2(h(U)).
% 1.99/2.15 0 [] -sorti2(V)|sorti1(j(V)).
% 1.99/2.15 0 [] -sorti1(W)| -sorti1(X)|h(op1(W,X))=op2(h(W),h(X)).
% 1.99/2.15 0 [] -sorti2(Y)| -sorti2(Z)|j(op2(Y,Z))=op1(j(Y),j(Z)).
% 1.99/2.15 0 [] -sorti2(X1)|h(j(X1))=X1.
% 1.99/2.15 0 [] -sorti1(X2)|j(h(X2))=X2.
% 1.99/2.15 end_of_list.
% 1.99/2.15
% 1.99/2.15 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.99/2.15
% 1.99/2.15 This is a Horn set with equality. The strategy will be
% 1.99/2.15 Knuth-Bendix and hyper_res, with positive clauses in
% 1.99/2.15 sos and nonpositive clauses in usable.
% 1.99/2.15
% 1.99/2.15 dependent: set(knuth_bendix).
% 1.99/2.15 dependent: set(anl_eq).
% 1.99/2.15 dependent: set(para_from).
% 1.99/2.15 dependent: set(para_into).
% 1.99/2.15 dependent: clear(para_from_right).
% 1.99/2.15 dependent: clear(para_into_right).
% 1.99/2.15 dependent: set(para_from_vars).
% 1.99/2.15 dependent: set(eq_units_both_ways).
% 1.99/2.15 dependent: set(dynamic_demod_all).
% 1.99/2.15 dependent: set(dynamic_demod).
% 1.99/2.15 dependent: set(order_eq).
% 1.99/2.15 dependent: set(back_demod).
% 1.99/2.15 dependent: set(lrpo).
% 1.99/2.15 dependent: set(hyper_res).
% 1.99/2.15 dependent: clear(order_hyper).
% 1.99/2.15
% 1.99/2.15 ------------> process usable:
% 1.99/2.15 ** KEPT (pick-wt=8): 1 [] -sorti1(A)| -sorti1(B)|sorti1(op1(A,B)).
% 1.99/2.15 ** KEPT (pick-wt=8): 2 [] -sorti2(A)| -sorti2(B)|sorti2(op2(A,B)).
% 1.99/2.15 ** KEPT (pick-wt=7): 3 [] -sorti1(A)|op1(A,A)=A.
% 1.99/2.15 ** KEPT (pick-wt=5): 4 [] op2($c1,$c1)!=$c1.
% 1.99/2.15 ** KEPT (pick-wt=5): 5 [] -sorti1(A)|sorti2(h(A)).
% 1.99/2.15 ** KEPT (pick-wt=5): 6 [] -sorti2(A)|sorti1(j(A)).
% 1.99/2.15 ** KEPT (pick-wt=14): 7 [] -sorti1(A)| -sorti1(B)|h(op1(A,B))=op2(h(A),h(B)).
% 1.99/2.15 ** KEPT (pick-wt=14): 8 [] -sorti2(A)| -sorti2(B)|j(op2(A,B))=op1(j(A),j(B)).
% 1.99/2.15 ** KEPT (pick-wt=7): 9 [] -sorti2(A)|h(j(A))=A.
% 1.99/2.15 ** KEPT (pick-wt=7): 10 [] -sorti1(A)|j(h(A))=A.
% 1.99/2.15
% 1.99/2.15 ------------> process sos:
% 1.99/2.15 ** KEPT (pick-wt=3): 11 [] A=A.
% 1.99/2.15 ** KEPT (pick-wt=2): 12 [] sorti2($c1).
% 1.99/2.15 Following clause subsumed by 11 during input processing: 0 [copy,11,flip.1] A=A.
% 1.99/2.15
% 1.99/2.15 ======= end of input processing =======
% 1.99/2.15
% 1.99/2.15 =========== start of search ===========
% 1.99/2.15
% 1.99/2.15 -------- PROOF --------
% 1.99/2.15
% 1.99/2.15 ----> UNIT CONFLICT at 0.00 sec ----> 25 [binary,23.1,4.1] $F.
% 1.99/2.15
% 1.99/2.15 Length of proof is 5. Level of proof is 3.
% 1.99/2.15
% 1.99/2.15 ---------------- PROOF ----------------
% 1.99/2.15 % SZS status Theorem
% 1.99/2.15 % SZS output start Refutation
% See solution above
% 1.99/2.15 ------------ end of proof -------------
% 1.99/2.15
% 1.99/2.15
% 1.99/2.15 Search stopped by max_proofs option.
% 1.99/2.15
% 1.99/2.15
% 1.99/2.15 Search stopped by max_proofs option.
% 1.99/2.15
% 1.99/2.15 ============ end of search ============
% 1.99/2.15
% 1.99/2.15 -------------- statistics -------------
% 1.99/2.15 clauses given 3
% 1.99/2.15 clauses generated 13
% 1.99/2.15 clauses kept 19
% 1.99/2.15 clauses forward subsumed 8
% 1.99/2.15 clauses back subsumed 0
% 1.99/2.15 Kbytes malloced 976
% 1.99/2.15
% 1.99/2.15 ----------- times (seconds) -----------
% 1.99/2.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.15 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.99/2.15
% 1.99/2.15 That finishes the proof of the theorem.
% 1.99/2.15
% 1.99/2.15 Process 12291 finished Wed Jul 27 03:51:47 2022
% 1.99/2.15 Otter interrupted
% 1.99/2.15 PROOF FOUND
%------------------------------------------------------------------------------