TSTP Solution File: GRP560-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:15 EDT 2022
% Result : Unsatisfiable 1.90s 2.11s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 16 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,b) != multiply(b,a),
file('GRP560-1.p',unknown),
[] ).
cnf(2,plain,
multiply(b,a) != multiply(a,b),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(4,axiom,
divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B,
file('GRP560-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP560-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(9,plain,
divide(A,inverse(divide(multiply(B,C),divide(A,inverse(C))))) = B,
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.2.1.1,7.1.1')] ).
cnf(11,plain,
divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.2.1.1,4.1.1')] ).
cnf(21,plain,
divide(A,inverse(divide(multiply(B,C),multiply(A,C)))) = B,
inference(para_into,[status(thm),theory(equality)],[9,7]),
[iquote('para_into,9.1.1.2.1.2,7.1.1')] ).
cnf(25,plain,
multiply(A,divide(multiply(B,C),divide(A,inverse(C)))) = B,
inference(para_into,[status(thm),theory(equality)],[9,7]),
[iquote('para_into,9.1.1,7.1.1')] ).
cnf(43,plain,
multiply(A,divide(multiply(B,C),multiply(A,C))) = B,
inference(para_into,[status(thm),theory(equality)],[21,7]),
[iquote('para_into,21.1.1,7.1.1')] ).
cnf(89,plain,
divide(A,inverse(divide(B,B))) = A,
inference(para_into,[status(thm),theory(equality)],[11,4]),
[iquote('para_into,11.1.1.2.1.2,4.1.1')] ).
cnf(106,plain,
multiply(A,divide(B,B)) = A,
inference(para_into,[status(thm),theory(equality)],[89,7]),
[iquote('para_into,89.1.1,7.1.1')] ).
cnf(111,plain,
multiply(A,divide(B,A)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[89,25]),106]),
[iquote('para_from,89.1.1,25.1.1.2.2,demod,106')] ).
cnf(118,plain,
multiply(inverse(divide(A,A)),B) = B,
inference(para_into,[status(thm),theory(equality)],[111,89]),
[iquote('para_into,111.1.1.2,89.1.1')] ).
cnf(198,plain,
divide(multiply(A,B),B) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[118,43]),118])]),
[iquote('para_into,117.1.1,43.1.1,demod,118,flip.1')] ).
cnf(230,plain,
multiply(A,B) = multiply(B,A),
inference(para_from,[status(thm),theory(equality)],[198,111]),
[iquote('para_from,198.1.1,111.1.1.2')] ).
cnf(231,plain,
$false,
inference(binary,[status(thm)],[230,2]),
[iquote('binary,230.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP560-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n013.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:14:15 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.90/2.11 ----- Otter 3.3f, August 2004 -----
% 1.90/2.11 The process was started by sandbox on n013.cluster.edu,
% 1.90/2.11 Wed Jul 27 05:14:15 2022
% 1.90/2.11 The command was "./otter". The process ID is 662.
% 1.90/2.11
% 1.90/2.11 set(prolog_style_variables).
% 1.90/2.11 set(auto).
% 1.90/2.11 dependent: set(auto1).
% 1.90/2.11 dependent: set(process_input).
% 1.90/2.11 dependent: clear(print_kept).
% 1.90/2.11 dependent: clear(print_new_demod).
% 1.90/2.11 dependent: clear(print_back_demod).
% 1.90/2.11 dependent: clear(print_back_sub).
% 1.90/2.11 dependent: set(control_memory).
% 1.90/2.11 dependent: assign(max_mem, 12000).
% 1.90/2.11 dependent: assign(pick_given_ratio, 4).
% 1.90/2.11 dependent: assign(stats_level, 1).
% 1.90/2.11 dependent: assign(max_seconds, 10800).
% 1.90/2.11 clear(print_given).
% 1.90/2.11
% 1.90/2.11 list(usable).
% 1.90/2.11 0 [] A=A.
% 1.90/2.11 0 [] divide(A,inverse(divide(divide(B,C),divide(A,C))))=B.
% 1.90/2.11 0 [] multiply(A,B)=divide(A,inverse(B)).
% 1.90/2.11 0 [] multiply(a,b)!=multiply(b,a).
% 1.90/2.11 end_of_list.
% 1.90/2.11
% 1.90/2.11 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.90/2.11
% 1.90/2.11 All clauses are units, and equality is present; the
% 1.90/2.11 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.90/2.11
% 1.90/2.11 dependent: set(knuth_bendix).
% 1.90/2.11 dependent: set(anl_eq).
% 1.90/2.11 dependent: set(para_from).
% 1.90/2.11 dependent: set(para_into).
% 1.90/2.11 dependent: clear(para_from_right).
% 1.90/2.11 dependent: clear(para_into_right).
% 1.90/2.11 dependent: set(para_from_vars).
% 1.90/2.11 dependent: set(eq_units_both_ways).
% 1.90/2.11 dependent: set(dynamic_demod_all).
% 1.90/2.11 dependent: set(dynamic_demod).
% 1.90/2.11 dependent: set(order_eq).
% 1.90/2.11 dependent: set(back_demod).
% 1.90/2.11 dependent: set(lrpo).
% 1.90/2.11
% 1.90/2.11 ------------> process usable:
% 1.90/2.11 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] multiply(b,a)!=multiply(a,b).
% 1.90/2.11
% 1.90/2.11 ------------> process sos:
% 1.90/2.11 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.90/2.11 ** KEPT (pick-wt=12): 4 [] divide(A,inverse(divide(divide(B,C),divide(A,C))))=B.
% 1.90/2.11 ---> New Demodulator: 5 [new_demod,4] divide(A,inverse(divide(divide(B,C),divide(A,C))))=B.
% 1.90/2.11 ** KEPT (pick-wt=8): 6 [] multiply(A,B)=divide(A,inverse(B)).
% 1.90/2.11 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.90/2.11 >>>> Starting back demodulation with 5.
% 1.90/2.11 ** KEPT (pick-wt=8): 7 [copy,6,flip.1] divide(A,inverse(B))=multiply(A,B).
% 1.90/2.11 Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 1.90/2.11
% 1.90/2.11 ======= end of input processing =======
% 1.90/2.11
% 1.90/2.11 =========== start of search ===========
% 1.90/2.11
% 1.90/2.11 -------- PROOF --------
% 1.90/2.11
% 1.90/2.11 ----> UNIT CONFLICT at 0.00 sec ----> 231 [binary,230.1,2.1] $F.
% 1.90/2.11
% 1.90/2.11 Length of proof is 13. Level of proof is 7.
% 1.90/2.11
% 1.90/2.11 ---------------- PROOF ----------------
% 1.90/2.11 % SZS status Unsatisfiable
% 1.90/2.11 % SZS output start Refutation
% See solution above
% 1.90/2.11 ------------ end of proof -------------
% 1.90/2.11
% 1.90/2.11
% 1.90/2.11 Search stopped by max_proofs option.
% 1.90/2.11
% 1.90/2.11
% 1.90/2.11 Search stopped by max_proofs option.
% 1.90/2.11
% 1.90/2.11 ============ end of search ============
% 1.90/2.11
% 1.90/2.11 -------------- statistics -------------
% 1.90/2.11 clauses given 20
% 1.90/2.11 clauses generated 286
% 1.90/2.11 clauses kept 124
% 1.90/2.11 clauses forward subsumed 183
% 1.90/2.11 clauses back subsumed 0
% 1.90/2.11 Kbytes malloced 2929
% 1.90/2.11
% 1.90/2.11 ----------- times (seconds) -----------
% 1.90/2.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.90/2.11 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.90/2.11
% 1.90/2.11 That finishes the proof of the theorem.
% 1.90/2.11
% 1.90/2.11 Process 662 finished Wed Jul 27 05:14:16 2022
% 1.90/2.11 Otter interrupted
% 1.90/2.11 PROOF FOUND
%------------------------------------------------------------------------------