TSTP Solution File: GRP465-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP465-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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:04 EDT 2022
% Result : Unsatisfiable 1.66s 1.90s
% Output : Refutation 1.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 4 RR)
% Number of literals : 21 ( 20 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP465-1.p',unknown),
[] ).
cnf(3,axiom,
divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C))) = B,
file('GRP465-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,divide(identity,B)),
file('GRP465-1.p',unknown),
[] ).
cnf(9,axiom,
identity = divide(A,A),
file('GRP465-1.p',unknown),
[] ).
cnf(11,plain,
divide(A,A) = identity,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,flip.1')] ).
cnf(12,plain,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),6,6,6,6]),
[iquote('back_demod,1,demod,6,6,6,6')] ).
cnf(13,plain,
divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),11]),
[iquote('back_demod,3,demod,11')] ).
cnf(28,plain,
divide(A,divide(divide(divide(identity,B),divide(identity,A)),identity)) = B,
inference(para_into,[status(thm),theory(equality)],[13,11]),
[iquote('para_into,13.1.1.2.2,10.1.1')] ).
cnf(31,plain,
divide(A,identity) = A,
inference(para_into,[status(thm),theory(equality)],[13,11]),
[iquote('para_into,13.1.1.2,10.1.1')] ).
cnf(33,plain,
divide(A,divide(divide(identity,B),divide(identity,A))) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[28]),31]),
[iquote('back_demod,28,demod,31')] ).
cnf(35,plain,
divide(A,divide(B,divide(identity,A))) = divide(identity,B),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[33,33]),11,31]),
[iquote('para_into,33.1.1.2.1,33.1.1,demod,11,31')] ).
cnf(42,plain,
divide(identity,divide(identity,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[33,31]),31]),
[iquote('para_into,33.1.1.2.2,30.1.1,demod,31')] ).
cnf(45,plain,
divide(identity,A) = divide(B,divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[35])]),
[iquote('copy,35,flip.1')] ).
cnf(53,plain,
divide(A,divide(divide(B,C),divide(divide(identity,A),C))) = divide(identity,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[33,13]),11,31]),
[iquote('para_from,33.1.1,13.1.1.2.1.1,demod,11,31')] ).
cnf(61,plain,
divide(divide(identity,A),divide(B,A)) = divide(identity,B),
inference(para_into,[status(thm),theory(equality)],[35,42]),
[iquote('para_into,35.1.1.2.2,41.1.1')] ).
cnf(69,plain,
divide(divide(a3,divide(A,divide(b3,divide(identity,A)))),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(para_from,[status(thm),theory(equality)],[45,12]),
[iquote('para_from,45.1.1,12.1.1.1.2')] ).
cnf(80,plain,
divide(divide(identity,divide(A,B)),divide(identity,A)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[61,61]),42]),
[iquote('para_into,61.1.1.2,61.1.1,demod,42')] ).
cnf(94,plain,
divide(divide(identity,divide(divide(identity,A),B)),A) = B,
inference(para_into,[status(thm),theory(equality)],[80,42]),
[iquote('para_into,80.1.1.2,41.1.1')] ).
cnf(358,plain,
divide(divide(A,B),divide(C,B)) = divide(A,C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[53,94]),42,42])]),
[iquote('para_from,53.1.1,94.1.1.1.2,demod,42,42,flip.1')] ).
cnf(386,plain,
divide(divide(A,divide(B,C)),divide(D,B)) = divide(A,divide(D,C)),
inference(para_into,[status(thm),theory(equality)],[358,358]),
[iquote('para_into,358.1.1.2,358.1.1')] ).
cnf(387,plain,
$false,
inference(binary,[status(thm)],[386,69]),
[iquote('binary,386.1,69.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP465-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 04:46:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.66/1.90 ----- Otter 3.3f, August 2004 -----
% 1.66/1.90 The process was started by sandbox2 on n017.cluster.edu,
% 1.66/1.90 Wed Jul 27 04:46:48 2022
% 1.66/1.90 The command was "./otter". The process ID is 2077.
% 1.66/1.90
% 1.66/1.90 set(prolog_style_variables).
% 1.66/1.90 set(auto).
% 1.66/1.90 dependent: set(auto1).
% 1.66/1.90 dependent: set(process_input).
% 1.66/1.90 dependent: clear(print_kept).
% 1.66/1.90 dependent: clear(print_new_demod).
% 1.66/1.90 dependent: clear(print_back_demod).
% 1.66/1.90 dependent: clear(print_back_sub).
% 1.66/1.90 dependent: set(control_memory).
% 1.66/1.90 dependent: assign(max_mem, 12000).
% 1.66/1.90 dependent: assign(pick_given_ratio, 4).
% 1.66/1.90 dependent: assign(stats_level, 1).
% 1.66/1.90 dependent: assign(max_seconds, 10800).
% 1.66/1.90 clear(print_given).
% 1.66/1.90
% 1.66/1.90 list(usable).
% 1.66/1.90 0 [] A=A.
% 1.66/1.90 0 [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C)))=B.
% 1.66/1.90 0 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.66/1.90 0 [] inverse(A)=divide(identity,A).
% 1.66/1.90 0 [] identity=divide(A,A).
% 1.66/1.90 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.66/1.90 end_of_list.
% 1.66/1.90
% 1.66/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.66/1.90
% 1.66/1.90 All clauses are units, and equality is present; the
% 1.66/1.90 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.66/1.90
% 1.66/1.90 dependent: set(knuth_bendix).
% 1.66/1.90 dependent: set(anl_eq).
% 1.66/1.90 dependent: set(para_from).
% 1.66/1.90 dependent: set(para_into).
% 1.66/1.90 dependent: clear(para_from_right).
% 1.66/1.90 dependent: clear(para_into_right).
% 1.66/1.90 dependent: set(para_from_vars).
% 1.66/1.90 dependent: set(eq_units_both_ways).
% 1.66/1.90 dependent: set(dynamic_demod_all).
% 1.66/1.90 dependent: set(dynamic_demod).
% 1.66/1.90 dependent: set(order_eq).
% 1.66/1.90 dependent: set(back_demod).
% 1.66/1.90 dependent: set(lrpo).
% 1.66/1.90
% 1.66/1.90 ------------> process usable:
% 1.66/1.90 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.66/1.90
% 1.66/1.90 ------------> process sos:
% 1.66/1.90 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.66/1.90 ** KEPT (pick-wt=17): 3 [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C)))=B.
% 1.66/1.90 ---> New Demodulator: 4 [new_demod,3] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C)))=B.
% 1.66/1.90 ** KEPT (pick-wt=9): 5 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.66/1.90 ---> New Demodulator: 6 [new_demod,5] multiply(A,B)=divide(A,divide(identity,B)).
% 1.66/1.90 ** KEPT (pick-wt=6): 7 [] inverse(A)=divide(identity,A).
% 1.66/1.90 ---> New Demodulator: 8 [new_demod,7] inverse(A)=divide(identity,A).
% 1.66/1.90 ** KEPT (pick-wt=5): 10 [copy,9,flip.1] divide(A,A)=identity.
% 1.66/1.90 ---> New Demodulator: 11 [new_demod,10] divide(A,A)=identity.
% 1.66/1.90 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.66/1.90 >>>> Starting back demodulation with 4.
% 1.66/1.90 >>>> Starting back demodulation with 6.
% 1.66/1.90 >> back demodulating 1 with 6.
% 1.66/1.90 >>>> Starting back demodulation with 8.
% 1.66/1.90 >>>> Starting back demodulation with 11.
% 1.66/1.90 >> back demodulating 3 with 11.
% 1.66/1.90 >>>> Starting back demodulation with 14.
% 1.66/1.90
% 1.66/1.90 ======= end of input processing =======
% 1.66/1.90
% 1.66/1.90 =========== start of search ===========
% 1.66/1.90
% 1.66/1.90 -------- PROOF --------
% 1.66/1.90
% 1.66/1.90 ----> UNIT CONFLICT at 0.01 sec ----> 387 [binary,386.1,69.1] $F.
% 1.66/1.90
% 1.66/1.90 Length of proof is 16. Level of proof is 10.
% 1.66/1.90
% 1.66/1.90 ---------------- PROOF ----------------
% 1.66/1.90 % SZS status Unsatisfiable
% 1.66/1.90 % SZS output start Refutation
% See solution above
% 1.66/1.90 ------------ end of proof -------------
% 1.66/1.90
% 1.66/1.90
% 1.66/1.90 Search stopped by max_proofs option.
% 1.66/1.90
% 1.66/1.90
% 1.66/1.90 Search stopped by max_proofs option.
% 1.66/1.90
% 1.66/1.90 ============ end of search ============
% 1.66/1.90
% 1.66/1.90 -------------- statistics -------------
% 1.66/1.90 clauses given 32
% 1.66/1.90 clauses generated 1124
% 1.66/1.90 clauses kept 232
% 1.66/1.90 clauses forward subsumed 1050
% 1.66/1.90 clauses back subsumed 8
% 1.66/1.90 Kbytes malloced 1953
% 1.66/1.90
% 1.66/1.90 ----------- times (seconds) -----------
% 1.66/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.66/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.66/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.66/1.90
% 1.66/1.90 That finishes the proof of the theorem.
% 1.66/1.90
% 1.66/1.90 Process 2077 finished Wed Jul 27 04:46:49 2022
% 1.66/1.90 Otter interrupted
% 1.66/1.90 PROOF FOUND
%------------------------------------------------------------------------------