TSTP Solution File: BOO004-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO004-4 : TPTP v8.1.0. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:03 EDT 2022
% Result : Unsatisfiable 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 2 RR)
% Number of literals : 17 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO004-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO004-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(add(A,B),add(A,C)),add(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO004-4.p',unknown),
[] ).
cnf(5,plain,
equal(add(multiply(add(A,B),A),multiply(add(A,B),C)),add(A,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),4]),
[iquote('back_demod(3),demod([4])')] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO004-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO004-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(add(a,a),a),
file('BOO004-4.p',unknown),
[] ).
cnf(12,plain,
equal(add(multiply(A,B),multiply(A,C)),multiply(add(B,C),A)),
inference(para,[status(thm),theory(equality)],[4,2]),
[iquote('para(4,2)')] ).
cnf(21,plain,
equal(multiply(multiplicative_identity,A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
[iquote('para(7,2),flip(1)')] ).
cnf(34,plain,
equal(add(A,multiply(inverse(A),B)),add(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,5]),21,8,21]),1]),
[iquote('para(8,5),demod([21,8,21]),flip(1)')] ).
cnf(57,plain,
equal(add(multiply(A,B),A),multiply(add(B,multiplicative_identity),A)),
inference(para,[status(thm),theory(equality)],[7,12]),
[iquote('para(7,12)')] ).
cnf(58,plain,
equal(multiply(add(A,multiplicative_identity),B),add(multiply(B,A),B)),
inference(flip,[status(thm),theory(equality)],[57]),
[iquote('flip(57)')] ).
cnf(70,plain,
equal(add(A,multiplicative_identity),multiplicative_identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,34]),8]),1]),
[iquote('para(7,34),demod([8]),flip(1)')] ).
cnf(71,plain,
equal(add(multiply(A,B),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[58]),70,21]),1]),
[iquote('back_demod(58),demod([70,21]),flip(1)')] ).
cnf(80,plain,
equal(add(A,A),A),
inference(para,[status(thm),theory(equality)],[7,71]),
[iquote('para(7,71)')] ).
cnf(81,plain,
$false,
inference(conflict,[status(thm)],[80,10]),
[iquote('conflict(80,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : BOO004-4 : TPTP v8.1.0. Released v1.1.0.
% 0.14/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n021.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Wed Jun 1 16:48:16 EDT 2022
% 0.22/0.36 % CPUTime :
% 0.74/1.13 ----- EQP 0.9e, May 2009 -----
% 0.74/1.13 The job began on n021.cluster.edu, Wed Jun 1 16:48:16 2022
% 0.74/1.13 The command was "./eqp09e".
% 0.74/1.13
% 0.74/1.13 set(prolog_style_variables).
% 0.74/1.13 set(lrpo).
% 0.74/1.13 set(basic_paramod).
% 0.74/1.13 set(functional_subsume).
% 0.74/1.13 set(ordered_paramod).
% 0.74/1.13 set(prime_paramod).
% 0.74/1.13 set(para_pairs).
% 0.74/1.13 assign(pick_given_ratio,4).
% 0.74/1.13 clear(print_kept).
% 0.74/1.13 clear(print_new_demod).
% 0.74/1.13 clear(print_back_demod).
% 0.74/1.13 clear(print_given).
% 0.74/1.13 assign(max_mem,64000).
% 0.74/1.13 end_of_commands.
% 0.74/1.13
% 0.74/1.13 Usable:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Sos:
% 0.74/1.13 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.74/1.13 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.74/1.13 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.74/1.13 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.74/1.13 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.74/1.13 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.74/1.13 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.74/1.13 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.74/1.13 0 (wt=-1) [] -(add(a,a) = a).
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Demodulators:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Passive:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Starting to process input.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.74/1.13 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.74/1.13
% 0.74/1.13 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.74/1.13 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.74/1.13
% 0.74/1.13 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.74/1.13 3 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.74/1.13 4 is a new demodulator.
% 0.74/1.13 -> 4 back demodulating 3.
% 0.74/1.13
% 0.74/1.13 ** 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.74/1.13 5 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.74/1.13 6 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.74/1.13 7 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.74/1.13 8 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.74/1.13 9 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 10 (wt=5) [] -(add(a,a) = a).
% 0.74/1.13 ---------------- PROOF FOUND ----------------
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 After processing input:
% 0.74/1.13
% 0.74/1.13 Usable:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Sos:
% 0.74/1.13 6 (wt=5) [] add(A,additive_identity) = A.
% 0.74/1.13 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.74/1.13 10 (wt=5) [] -(add(a,a) = a).
% 0.74/1.13 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.74/1.13 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.74/1.13 1 (wt=7) [] add(A,B) = add(B,A).
% 0.74/1.13 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.74/1.13 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.74/1.13 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.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Demodulators:
% 0.74/1.13 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.74/1.13 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.74/1.13 6 (wt=5) [] add(A,additive_identity) = A.
% 0.74/1.13 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.74/1.13 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.74/1.13 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Passive:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 UNIT CONFLICT from 80 and 10 at 0.00 seconds.
% 0.74/1.13
% 0.74/1.13 ---------------- PROOF ----------------
% 0.74/1.13 % SZS output start Refutation
% See solution above
% 0.74/1.13 ------------ end of proof -------------
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 ------------- memory usage ------------
% 0.74/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.13 type (bytes each) gets frees in use avail bytes
% 0.74/1.13 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.74/1.13 term ( 16) 3860 2721 1139 19 22.3 K
% 0.74/1.13 gen_ptr ( 8) 4725 732 3993 16 31.3 K
% 0.74/1.13 context ( 808) 2896 2894 2 3 3.9 K
% 0.74/1.13 trail ( 12) 425 425 0 4 0.0 K
% 0.74/1.13 bt_node ( 68) 990 987 3 8 0.7 K
% 0.74/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.13 ac_match_free_vars_pos (4020)
% 0.74/1.13 0 0 0 0 0.0 K
% 0.74/1.13 discrim ( 12) 963 126 837 34 10.2 K
% 0.74/1.13 flat ( 40) 5600 5600 0 33 1.3 K
% 0.74/1.13 discrim_pos ( 12) 133 133 0 1 0.0 K
% 0.74/1.13 fpa_head ( 12) 419 0 419 0 4.9 K
% 0.74/1.13 fpa_tree ( 28) 101 101 0 7 0.2 K
% 0.74/1.13 fpa_pos ( 36) 125 125 0 1 0.0 K
% 0.74/1.13 literal ( 12) 277 197 80 1 0.9 K
% 0.74/1.13 clause ( 24) 277 197 80 1 1.9 K
% 0.74/1.13 list ( 12) 104 48 56 4 0.7 K
% 0.74/1.13 list_pos ( 20) 325 82 243 13 5.0 K
% 0.74/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.13
% 0.74/1.13 -------------- statistics -------------
% 0.74/1.13 Clauses input 9
% 0.74/1.13 Usable input 0
% 0.74/1.13 Sos input 9
% 0.74/1.13 Demodulators input 0
% 0.74/1.13 Passive input 0
% 0.74/1.13
% 0.74/1.13 Processed BS (before search) 12
% 0.74/1.13 Forward subsumed BS 2
% 0.74/1.13 Kept BS 10
% 0.74/1.13 New demodulators BS 7
% 0.74/1.13 Back demodulated BS 1
% 0.74/1.13
% 0.74/1.13 Clauses or pairs given 292
% 0.74/1.13 Clauses generated 159
% 0.74/1.13 Forward subsumed 89
% 0.74/1.13 Deleted by weight 0
% 0.74/1.13 Deleted by variable count 0
% 0.74/1.13 Kept 70
% 0.74/1.13 New demodulators 38
% 0.74/1.13 Back demodulated 14
% 0.74/1.13 Ordered paramod prunes 0
% 0.74/1.13 Basic paramod prunes 488
% 0.74/1.13 Prime paramod prunes 11
% 0.74/1.13 Semantic prunes 0
% 0.74/1.13
% 0.74/1.13 Rewrite attmepts 1252
% 0.74/1.13 Rewrites 99
% 0.74/1.13
% 0.74/1.13 FPA overloads 0
% 0.74/1.13 FPA underloads 0
% 0.74/1.13
% 0.74/1.13 Usable size 0
% 0.74/1.13 Sos size 64
% 0.74/1.13 Demodulators size 36
% 0.74/1.13 Passive size 0
% 0.74/1.13 Disabled size 15
% 0.74/1.13
% 0.74/1.13 Proofs found 1
% 0.74/1.13
% 0.74/1.13 ----------- times (seconds) ----------- Wed Jun 1 16:48:16 2022
% 0.74/1.13
% 0.74/1.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.13 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.13 input time 0.00
% 0.74/1.13 paramodulation time 0.00
% 0.74/1.13 demodulation time 0.00
% 0.74/1.13 orient time 0.00
% 0.74/1.13 weigh time 0.00
% 0.74/1.13 forward subsume time 0.00
% 0.74/1.13 back demod find time 0.00
% 0.74/1.13 conflict time 0.00
% 0.74/1.13 LRPO time 0.00
% 0.74/1.13 store clause time 0.00
% 0.74/1.13 disable clause time 0.00
% 0.74/1.13 prime paramod time 0.00
% 0.74/1.13 semantics time 0.00
% 0.74/1.13
% 0.74/1.13 EQP interrupted
%------------------------------------------------------------------------------