TSTP Solution File: GRP550-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : GRP550-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:14 EDT 2022
% Result : Unsatisfiable 1.23s 1.76s
% Output : Refutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 16 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('GRP550-1.p',unknown),
[] ).
cnf(3,axiom,
divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C,
file('GRP550-1.p',unknown),
[] ).
cnf(6,axiom,
multiply(A,B) = divide(A,divide(identity,B)),
file('GRP550-1.p',unknown),
[] ).
cnf(8,axiom,
inverse(A) = divide(identity,A),
file('GRP550-1.p',unknown),
[] ).
cnf(9,axiom,
identity = divide(A,A),
file('GRP550-1.p',unknown),
[] ).
cnf(11,plain,
divide(A,A) = identity,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[9])]),
[iquote('copy,9,flip.1')] ).
cnf(12,plain,
divide(identity,divide(identity,a2)) != a2,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[1]),8,6,11,6]),
[iquote('back_demod,1,demod,8,6,11,6')] ).
cnf(13,plain,
divide(identity,divide(divide(divide(A,identity),B),A)) = B,
inference(para_into,[status(thm),theory(equality)],[3,11]),
[iquote('para_into,3.1.1.1,10.1.1')] ).
cnf(15,plain,
divide(divide(identity,A),divide(divide(identity,B),A)) = B,
inference(para_into,[status(thm),theory(equality)],[3,11]),
[iquote('para_into,3.1.1.2.1.1,10.1.1')] ).
cnf(19,plain,
divide(divide(identity,A),divide(identity,B)) = divide(B,A),
inference(para_into,[status(thm),theory(equality)],[3,11]),
[iquote('para_into,3.1.1.2.1,10.1.1')] ).
cnf(21,plain,
divide(divide(divide(A,B),C),A) = divide(divide(identity,B),divide(C,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[3,3])]),
[iquote('para_into,3.1.1.2.1,3.1.1,flip.1')] ).
cnf(25,plain,
divide(identity,divide(identity,divide(A,identity))) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[13]),21,11]),
[iquote('back_demod,13,demod,21,11')] ).
cnf(31,plain,
divide(identity,divide(divide(identity,A),identity)) = A,
inference(para_into,[status(thm),theory(equality)],[15,11]),
[iquote('para_into,15.1.1.1,10.1.1')] ).
cnf(40,plain,
divide(divide(identity,A),identity) = divide(identity,divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[31,31])]),
[iquote('para_into,31.1.1.2.1,31.1.1,flip.1')] ).
cnf(45,plain,
divide(identity,divide(A,identity)) = divide(identity,A),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,11]),40]),
[iquote('para_into,19.1.1.2,10.1.1,demod,40')] ).
cnf(55,plain,
divide(identity,divide(identity,A)) = A,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[25]),45]),
[iquote('back_demod,25,demod,45')] ).
cnf(57,plain,
$false,
inference(binary,[status(thm)],[55,12]),
[iquote('binary,55.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP550-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:35:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.23/1.76 ----- Otter 3.3f, August 2004 -----
% 1.23/1.76 The process was started by sandbox on n016.cluster.edu,
% 1.23/1.76 Wed Jul 27 05:35:37 2022
% 1.23/1.76 The command was "./otter". The process ID is 26230.
% 1.23/1.76
% 1.23/1.76 set(prolog_style_variables).
% 1.23/1.76 set(auto).
% 1.23/1.76 dependent: set(auto1).
% 1.23/1.76 dependent: set(process_input).
% 1.23/1.76 dependent: clear(print_kept).
% 1.23/1.76 dependent: clear(print_new_demod).
% 1.23/1.76 dependent: clear(print_back_demod).
% 1.23/1.76 dependent: clear(print_back_sub).
% 1.23/1.76 dependent: set(control_memory).
% 1.23/1.76 dependent: assign(max_mem, 12000).
% 1.23/1.76 dependent: assign(pick_given_ratio, 4).
% 1.23/1.76 dependent: assign(stats_level, 1).
% 1.23/1.76 dependent: assign(max_seconds, 10800).
% 1.23/1.76 clear(print_given).
% 1.23/1.76
% 1.23/1.76 list(usable).
% 1.23/1.76 0 [] A=A.
% 1.23/1.76 0 [] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.23/1.76 0 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.23/1.76 0 [] inverse(A)=divide(identity,A).
% 1.23/1.76 0 [] identity=divide(A,A).
% 1.23/1.76 0 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.23/1.76 end_of_list.
% 1.23/1.76
% 1.23/1.76 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.23/1.76
% 1.23/1.76 All clauses are units, and equality is present; the
% 1.23/1.76 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.23/1.76
% 1.23/1.76 dependent: set(knuth_bendix).
% 1.23/1.76 dependent: set(anl_eq).
% 1.23/1.76 dependent: set(para_from).
% 1.23/1.76 dependent: set(para_into).
% 1.23/1.76 dependent: clear(para_from_right).
% 1.23/1.76 dependent: clear(para_into_right).
% 1.23/1.76 dependent: set(para_from_vars).
% 1.23/1.76 dependent: set(eq_units_both_ways).
% 1.23/1.76 dependent: set(dynamic_demod_all).
% 1.23/1.76 dependent: set(dynamic_demod).
% 1.23/1.76 dependent: set(order_eq).
% 1.23/1.76 dependent: set(back_demod).
% 1.23/1.76 dependent: set(lrpo).
% 1.23/1.76
% 1.23/1.76 ------------> process usable:
% 1.23/1.76 ** KEPT (pick-wt=8): 1 [] multiply(multiply(inverse(b2),b2),a2)!=a2.
% 1.23/1.76
% 1.23/1.76 ------------> process sos:
% 1.23/1.76 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.23/1.76 ** KEPT (pick-wt=13): 3 [] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.23/1.76 ---> New Demodulator: 4 [new_demod,3] divide(divide(identity,A),divide(divide(divide(B,A),C),B))=C.
% 1.23/1.76 ** KEPT (pick-wt=9): 5 [] multiply(A,B)=divide(A,divide(identity,B)).
% 1.23/1.76 ---> New Demodulator: 6 [new_demod,5] multiply(A,B)=divide(A,divide(identity,B)).
% 1.23/1.76 ** KEPT (pick-wt=6): 7 [] inverse(A)=divide(identity,A).
% 1.23/1.76 ---> New Demodulator: 8 [new_demod,7] inverse(A)=divide(identity,A).
% 1.23/1.76 ** KEPT (pick-wt=5): 10 [copy,9,flip.1] divide(A,A)=identity.
% 1.23/1.76 ---> New Demodulator: 11 [new_demod,10] divide(A,A)=identity.
% 1.23/1.76 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.23/1.76 >>>> Starting back demodulation with 4.
% 1.23/1.76 >>>> Starting back demodulation with 6.
% 1.23/1.76 >> back demodulating 1 with 6.
% 1.23/1.76 >>>> Starting back demodulation with 8.
% 1.23/1.76 >>>> Starting back demodulation with 11.
% 1.23/1.76
% 1.23/1.76 ======= end of input processing =======
% 1.23/1.76
% 1.23/1.76 =========== start of search ===========
% 1.23/1.76
% 1.23/1.76 -------- PROOF --------
% 1.23/1.76
% 1.23/1.76 ----> UNIT CONFLICT at 0.00 sec ----> 57 [binary,55.1,12.1] $F.
% 1.23/1.76
% 1.23/1.76 Length of proof is 11. Level of proof is 6.
% 1.23/1.76
% 1.23/1.76 ---------------- PROOF ----------------
% 1.23/1.76 % SZS status Unsatisfiable
% 1.23/1.76 % SZS output start Refutation
% See solution above
% 1.23/1.76 ------------ end of proof -------------
% 1.23/1.76
% 1.23/1.76
% 1.23/1.76 Search stopped by max_proofs option.
% 1.23/1.76
% 1.23/1.76
% 1.23/1.76 Search stopped by max_proofs option.
% 1.23/1.76
% 1.23/1.76 ============ end of search ============
% 1.23/1.76
% 1.23/1.76 -------------- statistics -------------
% 1.23/1.76 clauses given 10
% 1.23/1.76 clauses generated 34
% 1.23/1.76 clauses kept 34
% 1.23/1.76 clauses forward subsumed 27
% 1.23/1.76 clauses back subsumed 0
% 1.23/1.76 Kbytes malloced 976
% 1.23/1.76
% 1.23/1.76 ----------- times (seconds) -----------
% 1.23/1.76 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.23/1.76 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.23/1.76 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.23/1.76
% 1.23/1.76 That finishes the proof of the theorem.
% 1.23/1.76
% 1.23/1.76 Process 26230 finished Wed Jul 27 05:35:38 2022
% 1.23/1.76 Otter interrupted
% 1.23/1.76 PROOF FOUND
%------------------------------------------------------------------------------