TSTP Solution File: GRP671-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:37 EDT 2022
% Result : Unsatisfiable 1.82s 2.02s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 2 RR)
% Number of literals : 7 ( 6 equ; 1 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 : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
mult(mult(a,b),a) != mult(a,mult(b,a)),
file('GRP671-1.p',unknown),
[] ).
cnf(12,axiom,
mult(A,unit) = A,
file('GRP671-1.p',unknown),
[] ).
cnf(13,axiom,
mult(unit,A) = A,
file('GRP671-1.p',unknown),
[] ).
cnf(19,axiom,
mult(mult(A,B),mult(C,mult(A,B))) = mult(mult(mult(A,mult(B,C)),A),B),
file('GRP671-1.p',unknown),
[] ).
cnf(20,plain,
mult(mult(mult(A,mult(B,C)),A),B) = mult(mult(A,B),mult(C,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[19])]),
[iquote('copy,19,flip.1')] ).
cnf(63,plain,
mult(mult(A,B),A) = mult(A,mult(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[20,13]),12,12,12]),
[iquote('para_into,20.1.1.1.1.2,13.1.1,demod,12,12,12')] ).
cnf(65,plain,
$false,
inference(binary,[status(thm)],[63,1]),
[iquote('binary,63.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:09:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.82/2.02 ----- Otter 3.3f, August 2004 -----
% 1.82/2.02 The process was started by sandbox2 on n025.cluster.edu,
% 1.82/2.02 Wed Jul 27 05:09:45 2022
% 1.82/2.02 The command was "./otter". The process ID is 5627.
% 1.82/2.02
% 1.82/2.02 set(prolog_style_variables).
% 1.82/2.02 set(auto).
% 1.82/2.02 dependent: set(auto1).
% 1.82/2.02 dependent: set(process_input).
% 1.82/2.02 dependent: clear(print_kept).
% 1.82/2.02 dependent: clear(print_new_demod).
% 1.82/2.02 dependent: clear(print_back_demod).
% 1.82/2.02 dependent: clear(print_back_sub).
% 1.82/2.02 dependent: set(control_memory).
% 1.82/2.02 dependent: assign(max_mem, 12000).
% 1.82/2.02 dependent: assign(pick_given_ratio, 4).
% 1.82/2.02 dependent: assign(stats_level, 1).
% 1.82/2.02 dependent: assign(max_seconds, 10800).
% 1.82/2.02 clear(print_given).
% 1.82/2.02
% 1.82/2.02 list(usable).
% 1.82/2.02 0 [] A=A.
% 1.82/2.02 0 [] mult(A,ld(A,B))=B.
% 1.82/2.02 0 [] ld(A,mult(A,B))=B.
% 1.82/2.02 0 [] mult(rd(A,B),B)=A.
% 1.82/2.02 0 [] rd(mult(A,B),B)=A.
% 1.82/2.02 0 [] mult(A,unit)=A.
% 1.82/2.02 0 [] mult(unit,A)=A.
% 1.82/2.02 0 [] mult(i(A),mult(A,B))=B.
% 1.82/2.02 0 [] mult(mult(A,B),i(B))=A.
% 1.82/2.02 0 [] mult(mult(A,B),mult(C,mult(A,B)))=mult(mult(mult(A,mult(B,C)),A),B).
% 1.82/2.02 0 [] mult(mult(a,b),a)!=mult(a,mult(b,a)).
% 1.82/2.02 end_of_list.
% 1.82/2.02
% 1.82/2.02 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.82/2.02
% 1.82/2.02 All clauses are units, and equality is present; the
% 1.82/2.02 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.82/2.02
% 1.82/2.02 dependent: set(knuth_bendix).
% 1.82/2.02 dependent: set(anl_eq).
% 1.82/2.02 dependent: set(para_from).
% 1.82/2.02 dependent: set(para_into).
% 1.82/2.02 dependent: clear(para_from_right).
% 1.82/2.02 dependent: clear(para_into_right).
% 1.82/2.02 dependent: set(para_from_vars).
% 1.82/2.02 dependent: set(eq_units_both_ways).
% 1.82/2.02 dependent: set(dynamic_demod_all).
% 1.82/2.02 dependent: set(dynamic_demod).
% 1.82/2.02 dependent: set(order_eq).
% 1.82/2.02 dependent: set(back_demod).
% 1.82/2.02 dependent: set(lrpo).
% 1.82/2.02
% 1.82/2.02 ------------> process usable:
% 1.82/2.02 ** KEPT (pick-wt=11): 1 [] mult(mult(a,b),a)!=mult(a,mult(b,a)).
% 1.82/2.02
% 1.82/2.02 ------------> process sos:
% 1.82/2.02 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.82/2.02 ** KEPT (pick-wt=7): 3 [] mult(A,ld(A,B))=B.
% 1.82/2.02 ---> New Demodulator: 4 [new_demod,3] mult(A,ld(A,B))=B.
% 1.82/2.02 ** KEPT (pick-wt=7): 5 [] ld(A,mult(A,B))=B.
% 1.82/2.02 ---> New Demodulator: 6 [new_demod,5] ld(A,mult(A,B))=B.
% 1.82/2.02 ** KEPT (pick-wt=7): 7 [] mult(rd(A,B),B)=A.
% 1.82/2.02 ---> New Demodulator: 8 [new_demod,7] mult(rd(A,B),B)=A.
% 1.82/2.02 ** KEPT (pick-wt=7): 9 [] rd(mult(A,B),B)=A.
% 1.82/2.02 ---> New Demodulator: 10 [new_demod,9] rd(mult(A,B),B)=A.
% 1.82/2.02 ** KEPT (pick-wt=5): 11 [] mult(A,unit)=A.
% 1.82/2.02 ---> New Demodulator: 12 [new_demod,11] mult(A,unit)=A.
% 1.82/2.02 ** KEPT (pick-wt=5): 13 [] mult(unit,A)=A.
% 1.82/2.02 ---> New Demodulator: 14 [new_demod,13] mult(unit,A)=A.
% 1.82/2.02 ** KEPT (pick-wt=8): 15 [] mult(i(A),mult(A,B))=B.
% 1.82/2.02 ---> New Demodulator: 16 [new_demod,15] mult(i(A),mult(A,B))=B.
% 1.82/2.02 ** KEPT (pick-wt=8): 17 [] mult(mult(A,B),i(B))=A.
% 1.82/2.02 ---> New Demodulator: 18 [new_demod,17] mult(mult(A,B),i(B))=A.
% 1.82/2.02 ** KEPT (pick-wt=19): 20 [copy,19,flip.1] mult(mult(mult(A,mult(B,C)),A),B)=mult(mult(A,B),mult(C,mult(A,B))).
% 1.82/2.02 ---> New Demodulator: 21 [new_demod,20] mult(mult(mult(A,mult(B,C)),A),B)=mult(mult(A,B),mult(C,mult(A,B))).
% 1.82/2.02 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.82/2.02 >>>> Starting back demodulation with 4.
% 1.82/2.02 >>>> Starting back demodulation with 6.
% 1.82/2.02 >>>> Starting back demodulation with 8.
% 1.82/2.02 >>>> Starting back demodulation with 10.
% 1.82/2.02 >>>> Starting back demodulation with 12.
% 1.82/2.02 >>>> Starting back demodulation with 14.
% 1.82/2.02 >>>> Starting back demodulation with 16.
% 1.82/2.02 >>>> Starting back demodulation with 18.
% 1.82/2.02 >>>> Starting back demodulation with 21.
% 1.82/2.02
% 1.82/2.02 ======= end of input processing =======
% 1.82/2.02
% 1.82/2.02 =========== start of search ===========
% 1.82/2.02
% 1.82/2.02 -------- PROOF --------
% 1.82/2.02
% 1.82/2.02 ----> UNIT CONFLICT at 0.00 sec ----> 65 [binary,63.1,1.1] $F.
% 1.82/2.02
% 1.82/2.02 Length of proof is 2. Level of proof is 2.
% 1.82/2.02
% 1.82/2.02 ---------------- PROOF ----------------
% 1.82/2.02 % SZS status Unsatisfiable
% 1.82/2.02 % SZS output start Refutation
% See solution above
% 1.82/2.02 ------------ end of proof -------------
% 1.82/2.02
% 1.82/2.02
% 1.82/2.02 Search stopped by max_proofs option.
% 1.82/2.02
% 1.82/2.02
% 1.82/2.02 Search stopped by max_proofs option.
% 1.82/2.02
% 1.82/2.02 ============ end of search ============
% 1.82/2.02
% 1.82/2.02 -------------- statistics -------------
% 1.82/2.02 clauses given 16
% 1.82/2.02 clauses generated 81
% 1.82/2.02 clauses kept 36
% 1.82/2.02 clauses forward subsumed 68
% 1.82/2.02 clauses back subsumed 0
% 1.82/2.02 Kbytes malloced 976
% 1.82/2.02
% 1.82/2.02 ----------- times (seconds) -----------
% 1.82/2.02 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/2.02 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/2.02
% 1.82/2.02 That finishes the proof of the theorem.
% 1.82/2.02
% 1.82/2.02 Process 5627 finished Wed Jul 27 05:09:47 2022
% 1.82/2.02 Otter interrupted
% 1.82/2.02 PROOF FOUND
%------------------------------------------------------------------------------