TSTP Solution File: GRP513-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP513-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n026.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:57:09 EDT 2022
% Result : Unsatisfiable 1.82s 2.03s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 equ; 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('GRP513-1.p',unknown),
[] ).
cnf(2,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B,
file('GRP513-1.p',unknown),
[] ).
cnf(6,plain,
multiply(A,multiply(B,inverse(multiply(A,multiply(multiply(B,C),inverse(multiply(D,C))))))) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.2.1,4.1.1')] ).
cnf(8,plain,
multiply(A,multiply(multiply(B,multiply(multiply(C,D),inverse(multiply(A,D)))),inverse(C))) = B,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.2.2.1,4.1.1')] ).
cnf(18,plain,
multiply(A,multiply(B,inverse(B))) = A,
inference(para_into,[status(thm),theory(equality)],[6,4]),
[iquote('para_into,6.1.1.2.2.1,4.1.1')] ).
cnf(22,plain,
multiply(A,multiply(B,inverse(A))) = B,
inference(para_from,[status(thm),theory(equality)],[18,6]),
[iquote('para_from,18.1.1,6.1.1.2.2.1')] ).
cnf(26,plain,
multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))) = A,
inference(para_from,[status(thm),theory(equality)],[22,6]),
[iquote('para_from,22.1.1,6.1.1.2.2.1')] ).
cnf(49,plain,
multiply(A,multiply(multiply(B,C),inverse(B))) = multiply(A,C),
inference(para_into,[status(thm),theory(equality)],[8,22]),
[iquote('para_into,8.1.1.2.1,22.1.1')] ).
cnf(64,plain,
multiply(multiply(A,multiply(B,inverse(multiply(B,C)))),C) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[26,26]),49]),
[iquote('para_into,26.1.1.2.2.1,26.1.1,demod,49')] ).
cnf(124,plain,
multiply(A,multiply(B,inverse(multiply(B,inverse(C))))) = multiply(A,C),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[64,49])]),
[iquote('para_from,64.1.1,48.1.1.2,flip.1')] ).
cnf(125,plain,
multiply(A,B) = multiply(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[64,22]),124]),
[iquote('para_from,64.1.1,22.1.1.2,demod,124')] ).
cnf(131,plain,
multiply(multiply(A,inverse(B)),B) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[125,22])]),
[iquote('para_into,125.1.1,22.1.1,flip.1')] ).
cnf(133,plain,
multiply(multiply(A,inverse(A)),B) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[125,18])]),
[iquote('para_into,125.1.1,18.1.1,flip.1')] ).
cnf(156,plain,
multiply(b1,inverse(b1)) != multiply(inverse(a1),a1),
inference(para_from,[status(thm),theory(equality)],[125,2]),
[iquote('para_from,125.1.1,2.1.1')] ).
cnf(210,plain,
multiply(inverse(A),A) = multiply(B,inverse(B)),
inference(para_from,[status(thm),theory(equality)],[133,131]),
[iquote('para_from,133.1.1,131.1.1.1')] ).
cnf(211,plain,
multiply(A,inverse(A)) = multiply(inverse(B),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[210])]),
[iquote('copy,210,flip.1')] ).
cnf(212,plain,
$false,
inference(binary,[status(thm)],[211,156]),
[iquote('binary,211.1,156.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP513-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n026.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:23:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.82/2.03 ----- Otter 3.3f, August 2004 -----
% 1.82/2.03 The process was started by sandbox on n026.cluster.edu,
% 1.82/2.03 Wed Jul 27 05:23:09 2022
% 1.82/2.03 The command was "./otter". The process ID is 27030.
% 1.82/2.03
% 1.82/2.03 set(prolog_style_variables).
% 1.82/2.03 set(auto).
% 1.82/2.03 dependent: set(auto1).
% 1.82/2.03 dependent: set(process_input).
% 1.82/2.03 dependent: clear(print_kept).
% 1.82/2.03 dependent: clear(print_new_demod).
% 1.82/2.03 dependent: clear(print_back_demod).
% 1.82/2.03 dependent: clear(print_back_sub).
% 1.82/2.03 dependent: set(control_memory).
% 1.82/2.03 dependent: assign(max_mem, 12000).
% 1.82/2.03 dependent: assign(pick_given_ratio, 4).
% 1.82/2.03 dependent: assign(stats_level, 1).
% 1.82/2.03 dependent: assign(max_seconds, 10800).
% 1.82/2.03 clear(print_given).
% 1.82/2.03
% 1.82/2.03 list(usable).
% 1.82/2.03 0 [] A=A.
% 1.82/2.03 0 [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.82/2.03 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 1.82/2.03 end_of_list.
% 1.82/2.03
% 1.82/2.03 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.82/2.03
% 1.82/2.03 All clauses are units, and equality is present; the
% 1.82/2.03 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.82/2.03
% 1.82/2.03 dependent: set(knuth_bendix).
% 1.82/2.03 dependent: set(anl_eq).
% 1.82/2.03 dependent: set(para_from).
% 1.82/2.03 dependent: set(para_into).
% 1.82/2.03 dependent: clear(para_from_right).
% 1.82/2.03 dependent: clear(para_into_right).
% 1.82/2.03 dependent: set(para_from_vars).
% 1.82/2.03 dependent: set(eq_units_both_ways).
% 1.82/2.03 dependent: set(dynamic_demod_all).
% 1.82/2.03 dependent: set(dynamic_demod).
% 1.82/2.03 dependent: set(order_eq).
% 1.82/2.03 dependent: set(back_demod).
% 1.82/2.03 dependent: set(lrpo).
% 1.82/2.03
% 1.82/2.03 ------------> process usable:
% 1.82/2.03 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 1.82/2.03
% 1.82/2.03 ------------> process sos:
% 1.82/2.03 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.82/2.03 ** KEPT (pick-wt=12): 4 [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.82/2.03 ---> New Demodulator: 5 [new_demod,4] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.82/2.03 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.82/2.03 >>>> Starting back demodulation with 5.
% 1.82/2.03
% 1.82/2.03 ======= end of input processing =======
% 1.82/2.03
% 1.82/2.03 =========== start of search ===========
% 1.82/2.03
% 1.82/2.03 -------- PROOF --------
% 1.82/2.03
% 1.82/2.03 ----> UNIT CONFLICT at 0.01 sec ----> 212 [binary,211.1,156.1] $F.
% 1.82/2.03
% 1.82/2.03 Length of proof is 15. Level of proof is 10.
% 1.82/2.03
% 1.82/2.03 ---------------- PROOF ----------------
% 1.82/2.03 % SZS status Unsatisfiable
% 1.82/2.03 % SZS output start Refutation
% See solution above
% 1.82/2.03 ------------ end of proof -------------
% 1.82/2.03
% 1.82/2.03
% 1.82/2.03 Search stopped by max_proofs option.
% 1.82/2.03
% 1.82/2.03
% 1.82/2.03 Search stopped by max_proofs option.
% 1.82/2.03
% 1.82/2.03 ============ end of search ============
% 1.82/2.03
% 1.82/2.03 -------------- statistics -------------
% 1.82/2.03 clauses given 13
% 1.82/2.03 clauses generated 200
% 1.82/2.03 clauses kept 113
% 1.82/2.03 clauses forward subsumed 173
% 1.82/2.03 clauses back subsumed 0
% 1.82/2.03 Kbytes malloced 1953
% 1.82/2.03
% 1.82/2.03 ----------- times (seconds) -----------
% 1.82/2.03 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.82/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.03 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.82/2.03
% 1.82/2.03 That finishes the proof of the theorem.
% 1.82/2.03
% 1.82/2.03 Process 27030 finished Wed Jul 27 05:23:10 2022
% 1.82/2.03 Otter interrupted
% 1.82/2.03 PROOF FOUND
%------------------------------------------------------------------------------