TSTP Solution File: GRP540-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP540-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:53 EDT 2022
% Result : Unsatisfiable 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
file('GRP540-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP540-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(6,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),6]),1]),
[iquote('back_demod(3),demod([6]),flip(1)')] ).
cnf(9,plain,
~ equal(divide(a,divide(identity,b)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[8,8]),
[iquote('demod([8,8])')] ).
cnf(11,plain,
equal(divide(divide(divide(A,B),C),divide(D,C)),divide(divide(A,D),B)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(14,plain,
equal(divide(identity,divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(15,plain,
equal(divide(divide(A,B),divide(identity,B)),A),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(16,plain,
equal(divide(divide(A,divide(A,B)),identity),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(17,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[6,14]),
[iquote('para(6,14)')] ).
cnf(22,plain,
equal(divide(A,identity),A),
inference(para,[status(thm),theory(equality)],[17,16]),
[iquote('para(17,16)')] ).
cnf(23,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),22]),
[iquote('back_demod(16),demod([22])')] ).
cnf(30,plain,
equal(divide(A,divide(identity,divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[23,15]),
[iquote('para(23,15)')] ).
cnf(32,plain,
equal(divide(A,B),divide(identity,divide(B,A))),
inference(para,[status(thm),theory(equality)],[30,23]),
[iquote('para(30,23)')] ).
cnf(43,plain,
equal(divide(divide(A,B),C),divide(identity,divide(B,divide(A,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,11]),1]),
[iquote('para(6,11),flip(1)')] ).
cnf(61,plain,
~ equal(divide(b,divide(identity,a)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,9]),43,23]),
[iquote('para(32,9),demod([43,23])')] ).
cnf(62,plain,
$false,
inference(conflict,[status(thm)],[61]),
[iquote('xx_conflict(61)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP540-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.36 % Computer : n022.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 600
% 0.13/0.36 % DateTime : Tue Jun 14 12:21:48 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.72/1.11 ----- EQP 0.9e, May 2009 -----
% 0.72/1.11 The job began on n022.cluster.edu, Tue Jun 14 12:21:49 2022
% 0.72/1.11 The command was "./eqp09e".
% 0.72/1.11
% 0.72/1.11 set(prolog_style_variables).
% 0.72/1.11 set(lrpo).
% 0.72/1.11 set(basic_paramod).
% 0.72/1.11 set(functional_subsume).
% 0.72/1.11 set(ordered_paramod).
% 0.72/1.11 set(prime_paramod).
% 0.72/1.11 set(para_pairs).
% 0.72/1.11 assign(pick_given_ratio,4).
% 0.72/1.11 clear(print_kept).
% 0.72/1.11 clear(print_new_demod).
% 0.72/1.11 clear(print_back_demod).
% 0.72/1.11 clear(print_given).
% 0.72/1.11 assign(max_mem,64000).
% 0.72/1.11 end_of_commands.
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 0 (wt=-1) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.72/1.11 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.72/1.11 0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.11 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Starting to process input.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.11 1 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.72/1.11 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.72/1.11 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 6 is a new demodulator.
% 0.72/1.11 -> 6 back demodulating 5.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.72/1.11 7 is a new demodulator.
% 0.72/1.11 -> 7 back demodulating 4.
% 0.72/1.11 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.72/1.11 -> 6 back demodulating 3.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 8 is a new demodulator.
% 0.72/1.11 -> 8 back demodulating 2.
% 0.72/1.11 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 9 (wt=11) [demod([8,8])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.72/1.11 ---------------- PROOF FOUND ----------------
% 0.72/1.11 % SZS status Unsatisfiable
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 After processing input:
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.72/1.11 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.11 9 (wt=11) [demod([8,8])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.72/1.11 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.72/1.11 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 UNIT CONFLICT from 61 and x=x at 0.00 seconds.
% 0.72/1.11
% 0.72/1.11 ---------------- PROOF ----------------
% 0.72/1.11 % SZS output start Refutation
% See solution above
% 0.72/1.11 ------------ end of proof -------------
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 ------------- memory usage ------------
% 0.72/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.11 type (bytes each) gets frees in use avail bytes
% 0.72/1.11 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.72/1.11 term ( 16) 5578 4672 906 16 17.8 K
% 0.72/1.11 gen_ptr ( 8) 5031 1350 3681 17 28.9 K
% 0.72/1.11 context ( 808) 2789 2787 2 10 9.5 K
% 0.72/1.11 trail ( 12) 390 390 0 5 0.1 K
% 0.72/1.11 bt_node ( 68) 767 764 3 10 0.9 K
% 0.72/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_free_vars_pos (4020)
% 0.72/1.11 0 0 0 0 0.0 K
% 0.72/1.11 discrim ( 12) 720 393 327 110 5.1 K
% 0.72/1.11 flat ( 40) 8993 8993 0 29 1.1 K
% 0.72/1.11 discrim_pos ( 12) 311 311 0 1 0.0 K
% 0.72/1.11 fpa_head ( 12) 255 0 255 0 3.0 K
% 0.72/1.11 fpa_tree ( 28) 102 102 0 13 0.4 K
% 0.72/1.11 fpa_pos ( 36) 90 90 0 1 0.0 K
% 0.72/1.11 literal ( 12) 260 199 61 1 0.7 K
% 0.72/1.11 clause ( 24) 260 199 61 1 1.5 K
% 0.72/1.11 list ( 12) 89 33 56 4 0.7 K
% 0.72/1.11 list_pos ( 20) 285 161 124 30 3.0 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) 13
% 0.72/1.11 Forward subsumed BS 4
% 0.72/1.11 Kept BS 9
% 0.72/1.11 New demodulators BS 4
% 0.72/1.11 Back demodulated BS 4
% 0.72/1.11
% 0.72/1.11 Clauses or pairs given 100
% 0.72/1.11 Clauses generated 153
% 0.72/1.11 Forward subsumed 101
% 0.72/1.11 Deleted by weight 0
% 0.72/1.11 Deleted by variable count 0
% 0.72/1.11 Kept 52
% 0.72/1.11 New demodulators 26
% 0.72/1.11 Back demodulated 30
% 0.72/1.11 Ordered paramod prunes 0
% 0.72/1.11 Basic paramod prunes 93
% 0.72/1.11 Prime paramod prunes 6
% 0.72/1.11 Semantic prunes 0
% 0.72/1.11
% 0.72/1.11 Rewrite attmepts 1675
% 0.72/1.11 Rewrites 277
% 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 26
% 0.72/1.11 Demodulators size 12
% 0.72/1.11 Passive size 0
% 0.72/1.11 Disabled size 34
% 0.72/1.11
% 0.72/1.11 Proofs found 1
% 0.72/1.11
% 0.72/1.11 ----------- times (seconds) ----------- Tue Jun 14 12:21:49 2022
% 0.72/1.11
% 0.72/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.11 system CPU time 0.01 (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
%------------------------------------------------------------------------------