TSTP Solution File: GRP521-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP521-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:10 EDT 2022
% Result : Unsatisfiable 1.87s 2.08s
% Output : Refutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 6 RR)
% Number of literals : 20 ( 19 equ; 5 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; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('GRP521-1.p',unknown),
[] ).
cnf(2,plain,
multiply(inverse(b1),b1) != multiply(inverse(a1),a1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[1])]),
[iquote('copy,1,flip.1')] ).
cnf(5,axiom,
divide(A,divide(B,divide(C,divide(A,B)))) = C,
file('GRP521-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,divide(divide(C,C),B)),
file('GRP521-1.p',unknown),
[] ).
cnf(7,axiom,
inverse(A) = divide(divide(B,B),A),
file('GRP521-1.p',unknown),
[] ).
cnf(8,plain,
divide(A,divide(divide(B,B),C)) = multiply(A,C),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(9,plain,
divide(divide(A,A),B) = inverse(B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,plain,
divide(divide(A,A),B) = divide(divide(C,C),B),
inference(para_into,[status(thm),theory(equality)],[7,7]),
[iquote('para_into,7.1.1,7.1.1')] ).
cnf(11,plain,
multiply(divide(divide(A,A),b1),b1) != multiply(inverse(a1),a1),
inference(para_from,[status(thm),theory(equality)],[7,2]),
[iquote('para_from,7.1.1,2.1.1.1')] ).
cnf(12,plain,
multiply(inverse(a1),a1) != multiply(divide(divide(A,A),b1),b1),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[11])]),
[iquote('copy,11,flip.1')] ).
cnf(85,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(para_into,[status(thm),theory(equality)],[8,9]),
[iquote('para_into,8.1.1.2,9.1.1')] ).
cnf(92,plain,
multiply(A,divide(B,divide(A,divide(C,C)))) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[8,5])]),
[iquote('para_into,8.1.1,4.1.1,flip.1')] ).
cnf(98,plain,
multiply(A,B) = divide(A,inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[85])]),
[iquote('copy,85,flip.1')] ).
cnf(129,plain,
divide(A,A) = divide(B,B),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[10,5]),5]),
[iquote('para_from,10.1.1,4.1.1.2.2,demod,5')] ).
cnf(144,plain,
divide(A,divide(B,divide(C,C))) = divide(A,B),
inference(para_from,[status(thm),theory(equality)],[129,5]),
[iquote('para_from,129.1.1,4.1.1.2.2')] ).
cnf(145,plain,
divide(A,divide(A,B)) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[129,5]),144]),
[iquote('para_from,129.1.1,4.1.1.2.2.2,demod,144')] ).
cnf(150,plain,
multiply(A,divide(B,A)) = B,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[92]),144]),
[iquote('back_demod,92,demod,144')] ).
cnf(187,plain,
multiply(divide(A,B),B) = A,
inference(para_into,[status(thm),theory(equality)],[150,145]),
[iquote('para_into,150.1.1.2,145.1.1')] ).
cnf(197,plain,
multiply(inverse(a1),a1) != divide(A,A),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[12]),187]),
[iquote('back_demod,12,demod,187')] ).
cnf(198,plain,
$false,
inference(binary,[status(thm)],[197,98]),
[iquote('binary,197.1,98.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : GRP521-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n013.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:57:30 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.08 ----- Otter 3.3f, August 2004 -----
% 1.87/2.08 The process was started by sandbox on n013.cluster.edu,
% 1.87/2.08 Wed Jul 27 04:57:30 2022
% 1.87/2.08 The command was "./otter". The process ID is 15913.
% 1.87/2.08
% 1.87/2.08 set(prolog_style_variables).
% 1.87/2.08 set(auto).
% 1.87/2.08 dependent: set(auto1).
% 1.87/2.08 dependent: set(process_input).
% 1.87/2.08 dependent: clear(print_kept).
% 1.87/2.08 dependent: clear(print_new_demod).
% 1.87/2.08 dependent: clear(print_back_demod).
% 1.87/2.08 dependent: clear(print_back_sub).
% 1.87/2.08 dependent: set(control_memory).
% 1.87/2.08 dependent: assign(max_mem, 12000).
% 1.87/2.08 dependent: assign(pick_given_ratio, 4).
% 1.87/2.08 dependent: assign(stats_level, 1).
% 1.87/2.08 dependent: assign(max_seconds, 10800).
% 1.87/2.08 clear(print_given).
% 1.87/2.08
% 1.87/2.08 list(usable).
% 1.87/2.08 0 [] A=A.
% 1.87/2.08 0 [] divide(A,divide(B,divide(C,divide(A,B))))=C.
% 1.87/2.08 0 [] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 1.87/2.08 0 [] inverse(A)=divide(divide(B,B),A).
% 1.87/2.08 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 1.87/2.08 end_of_list.
% 1.87/2.08
% 1.87/2.08 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.87/2.08
% 1.87/2.08 All clauses are units, and equality is present; the
% 1.87/2.08 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.87/2.08
% 1.87/2.08 dependent: set(knuth_bendix).
% 1.87/2.08 dependent: set(anl_eq).
% 1.87/2.08 dependent: set(para_from).
% 1.87/2.08 dependent: set(para_into).
% 1.87/2.08 dependent: clear(para_from_right).
% 1.87/2.08 dependent: clear(para_into_right).
% 1.87/2.08 dependent: set(para_from_vars).
% 1.87/2.08 dependent: set(eq_units_both_ways).
% 1.87/2.08 dependent: set(dynamic_demod_all).
% 1.87/2.08 dependent: set(dynamic_demod).
% 1.87/2.08 dependent: set(order_eq).
% 1.87/2.08 dependent: set(back_demod).
% 1.87/2.08 dependent: set(lrpo).
% 1.87/2.08
% 1.87/2.08 ------------> process usable:
% 1.87/2.08 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 1.87/2.08
% 1.87/2.08 ------------> process sos:
% 1.87/2.08 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.87/2.08 ** KEPT (pick-wt=11): 4 [] divide(A,divide(B,divide(C,divide(A,B))))=C.
% 1.87/2.08 ---> New Demodulator: 5 [new_demod,4] divide(A,divide(B,divide(C,divide(A,B))))=C.
% 1.87/2.08 ** KEPT (pick-wt=11): 6 [] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 1.87/2.08 ** KEPT (pick-wt=8): 7 [] inverse(A)=divide(divide(B,B),A).
% 1.87/2.08 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.87/2.08 >>>> Starting back demodulation with 5.
% 1.87/2.08 ** KEPT (pick-wt=11): 8 [copy,6,flip.1] divide(A,divide(divide(B,B),C))=multiply(A,C).
% 1.87/2.08 ** KEPT (pick-wt=8): 9 [copy,7,flip.1] divide(divide(A,A),B)=inverse(B).
% 1.87/2.08 Following clause subsumed by 6 during input processing: 0 [copy,8,flip.1] multiply(A,B)=divide(A,divide(divide(C,C),B)).
% 1.87/2.08 Following clause subsumed by 7 during input processing: 0 [copy,9,flip.1] inverse(A)=divide(divide(B,B),A).
% 1.87/2.08
% 1.87/2.08 ======= end of input processing =======
% 1.87/2.08
% 1.87/2.08 =========== start of search ===========
% 1.87/2.08
% 1.87/2.08 -------- PROOF --------
% 1.87/2.08
% 1.87/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 198 [binary,197.1,98.1] $F.
% 1.87/2.08
% 1.87/2.08 Length of proof is 15. Level of proof is 6.
% 1.87/2.08
% 1.87/2.08 ---------------- PROOF ----------------
% 1.87/2.08 % SZS status Unsatisfiable
% 1.87/2.08 % SZS output start Refutation
% See solution above
% 1.87/2.08 ------------ end of proof -------------
% 1.87/2.08
% 1.87/2.08
% 1.87/2.08 Search stopped by max_proofs option.
% 1.87/2.08
% 1.87/2.08
% 1.87/2.08 Search stopped by max_proofs option.
% 1.87/2.08
% 1.87/2.08 ============ end of search ============
% 1.87/2.08
% 1.87/2.08 -------------- statistics -------------
% 1.87/2.08 clauses given 14
% 1.87/2.08 clauses generated 170
% 1.87/2.08 clauses kept 156
% 1.87/2.08 clauses forward subsumed 190
% 1.87/2.08 clauses back subsumed 0
% 1.87/2.08 Kbytes malloced 1953
% 1.87/2.08
% 1.87/2.08 ----------- times (seconds) -----------
% 1.87/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.87/2.08 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.87/2.08
% 1.87/2.08 That finishes the proof of the theorem.
% 1.87/2.08
% 1.87/2.08 Process 15913 finished Wed Jul 27 04:57:31 2022
% 1.87/2.08 Otter interrupted
% 1.87/2.08 PROOF FOUND
%------------------------------------------------------------------------------