TSTP Solution File: GRP562-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP562-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:15 EDT 2022
% Result : Unsatisfiable 1.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 3 RR)
% Number of literals : 11 ( 10 equ; 2 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; 2 con; 0-2 aty)
% Number of variables : 19 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('GRP562-1.p',unknown),
[] ).
cnf(4,axiom,
divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B,
file('GRP562-1.p',unknown),
[] ).
cnf(5,axiom,
multiply(A,B) = divide(A,inverse(B)),
file('GRP562-1.p',unknown),
[] ).
cnf(6,plain,
divide(A,inverse(B)) = multiply(A,B),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[5])]),
[iquote('copy,5,flip.1')] ).
cnf(8,plain,
multiply(divide(inverse(b2),inverse(b2)),a2) != a2,
inference(para_from,[status(thm),theory(equality)],[5,1]),
[iquote('para_from,5.1.1,1.1.1.1')] ).
cnf(18,plain,
divide(divide(divide(divide(divide(A,inverse(B)),C),inverse(D)),divide(A,C)),B) = D,
inference(para_into,[status(thm),theory(equality)],[4,4]),
[iquote('para_into,3.1.1.2,3.1.1')] ).
cnf(194,plain,
divide(divide(A,inverse(B)),A) = B,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[18,18]),4]),
[iquote('para_into,18.1.1.1.1,18.1.1,demod,4')] ).
cnf(260,plain,
divide(multiply(A,B),A) = B,
inference(para_into,[status(thm),theory(equality)],[194,6]),
[iquote('para_into,194.1.1.1,6.1.1')] ).
cnf(288,plain,
divide(A,divide(B,B)) = A,
inference(para_from,[status(thm),theory(equality)],[194,4]),
[iquote('para_from,194.1.1,3.1.1.1')] ).
cnf(334,plain,
multiply(divide(A,A),B) = B,
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[288,260])]),
[iquote('para_into,288.1.1,260.1.1,flip.1')] ).
cnf(336,plain,
$false,
inference(binary,[status(thm)],[334,8]),
[iquote('binary,334.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP562-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/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:26:22 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox2 on n016.cluster.edu,
% 1.67/1.88 Wed Jul 27 05:26:22 2022
% 1.67/1.88 The command was "./otter". The process ID is 1039.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] A=A.
% 1.67/1.88 0 [] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.67/1.88 0 [] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.88 0 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.67/1.88
% 1.67/1.88 All clauses are units, and equality is present; the
% 1.67/1.88 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.67/1.88
% 1.67/1.88 dependent: set(knuth_bendix).
% 1.67/1.88 dependent: set(anl_eq).
% 1.67/1.88 dependent: set(para_from).
% 1.67/1.88 dependent: set(para_into).
% 1.67/1.88 dependent: clear(para_from_right).
% 1.67/1.88 dependent: clear(para_into_right).
% 1.67/1.88 dependent: set(para_from_vars).
% 1.67/1.88 dependent: set(eq_units_both_ways).
% 1.67/1.88 dependent: set(dynamic_demod_all).
% 1.67/1.88 dependent: set(dynamic_demod).
% 1.67/1.88 dependent: set(order_eq).
% 1.67/1.88 dependent: set(back_demod).
% 1.67/1.88 dependent: set(lrpo).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=8): 1 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.67/1.88 ** KEPT (pick-wt=12): 3 [] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.67/1.88 ---> New Demodulator: 4 [new_demod,3] divide(divide(divide(A,inverse(B)),C),divide(A,C))=B.
% 1.67/1.88 ** KEPT (pick-wt=8): 5 [] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.88 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.67/1.88 >>>> Starting back demodulation with 4.
% 1.67/1.88 ** KEPT (pick-wt=8): 6 [copy,5,flip.1] divide(A,inverse(B))=multiply(A,B).
% 1.67/1.88 Following clause subsumed by 5 during input processing: 0 [copy,6,flip.1] multiply(A,B)=divide(A,inverse(B)).
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 ----> UNIT CONFLICT at 0.00 sec ----> 336 [binary,334.1,8.1] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 7. Level of proof is 4.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Unsatisfiable
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 24
% 1.67/1.88 clauses generated 289
% 1.67/1.88 clauses kept 171
% 1.67/1.88 clauses forward subsumed 126
% 1.67/1.88 clauses back subsumed 0
% 1.67/1.88 Kbytes malloced 3906
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 1039 finished Wed Jul 27 05:26:23 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------