TSTP Solution File: GRP515-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:09 EDT 2022
% Result : Unsatisfiable 1.61s 1.78s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 17 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 40 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP515-1.p',unknown),
[] ).
cnf(3,axiom,
multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B,
file('GRP515-1.p',unknown),
[] ).
cnf(5,plain,
multiply(A,multiply(B,inverse(multiply(A,multiply(multiply(B,C),inverse(multiply(D,C))))))) = D,
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.1,3.1.1')] ).
cnf(7,plain,
multiply(A,multiply(multiply(B,multiply(multiply(C,D),inverse(multiply(A,D)))),inverse(C))) = B,
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.2.1,3.1.1')] ).
cnf(17,plain,
multiply(A,multiply(B,inverse(B))) = A,
inference(para_into,[status(thm),theory(equality)],[5,3]),
[iquote('para_into,5.1.1.2.2.1,3.1.1')] ).
cnf(21,plain,
multiply(A,multiply(B,inverse(A))) = B,
inference(para_from,[status(thm),theory(equality)],[17,5]),
[iquote('para_from,17.1.1,5.1.1.2.2.1')] ).
cnf(25,plain,
multiply(multiply(A,B),multiply(C,inverse(multiply(C,B)))) = A,
inference(para_from,[status(thm),theory(equality)],[21,5]),
[iquote('para_from,21.1.1,5.1.1.2.2.1')] ).
cnf(48,plain,
multiply(A,multiply(multiply(B,C),inverse(B))) = multiply(A,C),
inference(para_into,[status(thm),theory(equality)],[7,21]),
[iquote('para_into,7.1.1.2.1,21.1.1')] ).
cnf(63,plain,
multiply(multiply(A,multiply(B,inverse(multiply(B,C)))),C) = A,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[25,25]),48]),
[iquote('para_into,25.1.1.2.2.1,25.1.1,demod,48')] ).
cnf(73,plain,
multiply(multiply(A,B),multiply(C,inverse(A))) = multiply(C,B),
inference(para_from,[status(thm),theory(equality)],[25,7]),
[iquote('para_from,25.1.1,7.1.1.2.1')] ).
cnf(123,plain,
multiply(A,multiply(B,inverse(multiply(B,inverse(C))))) = multiply(A,C),
inference(flip,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[63,48])]),
[iquote('para_from,63.1.1,47.1.1.2,flip.1')] ).
cnf(124,plain,
multiply(A,B) = multiply(B,A),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[63,21]),123]),
[iquote('para_from,63.1.1,21.1.1.2,demod,123')] ).
cnf(147,plain,
multiply(A,multiply(inverse(A),B)) = B,
inference(para_from,[status(thm),theory(equality)],[124,21]),
[iquote('para_from,124.1.1,21.1.1.2')] ).
cnf(155,plain,
multiply(c3,multiply(a3,b3)) != multiply(a3,multiply(b3,c3)),
inference(para_from,[status(thm),theory(equality)],[124,1]),
[iquote('para_from,124.1.1,1.1.1')] ).
cnf(215,plain,
inverse(inverse(A)) = A,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[147,17])]),
[iquote('para_into,147.1.1,17.1.1,flip.1')] ).
cnf(216,plain,
multiply(inverse(A),multiply(A,B)) = B,
inference(para_from,[status(thm),theory(equality)],[215,147]),
[iquote('para_from,214.1.1,147.1.1.2.1')] ).
cnf(277,plain,
multiply(A,multiply(B,C)) = multiply(B,multiply(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[216,73]),215]),
[iquote('para_from,216.1.1,73.1.1.1,demod,215')] ).
cnf(278,plain,
$false,
inference(binary,[status(thm)],[277,155]),
[iquote('binary,277.1,155.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP515-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n022.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:17:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.61/1.78 ----- Otter 3.3f, August 2004 -----
% 1.61/1.78 The process was started by sandbox2 on n022.cluster.edu,
% 1.61/1.78 Wed Jul 27 05:17:20 2022
% 1.61/1.78 The command was "./otter". The process ID is 20467.
% 1.61/1.78
% 1.61/1.78 set(prolog_style_variables).
% 1.61/1.78 set(auto).
% 1.61/1.78 dependent: set(auto1).
% 1.61/1.78 dependent: set(process_input).
% 1.61/1.78 dependent: clear(print_kept).
% 1.61/1.78 dependent: clear(print_new_demod).
% 1.61/1.78 dependent: clear(print_back_demod).
% 1.61/1.78 dependent: clear(print_back_sub).
% 1.61/1.78 dependent: set(control_memory).
% 1.61/1.78 dependent: assign(max_mem, 12000).
% 1.61/1.78 dependent: assign(pick_given_ratio, 4).
% 1.61/1.78 dependent: assign(stats_level, 1).
% 1.61/1.78 dependent: assign(max_seconds, 10800).
% 1.61/1.78 clear(print_given).
% 1.61/1.78
% 1.61/1.78 list(usable).
% 1.61/1.78 0 [] A=A.
% 1.61/1.78 0 [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.61/1.78 0 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.61/1.78 end_of_list.
% 1.61/1.78
% 1.61/1.78 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.61/1.78
% 1.61/1.78 All clauses are units, and equality is present; the
% 1.61/1.78 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.61/1.78
% 1.61/1.78 dependent: set(knuth_bendix).
% 1.61/1.78 dependent: set(anl_eq).
% 1.61/1.78 dependent: set(para_from).
% 1.61/1.78 dependent: set(para_into).
% 1.61/1.78 dependent: clear(para_from_right).
% 1.61/1.78 dependent: clear(para_into_right).
% 1.61/1.78 dependent: set(para_from_vars).
% 1.61/1.78 dependent: set(eq_units_both_ways).
% 1.61/1.78 dependent: set(dynamic_demod_all).
% 1.61/1.78 dependent: set(dynamic_demod).
% 1.61/1.78 dependent: set(order_eq).
% 1.61/1.78 dependent: set(back_demod).
% 1.61/1.78 dependent: set(lrpo).
% 1.61/1.78
% 1.61/1.78 ------------> process usable:
% 1.61/1.78 ** KEPT (pick-wt=11): 1 [] multiply(multiply(a3,b3),c3)!=multiply(a3,multiply(b3,c3)).
% 1.61/1.78
% 1.61/1.78 ------------> process sos:
% 1.61/1.78 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.61/1.78 ** KEPT (pick-wt=12): 3 [] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.61/1.78 ---> New Demodulator: 4 [new_demod,3] multiply(A,multiply(multiply(B,C),inverse(multiply(A,C))))=B.
% 1.61/1.78 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.61/1.78 >>>> Starting back demodulation with 4.
% 1.61/1.78
% 1.61/1.78 ======= end of input processing =======
% 1.61/1.78
% 1.61/1.78 =========== start of search ===========
% 1.61/1.78
% 1.61/1.78 -------- PROOF --------
% 1.61/1.78
% 1.61/1.78 ----> UNIT CONFLICT at 0.01 sec ----> 278 [binary,277.1,155.1] $F.
% 1.61/1.78
% 1.61/1.78 Length of proof is 15. Level of proof is 11.
% 1.61/1.78
% 1.61/1.78 ---------------- PROOF ----------------
% 1.61/1.78 % SZS status Unsatisfiable
% 1.61/1.78 % SZS output start Refutation
% See solution above
% 1.61/1.78 ------------ end of proof -------------
% 1.61/1.78
% 1.61/1.78
% 1.61/1.78 Search stopped by max_proofs option.
% 1.61/1.78
% 1.61/1.78
% 1.61/1.78 Search stopped by max_proofs option.
% 1.61/1.78
% 1.61/1.78 ============ end of search ============
% 1.61/1.78
% 1.61/1.78 -------------- statistics -------------
% 1.61/1.78 clauses given 23
% 1.61/1.78 clauses generated 452
% 1.61/1.78 clauses kept 157
% 1.61/1.78 clauses forward subsumed 422
% 1.61/1.78 clauses back subsumed 0
% 1.61/1.78 Kbytes malloced 1953
% 1.61/1.78
% 1.61/1.78 ----------- times (seconds) -----------
% 1.61/1.78 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.61/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.61/1.78 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.61/1.78
% 1.61/1.78 That finishes the proof of the theorem.
% 1.61/1.78
% 1.61/1.78 Process 20467 finished Wed Jul 27 05:17:22 2022
% 1.61/1.78 Otter interrupted
% 1.61/1.78 PROOF FOUND
%------------------------------------------------------------------------------