TSTP Solution File: GRP535-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:12 EDT 2022
% Result : Unsatisfiable 1.75s 1.94s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 5 RR)
% Number of literals : 22 ( 21 equ; 4 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 34 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP535-1.p',unknown),
[] ).
cnf(2,axiom,
A = A,
file('GRP535-1.p',unknown),
[] ).
cnf(3,axiom,
divide(divide(A,divide(divide(A,B),C)),B) = C,
file('GRP535-1.p',unknown),
[] ).
cnf(5,axiom,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
file('GRP535-1.p',unknown),
[] ).
cnf(7,axiom,
identity = divide(A,A),
file('GRP535-1.p',unknown),
[] ).
cnf(9,plain,
divide(A,A) = identity,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(11,plain,
multiply(A,B) = divide(A,divide(identity,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),9])]),
[iquote('copy,5,flip.1,demod,9,flip.1')] ).
cnf(14,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]),11,11,11,11]),
[iquote('back_demod,1,demod,11,11,11,11')] ).
cnf(15,plain,
divide(divide(A,divide(identity,B)),A) = B,
inference(para_into,[status(thm),theory(equality)],[3,9]),
[iquote('para_into,3.1.1.1.2.1,8.1.1')] ).
cnf(25,plain,
divide(identity,divide(identity,A)) = A,
inference(para_into,[status(thm),theory(equality)],[15,9]),
[iquote('para_into,15.1.1.1,8.1.1')] ).
cnf(29,plain,
divide(divide(A,B),divide(identity,B)) = A,
inference(para_from,[status(thm),theory(equality)],[15,3]),
[iquote('para_from,15.1.1,3.1.1.1.2')] ).
cnf(34,plain,
divide(A,identity) = A,
inference(para_from,[status(thm),theory(equality)],[25,15]),
[iquote('para_from,25.1.1,15.1.1.1')] ).
cnf(35,plain,
divide(divide(A,B),A) = divide(identity,B),
inference(para_from,[status(thm),theory(equality)],[25,15]),
[iquote('para_from,25.1.1,15.1.1.1.2')] ).
cnf(40,plain,
divide(A,divide(A,B)) = B,
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[34,3]),34])]),
[iquote('para_into,33.1.1,3.1.1,demod,34,flip.1')] ).
cnf(43,plain,
divide(divide(A,B),C) = divide(divide(A,C),B),
inference(para_from,[status(thm),theory(equality)],[40,3]),
[iquote('para_from,39.1.1,3.1.1.1.2')] ).
cnf(62,plain,
divide(A,divide(identity,divide(B,A))) = B,
inference(para_into,[status(thm),theory(equality)],[29,40]),
[iquote('para_into,29.1.1.1,39.1.1')] ).
cnf(70,plain,
divide(A,B) = divide(identity,divide(B,A)),
inference(para_into,[status(thm),theory(equality)],[35,40]),
[iquote('para_into,35.1.1.1,39.1.1')] ).
cnf(81,plain,
divide(A,divide(divide(A,B),C)) = divide(B,divide(identity,C)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[62,3])]),
[iquote('para_into,62.1.1.2.2,3.1.1,flip.1')] ).
cnf(117,plain,
divide(divide(b3,divide(identity,a3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[70,14]),81]),
[iquote('para_from,70.1.1,14.1.1.1,demod,81')] ).
cnf(134,plain,
divide(divide(A,B),C) = divide(identity,divide(B,divide(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[43,70])]),
[iquote('para_into,43.1.1,70.1.1,flip.1')] ).
cnf(148,plain,
divide(a3,divide(identity,divide(b3,divide(identity,c3)))) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[117]),134,134,40]),
[iquote('back_demod,117,demod,134,134,40')] ).
cnf(149,plain,
$false,
inference(binary,[status(thm)],[148,2]),
[iquote('binary,148.1,2.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 05:20:09 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.75/1.94 ----- Otter 3.3f, August 2004 -----
% 1.75/1.94 The process was started by sandbox2 on n014.cluster.edu,
% 1.75/1.94 Wed Jul 27 05:20:09 2022
% 1.75/1.94 The command was "./otter". The process ID is 2911.
% 1.75/1.94
% 1.75/1.94 set(prolog_style_variables).
% 1.75/1.94 set(auto).
% 1.75/1.94 dependent: set(auto1).
% 1.75/1.94 dependent: set(process_input).
% 1.75/1.94 dependent: clear(print_kept).
% 1.75/1.94 dependent: clear(print_new_demod).
% 1.75/1.94 dependent: clear(print_back_demod).
% 1.75/1.94 dependent: clear(print_back_sub).
% 1.75/1.94 dependent: set(control_memory).
% 1.75/1.94 dependent: assign(max_mem, 12000).
% 1.75/1.94 dependent: assign(pick_given_ratio, 4).
% 1.75/1.94 dependent: assign(stats_level, 1).
% 1.75/1.94 dependent: assign(max_seconds, 10800).
% 1.75/1.94 clear(print_given).
% 1.75/1.94
% 1.75/1.94 list(usable).
% 1.75/1.94 0 [] A=A.
% 1.75/1.94 0 [] divide(divide(A,divide(divide(A,B),C)),B)=C.
% 1.75/1.94 0 [] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 1.75/1.94 0 [] inverse(A)=divide(divide(B,B),A).
% 1.75/1.94 0 [] identity=divide(A,A).
% 1.75/1.94 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.75/1.94 end_of_list.
% 1.75/1.94
% 1.75/1.94 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.75/1.94
% 1.75/1.94 All clauses are units, and equality is present; the
% 1.75/1.94 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.75/1.94
% 1.75/1.94 dependent: set(knuth_bendix).
% 1.75/1.94 dependent: set(anl_eq).
% 1.75/1.94 dependent: set(para_from).
% 1.75/1.94 dependent: set(para_into).
% 1.75/1.94 dependent: clear(para_from_right).
% 1.75/1.94 dependent: clear(para_into_right).
% 1.75/1.94 dependent: set(para_from_vars).
% 1.75/1.94 dependent: set(eq_units_both_ways).
% 1.75/1.94 dependent: set(dynamic_demod_all).
% 1.75/1.94 dependent: set(dynamic_demod).
% 1.75/1.94 dependent: set(order_eq).
% 1.75/1.94 dependent: set(back_demod).
% 1.75/1.94 dependent: set(lrpo).
% 1.75/1.94
% 1.75/1.94 ------------> process usable:
% 1.75/1.94 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.75/1.94
% 1.75/1.94 ------------> process sos:
% 1.75/1.94 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.75/1.94 ** KEPT (pick-wt=11): 3 [] divide(divide(A,divide(divide(A,B),C)),B)=C.
% 1.75/1.94 ---> New Demodulator: 4 [new_demod,3] divide(divide(A,divide(divide(A,B),C)),B)=C.
% 1.75/1.94 ** KEPT (pick-wt=11): 5 [] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 1.75/1.94 ** KEPT (pick-wt=8): 6 [] inverse(A)=divide(divide(B,B),A).
% 1.75/1.94 ** KEPT (pick-wt=5): 8 [copy,7,flip.1] divide(A,A)=identity.
% 1.75/1.94 ---> New Demodulator: 9 [new_demod,8] divide(A,A)=identity.
% 1.75/1.94 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.75/1.94 >>>> Starting back demodulation with 4.
% 1.75/1.94 ** KEPT (pick-wt=9): 10 [copy,5,flip.1,demod,9,flip.1] multiply(A,B)=divide(A,divide(identity,B)).
% 1.75/1.94 ---> New Demodulator: 11 [new_demod,10] multiply(A,B)=divide(A,divide(identity,B)).
% 1.75/1.94 ** KEPT (pick-wt=6): 12 [copy,6,flip.1,demod,9,flip.1] inverse(A)=divide(identity,A).
% 1.75/1.94 ---> New Demodulator: 13 [new_demod,12] inverse(A)=divide(identity,A).
% 1.75/1.94 >>>> Starting back demodulation with 9.
% 1.75/1.94 >> back demodulating 6 with 9.
% 1.75/1.94 >> back demodulating 5 with 9.
% 1.75/1.94 >>>> Starting back demodulation with 11.
% 1.75/1.94 >> back demodulating 1 with 11.
% 1.75/1.94 >>>> Starting back demodulation with 13.
% 1.75/1.94
% 1.75/1.94 ======= end of input processing =======
% 1.75/1.94
% 1.75/1.94 =========== start of search ===========
% 1.75/1.94
% 1.75/1.94 -------- PROOF --------
% 1.75/1.94
% 1.75/1.94 ----> UNIT CONFLICT at 0.00 sec ----> 149 [binary,148.1,2.1] $F.
% 1.75/1.94
% 1.75/1.94 Length of proof is 16. Level of proof is 9.
% 1.75/1.94
% 1.75/1.94 ---------------- PROOF ----------------
% 1.75/1.94 % SZS status Unsatisfiable
% 1.75/1.94 % SZS output start Refutation
% See solution above
% 1.75/1.94 ------------ end of proof -------------
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94
% 1.75/1.94 Search stopped by max_proofs option.
% 1.75/1.94
% 1.75/1.94 ============ end of search ============
% 1.75/1.94
% 1.75/1.94 -------------- statistics -------------
% 1.75/1.94 clauses given 19
% 1.75/1.94 clauses generated 232
% 1.75/1.94 clauses kept 89
% 1.75/1.94 clauses forward subsumed 209
% 1.75/1.94 clauses back subsumed 1
% 1.75/1.94 Kbytes malloced 976
% 1.75/1.94
% 1.75/1.94 ----------- times (seconds) -----------
% 1.75/1.94 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.94 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.94
% 1.75/1.94 That finishes the proof of the theorem.
% 1.75/1.94
% 1.75/1.94 Process 2911 finished Wed Jul 27 05:20:11 2022
% 1.75/1.95 Otter interrupted
% 1.75/1.95 PROOF FOUND
%------------------------------------------------------------------------------