TSTP Solution File: GRP466-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:04 EDT 2022
% Result : Unsatisfiable 1.67s 1.90s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 11 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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 : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('GRP466-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(4,axiom,
divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C,
file('GRP466-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP466-1.p',unknown),
[] ).
cnf(7,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[6])]),
[iquote('copy,6,flip.1')] ).
cnf(8,plain,
divide(inverse(b1),inverse(b1)) != multiply(inverse(a1),a1),
inference(para_from,[status(thm),theory(equality)],[6,2]),
[iquote('para_from,6.1.1,2.1.1')] ).
cnf(16,plain,
divide(divide(A,A),divide(B,multiply(divide(C,divide(D,B)),D))) = C,
inference(para_into,[status(thm),theory(equality)],[4,7]),
[iquote('para_into,4.1.1.2.2,7.1.1')] ).
cnf(43,plain,
divide(divide(A,A),divide(multiply(divide(B,divide(C,D)),C),multiply(B,D))) = divide(E,E),
inference(para_into,[status(thm),theory(equality)],[16,16]),
[iquote('para_into,16.1.1.2.2.1,16.1.1')] ).
cnf(241,plain,
divide(A,A) = divide(B,B),
inference(para_into,[status(thm),theory(equality)],[43,43]),
[iquote('para_into,43.1.1,43.1.1')] ).
cnf(282,plain,
multiply(inverse(A),A) = divide(B,B),
inference(para_into,[status(thm),theory(equality)],[241,7]),
[iquote('para_into,241.1.1,7.1.1')] ).
cnf(283,plain,
divide(A,A) = multiply(inverse(B),B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[282])]),
[iquote('copy,282,flip.1')] ).
cnf(284,plain,
$false,
inference(binary,[status(thm)],[283,8]),
[iquote('binary,283.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP466-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:50:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.90 ----- Otter 3.3f, August 2004 -----
% 1.67/1.90 The process was started by sandbox2 on n016.cluster.edu,
% 1.67/1.90 Wed Jul 27 05:50:52 2022
% 1.67/1.90 The command was "./otter". The process ID is 12577.
% 1.67/1.90
% 1.67/1.90 set(prolog_style_variables).
% 1.67/1.90 set(auto).
% 1.67/1.90 dependent: set(auto1).
% 1.67/1.90 dependent: set(process_input).
% 1.67/1.90 dependent: clear(print_kept).
% 1.67/1.90 dependent: clear(print_new_demod).
% 1.67/1.90 dependent: clear(print_back_demod).
% 1.67/1.90 dependent: clear(print_back_sub).
% 1.67/1.90 dependent: set(control_memory).
% 1.67/1.90 dependent: assign(max_mem, 12000).
% 1.67/1.90 dependent: assign(pick_given_ratio, 4).
% 1.67/1.90 dependent: assign(stats_level, 1).
% 1.67/1.90 dependent: assign(max_seconds, 10800).
% 1.67/1.90 clear(print_given).
% 1.67/1.90
% 1.67/1.90 list(usable).
% 1.67/1.90 0 [] A=A.
% 1.67/1.90 0 [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D))))=C.
% 1.67/1.90 0 [] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.90 0 [] multiply(inverse(a1),a1)!=multiply(inverse(b1),b1).
% 1.67/1.90 end_of_list.
% 1.67/1.90
% 1.67/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.90
% 1.67/1.90 All clauses are units, and equality is present; the
% 1.67/1.90 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.67/1.90
% 1.67/1.90 dependent: set(knuth_bendix).
% 1.67/1.90 dependent: set(anl_eq).
% 1.67/1.90 dependent: set(para_from).
% 1.67/1.90 dependent: set(para_into).
% 1.67/1.90 dependent: clear(para_from_right).
% 1.67/1.90 dependent: clear(para_into_right).
% 1.67/1.90 dependent: set(para_from_vars).
% 1.67/1.90 dependent: set(eq_units_both_ways).
% 1.67/1.90 dependent: set(dynamic_demod_all).
% 1.67/1.90 dependent: set(dynamic_demod).
% 1.67/1.90 dependent: set(order_eq).
% 1.67/1.90 dependent: set(back_demod).
% 1.67/1.90 dependent: set(lrpo).
% 1.67/1.90
% 1.67/1.90 ------------> process usable:
% 1.67/1.90 ** KEPT (pick-wt=9): 2 [copy,1,flip.1] multiply(inverse(b1),b1)!=multiply(inverse(a1),a1).
% 1.67/1.90
% 1.67/1.90 ------------> process sos:
% 1.67/1.90 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.67/1.90 ** KEPT (pick-wt=16): 4 [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D))))=C.
% 1.67/1.90 ---> New Demodulator: 5 [new_demod,4] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D))))=C.
% 1.67/1.90 ** KEPT (pick-wt=8): 6 [] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.90 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.67/1.90 >>>> Starting back demodulation with 5.
% 1.67/1.90 ** KEPT (pick-wt=8): 7 [copy,6,flip.1] divide(A,inverse(B))=multiply(A,B).
% 1.67/1.90 Following clause subsumed by 6 during input processing: 0 [copy,7,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.90
% 1.67/1.90 ======= end of input processing =======
% 1.67/1.90
% 1.67/1.90 =========== start of search ===========
% 1.67/1.90
% 1.67/1.90 -------- PROOF --------
% 1.67/1.90
% 1.67/1.90 ----> UNIT CONFLICT at 0.01 sec ----> 284 [binary,283.1,8.1] $F.
% 1.67/1.90
% 1.67/1.90 Length of proof is 8. Level of proof is 6.
% 1.67/1.90
% 1.67/1.90 ---------------- PROOF ----------------
% 1.67/1.90 % SZS status Unsatisfiable
% 1.67/1.90 % SZS output start Refutation
% See solution above
% 1.67/1.90 ------------ end of proof -------------
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90
% 1.67/1.90 Search stopped by max_proofs option.
% 1.67/1.90
% 1.67/1.90 ============ end of search ============
% 1.67/1.90
% 1.67/1.90 -------------- statistics -------------
% 1.67/1.90 clauses given 15
% 1.67/1.90 clauses generated 205
% 1.67/1.90 clauses kept 214
% 1.67/1.90 clauses forward subsumed 138
% 1.67/1.90 clauses back subsumed 0
% 1.67/1.90 Kbytes malloced 3906
% 1.67/1.90
% 1.67/1.90 ----------- times (seconds) -----------
% 1.67/1.90 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.67/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.90
% 1.67/1.90 That finishes the proof of the theorem.
% 1.67/1.90
% 1.67/1.90 Process 12577 finished Wed Jul 27 05:50:53 2022
% 1.67/1.90 Otter interrupted
% 1.67/1.90 PROOF FOUND
%------------------------------------------------------------------------------