TSTP Solution File: GRP554-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP554-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:14 EDT 2022
% Result : Unsatisfiable 1.68s 1.92s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 19 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('GRP554-1.p',unknown),
[] ).
cnf(3,axiom,
divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B,
file('GRP554-1.p',unknown),
[] ).
cnf(5,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP554-1.p',unknown),
[] ).
cnf(6,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(7,plain,
divide(multiply(inverse(b2),b2),inverse(a2)) != a2,
inference(para_from,[status(thm),theory(equality)],[5,1]),
[iquote('para_from,5.1.1,1.1.1')] ).
cnf(10,plain,
divide(divide(A,inverse(divide(B,multiply(A,C)))),inverse(C)) = B,
inference(para_into,[status(thm),theory(equality)],[3,6]),
[iquote('para_into,3.1.1.1.2.1.2,6.1.1')] ).
cnf(12,plain,
divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),C) = D,
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.1.2.1.2,3.1.1')] ).
cnf(16,plain,
divide(multiply(A,divide(B,divide(A,C))),C) = B,
inference(para_into,[status(thm),theory(equality)],[3,6]),
[iquote('para_into,3.1.1.1,6.1.1')] ).
cnf(22,plain,
divide(multiply(A,divide(B,multiply(A,C))),inverse(C)) = B,
inference(para_into,[status(thm),theory(equality)],[16,6]),
[iquote('para_into,16.1.1.1.2.2,6.1.1')] ).
cnf(39,plain,
multiply(multiply(A,divide(B,multiply(A,C))),C) = B,
inference(para_into,[status(thm),theory(equality)],[22,6]),
[iquote('para_into,22.1.1,6.1.1')] ).
cnf(49,plain,
multiply(divide(A,inverse(divide(B,multiply(A,C)))),C) = B,
inference(para_into,[status(thm),theory(equality)],[39,5]),
[iquote('para_into,39.1.1.1,5.1.1')] ).
cnf(131,plain,
divide(A,inverse(divide(B,A))) = B,
inference(para_into,[status(thm),theory(equality)],[12,3]),
[iquote('para_into,12.1.1.1,3.1.1')] ).
cnf(165,plain,
divide(A,inverse(divide(B,multiply(A,C)))) = divide(inverse(C),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[131,10])]),
[iquote('para_into,131.1.1.2.1,10.1.1,flip.1')] ).
cnf(169,plain,
divide(A,inverse(divide(B,divide(A,C)))) = divide(C,inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[131,3])]),
[iquote('para_into,131.1.1.2.1,3.1.1,flip.1')] ).
cnf(198,plain,
multiply(divide(inverse(A),inverse(B)),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[49]),165]),
[iquote('back_demod,49,demod,165')] ).
cnf(210,plain,
divide(divide(A,inverse(B)),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),169]),
[iquote('back_demod,3,demod,169')] ).
cnf(235,plain,
divide(multiply(A,B),A) = B,
inference(para_into,[status(thm),theory(equality)],[210,6]),
[iquote('para_into,210.1.1.1,6.1.1')] ).
cnf(256,plain,
multiply(divide(A,B),C) = divide(multiply(A,C),B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[235,16])]),
[iquote('para_from,235.1.1,16.1.1.1.2,flip.1')] ).
cnf(261,plain,
divide(multiply(inverse(A),A),inverse(B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[198]),256]),
[iquote('back_demod,198,demod,256')] ).
cnf(263,plain,
$false,
inference(binary,[status(thm)],[261,7]),
[iquote('binary,261.1,7.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP554-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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:02:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.92 ----- Otter 3.3f, August 2004 -----
% 1.68/1.92 The process was started by sandbox on n012.cluster.edu,
% 1.68/1.92 Wed Jul 27 05:02:05 2022
% 1.68/1.92 The command was "./otter". The process ID is 25577.
% 1.68/1.92
% 1.68/1.92 set(prolog_style_variables).
% 1.68/1.92 set(auto).
% 1.68/1.92 dependent: set(auto1).
% 1.68/1.92 dependent: set(process_input).
% 1.68/1.92 dependent: clear(print_kept).
% 1.68/1.92 dependent: clear(print_new_demod).
% 1.68/1.92 dependent: clear(print_back_demod).
% 1.68/1.92 dependent: clear(print_back_sub).
% 1.68/1.92 dependent: set(control_memory).
% 1.68/1.92 dependent: assign(max_mem, 12000).
% 1.68/1.92 dependent: assign(pick_given_ratio, 4).
% 1.68/1.92 dependent: assign(stats_level, 1).
% 1.68/1.92 dependent: assign(max_seconds, 10800).
% 1.68/1.92 clear(print_given).
% 1.68/1.92
% 1.68/1.92 list(usable).
% 1.68/1.92 0 [] A=A.
% 1.68/1.92 0 [] divide(divide(A,inverse(divide(B,divide(A,C)))),C)=B.
% 1.68/1.92 0 [] multiply(A,B)=divide(A,inverse(B)).
% 1.68/1.92 0 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.68/1.92 end_of_list.
% 1.68/1.92
% 1.68/1.92 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.68/1.92
% 1.68/1.92 All clauses are units, and equality is present; the
% 1.68/1.92 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.68/1.92
% 1.68/1.92 dependent: set(knuth_bendix).
% 1.68/1.92 dependent: set(anl_eq).
% 1.68/1.92 dependent: set(para_from).
% 1.68/1.92 dependent: set(para_into).
% 1.68/1.92 dependent: clear(para_from_right).
% 1.68/1.92 dependent: clear(para_into_right).
% 1.68/1.92 dependent: set(para_from_vars).
% 1.68/1.92 dependent: set(eq_units_both_ways).
% 1.68/1.92 dependent: set(dynamic_demod_all).
% 1.68/1.92 dependent: set(dynamic_demod).
% 1.68/1.92 dependent: set(order_eq).
% 1.68/1.92 dependent: set(back_demod).
% 1.68/1.92 dependent: set(lrpo).
% 1.68/1.92
% 1.68/1.92 ------------> process usable:
% 1.68/1.92 ** KEPT (pick-wt=8): 1 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.68/1.92
% 1.68/1.92 ------------> process sos:
% 1.68/1.92 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.68/1.92 ** KEPT (pick-wt=12): 3 [] divide(divide(A,inverse(divide(B,divide(A,C)))),C)=B.
% 1.68/1.92 ---> New Demodulator: 4 [new_demod,3] divide(divide(A,inverse(divide(B,divide(A,C)))),C)=B.
% 1.68/1.92 ** KEPT (pick-wt=8): 5 [] multiply(A,B)=divide(A,inverse(B)).
% 1.68/1.92 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.68/1.92 >>>> Starting back demodulation with 4.
% 1.68/1.92 ** KEPT (pick-wt=8): 6 [copy,5,flip.1] divide(A,inverse(B))=multiply(A,B).
% 1.68/1.92 Following clause subsumed by 5 during input processing: 0 [copy,6,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 1.68/1.92
% 1.68/1.92 ======= end of input processing =======
% 1.68/1.92
% 1.68/1.92 =========== start of search ===========
% 1.68/1.92
% 1.68/1.92 -------- PROOF --------
% 1.68/1.92
% 1.68/1.92 ----> UNIT CONFLICT at 0.01 sec ----> 263 [binary,261.1,7.1] $F.
% 1.68/1.92
% 1.68/1.92 Length of proof is 16. Level of proof is 7.
% 1.68/1.92
% 1.68/1.92 ---------------- PROOF ----------------
% 1.68/1.92 % SZS status Unsatisfiable
% 1.68/1.92 % SZS output start Refutation
% See solution above
% 1.68/1.92 ------------ end of proof -------------
% 1.68/1.92
% 1.68/1.92
% 1.68/1.92 Search stopped by max_proofs option.
% 1.68/1.92
% 1.68/1.92
% 1.68/1.92 Search stopped by max_proofs option.
% 1.68/1.92
% 1.68/1.92 ============ end of search ============
% 1.68/1.92
% 1.68/1.92 -------------- statistics -------------
% 1.68/1.92 clauses given 20
% 1.68/1.92 clauses generated 282
% 1.68/1.92 clauses kept 169
% 1.68/1.92 clauses forward subsumed 236
% 1.68/1.92 clauses back subsumed 0
% 1.68/1.92 Kbytes malloced 2929
% 1.68/1.92
% 1.68/1.92 ----------- times (seconds) -----------
% 1.68/1.92 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.68/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.92 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.92
% 1.68/1.92 That finishes the proof of the theorem.
% 1.68/1.92
% 1.68/1.92 Process 25577 finished Wed Jul 27 05:02:07 2022
% 1.68/1.92 Otter interrupted
% 1.68/1.92 PROOF FOUND
%------------------------------------------------------------------------------