TSTP Solution File: GRP572-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP572-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:16 EDT 2022
% Result : Unsatisfiable 1.37s 1.91s
% Output : Refutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 6 RR)
% Number of literals : 27 ( 26 equ; 4 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,b) != multiply(b,a),
file('GRP572-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,
double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B,
file('GRP572-1.p',unknown),
[] ).
cnf(7,axiom,
multiply(A,B) = double_divide(double_divide(B,A),identity),
file('GRP572-1.p',unknown),
[] ).
cnf(9,axiom,
inverse(A) = double_divide(A,identity),
file('GRP572-1.p',unknown),
[] ).
cnf(10,axiom,
identity = double_divide(A,inverse(A)),
file('GRP572-1.p',unknown),
[] ).
cnf(12,plain,
double_divide(A,double_divide(A,identity)) = identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10]),9])]),
[iquote('copy,10,demod,9,flip.1')] ).
cnf(13,plain,
double_divide(double_divide(b,a),identity) != double_divide(double_divide(a,b),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),7,7])]),
[iquote('back_demod,2,demod,7,7,flip.1')] ).
cnf(19,plain,
double_divide(double_divide(A,identity),double_divide(identity,identity)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[4,12]),12]),
[iquote('para_into,4.1.1.1.2.1,11.1.1,demod,12')] ).
cnf(20,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(B,double_divide(double_divide(A,double_divide(B,C)),double_divide(C,identity))),
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,4.1.1.1.2.1,4.1.1')] ).
cnf(21,plain,
double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))) = double_divide(double_divide(identity,double_divide(B,double_divide(identity,identity))),double_divide(identity,identity)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[20])]),
[iquote('copy,20,flip.1')] ).
cnf(23,plain,
double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)) = double_divide(A,identity),
inference(para_from,[status(thm),theory(equality)],[19,4]),
[iquote('para_from,18.1.1,4.1.1.1.2.1')] ).
cnf(26,plain,
double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))) = double_divide(B,identity),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[21]),23]),
[iquote('back_demod,21,demod,23')] ).
cnf(30,plain,
double_divide(double_divide(identity,A),double_divide(identity,identity)) = double_divide(double_divide(A,identity),identity),
inference(para_into,[status(thm),theory(equality)],[23,19]),
[iquote('para_into,22.1.1.1.2,18.1.1')] ).
cnf(32,plain,
double_divide(identity,identity) = identity,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[23,12]),19])]),
[iquote('para_into,22.1.1.1.2,11.1.1,demod,19,flip.1')] ).
cnf(33,plain,
double_divide(double_divide(A,identity),identity) = double_divide(double_divide(identity,A),identity),
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[30])]),32]),
[iquote('copy,30,flip.1,demod,32')] ).
cnf(40,plain,
double_divide(double_divide(A,identity),identity) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[19]),32]),
[iquote('back_demod,18,demod,32')] ).
cnf(43,plain,
double_divide(double_divide(identity,A),identity) = A,
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[33])]),40]),
[iquote('copy,33,flip.1,demod,40')] ).
cnf(47,plain,
double_divide(double_divide(A,identity),double_divide(double_divide(B,A),identity)) = double_divide(B,identity),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[26,40]),32]),
[iquote('para_into,26.1.1.2.1.2,39.1.1,demod,32')] ).
cnf(49,plain,
double_divide(identity,A) = double_divide(A,identity),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[26,32]),32,40]),
[iquote('para_into,26.1.1.2.1.2,31.1.1,demod,32,40')] ).
cnf(60,plain,
double_divide(A,identity) = double_divide(identity,A),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[49])]),
[iquote('copy,49,flip.1')] ).
cnf(77,plain,
double_divide(identity,double_divide(identity,A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[60,43])]),
[iquote('para_into,60.1.1,43.1.1,flip.1')] ).
cnf(81,plain,
double_divide(double_divide(a,b),identity) != double_divide(identity,double_divide(b,a)),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[60,13])]),
[iquote('para_from,60.1.1,13.1.1,flip.1')] ).
cnf(87,plain,
double_divide(double_divide(A,B),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[47,47]),40,40,40]),
[iquote('para_into,47.1.1.2.1,47.1.1,demod,40,40,40')] ).
cnf(96,plain,
double_divide(identity,double_divide(double_divide(A,B),B)) = double_divide(A,identity),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[77,26]),87]),
[iquote('para_from,77.1.1,26.1.1.2.1.2,demod,87')] ).
cnf(186,plain,
double_divide(double_divide(A,B),identity) = double_divide(identity,double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[96,87])]),
[iquote('para_into,96.1.1.2.1,86.1.1,flip.1')] ).
cnf(188,plain,
$false,
inference(binary,[status(thm)],[186,81]),
[iquote('binary,186.1,81.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP572-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:07:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.37/1.91 ----- Otter 3.3f, August 2004 -----
% 1.37/1.91 The process was started by sandbox2 on n024.cluster.edu,
% 1.37/1.91 Wed Jul 27 05:07:10 2022
% 1.37/1.91 The command was "./otter". The process ID is 18249.
% 1.37/1.91
% 1.37/1.91 set(prolog_style_variables).
% 1.37/1.91 set(auto).
% 1.37/1.91 dependent: set(auto1).
% 1.37/1.91 dependent: set(process_input).
% 1.37/1.91 dependent: clear(print_kept).
% 1.37/1.91 dependent: clear(print_new_demod).
% 1.37/1.91 dependent: clear(print_back_demod).
% 1.37/1.91 dependent: clear(print_back_sub).
% 1.37/1.91 dependent: set(control_memory).
% 1.37/1.91 dependent: assign(max_mem, 12000).
% 1.37/1.91 dependent: assign(pick_given_ratio, 4).
% 1.37/1.91 dependent: assign(stats_level, 1).
% 1.37/1.91 dependent: assign(max_seconds, 10800).
% 1.37/1.91 clear(print_given).
% 1.37/1.91
% 1.37/1.91 list(usable).
% 1.37/1.91 0 [] A=A.
% 1.37/1.91 0 [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.37/1.91 0 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.37/1.91 0 [] inverse(A)=double_divide(A,identity).
% 1.37/1.91 0 [] identity=double_divide(A,inverse(A)).
% 1.37/1.91 0 [] multiply(a,b)!=multiply(b,a).
% 1.37/1.91 end_of_list.
% 1.37/1.91
% 1.37/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.37/1.91
% 1.37/1.91 All clauses are units, and equality is present; the
% 1.37/1.91 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.37/1.91
% 1.37/1.91 dependent: set(knuth_bendix).
% 1.37/1.91 dependent: set(anl_eq).
% 1.37/1.91 dependent: set(para_from).
% 1.37/1.91 dependent: set(para_into).
% 1.37/1.91 dependent: clear(para_from_right).
% 1.37/1.91 dependent: clear(para_into_right).
% 1.37/1.91 dependent: set(para_from_vars).
% 1.37/1.91 dependent: set(eq_units_both_ways).
% 1.37/1.91 dependent: set(dynamic_demod_all).
% 1.37/1.91 dependent: set(dynamic_demod).
% 1.37/1.91 dependent: set(order_eq).
% 1.37/1.91 dependent: set(back_demod).
% 1.37/1.91 dependent: set(lrpo).
% 1.37/1.91
% 1.37/1.91 ------------> process usable:
% 1.37/1.91 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] multiply(b,a)!=multiply(a,b).
% 1.37/1.91
% 1.37/1.91 ------------> process sos:
% 1.37/1.91 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.37/1.91 ** KEPT (pick-wt=17): 4 [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.37/1.91 ---> New Demodulator: 5 [new_demod,4] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity))=B.
% 1.37/1.91 ** KEPT (pick-wt=9): 6 [] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.37/1.91 ---> New Demodulator: 7 [new_demod,6] multiply(A,B)=double_divide(double_divide(B,A),identity).
% 1.37/1.91 ** KEPT (pick-wt=6): 8 [] inverse(A)=double_divide(A,identity).
% 1.37/1.91 ---> New Demodulator: 9 [new_demod,8] inverse(A)=double_divide(A,identity).
% 1.37/1.91 ** KEPT (pick-wt=7): 11 [copy,10,demod,9,flip.1] double_divide(A,double_divide(A,identity))=identity.
% 1.37/1.91 ---> New Demodulator: 12 [new_demod,11] double_divide(A,double_divide(A,identity))=identity.
% 1.37/1.91 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.37/1.91 >>>> Starting back demodulation with 5.
% 1.37/1.91 >>>> Starting back demodulation with 7.
% 1.37/1.91 >> back demodulating 2 with 7.
% 1.37/1.91 >>>> Starting back demodulation with 9.
% 1.37/1.91 >>>> Starting back demodulation with 12.
% 1.37/1.91
% 1.37/1.91 ======= end of input processing =======
% 1.37/1.91
% 1.37/1.91 =========== start of search ===========
% 1.37/1.91
% 1.37/1.91 -------- PROOF --------
% 1.37/1.91
% 1.37/1.91 ----> UNIT CONFLICT at 0.01 sec ----> 188 [binary,186.1,81.1] $F.
% 1.37/1.91
% 1.37/1.91 Length of proof is 21. Level of proof is 10.
% 1.37/1.91
% 1.37/1.91 ---------------- PROOF ----------------
% 1.37/1.91 % SZS status Unsatisfiable
% 1.37/1.91 % SZS output start Refutation
% See solution above
% 1.37/1.91 ------------ end of proof -------------
% 1.37/1.91
% 1.37/1.91
% 1.37/1.91 Search stopped by max_proofs option.
% 1.37/1.91
% 1.37/1.91
% 1.37/1.91 Search stopped by max_proofs option.
% 1.37/1.91
% 1.37/1.91 ============ end of search ============
% 1.37/1.91
% 1.37/1.91 -------------- statistics -------------
% 1.37/1.91 clauses given 25
% 1.37/1.91 clauses generated 316
% 1.37/1.91 clauses kept 102
% 1.37/1.91 clauses forward subsumed 280
% 1.37/1.91 clauses back subsumed 0
% 1.37/1.91 Kbytes malloced 1953
% 1.37/1.91
% 1.37/1.91 ----------- times (seconds) -----------
% 1.37/1.91 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.37/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.37/1.91 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.37/1.91
% 1.37/1.91 That finishes the proof of the theorem.
% 1.37/1.91
% 1.37/1.91 Process 18249 finished Wed Jul 27 05:07:11 2022
% 1.37/1.91 Otter interrupted
% 1.37/1.91 PROOF FOUND
%------------------------------------------------------------------------------