TSTP Solution File: GRP039-5 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP039-5 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:55:56 EDT 2022
% Result : Unsatisfiable 230.71s 230.92s
% Output : Refutation 230.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 38 ( 24 unt; 9 nHn; 24 RR)
% Number of literals : 61 ( 22 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ subgroup_member(A)
| subgroup_member(inverse(A)) ),
file('GRP039-5.p',unknown),
[] ).
cnf(2,axiom,
( ~ subgroup_member(A)
| ~ subgroup_member(B)
| multiply(A,B) != C
| subgroup_member(C) ),
file('GRP039-5.p',unknown),
[] ).
cnf(3,axiom,
~ subgroup_member(d),
file('GRP039-5.p',unknown),
[] ).
cnf(5,axiom,
A = A,
file('GRP039-5.p',unknown),
[] ).
cnf(7,axiom,
multiply(identity,A) = A,
file('GRP039-5.p',unknown),
[] ).
cnf(8,axiom,
multiply(inverse(A),A) = identity,
file('GRP039-5.p',unknown),
[] ).
cnf(10,axiom,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
file('GRP039-5.p',unknown),
[] ).
cnf(13,axiom,
multiply(A,identity) = A,
file('GRP039-5.p',unknown),
[] ).
cnf(14,axiom,
multiply(A,inverse(A)) = identity,
file('GRP039-5.p',unknown),
[] ).
cnf(17,axiom,
( subgroup_member(A)
| subgroup_member(B)
| subgroup_member(element_in_O2(A,B)) ),
file('GRP039-5.p',unknown),
[] ).
cnf(18,axiom,
( subgroup_member(A)
| subgroup_member(B)
| multiply(A,element_in_O2(A,B)) = B ),
file('GRP039-5.p',unknown),
[] ).
cnf(19,axiom,
subgroup_member(b),
file('GRP039-5.p',unknown),
[] ).
cnf(20,axiom,
multiply(b,inverse(a)) = c,
file('GRP039-5.p',unknown),
[] ).
cnf(23,axiom,
multiply(a,c) = d,
file('GRP039-5.p',unknown),
[] ).
cnf(28,plain,
subgroup_member(inverse(b)),
inference(hyper,[status(thm)],[19,1]),
[iquote('hyper,19,1')] ).
cnf(65,plain,
( ~ subgroup_member(a)
| ~ subgroup_member(c)
| d != A
| subgroup_member(A) ),
inference(para_from,[status(thm),theory(equality)],[23,2]),
[iquote('para_from,22.1.1,2.3.1')] ).
cnf(77,plain,
multiply(inverse(A),multiply(A,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[10,8]),7])]),
[iquote('para_into,10.1.1.1,8.1.1,demod,7,flip.1')] ).
cnf(93,plain,
multiply(A,multiply(inverse(A),B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[14,10]),7])]),
[iquote('para_from,14.1.1,10.1.1.1,demod,7,flip.1')] ).
cnf(95,plain,
multiply(b,multiply(inverse(a),A)) = multiply(c,A),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[20,10])]),
[iquote('para_from,20.1.1,10.1.1.1,flip.1')] ).
cnf(159,plain,
( subgroup_member(A)
| subgroup_member(element_in_O2(inverse(a),A))
| subgroup_member(c) ),
inference(hyper,[status(thm)],[17,2,19,20]),
[iquote('hyper,17,2,19,20')] ).
cnf(266,plain,
( subgroup_member(c)
| subgroup_member(element_in_O2(inverse(a),c)) ),
inference(factor,[status(thm)],[159]),
[iquote('factor,159.1.3')] ).
cnf(610,plain,
( subgroup_member(A)
| multiply(inverse(a),element_in_O2(inverse(a),A)) = A
| subgroup_member(c) ),
inference(hyper,[status(thm)],[18,2,19,20]),
[iquote('hyper,18,2,19,20')] ).
cnf(745,plain,
( subgroup_member(c)
| multiply(inverse(a),element_in_O2(inverse(a),c)) = c ),
inference(factor,[status(thm)],[610]),
[iquote('factor,610.1.3')] ).
cnf(1255,plain,
( subgroup_member(element_in_O2(inverse(a),c))
| subgroup_member(inverse(c)) ),
inference(hyper,[status(thm)],[266,1]),
[iquote('hyper,266,1')] ).
cnf(1354,plain,
multiply(inverse(b),c) = inverse(a),
inference(para_into,[status(thm),theory(equality)],[77,20]),
[iquote('para_into,77.1.1.2,20.1.1')] ).
cnf(1357,plain,
inverse(inverse(A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[77,8]),13]),
[iquote('para_into,77.1.1.2,8.1.1,demod,13')] ).
cnf(1361,plain,
( ~ subgroup_member(inverse(A))
| subgroup_member(A) ),
inference(para_from,[status(thm),theory(equality)],[1357,1]),
[iquote('para_from,1356.1.1,1.2.1')] ).
cnf(1379,plain,
multiply(c,a) = b,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[95,14]),13,1357])]),
[iquote('para_into,95.1.1.2,14.1.1,demod,13,1357,flip.1')] ).
cnf(1383,plain,
multiply(inverse(c),b) = a,
inference(para_from,[status(thm),theory(equality)],[1379,77]),
[iquote('para_from,1379.1.1,77.1.1.2')] ).
cnf(1478,plain,
( ~ subgroup_member(c)
| inverse(a) != A
| subgroup_member(A) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1354,2]),28]),
[iquote('para_from,1354.1.1,2.3.1,unit_del,28')] ).
cnf(1609,plain,
( subgroup_member(element_in_O2(inverse(a),c))
| subgroup_member(a) ),
inference(hyper,[status(thm)],[1255,2,19,1383]),
[iquote('hyper,1255,2,19,1383')] ).
cnf(1611,plain,
subgroup_member(element_in_O2(inverse(a),c)),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[1609,65,266,5]),3])]),
[iquote('hyper,1609,65,266,5,unit_del,3,factor_simp')] ).
cnf(1837,plain,
( element_in_O2(inverse(a),c) = d
| subgroup_member(c) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[745,93]),23])]),
[iquote('para_from,745.2.1,93.1.1.2,demod,23,flip.1')] ).
cnf(1842,plain,
subgroup_member(c),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1837,1611]),3]),
[iquote('para_from,1837.1.1,1611.1.1,unit_del,3')] ).
cnf(1844,plain,
subgroup_member(inverse(a)),
inference(hyper,[status(thm)],[1842,1478,5]),
[iquote('hyper,1842,1478,5')] ).
cnf(2013,plain,
subgroup_member(a),
inference(hyper,[status(thm)],[1844,1361]),
[iquote('hyper,1844,1361')] ).
cnf(2048,plain,
subgroup_member(d),
inference(hyper,[status(thm)],[2013,65,1842,5]),
[iquote('hyper,2013,65,1842,5')] ).
cnf(2049,plain,
$false,
inference(binary,[status(thm)],[2048,3]),
[iquote('binary,2048.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP039-5 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 05:17:50 EDT 2022
% 0.13/0.33 % CPUTime :
% 2.05/2.29 ----- Otter 3.3f, August 2004 -----
% 2.05/2.29 The process was started by sandbox2 on n022.cluster.edu,
% 2.05/2.29 Wed Jul 27 05:17:50 2022
% 2.05/2.29 The command was "./otter". The process ID is 22281.
% 2.05/2.29
% 2.05/2.29 set(prolog_style_variables).
% 2.05/2.29 set(auto).
% 2.05/2.29 dependent: set(auto1).
% 2.05/2.29 dependent: set(process_input).
% 2.05/2.29 dependent: clear(print_kept).
% 2.05/2.29 dependent: clear(print_new_demod).
% 2.05/2.29 dependent: clear(print_back_demod).
% 2.05/2.29 dependent: clear(print_back_sub).
% 2.05/2.29 dependent: set(control_memory).
% 2.05/2.29 dependent: assign(max_mem, 12000).
% 2.05/2.29 dependent: assign(pick_given_ratio, 4).
% 2.05/2.29 dependent: assign(stats_level, 1).
% 2.05/2.29 dependent: assign(max_seconds, 10800).
% 2.05/2.29 clear(print_given).
% 2.05/2.29
% 2.05/2.29 list(usable).
% 2.05/2.29 0 [] A=A.
% 2.05/2.29 0 [] multiply(identity,X)=X.
% 2.05/2.29 0 [] multiply(inverse(X),X)=identity.
% 2.05/2.29 0 [] multiply(multiply(X,Y),Z)=multiply(X,multiply(Y,Z)).
% 2.05/2.29 0 [] -subgroup_member(X)|subgroup_member(inverse(X)).
% 2.05/2.29 0 [] -subgroup_member(X)| -subgroup_member(Y)|multiply(X,Y)!=Z|subgroup_member(Z).
% 2.05/2.29 0 [] multiply(X,identity)=X.
% 2.05/2.29 0 [] multiply(X,inverse(X))=identity.
% 2.05/2.29 0 [] subgroup_member(identity).
% 2.05/2.29 0 [] subgroup_member(X)|subgroup_member(Y)|subgroup_member(element_in_O2(X,Y)).
% 2.05/2.29 0 [] subgroup_member(X)|subgroup_member(Y)|multiply(X,element_in_O2(X,Y))=Y.
% 2.05/2.29 0 [] subgroup_member(b).
% 2.05/2.29 0 [] multiply(b,inverse(a))=c.
% 2.05/2.29 0 [] multiply(a,c)=d.
% 2.05/2.29 0 [] -subgroup_member(d).
% 2.05/2.29 end_of_list.
% 2.05/2.29
% 2.05/2.29 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.05/2.29
% 2.05/2.29 This ia a non-Horn set with equality. The strategy will be
% 2.05/2.29 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.05/2.29 deletion, with positive clauses in sos and nonpositive
% 2.05/2.29 clauses in usable.
% 2.05/2.29
% 2.05/2.29 dependent: set(knuth_bendix).
% 2.05/2.29 dependent: set(anl_eq).
% 2.05/2.29 dependent: set(para_from).
% 2.05/2.29 dependent: set(para_into).
% 2.05/2.29 dependent: clear(para_from_right).
% 2.05/2.29 dependent: clear(para_into_right).
% 2.05/2.29 dependent: set(para_from_vars).
% 2.05/2.29 dependent: set(eq_units_both_ways).
% 2.05/2.29 dependent: set(dynamic_demod_all).
% 2.05/2.29 dependent: set(dynamic_demod).
% 2.05/2.29 dependent: set(order_eq).
% 2.05/2.29 dependent: set(back_demod).
% 2.05/2.29 dependent: set(lrpo).
% 2.05/2.29 dependent: set(hyper_res).
% 2.05/2.29 dependent: set(unit_deletion).
% 2.05/2.29 dependent: set(factor).
% 2.05/2.29
% 2.05/2.29 ------------> process usable:
% 2.05/2.29 ** KEPT (pick-wt=5): 1 [] -subgroup_member(A)|subgroup_member(inverse(A)).
% 2.05/2.29 ** KEPT (pick-wt=11): 2 [] -subgroup_member(A)| -subgroup_member(B)|multiply(A,B)!=C|subgroup_member(C).
% 2.05/2.29 ** KEPT (pick-wt=2): 3 [] -subgroup_member(d).
% 2.05/2.29
% 2.05/2.29 ------------> process sos:
% 2.05/2.29 ** KEPT (pick-wt=3): 5 [] A=A.
% 2.05/2.29 ** KEPT (pick-wt=5): 6 [] multiply(identity,A)=A.
% 2.05/2.29 ---> New Demodulator: 7 [new_demod,6] multiply(identity,A)=A.
% 2.05/2.29 ** KEPT (pick-wt=6): 8 [] multiply(inverse(A),A)=identity.
% 2.05/2.29 ---> New Demodulator: 9 [new_demod,8] multiply(inverse(A),A)=identity.
% 2.05/2.29 ** KEPT (pick-wt=11): 10 [] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 2.05/2.29 ---> New Demodulator: 11 [new_demod,10] multiply(multiply(A,B),C)=multiply(A,multiply(B,C)).
% 2.05/2.29 ** KEPT (pick-wt=5): 12 [] multiply(A,identity)=A.
% 2.05/2.29 ---> New Demodulator: 13 [new_demod,12] multiply(A,identity)=A.
% 2.05/2.29 ** KEPT (pick-wt=6): 14 [] multiply(A,inverse(A))=identity.
% 2.05/2.29 ---> New Demodulator: 15 [new_demod,14] multiply(A,inverse(A))=identity.
% 2.05/2.29 ** KEPT (pick-wt=2): 16 [] subgroup_member(identity).
% 2.05/2.29 ** KEPT (pick-wt=8): 17 [] subgroup_member(A)|subgroup_member(B)|subgroup_member(element_in_O2(A,B)).
% 2.05/2.29 ** KEPT (pick-wt=11): 18 [] subgroup_member(A)|subgroup_member(B)|multiply(A,element_in_O2(A,B))=B.
% 2.05/2.29 ** KEPT (pick-wt=2): 19 [] subgroup_member(b).
% 2.05/2.29 ** KEPT (pick-wt=6): 20 [] multiply(b,inverse(a))=c.
% 2.05/2.29 ---> New Demodulator: 21 [new_demod,20] multiply(b,inverse(a))=c.
% 2.05/2.29 ** KEPT (pick-wt=5): 22 [] multiply(a,c)=d.
% 2.05/2.29 ---> New Demodulator: 23 [new_demod,22] multiply(a,c)=d.
% 2.05/2.29 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 2.05/2.29 >>>> Starting back demodulation with 7.
% 2.05/2.29 >>>> Starting back demodulation with 9.
% 2.05/2.29 >>>> Starting back demodulation with 11.
% 2.05/2.29 >>>> Starting back demodulation with 13.
% 2.05/2.29 >>>> Starting back demodulation with 15.
% 2.05/2.29 >>>> Starting back demodulation with 21.
% 2.05/2.29 >>>> Starting back demodulation with 23.
% 2.05/2.29
% 2.05/2.29 ======= end of input processing =======
% 2.05/2.29
% 2.05/2.29 =========== start of search ===========
% 2.05/2.29
% 2.05/2.29
% 2.05/2.29 Resetting weight limit to 9.
% 2.05/2.29
% 2.05/2.29
% 2.05/2.29 Resetting weight limit to 9.
% 2.05/2.29
% 2.05/2.29 sos_size=1067
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Resetting weight limit to 8.
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Resetting weight limit to 8.
% 230.71/230.92
% 230.71/230.92 sos_size=1134
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Resetting weight limit to 7.
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Resetting weight limit to 7.
% 230.71/230.92
% 230.71/230.92 sos_size=737
% 230.71/230.92
% 230.71/230.92 -- HEY sandbox2, WE HAVE A PROOF!! --
% 230.71/230.92
% 230.71/230.92 ----> UNIT CONFLICT at 229.01 sec ----> 2049 [binary,2048.1,3.1] $F.
% 230.71/230.92
% 230.71/230.92 Length of proof is 23. Level of proof is 10.
% 230.71/230.92
% 230.71/230.92 ---------------- PROOF ----------------
% 230.71/230.92 % SZS status Unsatisfiable
% 230.71/230.92 % SZS output start Refutation
% See solution above
% 230.71/230.92 ------------ end of proof -------------
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Search stopped by max_proofs option.
% 230.71/230.92
% 230.71/230.92
% 230.71/230.92 Search stopped by max_proofs option.
% 230.71/230.92
% 230.71/230.92 ============ end of search ============
% 230.71/230.92
% 230.71/230.92 -------------- statistics -------------
% 230.71/230.92 clauses given 670
% 230.71/230.92 clauses generated 5371804
% 230.71/230.92 clauses kept 2016
% 230.71/230.92 clauses forward subsumed 25857
% 230.71/230.92 clauses back subsumed 174
% 230.71/230.92 Kbytes malloced 5859
% 230.71/230.92
% 230.71/230.92 ----------- times (seconds) -----------
% 230.71/230.92 user CPU time 229.01 (0 hr, 3 min, 49 sec)
% 230.71/230.92 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 230.71/230.92 wall-clock time 231 (0 hr, 3 min, 51 sec)
% 230.71/230.92
% 230.71/230.92 That finishes the proof of the theorem.
% 230.71/230.92
% 230.71/230.92 Process 22281 finished Wed Jul 27 05:21:41 2022
% 230.71/230.92 Otter interrupted
% 230.71/230.92 PROOF FOUND
%------------------------------------------------------------------------------