TSTP Solution File: GRP715-11 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.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:43 EDT 2022
% Result : Unsatisfiable 2.18s 2.37s
% Output : Refutation 2.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 6 RR)
% Number of literals : 14 ( 13 equ; 2 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(mult(x0,op_b),op_a) != x0,
file('GRP715-11.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('GRP715-11.p',unknown),
[] ).
cnf(14,axiom,
mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)),
file('GRP715-11.p',unknown),
[] ).
cnf(15,axiom,
mult(A,mult(B,B)) = mult(mult(A,B),B),
file('GRP715-11.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-11.p',unknown),
[] ).
cnf(21,axiom,
mult(unit,A) = A,
file('GRP715-11.p',unknown),
[] ).
cnf(23,axiom,
mult(op_a,op_b) = unit,
file('GRP715-11.p',unknown),
[] ).
cnf(25,axiom,
mult(op_b,op_a) = unit,
file('GRP715-11.p',unknown),
[] ).
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(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(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(923,plain,
x0 != x0,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[761,1]),23,21,14,111,25,19]),
[iquote('para_from,761.1.1,1.1.1,demod,23,21,14,111,25,19')] ).
cnf(924,plain,
$false,
inference(binary,[status(thm)],[923,2]),
[iquote('binary,923.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:30:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.18/2.37 ----- Otter 3.3f, August 2004 -----
% 2.18/2.37 The process was started by sandbox on n013.cluster.edu,
% 2.18/2.37 Wed Jul 27 05:30:45 2022
% 2.18/2.37 The command was "./otter". The process ID is 14018.
% 2.18/2.37
% 2.18/2.37 set(prolog_style_variables).
% 2.18/2.37 set(auto).
% 2.18/2.37 dependent: set(auto1).
% 2.18/2.37 dependent: set(process_input).
% 2.18/2.37 dependent: clear(print_kept).
% 2.18/2.37 dependent: clear(print_new_demod).
% 2.18/2.37 dependent: clear(print_back_demod).
% 2.18/2.37 dependent: clear(print_back_sub).
% 2.18/2.37 dependent: set(control_memory).
% 2.18/2.37 dependent: assign(max_mem, 12000).
% 2.18/2.37 dependent: assign(pick_given_ratio, 4).
% 2.18/2.37 dependent: assign(stats_level, 1).
% 2.18/2.37 dependent: assign(max_seconds, 10800).
% 2.18/2.37 clear(print_given).
% 2.18/2.37
% 2.18/2.37 list(usable).
% 2.18/2.37 0 [] A=A.
% 2.18/2.37 0 [] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.18/2.37 0 [] plus(A,B)=plus(B,A).
% 2.18/2.37 0 [] plus(A,op_0)=A.
% 2.18/2.37 0 [] plus(A,minus(A))=op_0.
% 2.18/2.37 0 [] mult(A,plus(B,C))=plus(mult(A,B),mult(A,C)).
% 2.18/2.37 0 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.18/2.37 0 [] mult(A,mult(B,B))=mult(mult(A,B),B).
% 2.18/2.37 0 [] mult(A,unit)=A.
% 2.18/2.37 0 [] mult(unit,A)=A.
% 2.18/2.37 0 [] mult(op_a,op_b)=unit.
% 2.18/2.37 0 [] mult(op_b,op_a)=unit.
% 2.18/2.37 0 [] mult(mult(x0,op_b),op_a)!=x0.
% 2.18/2.37 end_of_list.
% 2.18/2.37
% 2.18/2.37 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.18/2.37
% 2.18/2.37 All clauses are units, and equality is present; the
% 2.18/2.37 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.18/2.37
% 2.18/2.37 dependent: set(knuth_bendix).
% 2.18/2.37 dependent: set(anl_eq).
% 2.18/2.37 dependent: set(para_from).
% 2.18/2.37 dependent: set(para_into).
% 2.18/2.37 dependent: clear(para_from_right).
% 2.18/2.37 dependent: clear(para_into_right).
% 2.18/2.37 dependent: set(para_from_vars).
% 2.18/2.37 dependent: set(eq_units_both_ways).
% 2.18/2.37 dependent: set(dynamic_demod_all).
% 2.18/2.37 dependent: set(dynamic_demod).
% 2.18/2.37 dependent: set(order_eq).
% 2.18/2.37 dependent: set(back_demod).
% 2.18/2.37 dependent: set(lrpo).
% 2.18/2.37
% 2.18/2.37 ------------> process usable:
% 2.18/2.37 ** KEPT (pick-wt=7): 1 [] mult(mult(x0,op_b),op_a)!=x0.
% 2.18/2.37
% 2.18/2.37 ------------> process sos:
% 2.18/2.37 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.18/2.37 ** KEPT (pick-wt=11): 3 [] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.18/2.37 ---> New Demodulator: 4 [new_demod,3] plus(plus(A,B),C)=plus(A,plus(B,C)).
% 2.18/2.37 ** KEPT (pick-wt=7): 5 [] plus(A,B)=plus(B,A).
% 2.18/2.37 ** KEPT (pick-wt=5): 6 [] plus(A,op_0)=A.
% 2.18/2.37 ---> New Demodulator: 7 [new_demod,6] plus(A,op_0)=A.
% 2.18/2.37 ** KEPT (pick-wt=6): 8 [] plus(A,minus(A))=op_0.
% 2.18/2.37 ---> New Demodulator: 9 [new_demod,8] plus(A,minus(A))=op_0.
% 2.18/2.37 ** KEPT (pick-wt=13): 11 [copy,10,flip.1] plus(mult(A,B),mult(A,C))=mult(A,plus(B,C)).
% 2.18/2.37 ---> New Demodulator: 12 [new_demod,11] plus(mult(A,B),mult(A,C))=mult(A,plus(B,C)).
% 2.18/2.37 ** KEPT (pick-wt=15): 13 [] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.18/2.37 ---> New Demodulator: 14 [new_demod,13] mult(mult(mult(A,B),C),B)=mult(A,mult(mult(B,C),B)).
% 2.18/2.37 ** KEPT (pick-wt=11): 16 [copy,15,flip.1] mult(mult(A,B),B)=mult(A,mult(B,B)).
% 2.18/2.37 ---> New Demodulator: 17 [new_demod,16] mult(mult(A,B),B)=mult(A,mult(B,B)).
% 2.18/2.37 ** KEPT (pick-wt=5): 18 [] mult(A,unit)=A.
% 2.18/2.37 ---> New Demodulator: 19 [new_demod,18] mult(A,unit)=A.
% 2.18/2.37 ** KEPT (pick-wt=5): 20 [] mult(unit,A)=A.
% 2.18/2.37 ---> New Demodulator: 21 [new_demod,20] mult(unit,A)=A.
% 2.18/2.37 ** KEPT (pick-wt=5): 22 [] mult(op_a,op_b)=unit.
% 2.18/2.37 ---> New Demodulator: 23 [new_demod,22] mult(op_a,op_b)=unit.
% 2.18/2.37 ** KEPT (pick-wt=5): 24 [] mult(op_b,op_a)=unit.
% 2.18/2.37 ---> New Demodulator: 25 [new_demod,24] mult(op_b,op_a)=unit.
% 2.18/2.37 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.18/2.37 >>>> Starting back demodulation with 4.
% 2.18/2.37 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] plus(A,B)=plus(B,A).
% 2.18/2.37 >>>> Starting back demodulation with 7.
% 2.18/2.37 >>>> Starting back demodulation with 9.
% 2.18/2.37 >>>> Starting back demodulation with 12.
% 2.18/2.37 >>>> Starting back demodulation with 14.
% 2.18/2.37 >>>> Starting back demodulation with 17.
% 2.18/2.37 >>>> Starting back demodulation with 19.
% 2.18/2.37 >>>> Starting back demodulation with 21.
% 2.18/2.37 >>>> Starting back demodulation with 23.
% 2.18/2.37 >>>> Starting back demodulation with 25.
% 2.18/2.37
% 2.18/2.37 ======= end of input processing =======
% 2.18/2.37
% 2.18/2.37 =========== start of search ===========
% 2.18/2.37
% 2.18/2.37
% 2.18/2.37 Resetting weight limit to 11.
% 2.18/2.37
% 2.18/2.37
% 2.18/2.37 Resetting weight limit to 11.
% 2.18/2.37
% 2.18/2.37 sos_size=362
% 2.18/2.37
% 2.18/2.37 -------- PROOF --------
% 2.18/2.37
% 2.18/2.37 ----> UNIT CONFLICT at 0.28 sec ----> 924 [binary,923.1,2.1] $F.
% 2.18/2.37
% 2.18/2.37 Length of proof is 5. Level of proof is 4.
% 2.18/2.37
% 2.18/2.37 ---------------- PROOF ----------------
% 2.18/2.37 % SZS status Unsatisfiable
% 2.18/2.37 % SZS output start Refutation
% See solution above
% 2.18/2.37 ------------ end of proof -------------
% 2.18/2.37
% 2.18/2.37
% 2.18/2.37 Search stopped by max_proofs option.
% 2.18/2.37
% 2.18/2.37
% 2.18/2.37 Search stopped by max_proofs option.
% 2.18/2.37
% 2.18/2.37 ============ end of search ============
% 2.18/2.37
% 2.18/2.37 -------------- statistics -------------
% 2.18/2.37 clauses given 328
% 2.18/2.37 clauses generated 40076
% 2.18/2.37 clauses kept 562
% 2.18/2.37 clauses forward subsumed 6275
% 2.18/2.37 clauses back subsumed 8
% 2.18/2.37 Kbytes malloced 5859
% 2.18/2.37
% 2.18/2.37 ----------- times (seconds) -----------
% 2.18/2.37 user CPU time 0.28 (0 hr, 0 min, 0 sec)
% 2.18/2.37 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.18/2.37 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.18/2.37
% 2.18/2.37 That finishes the proof of the theorem.
% 2.18/2.37
% 2.18/2.37 Process 14018 finished Wed Jul 27 05:30:47 2022
% 2.18/2.37 Otter interrupted
% 2.18/2.37 PROOF FOUND
%------------------------------------------------------------------------------