TSTP Solution File: GRP519-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP519-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:10 EDT 2022
% Result : Unsatisfiable 1.61s 1.78s
% Output : Refutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 2 RR)
% Number of literals : 9 ( 8 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('GRP519-1.p',unknown),
[] ).
cnf(3,axiom,
multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C,
file('GRP519-1.p',unknown),
[] ).
cnf(5,plain,
multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(inverse(multiply(A,D)),B),D))) = C,
inference(para_into,[status(thm),theory(equality)],[3,3]),
[iquote('para_into,3.1.1.2.1.1.1,3.1.1')] ).
cnf(17,plain,
multiply(multiply(inverse(A),B),A) = B,
inference(para_into,[status(thm),theory(equality)],[5,3]),
[iquote('para_into,5.1.1.2,3.1.1')] ).
cnf(23,plain,
multiply(multiply(inverse(A),B),multiply(multiply(inverse(multiply(inverse(C),D)),A),D)) = multiply(B,C),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,5])]),
[iquote('para_into,17.1.1.1,5.1.1,flip.1')] ).
cnf(26,plain,
multiply(multiply(inverse(multiply(inverse(A),B)),C),B) = multiply(C,A),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[17,3])]),
[iquote('para_into,17.1.1.1,3.1.1,flip.1')] ).
cnf(29,plain,
multiply(multiply(inverse(A),B),multiply(A,C)) = multiply(B,C),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[23]),26]),
[iquote('back_demod,23,demod,26')] ).
cnf(84,plain,
multiply(multiply(A,B),C) = multiply(A,multiply(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[29,3]),26])]),
[iquote('para_into,29.1.1.1,3.1.1,demod,26,flip.1')] ).
cnf(86,plain,
$false,
inference(binary,[status(thm)],[84,1]),
[iquote('binary,84.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP519-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n022.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:00:05 EDT 2022
% 0.12/0.34 % 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:00:05 2022
% 1.61/1.78 The command was "./otter". The process ID is 17892.
% 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(inverse(multiply(A,B)),C),B))=C.
% 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(inverse(multiply(A,B)),C),B))=C.
% 1.61/1.78 ---> New Demodulator: 4 [new_demod,3] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B))=C.
% 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.00 sec ----> 86 [binary,84.1,1.1] $F.
% 1.61/1.78
% 1.61/1.78 Length of proof is 6. Level of proof is 5.
% 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 7
% 1.61/1.78 clauses generated 64
% 1.61/1.78 clauses kept 50
% 1.61/1.78 clauses forward subsumed 42
% 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.00 (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 1 (0 hr, 0 min, 1 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 17892 finished Wed Jul 27 05:00:06 2022
% 1.61/1.78 Otter interrupted
% 1.61/1.78 PROOF FOUND
%------------------------------------------------------------------------------