TSTP Solution File: GRP564-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP564-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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.96s 2.16s
% Output : Refutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 24 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 : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,b) != multiply(b,a),
file('GRP564-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(5,axiom,
divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B,
file('GRP564-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP564-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(divide(multiply(A,B),C),divide(A,C)) = B,
inference(para_into,[status(thm),theory(equality)],[5,7]),
[iquote('para_into,4.1.1.1.1,7.1.1')] ).
cnf(17,plain,
divide(divide(divide(divide(divide(A,inverse(B)),C),inverse(D)),divide(A,C)),B) = D,
inference(para_into,[status(thm),theory(equality)],[5,5]),
[iquote('para_into,4.1.1.2,4.1.1')] ).
cnf(19,plain,
divide(multiply(multiply(A,B),C),divide(A,inverse(C))) = B,
inference(para_into,[status(thm),theory(equality)],[9,7]),
[iquote('para_into,9.1.1.1,7.1.1')] ).
cnf(29,plain,
divide(A,divide(multiply(B,A),divide(B,inverse(C)))) = C,
inference(para_from,[status(thm),theory(equality)],[9,5]),
[iquote('para_from,9.1.1,4.1.1.1')] ).
cnf(31,plain,
divide(multiply(multiply(A,B),C),multiply(A,C)) = B,
inference(para_into,[status(thm),theory(equality)],[19,7]),
[iquote('para_into,19.1.1.2,7.1.1')] ).
cnf(39,plain,
divide(A,divide(multiply(B,A),multiply(B,C))) = C,
inference(para_from,[status(thm),theory(equality)],[31,9]),
[iquote('para_from,31.1.1,9.1.1.1')] ).
cnf(45,plain,
divide(A,divide(divide(B,inverse(A)),multiply(B,C))) = C,
inference(para_into,[status(thm),theory(equality)],[39,6]),
[iquote('para_into,39.1.1.2.1,6.1.1')] ).
cnf(49,plain,
divide(divide(multiply(A,B),divide(multiply(C,A),multiply(C,D))),D) = B,
inference(para_from,[status(thm),theory(equality)],[39,9]),
[iquote('para_from,39.1.1,9.1.1.2')] ).
cnf(189,plain,
multiply(divide(multiply(A,B),divide(multiply(C,A),multiply(C,inverse(D)))),D) = B,
inference(para_into,[status(thm),theory(equality)],[49,7]),
[iquote('para_into,49.1.1,7.1.1')] ).
cnf(233,plain,
divide(divide(A,inverse(B)),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,17]),5]),
[iquote('para_into,17.1.1.1.1,17.1.1,demod,5')] ).
cnf(305,plain,
divide(multiply(A,B),A) = B,
inference(para_into,[status(thm),theory(equality)],[233,7]),
[iquote('para_into,233.1.1.1,7.1.1')] ).
cnf(333,plain,
divide(A,divide(B,B)) = A,
inference(para_from,[status(thm),theory(equality)],[233,5]),
[iquote('para_from,233.1.1,4.1.1.1')] ).
cnf(373,plain,
multiply(divide(A,A),B) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[333,305])]),
[iquote('para_into,333.1.1,305.1.1,flip.1')] ).
cnf(376,plain,
divide(divide(A,A),inverse(B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[333,233])]),
[iquote('para_into,333.1.1,233.1.1,flip.1')] ).
cnf(383,plain,
divide(A,divide(A,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[373,45]),376]),
[iquote('para_from,373.1.1,45.1.1.2.2,demod,376')] ).
cnf(399,plain,
divide(multiply(A,B),multiply(A,C)) = divide(B,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[383,39])]),
[iquote('para_into,383.1.1.2,39.1.1,flip.1')] ).
cnf(405,plain,
divide(multiply(A,B),divide(A,inverse(C))) = divide(B,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[383,29])]),
[iquote('para_into,383.1.1.2,29.1.1,flip.1')] ).
cnf(439,plain,
multiply(divide(A,B),B) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[189]),399,405]),
[iquote('back_demod,189,demod,399,405')] ).
cnf(468,plain,
multiply(A,B) = multiply(B,A),
inference(para_into,[status(thm),theory(equality)],[439,305]),
[iquote('para_into,439.1.1.1,305.1.1')] ).
cnf(469,plain,
$false,
inference(binary,[status(thm)],[468,2]),
[iquote('binary,468.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP564-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:55:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.96/2.16 ----- Otter 3.3f, August 2004 -----
% 1.96/2.16 The process was started by sandbox on n023.cluster.edu,
% 1.96/2.16 Wed Jul 27 05:55:18 2022
% 1.96/2.16 The command was "./otter". The process ID is 8802.
% 1.96/2.16
% 1.96/2.16 set(prolog_style_variables).
% 1.96/2.16 set(auto).
% 1.96/2.16 dependent: set(auto1).
% 1.96/2.16 dependent: set(process_input).
% 1.96/2.16 dependent: clear(print_kept).
% 1.96/2.16 dependent: clear(print_new_demod).
% 1.96/2.16 dependent: clear(print_back_demod).
% 1.96/2.16 dependent: clear(print_back_sub).
% 1.96/2.16 dependent: set(control_memory).
% 1.96/2.16 dependent: assign(max_mem, 12000).
% 1.96/2.16 dependent: assign(pick_given_ratio, 4).
% 1.96/2.16 dependent: assign(stats_level, 1).
% 1.96/2.16 dependent: assign(max_seconds, 10800).
% 1.96/2.16 clear(print_given).
% 1.96/2.16
% 1.96/2.16 list(usable).
% 1.96/2.16 0 [] A=A.
% 1.96/2.16 0 [] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.96/2.16 0 [] multiply(A,B)=divide(A,inverse(B)).
% 1.96/2.16 0 [] multiply(a,b)!=multiply(b,a).
% 1.96/2.16 end_of_list.
% 1.96/2.16
% 1.96/2.16 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.96/2.16
% 1.96/2.16 All clauses are units, and equality is present; the
% 1.96/2.16 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.96/2.16
% 1.96/2.16 dependent: set(knuth_bendix).
% 1.96/2.16 dependent: set(anl_eq).
% 1.96/2.16 dependent: set(para_from).
% 1.96/2.16 dependent: set(para_into).
% 1.96/2.16 dependent: clear(para_from_right).
% 1.96/2.16 dependent: clear(para_into_right).
% 1.96/2.16 dependent: set(para_from_vars).
% 1.96/2.16 dependent: set(eq_units_both_ways).
% 1.96/2.16 dependent: set(dynamic_demod_all).
% 1.96/2.16 dependent: set(dynamic_demod).
% 1.96/2.16 dependent: set(order_eq).
% 1.96/2.16 dependent: set(back_demod).
% 1.96/2.16 dependent: set(lrpo).
% 1.96/2.16
% 1.96/2.16 ------------> process usable:
% 1.96/2.16 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] multiply(b,a)!=multiply(a,b).
% 1.96/2.16
% 1.96/2.16 ------------> process sos:
% 1.96/2.16 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.96/2.16 ** KEPT (pick-wt=12): 4 [] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.96/2.16 ---> New Demodulator: 5 [new_demod,4] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.96/2.16 ** KEPT (pick-wt=8): 6 [] multiply(A,B)=divide(A,inverse(B)).
% 1.96/2.16 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.96/2.16 >>>> Starting back demodulation with 5.
% 1.96/2.16 ** KEPT (pick-wt=8): 7 [copy,6,flip.1] divide(A,inverse(B))=multiply(A,B).
% 1.96/2.16 Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 1.96/2.16
% 1.96/2.16 ======= end of input processing =======
% 1.96/2.16
% 1.96/2.16 =========== start of search ===========
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Resetting weight limit to 13.
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Resetting weight limit to 13.
% 1.96/2.16
% 1.96/2.16 sos_size=149
% 1.96/2.16
% 1.96/2.16 -------- PROOF --------
% 1.96/2.16
% 1.96/2.16 ----> UNIT CONFLICT at 0.01 sec ----> 469 [binary,468.1,2.1] $F.
% 1.96/2.16
% 1.96/2.16 Length of proof is 21. Level of proof is 10.
% 1.96/2.16
% 1.96/2.16 ---------------- PROOF ----------------
% 1.96/2.16 % SZS status Unsatisfiable
% 1.96/2.16 % SZS output start Refutation
% See solution above
% 1.96/2.16 ------------ end of proof -------------
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Search stopped by max_proofs option.
% 1.96/2.16
% 1.96/2.16
% 1.96/2.16 Search stopped by max_proofs option.
% 1.96/2.16
% 1.96/2.16 ============ end of search ============
% 1.96/2.16
% 1.96/2.16 -------------- statistics -------------
% 1.96/2.16 clauses given 30
% 1.96/2.16 clauses generated 561
% 1.96/2.16 clauses kept 240
% 1.96/2.16 clauses forward subsumed 293
% 1.96/2.16 clauses back subsumed 0
% 1.96/2.16 Kbytes malloced 4882
% 1.96/2.16
% 1.96/2.16 ----------- times (seconds) -----------
% 1.96/2.16 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.96/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.96/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.96/2.16
% 1.96/2.16 That finishes the proof of the theorem.
% 1.96/2.16
% 1.96/2.16 Process 8802 finished Wed Jul 27 05:55:20 2022
% 1.96/2.16 Otter interrupted
% 1.96/2.16 PROOF FOUND
%------------------------------------------------------------------------------