TSTP Solution File: GRP091-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP091-1 : TPTP v8.1.0. Bugfixed 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:56:02 EDT 2022
% Result : Unsatisfiable 2.00s 2.21s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 26 unt; 0 nHn; 6 RR)
% Number of literals : 46 ( 45 equ; 20 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(a4,b4) != multiply(b4,a4) ),
file('GRP091-1.p',unknown),
[] ).
cnf(2,plain,
( multiply(inverse(b1),b1) != multiply(inverse(a1),a1)
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(b4,a4) != multiply(a4,b4) ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])])]),
[iquote('copy,1,flip.1,flip.4')] ).
cnf(3,axiom,
A = A,
file('GRP091-1.p',unknown),
[] ).
cnf(4,axiom,
divide(divide(A,divide(divide(A,B),C)),B) = C,
file('GRP091-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
file('GRP091-1.p',unknown),
[] ).
cnf(7,axiom,
inverse(A) = divide(divide(B,B),A),
file('GRP091-1.p',unknown),
[] ).
cnf(8,axiom,
identity = divide(A,A),
file('GRP091-1.p',unknown),
[] ).
cnf(10,plain,
divide(A,A) = identity,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(12,plain,
multiply(A,B) = divide(A,divide(identity,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),10])]),
[iquote('copy,6,flip.1,demod,10,flip.1')] ).
cnf(14,plain,
inverse(A) = divide(identity,A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),10])]),
[iquote('copy,7,flip.1,demod,10,flip.1')] ).
cnf(15,plain,
( identity != identity
| divide(identity,divide(identity,a2)) != a2
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),14,12,10,14,12,10,14,12,10,12,12,12,12,12,12,12])]),
[iquote('back_demod,2,demod,14,12,10,14,12,10,14,12,10,12,12,12,12,12,12,12,flip.4')] ).
cnf(16,plain,
divide(divide(A,divide(identity,B)),A) = B,
inference(para_into,[status(thm),theory(equality)],[4,10]),
[iquote('para_into,4.1.1.1.2.1,9.1.1')] ).
cnf(27,plain,
divide(identity,divide(identity,A)) = A,
inference(para_into,[status(thm),theory(equality)],[16,10]),
[iquote('para_into,16.1.1.1,9.1.1')] ).
cnf(30,plain,
( identity != identity
| a2 != a2
| divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3))))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),27]),
[iquote('back_demod,15,demod,27')] ).
cnf(31,plain,
divide(divide(A,B),divide(identity,B)) = A,
inference(para_from,[status(thm),theory(equality)],[16,4]),
[iquote('para_from,16.1.1,4.1.1.1.2')] ).
cnf(36,plain,
divide(A,identity) = A,
inference(para_from,[status(thm),theory(equality)],[27,16]),
[iquote('para_from,26.1.1,16.1.1.1')] ).
cnf(37,plain,
divide(divide(A,B),A) = divide(identity,B),
inference(para_from,[status(thm),theory(equality)],[27,16]),
[iquote('para_from,26.1.1,16.1.1.1.2')] ).
cnf(42,plain,
divide(A,divide(A,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[36,4]),36])]),
[iquote('para_into,35.1.1,4.1.1,demod,36,flip.1')] ).
cnf(45,plain,
divide(divide(A,B),C) = divide(divide(A,C),B),
inference(para_from,[status(thm),theory(equality)],[42,4]),
[iquote('para_from,41.1.1,4.1.1.1.2')] ).
cnf(67,plain,
divide(divide(A,divide(identity,B)),B) = A,
inference(para_into,[status(thm),theory(equality)],[31,42]),
[iquote('para_into,31.1.1.2,41.1.1')] ).
cnf(72,plain,
divide(A,B) = divide(identity,divide(B,A)),
inference(para_into,[status(thm),theory(equality)],[37,42]),
[iquote('para_into,37.1.1.1,41.1.1')] ).
cnf(77,plain,
divide(identity,divide(A,B)) = divide(B,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[72])]),
[iquote('copy,72,flip.1')] ).
cnf(122,plain,
divide(divide(A,divide(B,C)),divide(C,B)) = A,
inference(para_from,[status(thm),theory(equality)],[77,67]),
[iquote('para_from,77.1.1,67.1.1.1.2')] ).
cnf(134,plain,
divide(divide(A,B),C) = divide(identity,divide(B,divide(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[45,72])]),
[iquote('para_into,45.1.1,72.1.1,flip.1')] ).
cnf(146,plain,
divide(A,divide(B,divide(C,divide(A,B)))) = C,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[122]),134,134,42]),
[iquote('back_demod,122,demod,134,134,42')] ).
cnf(156,plain,
( identity != identity
| a2 != a2
| divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(b3,divide(identity,divide(a3,divide(identity,c3))))
| divide(a4,divide(identity,b4)) != divide(b4,divide(identity,a4)) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[30]),134,134,42])]),
[iquote('back_demod,30,demod,134,134,42,flip.3')] ).
cnf(173,plain,
divide(A,B) = divide(C,divide(B,divide(A,C))),
inference(para_from,[status(thm),theory(equality)],[146,42]),
[iquote('para_from,146.1.1,41.1.1.2')] ).
cnf(175,plain,
divide(A,divide(B,divide(C,A))) = divide(C,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[173])]),
[iquote('copy,173,flip.1')] ).
cnf(199,plain,
divide(A,divide(B,C)) = divide(C,divide(B,A)),
inference(para_from,[status(thm),theory(equality)],[175,42]),
[iquote('para_from,175.1.1,41.1.1.2')] ).
cnf(229,plain,
divide(A,divide(B,divide(C,D))) = divide(C,divide(B,divide(A,D))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[199,134]),134,134,42,134,42]),
[iquote('para_from,199.1.1,133.1.1.1,demod,134,134,42,134,42')] ).
cnf(976,plain,
$false,
inference(hyper,[status(thm)],[229,156,3,3,199]),
[iquote('hyper,229,156,3,3,199')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP091-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:27:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.00/2.21 ----- Otter 3.3f, August 2004 -----
% 2.00/2.21 The process was started by sandbox2 on n025.cluster.edu,
% 2.00/2.21 Wed Jul 27 05:27:30 2022
% 2.00/2.21 The command was "./otter". The process ID is 30602.
% 2.00/2.21
% 2.00/2.21 set(prolog_style_variables).
% 2.00/2.21 set(auto).
% 2.00/2.21 dependent: set(auto1).
% 2.00/2.21 dependent: set(process_input).
% 2.00/2.21 dependent: clear(print_kept).
% 2.00/2.21 dependent: clear(print_new_demod).
% 2.00/2.21 dependent: clear(print_back_demod).
% 2.00/2.21 dependent: clear(print_back_sub).
% 2.00/2.21 dependent: set(control_memory).
% 2.00/2.21 dependent: assign(max_mem, 12000).
% 2.00/2.21 dependent: assign(pick_given_ratio, 4).
% 2.00/2.21 dependent: assign(stats_level, 1).
% 2.00/2.21 dependent: assign(max_seconds, 10800).
% 2.00/2.21 clear(print_given).
% 2.00/2.21
% 2.00/2.21 list(usable).
% 2.00/2.21 0 [] A=A.
% 2.00/2.21 0 [] divide(divide(X,divide(divide(X,Y),Z)),Y)=Z.
% 2.00/2.21 0 [] multiply(X,Y)=divide(X,divide(divide(Z,Z),Y)).
% 2.00/2.21 0 [] inverse(X)=divide(divide(Z,Z),X).
% 2.00/2.21 0 [] identity=divide(X,X).
% 2.00/2.21 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1)|multiply(multiply(inverse(b2),b2),a2)!=a2|multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(a4,b4)!=multiply(b4,a4).
% 2.00/2.21 end_of_list.
% 2.00/2.21
% 2.00/2.21 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=4.
% 2.00/2.21
% 2.00/2.21 This is a Horn set with equality. The strategy will be
% 2.00/2.21 Knuth-Bendix and hyper_res, with positive clauses in
% 2.00/2.21 sos and nonpositive clauses in usable.
% 2.00/2.21
% 2.00/2.21 dependent: set(knuth_bendix).
% 2.00/2.21 dependent: set(anl_eq).
% 2.00/2.21 dependent: set(para_from).
% 2.00/2.21 dependent: set(para_into).
% 2.00/2.21 dependent: clear(para_from_right).
% 2.00/2.21 dependent: clear(para_into_right).
% 2.00/2.21 dependent: set(para_from_vars).
% 2.00/2.21 dependent: set(eq_units_both_ways).
% 2.00/2.21 dependent: set(dynamic_demod_all).
% 2.00/2.21 dependent: set(dynamic_demod).
% 2.00/2.21 dependent: set(order_eq).
% 2.00/2.21 dependent: set(back_demod).
% 2.00/2.21 dependent: set(lrpo).
% 2.00/2.21 dependent: set(hyper_res).
% 2.00/2.21 dependent: clear(order_hyper).
% 2.00/2.21
% 2.00/2.21 ------------> process usable:
% 2.00/2.21 ** KEPT (pick-wt=35): 2 [copy,1,flip.1,flip.4] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1)|multiply(multiply(inverse(b2),b2),a2)!=a2|multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3))|multiply(b4,a4)!=multiply(a4,b4).
% 2.00/2.21
% 2.00/2.21 ------------> process sos:
% 2.00/2.21 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.00/2.21 ** KEPT (pick-wt=11): 4 [] divide(divide(A,divide(divide(A,B),C)),B)=C.
% 2.00/2.21 ---> New Demodulator: 5 [new_demod,4] divide(divide(A,divide(divide(A,B),C)),B)=C.
% 2.00/2.21 ** KEPT (pick-wt=11): 6 [] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 2.00/2.21 ** KEPT (pick-wt=8): 7 [] inverse(A)=divide(divide(B,B),A).
% 2.00/2.21 ** KEPT (pick-wt=5): 9 [copy,8,flip.1] divide(A,A)=identity.
% 2.00/2.21 ---> New Demodulator: 10 [new_demod,9] divide(A,A)=identity.
% 2.00/2.21 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.00/2.21 >>>> Starting back demodulation with 5.
% 2.00/2.21 ** KEPT (pick-wt=9): 11 [copy,6,flip.1,demod,10,flip.1] multiply(A,B)=divide(A,divide(identity,B)).
% 2.00/2.21 ---> New Demodulator: 12 [new_demod,11] multiply(A,B)=divide(A,divide(identity,B)).
% 2.00/2.21 ** KEPT (pick-wt=6): 13 [copy,7,flip.1,demod,10,flip.1] inverse(A)=divide(identity,A).
% 2.00/2.21 ---> New Demodulator: 14 [new_demod,13] inverse(A)=divide(identity,A).
% 2.00/2.21 >>>> Starting back demodulation with 10.
% 2.00/2.21 >> back demodulating 7 with 10.
% 2.00/2.21 >> back demodulating 6 with 10.
% 2.00/2.21 >>>> Starting back demodulation with 12.
% 2.00/2.21 >> back demodulating 2 with 12.
% 2.00/2.21 >>>> Starting back demodulation with 14.
% 2.00/2.21
% 2.00/2.21 ======= end of input processing =======
% 2.00/2.21
% 2.00/2.21 =========== start of search ===========
% 2.00/2.21
% 2.00/2.21 -------- PROOF --------
% 2.00/2.21
% 2.00/2.21 -----> EMPTY CLAUSE at 0.08 sec ----> 976 [hyper,229,156,3,3,199] $F.
% 2.00/2.21
% 2.00/2.21 Length of proof is 24. Level of proof is 13.
% 2.00/2.21
% 2.00/2.21 ---------------- PROOF ----------------
% 2.00/2.21 % SZS status Unsatisfiable
% 2.00/2.21 % SZS output start Refutation
% See solution above
% 2.00/2.21 ------------ end of proof -------------
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21
% 2.00/2.21 Search stopped by max_proofs option.
% 2.00/2.21
% 2.00/2.21 ============ end of search ============
% 2.00/2.21
% 2.00/2.21 -------------- statistics -------------
% 2.00/2.21 clauses given 52
% 2.00/2.21 clauses generated 3107
% 2.00/2.21 clauses kept 831
% 2.00/2.21 clauses forward subsumed 3065
% 2.00/2.21 clauses back subsumed 106
% 2.00/2.21 Kbytes malloced 1953
% 2.00/2.21
% 2.00/2.21 ----------- times (seconds) -----------
% 2.00/2.21 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 2.00/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.21
% 2.00/2.21 That finishes the proof of the theorem.
% 2.00/2.21
% 2.00/2.21 Process 30602 finished Wed Jul 27 05:27:32 2022
% 2.00/2.21 Otter interrupted
% 2.00/2.21 PROOF FOUND
%------------------------------------------------------------------------------