TSTP Solution File: GRP715-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.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:43 EDT 2022
% Result : Unsatisfiable 2.27s 2.45s
% Output : Refutation 2.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 12
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 7 RR)
% Number of literals : 45 ( 44 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 66 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(mult(x0,op_a),op_b) != x0,
file('GRP715-10.p',unknown),
[] ).
cnf(4,axiom,
plus(plus(A,B),C) = plus(A,plus(B,C)),
file('GRP715-10.p',unknown),
[] ).
cnf(5,axiom,
plus(A,B) = plus(B,A),
file('GRP715-10.p',unknown),
[] ).
cnf(7,axiom,
plus(A,op_0) = A,
file('GRP715-10.p',unknown),
[] ).
cnf(8,axiom,
plus(A,minus(A)) = op_0,
file('GRP715-10.p',unknown),
[] ).
cnf(10,axiom,
mult(A,plus(B,C)) = plus(mult(A,B),mult(A,C)),
file('GRP715-10.p',unknown),
[] ).
cnf(12,plain,
plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(14,axiom,
mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)),
file('GRP715-10.p',unknown),
[] ).
cnf(15,axiom,
mult(A,mult(B,B)) = mult(mult(A,B),B),
file('GRP715-10.p',unknown),
[] ).
cnf(16,plain,
mult(mult(A,B),B) = mult(A,mult(B,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[15])]),
[iquote('copy,15,flip.1')] ).
cnf(19,axiom,
mult(A,unit) = A,
file('GRP715-10.p',unknown),
[] ).
cnf(21,axiom,
mult(unit,A) = A,
file('GRP715-10.p',unknown),
[] ).
cnf(23,axiom,
mult(op_a,op_b) = unit,
file('GRP715-10.p',unknown),
[] ).
cnf(25,axiom,
mult(op_b,op_a) = unit,
file('GRP715-10.p',unknown),
[] ).
cnf(30,plain,
plus(A,plus(minus(A),B)) = plus(op_0,B),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[8,4])]),
[iquote('para_from,8.1.1,3.1.1.1,flip.1')] ).
cnf(33,plain,
plus(minus(A),A) = op_0,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,8])]),
[iquote('para_into,5.1.1,8.1.1,flip.1')] ).
cnf(35,plain,
plus(op_0,A) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[5,7])]),
[iquote('para_into,5.1.1,6.1.1,flip.1')] ).
cnf(37,plain,
plus(A,plus(minus(A),B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[30]),35]),
[iquote('back_demod,30,demod,35')] ).
cnf(47,plain,
plus(A,mult(A,B)) = mult(A,plus(unit,B)),
inference(para_into,[status(thm),theory(equality)],[12,19]),
[iquote('para_into,11.1.1.1,18.1.1')] ).
cnf(54,plain,
mult(A,plus(B,C)) = mult(A,plus(C,B)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[12,5]),12]),
[iquote('para_into,11.1.1,5.1.1,demod,12')] ).
cnf(55,plain,
mult(A,plus(unit,B)) = plus(A,mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[47])]),
[iquote('copy,47,flip.1')] ).
cnf(58,plain,
plus(minus(A),plus(A,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[33,4]),35])]),
[iquote('para_from,32.1.1,3.1.1.1,demod,35,flip.1')] ).
cnf(66,plain,
plus(minus(A),plus(B,A)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[37,5]),4]),
[iquote('para_into,37.1.1,5.1.1,demod,4')] ).
cnf(73,plain,
mult(op_a,mult(mult(op_b,A),op_b)) = mult(A,op_b),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[14,23]),21])]),
[iquote('para_into,13.1.1.1.1,22.1.1,demod,21,flip.1')] ).
cnf(74,plain,
mult(mult(mult(A,mult(mult(B,C),B)),D),B) = mult(mult(mult(A,B),C),mult(mult(B,D),B)),
inference(para_into,[status(thm),theory(equality)],[14,14]),
[iquote('para_into,13.1.1.1.1,13.1.1')] ).
cnf(82,plain,
plus(minus(mult(A,B)),mult(A,plus(B,C))) = mult(A,C),
inference(para_into,[status(thm),theory(equality)],[58,12]),
[iquote('para_into,58.1.1.2,11.1.1')] ).
cnf(111,plain,
mult(op_a,mult(op_b,op_b)) = op_b,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[16,23]),21])]),
[iquote('para_into,16.1.1.1,22.1.1,demod,21,flip.1')] ).
cnf(394,plain,
plus(A,mult(A,minus(unit))) = mult(A,op_0),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[55,8])]),
[iquote('para_into,55.1.1.2,8.1.1,flip.1')] ).
cnf(396,plain,
plus(A,mult(A,op_0)) = A,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[55,7]),19])]),
[iquote('para_into,55.1.1.2,6.1.1,demod,19,flip.1')] ).
cnf(438,plain,
mult(A,op_0) = op_0,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[396,58]),33])]),
[iquote('para_from,396.1.1,58.1.1.2,demod,33,flip.1')] ).
cnf(439,plain,
plus(A,mult(A,minus(unit))) = op_0,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[394]),438]),
[iquote('back_demod,394,demod,438')] ).
cnf(455,plain,
minus(A) = mult(A,minus(unit)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[439,58]),7]),
[iquote('para_from,439.1.1,58.1.1.2,demod,7')] ).
cnf(456,plain,
mult(A,minus(unit)) = minus(A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[455])]),
[iquote('copy,455,flip.1')] ).
cnf(655,plain,
mult(plus(A,B),op_b) = mult(plus(B,A),op_b),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[73,54]),73]),
[iquote('para_into,72.1.1.2.1,54.1.1,demod,73')] ).
cnf(761,plain,
mult(mult(A,B),op_a) = mult(mult(mult(A,op_a),mult(op_b,op_b)),mult(mult(op_a,B),op_a)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[74,111]),25,19]),
[iquote('para_into,74.1.1.1.1.2.1,110.1.1,demod,25,19')] ).
cnf(843,plain,
minus(mult(A,B)) = mult(A,mult(B,minus(unit))),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[82,439]),438,7]),
[iquote('para_into,82.1.1.2.2,439.1.1,demod,438,7')] ).
cnf(861,plain,
mult(op_b,mult(op_a,minus(unit))) = minus(unit),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[843,25])]),
[iquote('para_into,843.1.1.1,24.1.1,flip.1')] ).
cnf(865,plain,
minus(unit) = mult(op_b,minus(op_a)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[861,456])]),
[iquote('para_into,861.1.1.2,456.1.1,flip.1')] ).
cnf(876,plain,
plus(mult(op_b,minus(op_a)),plus(A,unit)) = A,
inference(para_from,[status(thm),theory(equality)],[865,66]),
[iquote('para_from,865.1.1,66.1.1.1')] ).
cnf(883,plain,
plus(unit,plus(mult(op_b,minus(op_a)),A)) = A,
inference(para_from,[status(thm),theory(equality)],[865,37]),
[iquote('para_from,865.1.1,37.1.1.2.1')] ).
cnf(917,plain,
mult(mult(plus(A,B),op_b),op_a) = plus(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[761,655]),23,21,14,111,25,19]),
[iquote('para_into,761.1.1.1,655.1.1,demod,23,21,14,111,25,19')] ).
cnf(923,plain,
mult(mult(A,op_b),op_a) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[917,883]),4,876]),
[iquote('para_into,917.1.1.1.1,883.1.1,demod,4,876')] ).
cnf(926,plain,
mult(mult(A,mult(op_b,op_b)),op_a) = mult(A,op_b),
inference(para_into,[status(thm),theory(equality)],[923,16]),
[iquote('para_into,923.1.1.1,16.1.1')] ).
cnf(927,plain,
mult(mult(A,op_a),op_b) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[923,761]),23,21,926]),
[iquote('para_into,923.1.1,761.1.1,demod,23,21,926')] ).
cnf(929,plain,
$false,
inference(binary,[status(thm)],[927,1]),
[iquote('binary,927.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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:49:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.27/2.44 ----- Otter 3.3f, August 2004 -----
% 2.27/2.44 The process was started by sandbox2 on n023.cluster.edu,
% 2.27/2.44 Wed Jul 27 05:49:48 2022
% 2.27/2.44 The command was "./otter". The process ID is 1005.
% 2.27/2.44
% 2.27/2.44 set(prolog_style_variables).
% 2.27/2.44 set(auto).
% 2.27/2.44 dependent: set(auto1).
% 2.27/2.44 dependent: set(process_input).
% 2.27/2.44 dependent: clear(print_kept).
% 2.27/2.44 dependent: clear(print_new_demod).
% 2.27/2.44 dependent: clear(print_back_demod).
% 2.27/2.44 dependent: clear(print_back_sub).
% 2.27/2.44 dependent: set(control_memory).
% 2.27/2.44 dependent: assign(max_mem, 12000).
% 2.27/2.44 dependent: assign(pick_given_ratio, 4).
% 2.27/2.44 dependent: assign(stats_level, 1).
% 2.27/2.44 dependent: assign(max_seconds, 10800).
% 2.27/2.44 clear(print_given).
% 2.27/2.44
% 2.27/2.44 list(usable).
% 2.27/2.44 0 [] A=A.
% 2.27/2.44 0 [] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.27/2.44 0 [] plus(A,B)=plus(B,A).
% 2.27/2.44 0 [] plus(A,op_0)=A.
% 2.27/2.44 0 [] plus(A,minus(A))=op_0.
% 2.27/2.44 0 [] mult(A,plus(B,C))=plus(mult(A,B),mult(A,C)).
% 2.27/2.44 0 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.27/2.44 0 [] mult(A,mult(B,B))=mult(mult(A,B),B).
% 2.27/2.44 0 [] mult(A,unit)=A.
% 2.27/2.44 0 [] mult(unit,A)=A.
% 2.27/2.44 0 [] mult(op_a,op_b)=unit.
% 2.27/2.44 0 [] mult(op_b,op_a)=unit.
% 2.27/2.44 0 [] mult(mult(x0,op_a),op_b)!=x0.
% 2.27/2.44 end_of_list.
% 2.27/2.44
% 2.27/2.44 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.27/2.44
% 2.27/2.44 All clauses are units, and equality is present; the
% 2.27/2.44 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.27/2.44
% 2.27/2.44 dependent: set(knuth_bendix).
% 2.27/2.44 dependent: set(anl_eq).
% 2.27/2.44 dependent: set(para_from).
% 2.27/2.44 dependent: set(para_into).
% 2.27/2.44 dependent: clear(para_from_right).
% 2.27/2.44 dependent: clear(para_into_right).
% 2.27/2.44 dependent: set(para_from_vars).
% 2.27/2.44 dependent: set(eq_units_both_ways).
% 2.27/2.44 dependent: set(dynamic_demod_all).
% 2.27/2.44 dependent: set(dynamic_demod).
% 2.27/2.44 dependent: set(order_eq).
% 2.27/2.44 dependent: set(back_demod).
% 2.27/2.44 dependent: set(lrpo).
% 2.27/2.44
% 2.27/2.44 ------------> process usable:
% 2.27/2.44 ** KEPT (pick-wt=7): 1 [] mult(mult(x0,op_a),op_b)!=x0.
% 2.27/2.44
% 2.27/2.44 ------------> process sos:
% 2.27/2.44 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.27/2.44 ** KEPT (pick-wt=11): 3 [] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.27/2.44 ---> New Demodulator: 4 [new_demod,3] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.27/2.44 ** KEPT (pick-wt=7): 5 [] plus(A,B)=plus(B,A).
% 2.27/2.44 ** KEPT (pick-wt=5): 6 [] plus(A,op_0)=A.
% 2.27/2.45 ---> New Demodulator: 7 [new_demod,6] plus(A,op_0)=A.
% 2.27/2.45 ** KEPT (pick-wt=6): 8 [] plus(A,minus(A))=op_0.
% 2.27/2.45 ---> New Demodulator: 9 [new_demod,8] plus(A,minus(A))=op_0.
% 2.27/2.45 ** KEPT (pick-wt=13): 11 [copy,10,flip.1] plus(mult(A,B),mult(A,C))=mult(A,plus(B,C)).
% 2.27/2.45 ---> New Demodulator: 12 [new_demod,11] plus(mult(A,B),mult(A,C))=mult(A,plus(B,C)).
% 2.27/2.45 ** KEPT (pick-wt=15): 13 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.27/2.45 ---> New Demodulator: 14 [new_demod,13] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.27/2.45 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] mult(mult(A,B),B)=mult(A,mult(B,B)).
% 2.27/2.45 ---> New Demodulator: 17 [new_demod,16] mult(mult(A,B),B)=mult(A,mult(B,B)).
% 2.27/2.45 ** KEPT (pick-wt=5): 18 [] mult(A,unit)=A.
% 2.27/2.45 ---> New Demodulator: 19 [new_demod,18] mult(A,unit)=A.
% 2.27/2.45 ** KEPT (pick-wt=5): 20 [] mult(unit,A)=A.
% 2.27/2.45 ---> New Demodulator: 21 [new_demod,20] mult(unit,A)=A.
% 2.27/2.45 ** KEPT (pick-wt=5): 22 [] mult(op_a,op_b)=unit.
% 2.27/2.45 ---> New Demodulator: 23 [new_demod,22] mult(op_a,op_b)=unit.
% 2.27/2.45 ** KEPT (pick-wt=5): 24 [] mult(op_b,op_a)=unit.
% 2.27/2.45 ---> New Demodulator: 25 [new_demod,24] mult(op_b,op_a)=unit.
% 2.27/2.45 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.27/2.45 >>>> Starting back demodulation with 4.
% 2.27/2.45 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] plus(A,B)=plus(B,A).
% 2.27/2.45 >>>> Starting back demodulation with 7.
% 2.27/2.45 >>>> Starting back demodulation with 9.
% 2.27/2.45 >>>> Starting back demodulation with 12.
% 2.27/2.45 >>>> Starting back demodulation with 14.
% 2.27/2.45 >>>> Starting back demodulation with 17.
% 2.27/2.45 >>>> Starting back demodulation with 19.
% 2.27/2.45 >>>> Starting back demodulation with 21.
% 2.27/2.45 >>>> Starting back demodulation with 23.
% 2.27/2.45 >>>> Starting back demodulation with 25.
% 2.27/2.45
% 2.27/2.45 ======= end of input processing =======
% 2.27/2.45
% 2.27/2.45 =========== start of search ===========
% 2.27/2.45
% 2.27/2.45
% 2.27/2.45 Resetting weight limit to 11.
% 2.27/2.45
% 2.27/2.45
% 2.27/2.45 Resetting weight limit to 11.
% 2.27/2.45
% 2.27/2.45 sos_size=362
% 2.27/2.45
% 2.27/2.45 -------- PROOF --------
% 2.27/2.45
% 2.27/2.45 ----> UNIT CONFLICT at 0.36 sec ----> 929 [binary,927.1,1.1] $F.
% 2.27/2.45
% 2.27/2.45 Length of proof is 32. Level of proof is 13.
% 2.27/2.45
% 2.27/2.45 ---------------- PROOF ----------------
% 2.27/2.45 % SZS status Unsatisfiable
% 2.27/2.45 % SZS output start Refutation
% See solution above
% 2.27/2.45 ------------ end of proof -------------
% 2.27/2.45
% 2.27/2.45
% 2.27/2.45 Search stopped by max_proofs option.
% 2.27/2.45
% 2.27/2.45
% 2.27/2.45 Search stopped by max_proofs option.
% 2.27/2.45
% 2.27/2.45 ============ end of search ============
% 2.27/2.45
% 2.27/2.45 -------------- statistics -------------
% 2.27/2.45 clauses given 330
% 2.27/2.45 clauses generated 40251
% 2.27/2.45 clauses kept 564
% 2.27/2.45 clauses forward subsumed 6330
% 2.27/2.45 clauses back subsumed 8
% 2.27/2.45 Kbytes malloced 5859
% 2.27/2.45
% 2.27/2.45 ----------- times (seconds) -----------
% 2.27/2.45 user CPU time 0.36 (0 hr, 0 min, 0 sec)
% 2.27/2.45 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.27/2.45 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.27/2.45
% 2.27/2.45 That finishes the proof of the theorem.
% 2.27/2.45
% 2.27/2.45 Process 1005 finished Wed Jul 27 05:49:50 2022
% 2.27/2.45 Otter interrupted
% 2.27/2.45 PROOF FOUND
%------------------------------------------------------------------------------