TSTP Solution File: GRP551-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP551-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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 : 600s
% DateTime : Sat Jul 16 08:47:56 EDT 2022
% Result : Unsatisfiable 0.72s 1.10s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 2
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 3 RR)
% Number of literals : 36 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 75 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,A),divide(divide(divide(B,A),C),B)),C),
file('GRP551-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP551-1.p',unknown),
[] ).
cnf(4,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(divide(a3,divide(identity,b3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(demod,[status(thm),theory(equality)],[2,2,2,2]),
[iquote('demod([2,2,2,2])')] ).
cnf(6,plain,
equal(divide(divide(identity,divide(divide(divide(A,B),C),A)),divide(divide(C,D),divide(identity,B))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(divide(divide(divide(A,B),C),A),divide(divide(identity,B),divide(C,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(8,plain,
equal(divide(divide(identity,divide(divide(identity,A),divide(B,identity))),divide(divide(B,C),divide(identity,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),7]),
[iquote('back_demod(6),demod([7])')] ).
cnf(9,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),divide(B,identity))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),7]),
[iquote('back_demod(1),demod([7])')] ).
cnf(10,plain,
equal(divide(identity,divide(identity,divide(A,identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),4]),
[iquote('para(4,9),demod([4])')] ).
cnf(11,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),identity)),identity),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(12,plain,
equal(divide(A,divide(A,identity)),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),10]),
[iquote('para(10,11),demod([10])')] ).
cnf(13,plain,
equal(divide(divide(identity,A),identity),divide(identity,A)),
inference(para,[status(thm),theory(equality)],[12,9]),
[iquote('para(12,9)')] ).
cnf(15,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,13]),10]),
[iquote('para(10,13),demod([10])')] ).
cnf(16,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),15]),
[iquote('back_demod(10),demod([15])')] ).
cnf(17,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),15]),
[iquote('back_demod(9),demod([15])')] ).
cnf(18,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),divide(divide(B,C),divide(identity,A))),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),15]),
[iquote('back_demod(8),demod([15])')] ).
cnf(19,plain,
equal(divide(divide(divide(A,B),C),A),divide(divide(identity,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),15]),
[iquote('back_demod(7),demod([15])')] ).
cnf(20,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,17]),16]),
[iquote('para(16,17),demod([16])')] ).
cnf(21,plain,
equal(divide(divide(divide(A,B),C),divide(divide(identity,B),C)),A),
inference(para,[status(thm),theory(equality)],[19,20]),
[iquote('para(19,20)')] ).
cnf(23,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,18]),20]),
[iquote('para(4,18),demod([20])')] ).
cnf(24,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[20,23]),
[iquote('para(20,23)')] ).
cnf(27,plain,
equal(divide(A,divide(divide(identity,B),divide(identity,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,18]),20]),
[iquote('para(15,18),demod([20])')] ).
cnf(30,plain,
equal(divide(divide(identity,divide(divide(identity,A),divide(identity,divide(divide(identity,B),C)))),divide(D,divide(identity,A))),divide(divide(C,D),divide(identity,B))),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(31,plain,
equal(divide(divide(A,B),divide(identity,C)),divide(divide(identity,divide(divide(identity,D),divide(identity,divide(divide(identity,C),A)))),divide(B,divide(identity,D)))),
inference(flip,[status(thm),theory(equality)],[30]),
[iquote('flip(30)')] ).
cnf(33,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
inference(para,[status(thm),theory(equality)],[20,24]),
[iquote('para(20,24)')] ).
cnf(37,plain,
equal(divide(A,divide(B,divide(identity,A))),divide(identity,B)),
inference(para,[status(thm),theory(equality)],[20,27]),
[iquote('para(20,27)')] ).
cnf(40,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),divide(C,divide(identity,A))),divide(B,C)),
inference(para,[status(thm),theory(equality)],[20,18]),
[iquote('para(20,18)')] ).
cnf(41,plain,
equal(divide(divide(A,B),divide(identity,C)),divide(divide(identity,divide(divide(identity,C),A)),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),40]),
[iquote('back_demod(31),demod([40])')] ).
cnf(42,plain,
equal(divide(divide(identity,divide(divide(identity,A),B)),C),divide(divide(B,C),divide(identity,A))),
inference(flip,[status(thm),theory(equality)],[41]),
[iquote('flip(41)')] ).
cnf(44,plain,
equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
inference(para,[status(thm),theory(equality)],[20,33]),
[iquote('para(20,33)')] ).
cnf(46,plain,
equal(divide(divide(A,B),divide(identity,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,21]),15]),
[iquote('para(4,21),demod([15])')] ).
cnf(47,plain,
equal(divide(divide(A,B),A),divide(identity,B)),
inference(para,[status(thm),theory(equality)],[46,20]),
[iquote('para(46,20)')] ).
cnf(66,plain,
equal(divide(identity,divide(divide(identity,A),B)),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,37]),1]),
[iquote('para(47,37),flip(1)')] ).
cnf(68,plain,
equal(divide(divide(A,divide(identity,B)),C),divide(divide(B,C),divide(identity,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),66]),
[iquote('back_demod(42),demod([66])')] ).
cnf(142,plain,
~ equal(divide(divide(b3,divide(identity,c3)),divide(identity,a3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(para,[status(thm),theory(equality)],[68,5]),
[iquote('para(68,5)')] ).
cnf(143,plain,
$false,
inference(conflict,[status(thm)],[142,44]),
[iquote('conflict(142,44)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP551-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.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 : 600
% 0.12/0.33 % DateTime : Mon Jun 13 19:11:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.10 ----- EQP 0.9e, May 2009 -----
% 0.72/1.10 The job began on n011.cluster.edu, Mon Jun 13 19:11:49 2022
% 0.72/1.10 The command was "./eqp09e".
% 0.72/1.10
% 0.72/1.10 set(prolog_style_variables).
% 0.72/1.10 set(lrpo).
% 0.72/1.10 set(basic_paramod).
% 0.72/1.10 set(functional_subsume).
% 0.72/1.10 set(ordered_paramod).
% 0.72/1.10 set(prime_paramod).
% 0.72/1.10 set(para_pairs).
% 0.72/1.10 assign(pick_given_ratio,4).
% 0.72/1.10 clear(print_kept).
% 0.72/1.10 clear(print_new_demod).
% 0.72/1.10 clear(print_back_demod).
% 0.72/1.10 clear(print_given).
% 0.72/1.10 assign(max_mem,64000).
% 0.72/1.10 end_of_commands.
% 0.72/1.10
% 0.72/1.10 Usable:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Sos:
% 0.72/1.10 0 (wt=-1) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.72/1.10 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.72/1.10 0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.10 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Demodulators:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Passive:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Starting to process input.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.72/1.10 1 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10 2 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10 3 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10 4 is a new demodulator.
% 0.72/1.10
% 0.72/1.10 ** KEPT: 5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.10 ---------------- PROOF FOUND ----------------
% 0.72/1.10 % SZS status Unsatisfiable
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 After processing input:
% 0.72/1.10
% 0.72/1.10 Usable:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Sos:
% 0.72/1.10 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.72/1.10 5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Demodulators:
% 0.72/1.10 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.72/1.10 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.10 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.10 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 Passive:
% 0.72/1.10 end_of_list.
% 0.72/1.10
% 0.72/1.10 UNIT CONFLICT from 142 and 44 at 0.01 seconds.
% 0.72/1.10
% 0.72/1.10 ---------------- PROOF ----------------
% 0.72/1.10 % SZS output start Refutation
% See solution above
% 0.72/1.10 ------------ end of proof -------------
% 0.72/1.10
% 0.72/1.10
% 0.72/1.10 ------------- memory usage ------------
% 0.72/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.10 type (bytes each) gets frees in use avail bytes
% 0.72/1.10 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.10 term ( 16) 14255 12230 2025 28 39.5 K
% 0.72/1.10 gen_ptr ( 8) 11970 4203 7767 35 61.0 K
% 0.72/1.10 context ( 808) 11615 11613 2 3 3.9 K
% 0.72/1.10 trail ( 12) 981 981 0 4 0.0 K
% 0.72/1.10 bt_node ( 68) 5257 5250 7 8 1.0 K
% 0.72/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.10 ac_match_free_vars_pos (4020)
% 0.72/1.10 0 0 0 0 0.0 K
% 0.72/1.10 discrim ( 12) 1620 660 960 0 11.2 K
% 0.72/1.10 flat ( 40) 22679 22679 0 27 1.1 K
% 0.72/1.10 discrim_pos ( 12) 959 959 0 1 0.0 K
% 0.72/1.10 fpa_head ( 12) 386 0 386 0 4.5 K
% 0.72/1.11 fpa_tree ( 28) 714 714 0 41 1.1 K
% 0.72/1.11 fpa_pos ( 36) 243 243 0 1 0.0 K
% 0.72/1.11 literal ( 12) 810 668 142 1 1.7 K
% 0.72/1.11 clause ( 24) 810 668 142 1 3.4 K
% 0.72/1.11 list ( 12) 160 104 56 3 0.7 K
% 0.72/1.11 list_pos ( 20) 639 271 368 0 7.2 K
% 0.72/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.11
% 0.72/1.11 -------------- statistics -------------
% 0.72/1.11 Clauses input 5
% 0.72/1.11 Usable input 0
% 0.72/1.11 Sos input 5
% 0.72/1.11 Demodulators input 0
% 0.72/1.11 Passive input 0
% 0.72/1.11
% 0.72/1.11 Processed BS (before search) 5
% 0.72/1.11 Forward subsumed BS 0
% 0.72/1.11 Kept BS 5
% 0.72/1.11 New demodulators BS 4
% 0.72/1.11 Back demodulated BS 0
% 0.72/1.11
% 0.72/1.11 Clauses or pairs given 630
% 0.72/1.11 Clauses generated 586
% 0.72/1.11 Forward subsumed 449
% 0.72/1.11 Deleted by weight 0
% 0.72/1.11 Deleted by variable count 0
% 0.72/1.11 Kept 137
% 0.72/1.11 New demodulators 97
% 0.72/1.11 Back demodulated 55
% 0.72/1.11 Ordered paramod prunes 0
% 0.72/1.11 Basic paramod prunes 2016
% 0.72/1.11 Prime paramod prunes 107
% 0.72/1.11 Semantic prunes 0
% 0.72/1.11
% 0.72/1.11 Rewrite attmepts 5278
% 0.72/1.11 Rewrites 771
% 0.72/1.11
% 0.72/1.11 FPA overloads 0
% 0.72/1.11 FPA underloads 0
% 0.72/1.11
% 0.72/1.11 Usable size 0
% 0.72/1.11 Sos size 86
% 0.72/1.11 Demodulators size 55
% 0.72/1.11 Passive size 0
% 0.72/1.11 Disabled size 55
% 0.72/1.11
% 0.72/1.11 Proofs found 1
% 0.72/1.11
% 0.72/1.11 ----------- times (seconds) ----------- Mon Jun 13 19:11:49 2022
% 0.72/1.11
% 0.72/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.72/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.11 input time 0.00
% 0.72/1.11 paramodulation time 0.00
% 0.72/1.11 demodulation time 0.00
% 0.72/1.11 orient time 0.00
% 0.72/1.11 weigh time 0.00
% 0.72/1.11 forward subsume time 0.00
% 0.72/1.11 back demod find time 0.00
% 0.72/1.11 conflict time 0.00
% 0.72/1.11 LRPO time 0.00
% 0.72/1.11 store clause time 0.00
% 0.72/1.11 disable clause time 0.00
% 0.72/1.11 prime paramod time 0.00
% 0.72/1.11 semantics time 0.00
% 0.72/1.11
% 0.72/1.11 EQP interrupted
%------------------------------------------------------------------------------