TSTP Solution File: GRP206-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP206-1 : TPTP v8.1.0. Released v2.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:56:44 EDT 2022
% Result : Unsatisfiable 1.89s 2.09s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 3 RR)
% Number of literals : 7 ( 6 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
file('GRP206-1.p',unknown),
[] ).
cnf(4,axiom,
multiply(identity,A) = A,
file('GRP206-1.p',unknown),
[] ).
cnf(5,axiom,
multiply(A,identity) = A,
file('GRP206-1.p',unknown),
[] ).
cnf(19,axiom,
multiply(A,multiply(multiply(B,C),A)) = multiply(multiply(A,B),multiply(C,A)),
file('GRP206-1.p',unknown),
[] ).
cnf(49,plain,
multiply(multiply(A,B),A) = multiply(A,multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,5]),4])]),
[iquote('para_into,19.1.1.2.1,5.1.1,demod,4,flip.1')] ).
cnf(55,plain,
multiply(a,multiply(multiply(b,c),a)) != multiply(multiply(a,b),multiply(c,a)),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),49]),
[iquote('back_demod,1,demod,49')] ).
cnf(56,plain,
$false,
inference(binary,[status(thm)],[55,19]),
[iquote('binary,55.1,19.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP206-1 : TPTP v8.1.0. Released v2.3.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:19:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n015.cluster.edu,
% 1.89/2.09 Wed Jul 27 05:19:41 2022
% 1.89/2.09 The command was "./otter". The process ID is 21766.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] A=A.
% 1.89/2.09 0 [] multiply(identity,X)=X.
% 1.89/2.09 0 [] multiply(X,identity)=X.
% 1.89/2.09 0 [] multiply(X,left_division(X,Y))=Y.
% 1.89/2.09 0 [] left_division(X,multiply(X,Y))=Y.
% 1.89/2.09 0 [] multiply(right_division(X,Y),Y)=X.
% 1.89/2.09 0 [] right_division(multiply(X,Y),Y)=X.
% 1.89/2.09 0 [] multiply(X,right_inverse(X))=identity.
% 1.89/2.09 0 [] multiply(left_inverse(X),X)=identity.
% 1.89/2.09 0 [] multiply(X,multiply(multiply(Y,Z),X))=multiply(multiply(X,Y),multiply(Z,X)).
% 1.89/2.09 0 [] multiply(multiply(a,multiply(b,c)),a)!=multiply(multiply(a,b),multiply(c,a)).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.89/2.09
% 1.89/2.09 All clauses are units, and equality is present; the
% 1.89/2.09 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.89/2.09
% 1.89/2.09 dependent: set(knuth_bendix).
% 1.89/2.09 dependent: set(anl_eq).
% 1.89/2.09 dependent: set(para_from).
% 1.89/2.09 dependent: set(para_into).
% 1.89/2.09 dependent: clear(para_from_right).
% 1.89/2.09 dependent: clear(para_into_right).
% 1.89/2.09 dependent: set(para_from_vars).
% 1.89/2.09 dependent: set(eq_units_both_ways).
% 1.89/2.09 dependent: set(dynamic_demod_all).
% 1.89/2.09 dependent: set(dynamic_demod).
% 1.89/2.09 dependent: set(order_eq).
% 1.89/2.09 dependent: set(back_demod).
% 1.89/2.09 dependent: set(lrpo).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=15): 1 [] multiply(multiply(a,multiply(b,c)),a)!=multiply(multiply(a,b),multiply(c,a)).
% 1.89/2.09
% 1.89/2.09 ------------> process sos:
% 1.89/2.09 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.89/2.09 ** KEPT (pick-wt=5): 3 [] multiply(identity,A)=A.
% 1.89/2.09 ---> New Demodulator: 4 [new_demod,3] multiply(identity,A)=A.
% 1.89/2.09 ** KEPT (pick-wt=5): 5 [] multiply(A,identity)=A.
% 1.89/2.09 ---> New Demodulator: 6 [new_demod,5] multiply(A,identity)=A.
% 1.89/2.09 ** KEPT (pick-wt=7): 7 [] multiply(A,left_division(A,B))=B.
% 1.89/2.09 ---> New Demodulator: 8 [new_demod,7] multiply(A,left_division(A,B))=B.
% 1.89/2.09 ** KEPT (pick-wt=7): 9 [] left_division(A,multiply(A,B))=B.
% 1.89/2.09 ---> New Demodulator: 10 [new_demod,9] left_division(A,multiply(A,B))=B.
% 1.89/2.09 ** KEPT (pick-wt=7): 11 [] multiply(right_division(A,B),B)=A.
% 1.89/2.09 ---> New Demodulator: 12 [new_demod,11] multiply(right_division(A,B),B)=A.
% 1.89/2.09 ** KEPT (pick-wt=7): 13 [] right_division(multiply(A,B),B)=A.
% 1.89/2.09 ---> New Demodulator: 14 [new_demod,13] right_division(multiply(A,B),B)=A.
% 1.89/2.09 ** KEPT (pick-wt=6): 15 [] multiply(A,right_inverse(A))=identity.
% 1.89/2.09 ---> New Demodulator: 16 [new_demod,15] multiply(A,right_inverse(A))=identity.
% 1.89/2.09 ** KEPT (pick-wt=6): 17 [] multiply(left_inverse(A),A)=identity.
% 1.89/2.09 ---> New Demodulator: 18 [new_demod,17] multiply(left_inverse(A),A)=identity.
% 1.89/2.09 ** KEPT (pick-wt=15): 19 [] multiply(A,multiply(multiply(B,C),A))=multiply(multiply(A,B),multiply(C,A)).
% 1.89/2.09 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.89/2.09 >>>> Starting back demodulation with 4.
% 1.89/2.09 >>>> Starting back demodulation with 6.
% 1.89/2.09 >>>> Starting back demodulation with 8.
% 1.89/2.09 >>>> Starting back demodulation with 10.
% 1.89/2.09 >>>> Starting back demodulation with 12.
% 1.89/2.09 >>>> Starting back demodulation with 14.
% 1.89/2.09 >>>> Starting back demodulation with 16.
% 1.89/2.09 >>>> Starting back demodulation with 18.
% 1.89/2.09 ** KEPT (pick-wt=15): 20 [copy,19,flip.1] multiply(multiply(A,B),multiply(C,A))=multiply(A,multiply(multiply(B,C),A)).
% 1.89/2.09 Following clause subsumed by 19 during input processing: 0 [copy,20,flip.1] multiply(A,multiply(multiply(B,C),A))=multiply(multiply(A,B),multiply(C,A)).
% 1.89/2.09
% 1.89/2.09 ======= end of input processing =======
% 1.89/2.09
% 1.89/2.09 =========== start of search ===========
% 1.89/2.09
% 1.89/2.09 -------- PROOF --------
% 1.89/2.09
% 1.89/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 56 [binary,55.1,19.1] $F.
% 1.89/2.09
% 1.89/2.09 Length of proof is 2. Level of proof is 2.
% 1.89/2.09
% 1.89/2.09 ---------------- PROOF ----------------
% 1.89/2.09 % SZS status Unsatisfiable
% 1.89/2.09 % SZS output start Refutation
% See solution above
% 1.89/2.09 ------------ end of proof -------------
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09 ============ end of search ============
% 1.89/2.09
% 1.89/2.09 -------------- statistics -------------
% 1.89/2.09 clauses given 21
% 1.89/2.09 clauses generated 97
% 1.89/2.09 clauses kept 31
% 1.89/2.09 clauses forward subsumed 87
% 1.89/2.09 clauses back subsumed 0
% 1.89/2.09 Kbytes malloced 976
% 1.89/2.09
% 1.89/2.09 ----------- times (seconds) -----------
% 1.89/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.09
% 1.89/2.09 That finishes the proof of the theorem.
% 1.89/2.09
% 1.89/2.09 Process 21766 finished Wed Jul 27 05:19:43 2022
% 1.89/2.09 Otter interrupted
% 1.89/2.09 PROOF FOUND
%------------------------------------------------------------------------------