TSTP Solution File: GRP472-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP472-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:04 EDT 2022
% Result : Unsatisfiable 2.31s 2.49s
% Output : Refutation 2.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 3
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 4 RR)
% Number of literals : 36 ( 35 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 120 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('GRP472-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,
divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C)) = B,
file('GRP472-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP472-1.p',unknown),
[] ).
cnf(7,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(8,plain,
divide(inverse(b1),inverse(b1)) != multiply(inverse(a1),a1),
inference(para_from,[status(thm),theory(equality)],[6,2]),
[iquote('para_from,6.1.1,2.1.1')] ).
cnf(9,plain,
divide(divide(inverse(multiply(A,B)),divide(divide(C,D),A)),divide(D,C)) = inverse(B),
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.1.1.1,7.1.1')] ).
cnf(12,plain,
divide(divide(inverse(A),divide(divide(B,C),divide(inverse(divide(D,A)),divide(divide(E,F),D)))),divide(C,B)) = divide(F,E),
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.1.1.1,4.1.1')] ).
cnf(14,plain,
divide(divide(inverse(divide(A,B)),divide(multiply(C,D),A)),divide(inverse(D),C)) = B,
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.1.2.1,7.1.1')] ).
cnf(17,plain,
divide(divide(inverse(divide(inverse(A),B)),multiply(divide(C,D),A)),divide(D,C)) = B,
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.1.2,7.1.1')] ).
cnf(19,plain,
divide(divide(inverse(divide(divide(A,B),C)),D),divide(divide(divide(B,A),E),inverse(divide(E,D)))) = C,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.1.2,4.1.1')] ).
cnf(21,plain,
divide(divide(inverse(divide(A,B)),divide(divide(inverse(C),D),A)),multiply(D,C)) = B,
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.2,7.1.1')] ).
cnf(63,plain,
divide(divide(inverse(divide(A,B)),divide(divide(divide(inverse(C),D),divide(inverse(divide(E,F)),divide(multiply(D,C),E))),A)),F) = B,
inference(para_from,[status(thm),theory(equality)],[14,4]),
[iquote('para_from,13.1.1,4.1.1.2')] ).
cnf(111,plain,
divide(divide(inverse(A),divide(divide(inverse(B),C),divide(inverse(divide(inverse(D),A)),multiply(divide(E,F),D)))),multiply(C,B)) = divide(F,E),
inference(para_into,[status(thm),theory(equality)],[21,17]),
[iquote('para_into,21.1.1.1.1.1,17.1.1')] ).
cnf(123,plain,
divide(divide(inverse(divide(divide(A,B),C)),inverse(D)),multiply(divide(divide(B,A),E),multiply(E,D))) = C,
inference(para_into,[status(thm),theory(equality)],[21,9]),
[iquote('para_into,21.1.1.1.2,9.1.1')] ).
cnf(204,plain,
divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(divide(E,F),D))))) = divide(E,F),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,12]),12])]),
[iquote('para_into,11.1.1.1.2.2.2.1,11.1.1,demod,12,flip.1')] ).
cnf(665,plain,
divide(multiply(inverse(divide(divide(A,B),C)),D),multiply(divide(divide(B,A),E),multiply(E,D))) = C,
inference(para_into,[status(thm),theory(equality)],[123,7]),
[iquote('para_into,123.1.1.1,7.1.1')] ).
cnf(673,plain,
divide(multiply(inverse(divide(divide(A,B),C)),D),multiply(multiply(divide(B,A),E),multiply(inverse(E),D))) = C,
inference(para_into,[status(thm),theory(equality)],[665,7]),
[iquote('para_into,665.1.1.2.1,7.1.1')] ).
cnf(698,plain,
divide(multiply(inverse(divide(divide(A,B),C)),D),divide(multiply(divide(B,A),E),inverse(multiply(inverse(E),D)))) = C,
inference(para_into,[status(thm),theory(equality)],[673,6]),
[iquote('para_into,673.1.1.2,6.1.1')] ).
cnf(699,plain,
divide(divide(A,B),divide(inverse(C),divide(divide(B,A),divide(inverse(divide(D,C)),divide(E,D))))) = E,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[204,698]),698]),
[iquote('para_into,204.1.1.2.2.2.2.1,697.1.1,demod,698')] ).
cnf(717,plain,
divide(divide(inverse(divide(divide(inverse(A),divide(B,divide(inverse(divide(C,A)),divide(D,C)))),E)),D),B) = E,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[699,63]),14]),
[iquote('para_from,699.1.1,63.1.1.1.2,demod,14')] ).
cnf(869,plain,
divide(divide(inverse(divide(A,B)),divide(B,A)),divide(C,D)) = divide(D,C),
inference(para_into,[status(thm),theory(equality)],[717,12]),
[iquote('para_into,717.1.1.1.1.1,11.1.1')] ).
cnf(887,plain,
divide(inverse(divide(A,divide(B,divide(C,D)))),divide(divide(D,C),A)) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[869,19])]),
[iquote('para_into,869.1.1,19.1.1,flip.1')] ).
cnf(891,plain,
divide(divide(A,B),divide(inverse(divide(C,D)),divide(D,C))) = divide(A,B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[869,111]),111])]),
[iquote('para_from,869.1.1,110.1.1.1.2.2.2.1,demod,111,flip.1')] ).
cnf(897,plain,
divide(inverse(divide(divide(A,B),C)),divide(B,A)) = C,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[887,869]),891]),
[iquote('para_into,887.1.1.1.1,869.1.1,demod,891')] ).
cnf(899,plain,
divide(A,divide(divide(B,C),inverse(divide(C,B)))) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[887,869]),897]),
[iquote('para_into,887.1.1.2,869.1.1,demod,897')] ).
cnf(909,plain,
inverse(divide(A,B)) = divide(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[897,869]),899]),
[iquote('para_into,896.1.1.1.1,869.1.1,demod,899')] ).
cnf(952,plain,
divide(A,divide(divide(B,C),divide(B,C))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[899]),909]),
[iquote('back_demod,898,demod,909')] ).
cnf(1044,plain,
divide(A,divide(B,B)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[952,952]),952]),
[iquote('para_into,951.1.1.2.1,951.1.1,demod,952')] ).
cnf(1050,plain,
divide(A,multiply(inverse(B),B)) = A,
inference(para_into,[status(thm),theory(equality)],[1044,7]),
[iquote('para_into,1044.1.1.2,7.1.1')] ).
cnf(1054,plain,
inverse(A) = divide(divide(B,B),A),
inference(para_from,[status(thm),theory(equality)],[1044,909]),
[iquote('para_from,1044.1.1,908.1.1.1')] ).
cnf(1057,plain,
divide(divide(A,A),B) = inverse(B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1054])]),
[iquote('copy,1054,flip.1')] ).
cnf(1085,plain,
divide(A,A) = divide(B,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[1057,1044]),909]),
[iquote('para_into,1057.1.1,1044.1.1,demod,909')] ).
cnf(1126,plain,
multiply(inverse(A),A) = divide(B,B),
inference(para_into,[status(thm),theory(equality)],[1085,1050]),
[iquote('para_into,1085.1.1,1050.1.1')] ).
cnf(1128,plain,
divide(A,A) = multiply(inverse(B),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1126])]),
[iquote('copy,1126,flip.1')] ).
cnf(1129,plain,
$false,
inference(binary,[status(thm)],[1128,8]),
[iquote('binary,1128.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP472-1 : TPTP v8.1.0. Released v2.6.0.
% 0.00/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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:13:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.31/2.49 ----- Otter 3.3f, August 2004 -----
% 2.31/2.49 The process was started by sandbox on n003.cluster.edu,
% 2.31/2.49 Wed Jul 27 05:13:41 2022
% 2.31/2.49 The command was "./otter". The process ID is 32196.
% 2.31/2.49
% 2.31/2.49 set(prolog_style_variables).
% 2.31/2.49 set(auto).
% 2.31/2.49 dependent: set(auto1).
% 2.31/2.49 dependent: set(process_input).
% 2.31/2.49 dependent: clear(print_kept).
% 2.31/2.49 dependent: clear(print_new_demod).
% 2.31/2.49 dependent: clear(print_back_demod).
% 2.31/2.49 dependent: clear(print_back_sub).
% 2.31/2.49 dependent: set(control_memory).
% 2.31/2.49 dependent: assign(max_mem, 12000).
% 2.31/2.49 dependent: assign(pick_given_ratio, 4).
% 2.31/2.49 dependent: assign(stats_level, 1).
% 2.31/2.49 dependent: assign(max_seconds, 10800).
% 2.31/2.49 clear(print_given).
% 2.31/2.49
% 2.31/2.49 list(usable).
% 2.31/2.49 0 [] A=A.
% 2.31/2.49 0 [] divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C))=B.
% 2.31/2.49 0 [] multiply(A,B)=divide(A,inverse(B)).
% 2.31/2.49 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 2.31/2.49 end_of_list.
% 2.31/2.49
% 2.31/2.49 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.31/2.49
% 2.31/2.49 All clauses are units, and equality is present; the
% 2.31/2.49 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.31/2.49
% 2.31/2.49 dependent: set(knuth_bendix).
% 2.31/2.49 dependent: set(anl_eq).
% 2.31/2.49 dependent: set(para_from).
% 2.31/2.49 dependent: set(para_into).
% 2.31/2.49 dependent: clear(para_from_right).
% 2.31/2.49 dependent: clear(para_into_right).
% 2.31/2.49 dependent: set(para_from_vars).
% 2.31/2.49 dependent: set(eq_units_both_ways).
% 2.31/2.49 dependent: set(dynamic_demod_all).
% 2.31/2.49 dependent: set(dynamic_demod).
% 2.31/2.49 dependent: set(order_eq).
% 2.31/2.49 dependent: set(back_demod).
% 2.31/2.49 dependent: set(lrpo).
% 2.31/2.49
% 2.31/2.49 ------------> process usable:
% 2.31/2.49 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 2.31/2.49
% 2.31/2.49 ------------> process sos:
% 2.31/2.49 ** KEPT (pick-wt=3): 3 [] A=A.
% 2.31/2.49 ** KEPT (pick-wt=16): 4 [] divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C))=B.
% 2.31/2.49 ---> New Demodulator: 5 [new_demod,4] divide(divide(inverse(divide(A,B)),divide(divide(C,D),A)),divide(D,C))=B.
% 2.31/2.49 ** KEPT (pick-wt=8): 6 [] multiply(A,B)=divide(A,inverse(B)).
% 2.31/2.49 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 2.31/2.49 >>>> Starting back demodulation with 5.
% 2.31/2.49 ** KEPT (pick-wt=8): 7 [copy,6,flip.1] divide(A,inverse(B))=multiply(A,B).
% 2.31/2.49 Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 2.31/2.49
% 2.31/2.49 ======= end of input processing =======
% 2.31/2.49
% 2.31/2.49 =========== start of search ===========
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 22.
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 22.
% 2.31/2.49
% 2.31/2.49 sos_size=353
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 21.
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 21.
% 2.31/2.49
% 2.31/2.49 sos_size=344
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 18.
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Resetting weight limit to 18.
% 2.31/2.49
% 2.31/2.49 sos_size=366
% 2.31/2.49
% 2.31/2.49 -------- PROOF --------
% 2.31/2.49
% 2.31/2.49 ----> UNIT CONFLICT at 0.56 sec ----> 1129 [binary,1128.1,8.1] $F.
% 2.31/2.49
% 2.31/2.49 Length of proof is 32. Level of proof is 20.
% 2.31/2.49
% 2.31/2.49 ---------------- PROOF ----------------
% 2.31/2.49 % SZS status Unsatisfiable
% 2.31/2.49 % SZS output start Refutation
% See solution above
% 2.31/2.49 ------------ end of proof -------------
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Search stopped by max_proofs option.
% 2.31/2.49
% 2.31/2.49
% 2.31/2.49 Search stopped by max_proofs option.
% 2.31/2.49
% 2.31/2.49 ============ end of search ============
% 2.31/2.49
% 2.31/2.49 -------------- statistics -------------
% 2.31/2.49 clauses given 229
% 2.31/2.49 clauses generated 76004
% 2.31/2.49 clauses kept 710
% 2.31/2.49 clauses forward subsumed 4006
% 2.31/2.49 clauses back subsumed 9
% 2.31/2.49 Kbytes malloced 8789
% 2.31/2.49
% 2.31/2.49 ----------- times (seconds) -----------
% 2.31/2.49 user CPU time 0.56 (0 hr, 0 min, 0 sec)
% 2.31/2.49 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.31/2.49 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.31/2.49
% 2.31/2.49 That finishes the proof of the theorem.
% 2.31/2.49
% 2.31/2.49 Process 32196 finished Wed Jul 27 05:13:43 2022
% 2.31/2.49 Otter interrupted
% 2.31/2.49 PROOF FOUND
%------------------------------------------------------------------------------