TSTP Solution File: GRP117-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:56:05 EDT 2022
% Result : Unsatisfiable 1.69s 1.91s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 2 RR)
% Number of literals : 12 ( 11 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,identity) != a,
file('GRP117-1.p',unknown),
[] ).
cnf(3,axiom,
multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B,
file('GRP117-1.p',unknown),
[] ).
cnf(9,plain,
multiply(A,multiply(multiply(A,multiply(multiply(A,B),multiply(identity,multiply(multiply(identity,C),multiply(identity,C))))),C)) = B,
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.2,3.1.1')] ).
cnf(19,plain,
multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(multiply(identity,C),multiply(identity,C)))) = B,
inference(para_into,[status(thm),theory(equality)],[9,3]),
[iquote('para_into,9.1.1.2.1.2.2,3.1.1')] ).
cnf(24,plain,
multiply(multiply(A,B),multiply(identity,C)) = multiply(A,multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,3])]),
[iquote('para_into,9.1.1.2.1,3.1.1,flip.1')] ).
cnf(29,plain,
multiply(A,multiply(A,multiply(multiply(multiply(A,B),C),multiply(C,C)))) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),24,24]),
[iquote('back_demod,19,demod,24,24')] ).
cnf(52,plain,
multiply(A,multiply(A,multiply(A,multiply(B,identity)))) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,24]),24]),
[iquote('para_into,29.1.1.2.2,23.1.1,demod,24')] ).
cnf(68,plain,
multiply(multiply(A,B),multiply(multiply(A,B),multiply(A,multiply(B,identity)))) = identity,
inference(para_into,[status(thm),theory(equality)],[52,24]),
[iquote('para_into,51.1.1.2.2,23.1.1')] ).
cnf(99,plain,
multiply(identity,multiply(A,multiply(A,multiply(A,identity)))) = identity,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[68,24]),24]),
[iquote('para_into,68.1.1.2,23.1.1,demod,24')] ).
cnf(103,plain,
multiply(A,multiply(A,multiply(A,identity))) = identity,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[99,68]),99,52]),
[iquote('para_from,98.1.1,68.1.1.2.1,demod,99,52')] ).
cnf(153,plain,
multiply(A,identity) = A,
inference(para_from,[status(thm),theory(equality)],[103,52]),
[iquote('para_from,103.1.1,51.1.1.2')] ).
cnf(155,plain,
$false,
inference(binary,[status(thm)],[153,1]),
[iquote('binary,153.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 05:15:50 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.69/1.91 ----- Otter 3.3f, August 2004 -----
% 1.69/1.91 The process was started by sandbox2 on n022.cluster.edu,
% 1.69/1.91 Wed Jul 27 05:15:50 2022
% 1.69/1.91 The command was "./otter". The process ID is 15051.
% 1.69/1.91
% 1.69/1.91 set(prolog_style_variables).
% 1.69/1.91 set(auto).
% 1.69/1.91 dependent: set(auto1).
% 1.69/1.91 dependent: set(process_input).
% 1.69/1.91 dependent: clear(print_kept).
% 1.69/1.91 dependent: clear(print_new_demod).
% 1.69/1.91 dependent: clear(print_back_demod).
% 1.69/1.91 dependent: clear(print_back_sub).
% 1.69/1.91 dependent: set(control_memory).
% 1.69/1.91 dependent: assign(max_mem, 12000).
% 1.69/1.91 dependent: assign(pick_given_ratio, 4).
% 1.69/1.91 dependent: assign(stats_level, 1).
% 1.69/1.91 dependent: assign(max_seconds, 10800).
% 1.69/1.91 clear(print_given).
% 1.69/1.91
% 1.69/1.91 list(usable).
% 1.69/1.91 0 [] A=A.
% 1.69/1.91 0 [] multiply(X,multiply(multiply(X,multiply(multiply(X,Y),Z)),multiply(identity,multiply(Z,Z))))=Y.
% 1.69/1.91 0 [] multiply(a,identity)!=a.
% 1.69/1.91 end_of_list.
% 1.69/1.91
% 1.69/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.69/1.91
% 1.69/1.91 All clauses are units, and equality is present; the
% 1.69/1.91 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.69/1.91
% 1.69/1.91 dependent: set(knuth_bendix).
% 1.69/1.91 dependent: set(anl_eq).
% 1.69/1.91 dependent: set(para_from).
% 1.69/1.91 dependent: set(para_into).
% 1.69/1.91 dependent: clear(para_from_right).
% 1.69/1.91 dependent: clear(para_into_right).
% 1.69/1.91 dependent: set(para_from_vars).
% 1.69/1.91 dependent: set(eq_units_both_ways).
% 1.69/1.91 dependent: set(dynamic_demod_all).
% 1.69/1.91 dependent: set(dynamic_demod).
% 1.69/1.91 dependent: set(order_eq).
% 1.69/1.91 dependent: set(back_demod).
% 1.69/1.91 dependent: set(lrpo).
% 1.69/1.91
% 1.69/1.91 ------------> process usable:
% 1.69/1.91 ** KEPT (pick-wt=5): 1 [] multiply(a,identity)!=a.
% 1.69/1.91
% 1.69/1.91 ------------> process sos:
% 1.69/1.91 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.69/1.91 ** KEPT (pick-wt=17): 3 [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))))=B.
% 1.69/1.91 ---> New Demodulator: 4 [new_demod,3] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))))=B.
% 1.69/1.91 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.69/1.91 >>>> Starting back demodulation with 4.
% 1.69/1.91
% 1.69/1.91 ======= end of input processing =======
% 1.69/1.91
% 1.69/1.91 =========== start of search ===========
% 1.69/1.91
% 1.69/1.91 -------- PROOF --------
% 1.69/1.91
% 1.69/1.91 ----> UNIT CONFLICT at 0.01 sec ----> 155 [binary,153.1,1.1] $F.
% 1.69/1.91
% 1.69/1.91 Length of proof is 9. Level of proof is 8.
% 1.69/1.91
% 1.69/1.91 ---------------- PROOF ----------------
% 1.69/1.91 % SZS status Unsatisfiable
% 1.69/1.91 % SZS output start Refutation
% See solution above
% 1.69/1.91 ------------ end of proof -------------
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91
% 1.69/1.91 Search stopped by max_proofs option.
% 1.69/1.91
% 1.69/1.91 ============ end of search ============
% 1.69/1.91
% 1.69/1.91 -------------- statistics -------------
% 1.69/1.91 clauses given 12
% 1.69/1.91 clauses generated 110
% 1.69/1.91 clauses kept 97
% 1.69/1.91 clauses forward subsumed 98
% 1.69/1.91 clauses back subsumed 2
% 1.69/1.91 Kbytes malloced 1953
% 1.69/1.91
% 1.69/1.91 ----------- times (seconds) -----------
% 1.69/1.91 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.69/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.69/1.91
% 1.69/1.91 That finishes the proof of the theorem.
% 1.69/1.91
% 1.69/1.91 Process 15051 finished Wed Jul 27 05:15:52 2022
% 1.69/1.91 Otter interrupted
% 1.69/1.91 PROOF FOUND
%------------------------------------------------------------------------------