TSTP Solution File: GRP704-12 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP704-12 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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:42 EDT 2022
% Result : Unsatisfiable 1.29s 1.81s
% Output : Refutation 1.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 6 RR)
% Number of literals : 20 ( 19 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(x4,mult(op_f,x5)) != mult(mult(x4,op_f),x5),
file('GRP704-12.p',unknown),
[] ).
cnf(2,plain,
mult(mult(x4,op_f),x5) != mult(x4,mult(op_f,x5)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(3,axiom,
A = A,
file('GRP704-12.p',unknown),
[] ).
cnf(5,axiom,
mult(A,ld(A,B)) = B,
file('GRP704-12.p',unknown),
[] ).
cnf(12,axiom,
mult(A,unit) = A,
file('GRP704-12.p',unknown),
[] ).
cnf(14,axiom,
mult(unit,A) = A,
file('GRP704-12.p',unknown),
[] ).
cnf(25,axiom,
mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
file('GRP704-12.p',unknown),
[] ).
cnf(27,plain,
mult(mult(A,op_c),B) = mult(A,mult(op_c,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[25])]),
[iquote('copy,25,flip.1')] ).
cnf(28,axiom,
op_d = ld(A,mult(op_c,A)),
file('GRP704-12.p',unknown),
[] ).
cnf(29,plain,
ld(A,mult(op_c,A)) = op_d,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[28])]),
[iquote('copy,28,flip.1')] ).
cnf(34,axiom,
op_f = mult(A,mult(B,ld(mult(A,B),op_c))),
file('GRP704-12.p',unknown),
[] ).
cnf(35,plain,
mult(A,mult(B,ld(mult(A,B),op_c))) = op_f,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[34])]),
[iquote('copy,34,flip.1')] ).
cnf(38,plain,
ld(unit,A) = A,
inference(para_into,[status(thm),theory(equality)],[5,14]),
[iquote('para_into,4.1.1,14.1.1')] ).
cnf(66,plain,
op_d = op_c,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,12]),38])]),
[iquote('para_into,29.1.1.2,12.1.1,demod,38,flip.1')] ).
cnf(67,plain,
ld(ld(op_c,A),A) = op_c,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,5]),66]),
[iquote('para_into,29.1.1.2,4.1.1,demod,66')] ).
cnf(81,plain,
mult(ld(op_c,A),op_c) = A,
inference(para_from,[status(thm),theory(equality)],[67,5]),
[iquote('para_from,67.1.1,4.1.1.2')] ).
cnf(106,plain,
mult(ld(op_c,A),mult(op_c,B)) = mult(A,B),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[27,81])]),
[iquote('para_into,26.1.1.1,81.1.1,flip.1')] ).
cnf(146,plain,
op_f = op_c,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[35,81]),106,5])]),
[iquote('para_into,35.1.1.2.2.1,81.1.1,demod,106,5,flip.1')] ).
cnf(169,plain,
mult(x4,mult(op_c,x5)) != mult(x4,mult(op_c,x5)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),146,27,146]),
[iquote('back_demod,2,demod,146,27,146')] ).
cnf(170,plain,
$false,
inference(binary,[status(thm)],[169,3]),
[iquote('binary,169.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP704-12 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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:04:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.29/1.80 ----- Otter 3.3f, August 2004 -----
% 1.29/1.80 The process was started by sandbox on n007.cluster.edu,
% 1.29/1.80 Wed Jul 27 05:04:01 2022
% 1.29/1.80 The command was "./otter". The process ID is 2544.
% 1.29/1.80
% 1.29/1.80 set(prolog_style_variables).
% 1.29/1.80 set(auto).
% 1.29/1.80 dependent: set(auto1).
% 1.29/1.80 dependent: set(process_input).
% 1.29/1.80 dependent: clear(print_kept).
% 1.29/1.80 dependent: clear(print_new_demod).
% 1.29/1.80 dependent: clear(print_back_demod).
% 1.29/1.80 dependent: clear(print_back_sub).
% 1.29/1.80 dependent: set(control_memory).
% 1.29/1.80 dependent: assign(max_mem, 12000).
% 1.29/1.80 dependent: assign(pick_given_ratio, 4).
% 1.29/1.80 dependent: assign(stats_level, 1).
% 1.29/1.80 dependent: assign(max_seconds, 10800).
% 1.29/1.80 clear(print_given).
% 1.29/1.80
% 1.29/1.80 list(usable).
% 1.29/1.80 0 [] A=A.
% 1.29/1.80 0 [] mult(A,ld(A,B))=B.
% 1.29/1.80 0 [] ld(A,mult(A,B))=B.
% 1.29/1.80 0 [] mult(rd(A,B),B)=A.
% 1.29/1.80 0 [] rd(mult(A,B),B)=A.
% 1.29/1.80 0 [] mult(A,unit)=A.
% 1.29/1.80 0 [] mult(unit,A)=A.
% 1.29/1.80 0 [] mult(A,mult(B,mult(B,C)))=mult(mult(mult(A,B),B),C).
% 1.29/1.80 0 [] mult(op_c,mult(A,B))=mult(mult(op_c,A),B).
% 1.29/1.80 0 [] mult(A,mult(B,op_c))=mult(mult(A,B),op_c).
% 1.29/1.80 0 [] mult(A,mult(op_c,B))=mult(mult(A,op_c),B).
% 1.29/1.80 0 [] op_d=ld(A,mult(op_c,A)).
% 1.29/1.80 0 [] op_e=mult(mult(rd(op_c,mult(A,B)),B),A).
% 1.29/1.80 0 [] op_f=mult(A,mult(B,ld(mult(A,B),op_c))).
% 1.29/1.80 0 [] mult(x4,mult(op_f,x5))!=mult(mult(x4,op_f),x5).
% 1.29/1.80 end_of_list.
% 1.29/1.80
% 1.29/1.80 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.29/1.80
% 1.29/1.80 All clauses are units, and equality is present; the
% 1.29/1.80 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.29/1.80
% 1.29/1.80 dependent: set(knuth_bendix).
% 1.29/1.80 dependent: set(anl_eq).
% 1.29/1.80 dependent: set(para_from).
% 1.29/1.80 dependent: set(para_into).
% 1.29/1.80 dependent: clear(para_from_right).
% 1.29/1.80 dependent: clear(para_into_right).
% 1.29/1.80 dependent: set(para_from_vars).
% 1.29/1.80 dependent: set(eq_units_both_ways).
% 1.29/1.80 dependent: set(dynamic_demod_all).
% 1.29/1.80 dependent: set(dynamic_demod).
% 1.29/1.80 dependent: set(order_eq).
% 1.29/1.80 dependent: set(back_demod).
% 1.29/1.80 dependent: set(lrpo).
% 1.29/1.80
% 1.29/1.80 ------------> process usable:
% 1.29/1.80 ** KEPT (pick-wt=11): 2 [copy,1,flip.1] mult(mult(x4,op_f),x5)!=mult(x4,mult(op_f,x5)).
% 1.29/1.80
% 1.29/1.80 ------------> process sos:
% 1.29/1.80 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.29/1.80 ** KEPT (pick-wt=7): 4 [] mult(A,ld(A,B))=B.
% 1.29/1.80 ---> New Demodulator: 5 [new_demod,4] mult(A,ld(A,B))=B.
% 1.29/1.80 ** KEPT (pick-wt=7): 6 [] ld(A,mult(A,B))=B.
% 1.29/1.80 ---> New Demodulator: 7 [new_demod,6] ld(A,mult(A,B))=B.
% 1.29/1.80 ** KEPT (pick-wt=7): 8 [] mult(rd(A,B),B)=A.
% 1.29/1.80 ---> New Demodulator: 9 [new_demod,8] mult(rd(A,B),B)=A.
% 1.29/1.80 ** KEPT (pick-wt=7): 10 [] rd(mult(A,B),B)=A.
% 1.29/1.80 ---> New Demodulator: 11 [new_demod,10] rd(mult(A,B),B)=A.
% 1.29/1.80 ** KEPT (pick-wt=5): 12 [] mult(A,unit)=A.
% 1.29/1.80 ---> New Demodulator: 13 [new_demod,12] mult(A,unit)=A.
% 1.29/1.80 ** KEPT (pick-wt=5): 14 [] mult(unit,A)=A.
% 1.29/1.80 ---> New Demodulator: 15 [new_demod,14] mult(unit,A)=A.
% 1.29/1.80 ** KEPT (pick-wt=15): 17 [copy,16,flip.1] mult(mult(mult(A,B),B),C)=mult(A,mult(B,mult(B,C))).
% 1.29/1.80 ---> New Demodulator: 18 [new_demod,17] mult(mult(mult(A,B),B),C)=mult(A,mult(B,mult(B,C))).
% 1.29/1.80 ** KEPT (pick-wt=11): 20 [copy,19,flip.1] mult(mult(op_c,A),B)=mult(op_c,mult(A,B)).
% 1.29/1.80 ---> New Demodulator: 21 [new_demod,20] mult(mult(op_c,A),B)=mult(op_c,mult(A,B)).
% 1.29/1.80 ** KEPT (pick-wt=11): 23 [copy,22,flip.1] mult(mult(A,B),op_c)=mult(A,mult(B,op_c)).
% 1.29/1.80 ---> New Demodulator: 24 [new_demod,23] mult(mult(A,B),op_c)=mult(A,mult(B,op_c)).
% 1.29/1.80 ** KEPT (pick-wt=11): 26 [copy,25,flip.1] mult(mult(A,op_c),B)=mult(A,mult(op_c,B)).
% 1.29/1.80 ---> New Demodulator: 27 [new_demod,26] mult(mult(A,op_c),B)=mult(A,mult(op_c,B)).
% 1.29/1.80 ** KEPT (pick-wt=7): 29 [copy,28,flip.1] ld(A,mult(op_c,A))=op_d.
% 1.29/1.80 ---> New Demodulator: 30 [new_demod,29] ld(A,mult(op_c,A))=op_d.
% 1.29/1.80 ** KEPT (pick-wt=11): 32 [copy,31,flip.1] mult(mult(rd(op_c,mult(A,B)),B),A)=op_e.
% 1.29/1.80 ---> New Demodulator: 33 [new_demod,32] mult(mult(rd(op_c,mult(A,B)),B),A)=op_e.
% 1.29/1.80 ** KEPT (pick-wt=11): 35 [copy,34,flip.1] mult(A,mult(B,ld(mult(A,B),op_c)))=op_f.
% 1.29/1.80 ---> New Demodulator: 36 [new_demod,35] mult(A,mult(B,ld(mult(A,B),op_c)))=op_f.
% 1.29/1.80 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.29/1.80 >>>> Starting back demodulation with 5.
% 1.29/1.80 >>>> Starting back demodulation with 7.
% 1.29/1.80 >>>> Starting back demodulation with 9.
% 1.29/1.80 >>>> Starting back demodulation with 11.
% 1.29/1.80 >>>> Starting back demodulation with 13.
% 1.29/1.80 >>>> Starting back demodulation with 15.
% 1.29/1.80 >>>> Starting back demodulation with 18.
% 1.29/1.80 >>>> Starting back demodulation with 21.
% 1.29/1.81 >>>> Starting back demodulation with 24.
% 1.29/1.81 >>>> Starting back demodulation with 27.
% 1.29/1.81 >>>> Starting back demodulation with 30.
% 1.29/1.81 >>>> Starting back demodulation with 33.
% 1.29/1.81 >>>> Starting back demodulation with 36.
% 1.29/1.81
% 1.29/1.81 ======= end of input processing =======
% 1.29/1.81
% 1.29/1.81 =========== start of search ===========
% 1.29/1.81
% 1.29/1.81 -------- PROOF --------
% 1.29/1.81
% 1.29/1.81 ----> UNIT CONFLICT at 0.01 sec ----> 170 [binary,169.1,3.1] $F.
% 1.29/1.81
% 1.29/1.81 Length of proof is 11. Level of proof is 7.
% 1.29/1.81
% 1.29/1.81 ---------------- PROOF ----------------
% 1.29/1.81 % SZS status Unsatisfiable
% 1.29/1.81 % SZS output start Refutation
% See solution above
% 1.29/1.81 ------------ end of proof -------------
% 1.29/1.81
% 1.29/1.81
% 1.29/1.81 Search stopped by max_proofs option.
% 1.29/1.81
% 1.29/1.81
% 1.29/1.81 Search stopped by max_proofs option.
% 1.29/1.81
% 1.29/1.81 ============ end of search ============
% 1.29/1.81
% 1.29/1.81 -------------- statistics -------------
% 1.29/1.81 clauses given 30
% 1.29/1.81 clauses generated 265
% 1.29/1.81 clauses kept 85
% 1.29/1.81 clauses forward subsumed 211
% 1.29/1.81 clauses back subsumed 0
% 1.29/1.81 Kbytes malloced 1953
% 1.29/1.81
% 1.29/1.81 ----------- times (seconds) -----------
% 1.29/1.81 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.29/1.81 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.29/1.81 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.29/1.81
% 1.29/1.81 That finishes the proof of the theorem.
% 1.29/1.81
% 1.29/1.81 Process 2544 finished Wed Jul 27 05:04:02 2022
% 1.29/1.81 Otter interrupted
% 1.29/1.81 PROOF FOUND
%------------------------------------------------------------------------------