TSTP Solution File: BOO013-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO013-4 : TPTP v8.1.0. Released v1.1.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 : Thu Jul 14 23:37:06 EDT 2022
% Result : Unsatisfiable 0.46s 1.15s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 10 RR)
% Number of literals : 22 ( 0 equ; 1 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO013-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO013-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO013-4.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_identity),A),
file('BOO013-4.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO013-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO013-4.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO013-4.p',unknown),
[] ).
cnf(10,plain,
equal(add(a,b),multiplicative_identity),
file('BOO013-4.p',unknown),
[] ).
cnf(11,plain,
equal(multiply(a,b),additive_identity),
file('BOO013-4.p',unknown),
[] ).
cnf(12,plain,
~ equal(inverse(a),b),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(18,plain,
equal(add(additive_identity,A),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(35,plain,
equal(add(multiply(A,B),multiply(A,inverse(B))),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,4]),7]),1]),
[iquote('para(8,4),demod([7]),flip(1)')] ).
cnf(37,plain,
equal(multiply(inverse(A),A),additive_identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,2]),1]),
[iquote('para(9,2),flip(1)')] ).
cnf(40,plain,
equal(add(multiply(A,a),multiply(A,b)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,4]),7]),1]),
[iquote('para(10,4),demod([7]),flip(1)')] ).
cnf(120,plain,
equal(multiply(inverse(a),b),inverse(a)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,40]),18]),
[iquote('para(37,40),demod([18])')] ).
cnf(121,plain,
equal(multiply(inverse(b),a),inverse(b)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[37,40]),6]),
[iquote('para(37,40),demod([6])')] ).
cnf(152,plain,
equal(multiply(b,inverse(a)),inverse(a)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[120,2]),1]),
[iquote('para(120,2),flip(1)')] ).
cnf(171,plain,
equal(multiply(a,inverse(b)),inverse(b)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[121,2]),1]),
[iquote('para(121,2),flip(1)')] ).
cnf(279,plain,
equal(inverse(b),a),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,35]),171,18]),
[iquote('para(11,35),demod([171,18])')] ).
cnf(542,plain,
equal(multiply(A,inverse(inverse(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,35]),18]),
[iquote('para(9,35),demod([18])')] ).
cnf(545,plain,
equal(inverse(a),b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[279,542]),152]),
[iquote('para(279,542),demod([152])')] ).
cnf(546,plain,
$false,
inference(conflict,[status(thm)],[545,12]),
[iquote('conflict(545,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : BOO013-4 : TPTP v8.1.0. Released v1.1.0.
% 0.12/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 : Wed Jun 1 16:00:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.46/1.15 ----- EQP 0.9e, May 2009 -----
% 0.46/1.15 The job began on n022.cluster.edu, Wed Jun 1 16:00:37 2022
% 0.46/1.15 The command was "./eqp09e".
% 0.46/1.15
% 0.46/1.15 set(prolog_style_variables).
% 0.46/1.15 set(lrpo).
% 0.46/1.15 set(basic_paramod).
% 0.46/1.15 set(functional_subsume).
% 0.46/1.15 set(ordered_paramod).
% 0.46/1.15 set(prime_paramod).
% 0.46/1.15 set(para_pairs).
% 0.46/1.15 assign(pick_given_ratio,4).
% 0.46/1.15 clear(print_kept).
% 0.46/1.15 clear(print_new_demod).
% 0.46/1.15 clear(print_back_demod).
% 0.46/1.15 clear(print_given).
% 0.46/1.15 assign(max_mem,64000).
% 0.46/1.15 end_of_commands.
% 0.46/1.15
% 0.46/1.15 Usable:
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Sos:
% 0.46/1.15 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.46/1.15 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.46/1.15 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.46/1.15 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.46/1.15 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.46/1.15 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.46/1.15 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.46/1.15 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.46/1.15 0 (wt=-1) [] add(a,b) = multiplicative_identity.
% 0.46/1.15 0 (wt=-1) [] multiply(a,b) = additive_identity.
% 0.46/1.15 0 (wt=-1) [] -(b = inverse(a)).
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Demodulators:
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Passive:
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Starting to process input.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.46/1.15 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.46/1.15
% 0.46/1.15 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.46/1.15 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.46/1.15
% 0.46/1.15 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.46/1.15 3 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.46/1.15 4 is a new demodulator.
% 0.46/1.15 -> 4 back demodulating 3.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.46/1.15 5 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.46/1.15 6 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.46/1.15 7 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.46/1.15 8 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.46/1.15 9 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 10 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.46/1.15 10 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 11 (wt=5) [] multiply(a,b) = additive_identity.
% 0.46/1.15 11 is a new demodulator.
% 0.46/1.15
% 0.46/1.15 ** KEPT: 12 (wt=4) [flip(1)] -(inverse(a) = b).
% 0.46/1.15 ---------------- PROOF FOUND ----------------
% 0.46/1.15 % SZS status Unsatisfiable
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 After processing input:
% 0.46/1.15
% 0.46/1.15 Usable:
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Sos:
% 0.46/1.15 12 (wt=4) [flip(1)] -(inverse(a) = b).
% 0.46/1.15 6 (wt=5) [] add(A,additive_identity) = A.
% 0.46/1.15 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.46/1.15 10 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.46/1.15 11 (wt=5) [] multiply(a,b) = additive_identity.
% 0.46/1.15 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.46/1.15 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.46/1.15 1 (wt=7) [] add(A,B) = add(B,A).
% 0.46/1.15 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.46/1.15 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.46/1.15 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Demodulators:
% 0.46/1.15 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.46/1.15 5 (wt=17) [back_demod(3),demod([4])] add(multiply(add(A,B),A),multiply(add(A,B),C)) = add(A,multiply(B,C)).
% 0.46/1.15 6 (wt=5) [] add(A,additive_identity) = A.
% 0.46/1.15 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.46/1.15 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.46/1.15 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.46/1.15 10 (wt=5) [] add(a,b) = multiplicative_identity.
% 0.46/1.15 11 (wt=5) [] multiply(a,b) = additive_identity.
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 Passive:
% 0.46/1.15 end_of_list.
% 0.46/1.15
% 0.46/1.15 UNIT CONFLICT from 545 and 12 at 0.04 seconds.
% 0.46/1.15
% 0.46/1.15 ---------------- PROOF ----------------
% 0.46/1.15 % SZS output start Refutation
% See solution above
% 0.46/1.15 ------------ end of proof -------------
% 0.46/1.15
% 0.46/1.15
% 0.46/1.15 ------------- memory usage ------------
% 0.46/1.15 Memory dynamically allocated (tp_alloc): 1464.
% 0.46/1.15 type (bytes each) gets frees in use avail bytes
% 0.46/1.15 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.46/1.15 term ( 16) 38609 24226 14383 15 279.1 K
% 0.46/1.15 gen_ptr ( 8) 79003 16400 62603 21 489.2 K
% 0.46/1.15 context ( 808) 26848 26846 2 3 3.9 K
% 0.46/1.15 trail ( 12) 11408 11408 0 6 0.1 K
% 0.46/1.15 bt_node ( 68) 6082 6080 2 21 1.5 K
% 0.46/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.46/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.46/1.15 ac_match_free_vars_pos (4020)
% 0.46/1.15 0 0 0 0 0.0 K
% 0.46/1.15 discrim ( 12) 12278 8478 3800 1914 67.0 K
% 0.46/1.15 flat ( 40) 94119 94119 0 63 2.5 K
% 0.46/1.15 discrim_pos ( 12) 1618 1618 0 1 0.0 K
% 0.46/1.15 fpa_head ( 12) 2272 0 2272 0 26.6 K
% 0.46/1.15 fpa_tree ( 28) 1337 1337 0 21 0.6 K
% 0.46/1.15 fpa_pos ( 36) 871 871 0 1 0.0 K
% 0.46/1.15 literal ( 12) 1969 1424 545 1 6.4 K
% 0.46/1.15 clause ( 24) 1969 1424 545 1 12.8 K
% 0.46/1.15 list ( 12) 385 329 56 6 0.7 K
% 0.46/1.15 list_pos ( 20) 2688 1613 1075 117 23.3 K
% 0.46/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.46/1.15
% 0.46/1.15 -------------- statistics -------------
% 0.46/1.15 Clauses input 11
% 0.46/1.15 Usable input 0
% 0.46/1.15 Sos input 11
% 0.46/1.15 Demodulators input 0
% 0.46/1.15 Passive input 0
% 0.46/1.15
% 0.46/1.15 Processed BS (before search) 14
% 0.46/1.15 Forward subsumed BS 2
% 0.46/1.15 Kept BS 12
% 0.46/1.15 New demodulators BS 9
% 0.46/1.15 Back demodulated BS 1
% 0.46/1.15
% 0.46/1.15 Clauses or pairs given 1276
% 0.46/1.15 Clauses generated 1020
% 0.46/1.15 Forward subsumed 487
% 0.46/1.15 Deleted by weight 0
% 0.46/1.15 Deleted by variable count 0
% 0.46/1.15 Kept 533
% 0.46/1.15 New demodulators 317
% 0.46/1.15 Back demodulated 346
% 0.46/1.15 Ordered paramod prunes 0
% 0.46/1.15 Basic paramod prunes 2832
% 0.46/1.15 Prime paramod prunes 14
% 0.46/1.15 Semantic prunes 0
% 0.46/1.15
% 0.46/1.15 Rewrite attmepts 16328
% 0.46/1.15 Rewrites 1378
% 0.46/1.15
% 0.46/1.15 FPA overloads 0
% 0.46/1.15 FPA underloads 0
% 0.46/1.15
% 0.46/1.15 Usable size 0
% 0.46/1.15 Sos size 197
% 0.46/1.15 Demodulators size 137
% 0.46/1.15 Passive size 0
% 0.46/1.15 Disabled size 347
% 0.46/1.15
% 0.46/1.15 Proofs found 1
% 0.46/1.15
% 0.46/1.15 ----------- times (seconds) ----------- Wed Jun 1 16:00:37 2022
% 0.46/1.15
% 0.46/1.15 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.46/1.15 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.46/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.46/1.15 input time 0.00
% 0.46/1.15 paramodulation time 0.01
% 0.46/1.15 demodulation time 0.01
% 0.46/1.15 orient time 0.00
% 0.46/1.15 weigh time 0.00
% 0.46/1.15 forward subsume time 0.00
% 0.46/1.15 back demod find time 0.01
% 0.46/1.15 conflict time 0.00
% 0.46/1.15 LRPO time 0.00
% 0.46/1.15 store clause time 0.01
% 0.46/1.15 disable clause time 0.00
% 0.46/1.15 prime paramod time 0.00
% 0.46/1.15 semantics time 0.00
% 0.46/1.15
% 0.46/1.15 EQP interrupted
%------------------------------------------------------------------------------