TSTP Solution File: GRP409-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP409-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:57 EDT 2022
% Result : Unsatisfiable 1.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 4 RR)
% Number of literals : 14 ( 13 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 3 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 : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('GRP409-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(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C))) = B,
file('GRP409-1.p',unknown),
[] ).
cnf(6,plain,
multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(inverse(multiply(inverse(C),C))))),inverse(multiply(inverse(inverse(multiply(inverse(C),C))),inverse(multiply(inverse(C),C))))) = multiply(inverse(multiply(D,inverse(multiply(B,C)))),multiply(D,inverse(C))),
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.1.1.1.2.1,4.1.1')] ).
cnf(10,plain,
multiply(multiply(inverse(multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(D,multiply(inverse(C),C))))),B),inverse(multiply(inverse(multiply(inverse(C),C)),multiply(inverse(C),C)))) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.1.2,4.1.1')] ).
cnf(89,plain,
multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))) = multiply(inverse(multiply(D,inverse(multiply(B,C)))),multiply(D,inverse(C))),
inference(para_into,[status(thm),theory(equality)],[6,6]),
[iquote('para_into,6.1.1,6.1.1')] ).
cnf(91,plain,
multiply(inverse(multiply(A,inverse(multiply(multiply(B,inverse(multiply(inverse(C),C))),C)))),multiply(A,inverse(C))) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[6,4])]),
[iquote('para_into,6.1.1,4.1.1,flip.1')] ).
cnf(128,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,inverse(D))))) = multiply(inverse(multiply(E,inverse(B))),multiply(E,inverse(multiply(C,inverse(D))))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[89,91]),91]),
[iquote('para_into,89.1.1.1.1.2.1,90.1.1,demod,91')] ).
cnf(133,plain,
multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))) = multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[128,10]),10]),
[iquote('para_into,128.1.1.2.2.1,9.1.1,demod,10')] ).
cnf(138,plain,
multiply(inverse(A),multiply(multiply(inverse(multiply(B,inverse(multiply(A,C)))),multiply(B,inverse(C))),inverse(D))) = multiply(inverse(multiply(E,inverse(multiply(inverse(C),C)))),multiply(E,inverse(D))),
inference(para_into,[status(thm),theory(equality)],[133,4]),
[iquote('para_into,133.1.1.1.1,4.1.1')] ).
cnf(158,plain,
multiply(inverse(A),A) = multiply(inverse(multiply(B,inverse(multiply(inverse(C),C)))),multiply(B,inverse(multiply(inverse(C),C)))),
inference(para_into,[status(thm),theory(equality)],[138,4]),
[iquote('para_into,138.1.1.2,4.1.1')] ).
cnf(160,plain,
multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B)))) = multiply(inverse(C),C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[158])]),
[iquote('copy,158,flip.1')] ).
cnf(188,plain,
multiply(inverse(multiply(A,inverse(multiply(inverse(B),B)))),multiply(A,inverse(multiply(inverse(B),B)))) != multiply(inverse(a1),a1),
inference(para_from,[status(thm),theory(equality)],[158,2]),
[iquote('para_from,158.1.1,2.1.1')] ).
cnf(189,plain,
$false,
inference(binary,[status(thm)],[188,160]),
[iquote('binary,188.1,160.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP409-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 05:09:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox2 on n014.cluster.edu,
% 1.68/1.89 Wed Jul 27 05:09:09 2022
% 1.68/1.89 The command was "./otter". The process ID is 14089.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] A=A.
% 1.68/1.89 0 [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C)))=B.
% 1.68/1.89 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.68/1.89
% 1.68/1.89 All clauses are units, and equality is present; the
% 1.68/1.89 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.68/1.89
% 1.68/1.89 dependent: set(knuth_bendix).
% 1.68/1.89 dependent: set(anl_eq).
% 1.68/1.89 dependent: set(para_from).
% 1.68/1.89 dependent: set(para_into).
% 1.68/1.89 dependent: clear(para_from_right).
% 1.68/1.89 dependent: clear(para_into_right).
% 1.68/1.89 dependent: set(para_from_vars).
% 1.68/1.89 dependent: set(eq_units_both_ways).
% 1.68/1.89 dependent: set(dynamic_demod_all).
% 1.68/1.89 dependent: set(dynamic_demod).
% 1.68/1.89 dependent: set(order_eq).
% 1.68/1.89 dependent: set(back_demod).
% 1.68/1.89 dependent: set(lrpo).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.68/1.89 ** KEPT (pick-wt=20): 4 [] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C)))=B.
% 1.68/1.89 ---> New Demodulator: 5 [new_demod,4] multiply(multiply(inverse(multiply(A,inverse(multiply(B,C)))),multiply(A,inverse(C))),inverse(multiply(inverse(C),C)))=B.
% 1.68/1.89 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.68/1.89 >>>> Starting back demodulation with 5.
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Resetting weight limit to 44.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Resetting weight limit to 44.
% 1.68/1.89
% 1.68/1.89 sos_size=60
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 ----> UNIT CONFLICT at 0.01 sec ----> 189 [binary,188.1,160.1] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 11. Level of proof is 7.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Unsatisfiable
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 13
% 1.68/1.89 clauses generated 310
% 1.68/1.89 clauses kept 123
% 1.68/1.89 clauses forward subsumed 118
% 1.68/1.89 clauses back subsumed 18
% 1.68/1.89 Kbytes malloced 6835
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 14089 finished Wed Jul 27 05:09:10 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------