TSTP Solution File: GRP544-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:13 EDT 2022
% Result : Unsatisfiable 1.22s 1.76s
% Output : Refutation 1.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 4 RR)
% Number of literals : 17 ( 16 equ; 3 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; 3 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(a,b) != multiply(b,a),
file('GRP544-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,divide(divide(divide(A,B),C),A)),C) = B,
file('GRP544-1.p',unknown),
[] ).
cnf(7,axiom,
multiply(A,B) = divide(A,divide(identity,B)),
file('GRP544-1.p',unknown),
[] ).
cnf(10,axiom,
identity = divide(A,A),
file('GRP544-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(divide(identity,divide(divide(identity,A),B)),A) = B,
inference(para_into,[status(thm),theory(equality)],[4,12]),
[iquote('para_into,4.1.1.1.2.1.1,11.1.1')] ).
cnf(18,plain,
divide(divide(identity,divide(identity,A)),divide(A,B)) = B,
inference(para_into,[status(thm),theory(equality)],[4,12]),
[iquote('para_into,4.1.1.1.2.1,11.1.1')] ).
cnf(28,plain,
divide(divide(identity,A),divide(divide(identity,B),A)) = B,
inference(para_into,[status(thm),theory(equality)],[14,14]),
[iquote('para_into,14.1.1.1.2,14.1.1')] ).
cnf(31,plain,
divide(identity,divide(identity,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[18,12]),12]),
[iquote('para_into,18.1.1.1.2,11.1.1,demod,12')] ).
cnf(32,plain,
divide(divide(identity,divide(divide(identity,A),B)),B) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[18,14]),31]),
[iquote('para_into,18.1.1.2,14.1.1,demod,31')] ).
cnf(36,plain,
divide(A,divide(A,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[18]),31]),
[iquote('back_demod,18,demod,31')] ).
cnf(43,plain,
divide(A,divide(divide(identity,B),divide(identity,A))) = B,
inference(para_from,[status(thm),theory(equality)],[36,28]),
[iquote('para_from,36.1.1,28.1.1.1')] ).
cnf(49,plain,
divide(divide(identity,divide(A,B)),B) = divide(identity,A),
inference(para_into,[status(thm),theory(equality)],[32,36]),
[iquote('para_into,32.1.1.1.2.1,36.1.1')] ).
cnf(77,plain,
divide(A,divide(identity,B)) = divide(B,divide(identity,A)),
inference(para_from,[status(thm),theory(equality)],[49,43]),
[iquote('para_from,49.1.1,43.1.1.2')] ).
cnf(78,plain,
$false,
inference(binary,[status(thm)],[77,13]),
[iquote('binary,77.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : GRP544-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.11/0.32 % Computer : n016.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 05:27:22 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.22/1.76 ----- Otter 3.3f, August 2004 -----
% 1.22/1.76 The process was started by sandbox2 on n016.cluster.edu,
% 1.22/1.76 Wed Jul 27 05:27:22 2022
% 1.22/1.76 The command was "./otter". The process ID is 5935.
% 1.22/1.76
% 1.22/1.76 set(prolog_style_variables).
% 1.22/1.76 set(auto).
% 1.22/1.76 dependent: set(auto1).
% 1.22/1.76 dependent: set(process_input).
% 1.22/1.76 dependent: clear(print_kept).
% 1.22/1.76 dependent: clear(print_new_demod).
% 1.22/1.76 dependent: clear(print_back_demod).
% 1.22/1.76 dependent: clear(print_back_sub).
% 1.22/1.76 dependent: set(control_memory).
% 1.22/1.76 dependent: assign(max_mem, 12000).
% 1.22/1.76 dependent: assign(pick_given_ratio, 4).
% 1.22/1.76 dependent: assign(stats_level, 1).
% 1.22/1.76 dependent: assign(max_seconds, 10800).
% 1.22/1.76 clear(print_given).
% 1.22/1.76
% 1.22/1.76 list(usable).
% 1.22/1.76 0 [] A=A.
% 1.22/1.76 0 [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C)=B.
% 1.22/1.76 0 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.22/1.76 0 [] inverse(A)=divide(identity,A).
% 1.22/1.76 0 [] identity=divide(A,A).
% 1.22/1.76 0 [] multiply(a,b)!=multiply(b,a).
% 1.22/1.76 end_of_list.
% 1.22/1.76
% 1.22/1.76 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.22/1.76
% 1.22/1.76 All clauses are units, and equality is present; the
% 1.22/1.76 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.22/1.76
% 1.22/1.76 dependent: set(knuth_bendix).
% 1.22/1.76 dependent: set(anl_eq).
% 1.22/1.76 dependent: set(para_from).
% 1.22/1.76 dependent: set(para_into).
% 1.22/1.76 dependent: clear(para_from_right).
% 1.22/1.76 dependent: clear(para_into_right).
% 1.22/1.76 dependent: set(para_from_vars).
% 1.22/1.76 dependent: set(eq_units_both_ways).
% 1.22/1.76 dependent: set(dynamic_demod_all).
% 1.22/1.76 dependent: set(dynamic_demod).
% 1.22/1.76 dependent: set(order_eq).
% 1.22/1.76 dependent: set(back_demod).
% 1.22/1.76 dependent: set(lrpo).
% 1.22/1.76
% 1.22/1.76 ------------> process usable:
% 1.22/1.76 ** KEPT (pick-wt=7): 2 [copy,1,flip.1] multiply(b,a)!=multiply(a,b).
% 1.22/1.76
% 1.22/1.76 ------------> process sos:
% 1.22/1.76 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.22/1.76 ** KEPT (pick-wt=13): 4 [] divide(divide(identity,divide(divide(divide(A,B),C),A)),C)=B.
% 1.22/1.76 ---> New Demodulator: 5 [new_demod,4] divide(divide(identity,divide(divide(divide(A,B),C),A)),C)=B.
% 1.22/1.76 ** KEPT (pick-wt=9): 6 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.22/1.76 ---> New Demodulator: 7 [new_demod,6] multiply(A,B)=divide(A,divide(identity,B)).
% 1.22/1.76 ** KEPT (pick-wt=6): 8 [] inverse(A)=divide(identity,A).
% 1.22/1.76 ---> New Demodulator: 9 [new_demod,8] inverse(A)=divide(identity,A).
% 1.22/1.76 ** KEPT (pick-wt=5): 11 [copy,10,flip.1] divide(A,A)=identity.
% 1.22/1.76 ---> New Demodulator: 12 [new_demod,11] divide(A,A)=identity.
% 1.22/1.76 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.22/1.76 >>>> Starting back demodulation with 5.
% 1.22/1.76 >>>> Starting back demodulation with 7.
% 1.22/1.76 >> back demodulating 2 with 7.
% 1.22/1.76 >>>> Starting back demodulation with 9.
% 1.22/1.76 >>>> Starting back demodulation with 12.
% 1.22/1.76
% 1.22/1.76 ======= end of input processing =======
% 1.22/1.76
% 1.22/1.76 =========== start of search ===========
% 1.22/1.76
% 1.22/1.76 -------- PROOF --------
% 1.22/1.76
% 1.22/1.76 ----> UNIT CONFLICT at 0.00 sec ----> 78 [binary,77.1,13.1] $F.
% 1.22/1.76
% 1.22/1.76 Length of proof is 12. Level of proof is 6.
% 1.22/1.76
% 1.22/1.76 ---------------- PROOF ----------------
% 1.22/1.76 % SZS status Unsatisfiable
% 1.22/1.76 % SZS output start Refutation
% See solution above
% 1.22/1.76 ------------ end of proof -------------
% 1.22/1.76
% 1.22/1.76
% 1.22/1.76 Search stopped by max_proofs option.
% 1.22/1.76
% 1.22/1.76
% 1.22/1.76 Search stopped by max_proofs option.
% 1.22/1.76
% 1.22/1.76 ============ end of search ============
% 1.22/1.76
% 1.22/1.76 -------------- statistics -------------
% 1.22/1.76 clauses given 19
% 1.22/1.76 clauses generated 206
% 1.22/1.76 clauses kept 42
% 1.22/1.76 clauses forward subsumed 189
% 1.22/1.76 clauses back subsumed 0
% 1.22/1.76 Kbytes malloced 976
% 1.22/1.76
% 1.22/1.76 ----------- times (seconds) -----------
% 1.22/1.76 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.22/1.76 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.22/1.76 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.22/1.76
% 1.22/1.76 That finishes the proof of the theorem.
% 1.22/1.76
% 1.22/1.76 Process 5935 finished Wed Jul 27 05:27:23 2022
% 1.22/1.76 Otter interrupted
% 1.22/1.76 PROOF FOUND
%------------------------------------------------------------------------------