TSTP Solution File: GRP524-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP524-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:49 EDT 2022
% Result : Unsatisfiable 0.73s 1.12s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 28 ( 28 unt; 0 nHn; 2 RR)
% Number of literals : 28 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(B,divide(C,divide(A,B)))),C),
file('GRP524-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP524-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(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP524-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(multiply(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(9,plain,
equal(divide(A,divide(divide(B,divide(C,A)),B)),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(21,plain,
equal(divide(divide(A,A),divide(B,multiply(C,B))),C),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(45,plain,
equal(divide(divide(A,A),divide(B,divide(C,inverse(B)))),C),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(52,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(53,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[52]),
[iquote('flip(52)')] ).
cnf(60,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),1]),
[iquote('para(7,1),demod([1])')] ).
cnf(62,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[60,5]),
[iquote('para(60,5)')] ).
cnf(63,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[62]),
[iquote('flip(62)')] ).
cnf(106,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,3]),1]),
[iquote('para(9,3),flip(1)')] ).
cnf(108,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[106,53]),1]),
[iquote('para(106,53),flip(1)')] ).
cnf(116,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[63,108]),
[iquote('para(63,108)')] ).
cnf(167,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[21,9]),
[iquote('para(21,9)')] ).
cnf(168,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[167,52]),1]),
[iquote('para(167,52),flip(1)')] ).
cnf(232,plain,
equal(inverse(divide(A,divide(B,inverse(A)))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,5]),1]),
[iquote('para(45,5),flip(1)')] ).
cnf(279,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,1]),116]),
[iquote('para(60,1),demod([116])')] ).
cnf(288,plain,
equal(inverse(divide(A,B)),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[108,279]),1]),
[iquote('para(108,279),flip(1)')] ).
cnf(291,plain,
equal(divide(divide(A,inverse(B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[232]),288]),
[iquote('back_demod(232),demod([288])')] ).
cnf(311,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[167,291]),1]),
[iquote('para(167,291),flip(1)')] ).
cnf(312,plain,
equal(multiply(divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[168]),311]),
[iquote('back_demod(168),demod([311])')] ).
cnf(313,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[167,312]),
[iquote('para(167,312)')] ).
cnf(314,plain,
$false,
inference(conflict,[status(thm)],[313,6]),
[iquote('conflict(313,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP524-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 10:53:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.12 ----- EQP 0.9e, May 2009 -----
% 0.73/1.12 The job began on n022.cluster.edu, Mon Jun 13 10:53:49 2022
% 0.73/1.12 The command was "./eqp09e".
% 0.73/1.12
% 0.73/1.12 set(prolog_style_variables).
% 0.73/1.12 set(lrpo).
% 0.73/1.12 set(basic_paramod).
% 0.73/1.12 set(functional_subsume).
% 0.73/1.12 set(ordered_paramod).
% 0.73/1.12 set(prime_paramod).
% 0.73/1.12 set(para_pairs).
% 0.73/1.12 assign(pick_given_ratio,4).
% 0.73/1.12 clear(print_kept).
% 0.73/1.12 clear(print_new_demod).
% 0.73/1.12 clear(print_back_demod).
% 0.73/1.12 clear(print_given).
% 0.73/1.12 assign(max_mem,64000).
% 0.73/1.12 end_of_commands.
% 0.73/1.12
% 0.73/1.12 Usable:
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Sos:
% 0.73/1.12 0 (wt=-1) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.73/1.12 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.73/1.12 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.73/1.12 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Demodulators:
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Passive:
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Starting to process input.
% 0.73/1.12
% 0.73/1.12 ** KEPT: 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.73/1.12 1 is a new demodulator.
% 0.73/1.12
% 0.73/1.12 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.73/1.12
% 0.73/1.12 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.73/1.12 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.73/1.12
% 0.73/1.12 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.73/1.12
% 0.73/1.12 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.73/1.12 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.73/1.12
% 0.73/1.12 ** KEPT: 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.73/1.12 ---------------- PROOF FOUND ----------------
% 0.73/1.12 % SZS status Unsatisfiable
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 After processing input:
% 0.73/1.12
% 0.73/1.12 Usable:
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Sos:
% 0.73/1.12 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.73/1.12 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.73/1.12 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.73/1.12 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.73/1.12 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.73/1.12 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Demodulators:
% 0.73/1.12 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 Passive:
% 0.73/1.12 end_of_list.
% 0.73/1.12
% 0.73/1.12 UNIT CONFLICT from 313 and 6 at 0.02 seconds.
% 0.73/1.12
% 0.73/1.12 ---------------- PROOF ----------------
% 0.73/1.12 % SZS output start Refutation
% See solution above
% 0.73/1.12 ------------ end of proof -------------
% 0.73/1.12
% 0.73/1.12
% 0.73/1.12 ------------- memory usage ------------
% 0.73/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.12 type (bytes each) gets frees in use avail bytes
% 0.73/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.12 term ( 16) 22650 18433 4217 22 81.6 K
% 0.73/1.12 gen_ptr ( 8) 24085 7873 16212 111 127.5 K
% 0.73/1.12 context ( 808) 17426 17424 2 2 3.2 K
% 0.73/1.12 trail ( 12) 2196 2196 0 6 0.1 K
% 0.73/1.12 bt_node ( 68) 6342 6339 3 10 0.9 K
% 0.73/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.12 ac_match_free_vars_pos (4020)
% 0.73/1.12 0 0 0 0 0.0 K
% 0.73/1.12 discrim ( 12) 2984 1988 996 1403 28.1 K
% 0.73/1.12 flat ( 40) 43243 43243 0 23 0.9 K
% 0.73/1.12 discrim_pos ( 12) 1213 1213 0 1 0.0 K
% 0.73/1.12 fpa_head ( 12) 1481 0 1481 0 17.4 K
% 0.73/1.12 fpa_tree ( 28) 790 790 0 23 0.6 K
% 0.73/1.12 fpa_pos ( 36) 455 455 0 1 0.0 K
% 0.73/1.12 literal ( 12) 1839 1526 313 1 3.7 K
% 0.73/1.12 clause ( 24) 1839 1526 313 1 7.4 K
% 0.73/1.12 list ( 12) 201 145 56 4 0.7 K
% 0.73/1.12 list_pos ( 20) 1527 970 557 390 18.5 K
% 0.73/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.12
% 0.73/1.12 -------------- statistics -------------
% 0.73/1.12 Clauses input 4
% 0.73/1.12 Usable input 0
% 0.73/1.12 Sos input 4
% 0.73/1.12 Demodulators input 0
% 0.73/1.12 Passive input 0
% 0.73/1.12
% 0.73/1.12 Processed BS (before search) 8
% 0.73/1.12 Forward subsumed BS 2
% 0.73/1.12 Kept BS 6
% 0.73/1.12 New demodulators BS 1
% 0.73/1.12 Back demodulated BS 0
% 0.73/1.12
% 0.73/1.12 Clauses or pairs given 1759
% 0.73/1.12 Clauses generated 1056
% 0.73/1.12 Forward subsumed 749
% 0.73/1.12 Deleted by weight 0
% 0.73/1.12 Deleted by variable count 0
% 0.73/1.12 Kept 307
% 0.73/1.12 New demodulators 141
% 0.73/1.12 Back demodulated 219
% 0.73/1.12 Ordered paramod prunes 0
% 0.73/1.12 Basic paramod prunes 4029
% 0.73/1.12 Prime paramod prunes 82
% 0.73/1.12 Semantic prunes 0
% 0.73/1.12
% 0.73/1.12 Rewrite attmepts 7042
% 0.73/1.12 Rewrites 685
% 0.73/1.12
% 0.73/1.12 FPA overloads 0
% 0.73/1.12 FPA underloads 0
% 0.73/1.12
% 0.73/1.12 Usable size 0
% 0.73/1.12 Sos size 93
% 0.73/1.12 Demodulators size 59
% 0.73/1.12 Passive size 0
% 0.73/1.12 Disabled size 219
% 0.73/1.12
% 0.73/1.12 Proofs found 1
% 0.73/1.12
% 0.73/1.12 ----------- times (seconds) ----------- Mon Jun 13 10:53:49 2022
% 0.73/1.12
% 0.73/1.12 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.73/1.12 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.73/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.12 input time 0.00
% 0.73/1.12 paramodulation time 0.00
% 0.73/1.12 demodulation time 0.00
% 0.73/1.12 orient time 0.00
% 0.73/1.12 weigh time 0.00
% 0.73/1.12 forward subsume time 0.00
% 0.73/1.12 back demod find time 0.00
% 0.73/1.13 conflict time 0.00
% 0.73/1.13 LRPO time 0.00
% 0.73/1.13 store clause time 0.00
% 0.73/1.13 disable clause time 0.00
% 0.73/1.13 prime paramod time 0.00
% 0.73/1.13 semantics time 0.00
% 0.73/1.13
% 0.73/1.13 EQP interrupted
%------------------------------------------------------------------------------