TSTP Solution File: GRP552-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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:14 EDT 2022
% Result : Unsatisfiable 1.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 17 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,b) != multiply(b,a),
file('GRP552-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,
divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C,
file('GRP552-1.p',unknown),
[] ).
cnf(7,axiom,
multiply(A,B) = divide(A,divide(identity,B)),
file('GRP552-1.p',unknown),
[] ).
cnf(10,axiom,
identity = divide(A,A),
file('GRP552-1.p',unknown),
[] ).
cnf(12,plain,
divide(A,A) = identity,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[10])]),
[iquote('copy,10,flip.1')] ).
cnf(13,plain,
divide(a,divide(identity,b)) != divide(b,divide(identity,a)),
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(14,plain,
divide(identity,divide(divide(divide(A,identity),B),A)) = B,
inference(para_into,[status(thm),theory(equality)],[4,12]),
[iquote('para_into,4.1.1.1,11.1.1')] ).
cnf(16,plain,
divide(divide(identity,A),divide(divide(identity,B),A)) = B,
inference(para_into,[status(thm),theory(equality)],[4,12]),
[iquote('para_into,4.1.1.2.1.1,11.1.1')] ).
cnf(20,plain,
divide(divide(identity,A),divide(identity,B)) = divide(B,A),
inference(para_into,[status(thm),theory(equality)],[4,12]),
[iquote('para_into,4.1.1.2.1,11.1.1')] ).
cnf(22,plain,
divide(divide(divide(A,B),C),A) = divide(divide(identity,B),divide(C,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[4,4])]),
[iquote('para_into,4.1.1.2.1,4.1.1,flip.1')] ).
cnf(26,plain,
divide(identity,divide(identity,divide(A,identity))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[14]),22,12]),
[iquote('back_demod,14,demod,22,12')] ).
cnf(32,plain,
divide(identity,divide(divide(identity,A),identity)) = A,
inference(para_into,[status(thm),theory(equality)],[16,12]),
[iquote('para_into,16.1.1.1,11.1.1')] ).
cnf(41,plain,
divide(divide(identity,A),identity) = divide(identity,divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[32,32])]),
[iquote('para_into,32.1.1.2.1,32.1.1,flip.1')] ).
cnf(42,plain,
divide(A,divide(identity,B)) = divide(B,divide(identity,divide(A,identity))),
inference(para_into,[status(thm),theory(equality)],[20,26]),
[iquote('para_into,20.1.1.1,26.1.1')] ).
cnf(46,plain,
divide(identity,divide(A,identity)) = divide(identity,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[20,12]),41]),
[iquote('para_into,20.1.1.2,11.1.1,demod,41')] ).
cnf(47,plain,
divide(A,divide(identity,B)) = divide(B,divide(identity,A)),
inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[42])]),46]),
[iquote('copy,42,flip.1,demod,46')] ).
cnf(48,plain,
$false,
inference(binary,[status(thm)],[47,13]),
[iquote('binary,47.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP552-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:13:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox2 on n018.cluster.edu,
% 1.67/1.88 Wed Jul 27 05:13:16 2022
% 1.67/1.88 The command was "./otter". The process ID is 4247.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] A=A.
% 1.67/1.88 0 [] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.67/1.88 0 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.67/1.88 0 [] inverse(A)=divide(identity,A).
% 1.67/1.88 0 [] identity=divide(A,A).
% 1.67/1.88 0 [] multiply(a,b)!=multiply(b,a).
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.88
% 1.67/1.88 All clauses are units, and equality is present; the
% 1.67/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.67/1.88
% 1.67/1.88 dependent: set(knuth_bendix).
% 1.67/1.88 dependent: set(anl_eq).
% 1.67/1.88 dependent: set(para_from).
% 1.67/1.88 dependent: set(para_into).
% 1.67/1.88 dependent: clear(para_from_right).
% 1.67/1.88 dependent: clear(para_into_right).
% 1.67/1.88 dependent: set(para_from_vars).
% 1.67/1.88 dependent: set(eq_units_both_ways).
% 1.67/1.88 dependent: set(dynamic_demod_all).
% 1.67/1.88 dependent: set(dynamic_demod).
% 1.67/1.88 dependent: set(order_eq).
% 1.67/1.88 dependent: set(back_demod).
% 1.67/1.88 dependent: set(lrpo).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] multiply(b,a)!=multiply(a,b).
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.67/1.88 ** KEPT (pick-wt=13): 4 [] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.67/1.88 ---> New Demodulator: 5 [new_demod,4] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.67/1.88 ** KEPT (pick-wt=9): 6 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.67/1.88 ---> New Demodulator: 7 [new_demod,6] multiply(A,B)=divide(A,divide(identity,B)).
% 1.67/1.88 ** KEPT (pick-wt=6): 8 [] inverse(A)=divide(identity,A).
% 1.67/1.88 ---> New Demodulator: 9 [new_demod,8] inverse(A)=divide(identity,A).
% 1.67/1.88 ** KEPT (pick-wt=5): 11 [copy,10,flip.1] divide(A,A)=identity.
% 1.67/1.88 ---> New Demodulator: 12 [new_demod,11] divide(A,A)=identity.
% 1.67/1.88 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.67/1.88 >>>> Starting back demodulation with 5.
% 1.67/1.88 >>>> Starting back demodulation with 7.
% 1.67/1.88 >> back demodulating 2 with 7.
% 1.67/1.88 >>>> Starting back demodulation with 9.
% 1.67/1.88 >>>> Starting back demodulation with 12.
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 ----> UNIT CONFLICT at 0.00 sec ----> 48 [binary,47.1,13.1] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 13. Level of proof is 6.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Unsatisfiable
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 10
% 1.67/1.88 clauses generated 34
% 1.67/1.88 clauses kept 28
% 1.67/1.88 clauses forward subsumed 24
% 1.67/1.88 clauses back subsumed 0
% 1.67/1.88 Kbytes malloced 976
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 4247 finished Wed Jul 27 05:13:17 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------