TSTP Solution File: BOO012-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO012-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:06 EDT 2022
% Result : Unsatisfiable 0.43s 1.08s
% Output : Refutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 2 RR)
% Number of literals : 15 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(add(A,B),add(B,A)),
file('BOO012-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),multiply(B,A)),
file('BOO012-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,add(B,C)),add(multiply(A,B),multiply(A,C))),
file('BOO012-4.p',unknown),
[] ).
cnf(6,plain,
equal(add(A,additive_identity),A),
file('BOO012-4.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(A,multiplicative_identity),A),
file('BOO012-4.p',unknown),
[] ).
cnf(8,plain,
equal(add(A,inverse(A)),multiplicative_identity),
file('BOO012-4.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(A,inverse(A)),additive_identity),
file('BOO012-4.p',unknown),
[] ).
cnf(10,plain,
~ equal(inverse(inverse(x)),x),
file('BOO012-4.p',unknown),
[] ).
cnf(11,plain,
equal(add(additive_identity,A),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(33,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(35,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(138,plain,
equal(multiply(A,inverse(inverse(A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,33]),11]),
[iquote('para(9,33),demod([11])')] ).
cnf(150,plain,
equal(multiply(inverse(inverse(A)),A),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[138,2]),1]),
[iquote('para(138,2),flip(1)')] ).
cnf(173,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,33]),150,6]),1]),
[iquote('para(35,33),demod([150,6]),flip(1)')] ).
cnf(174,plain,
$false,
inference(conflict,[status(thm)],[173,10]),
[iquote('conflict(173,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO012-4 : TPTP v8.1.0. Released v1.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n021.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % 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 17:23:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.08 ----- EQP 0.9e, May 2009 -----
% 0.43/1.08 The job began on n021.cluster.edu, Wed Jun 1 17:23:46 2022
% 0.43/1.08 The command was "./eqp09e".
% 0.43/1.08
% 0.43/1.08 set(prolog_style_variables).
% 0.43/1.08 set(lrpo).
% 0.43/1.08 set(basic_paramod).
% 0.43/1.08 set(functional_subsume).
% 0.43/1.08 set(ordered_paramod).
% 0.43/1.08 set(prime_paramod).
% 0.43/1.08 set(para_pairs).
% 0.43/1.08 assign(pick_given_ratio,4).
% 0.43/1.08 clear(print_kept).
% 0.43/1.08 clear(print_new_demod).
% 0.43/1.08 clear(print_back_demod).
% 0.43/1.08 clear(print_given).
% 0.43/1.08 assign(max_mem,64000).
% 0.43/1.08 end_of_commands.
% 0.43/1.08
% 0.43/1.08 Usable:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Sos:
% 0.43/1.08 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.43/1.08 0 (wt=-1) [] multiply(A,B) = multiply(B,A).
% 0.43/1.08 0 (wt=-1) [] add(A,multiply(B,C)) = multiply(add(A,B),add(A,C)).
% 0.43/1.08 0 (wt=-1) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.08 0 (wt=-1) [] add(A,additive_identity) = A.
% 0.43/1.08 0 (wt=-1) [] multiply(A,multiplicative_identity) = A.
% 0.43/1.08 0 (wt=-1) [] add(A,inverse(A)) = multiplicative_identity.
% 0.43/1.08 0 (wt=-1) [] multiply(A,inverse(A)) = additive_identity.
% 0.43/1.08 0 (wt=-1) [] -(inverse(inverse(x)) = x).
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Demodulators:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Passive:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Starting to process input.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 1 (wt=7) [] add(A,B) = add(B,A).
% 0.43/1.08 clause forward subsumed: 0 (wt=7) [flip(1)] add(B,A) = add(A,B).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.43/1.08 clause forward subsumed: 0 (wt=7) [flip(2)] multiply(B,A) = multiply(A,B).
% 0.43/1.08
% 0.43/1.08 ** KEPT: 3 (wt=13) [flip(1)] multiply(add(A,B),add(A,C)) = add(A,multiply(B,C)).
% 0.43/1.08 3 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.08 4 is a new demodulator.
% 0.43/1.08 -> 4 back demodulating 3.
% 0.43/1.08
% 0.43/1.08 ** 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.43/1.08 5 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 6 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.08 6 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.43/1.08 7 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.43/1.08 8 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.43/1.08 9 is a new demodulator.
% 0.43/1.08
% 0.43/1.08 ** KEPT: 10 (wt=5) [] -(inverse(inverse(x)) = x).
% 0.43/1.08 ---------------- PROOF FOUND ----------------
% 0.43/1.08 % SZS status Unsatisfiable
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 After processing input:
% 0.43/1.08
% 0.43/1.08 Usable:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Sos:
% 0.43/1.08 6 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.08 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.43/1.08 10 (wt=5) [] -(inverse(inverse(x)) = x).
% 0.43/1.08 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.43/1.08 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.43/1.08 1 (wt=7) [] add(A,B) = add(B,A).
% 0.43/1.08 2 (wt=7) [] multiply(A,B) = multiply(B,A).
% 0.43/1.08 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.08 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.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Demodulators:
% 0.43/1.08 4 (wt=13) [] multiply(A,add(B,C)) = add(multiply(A,B),multiply(A,C)).
% 0.43/1.08 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.43/1.08 6 (wt=5) [] add(A,additive_identity) = A.
% 0.43/1.08 7 (wt=5) [] multiply(A,multiplicative_identity) = A.
% 0.43/1.08 8 (wt=6) [] add(A,inverse(A)) = multiplicative_identity.
% 0.43/1.08 9 (wt=6) [] multiply(A,inverse(A)) = additive_identity.
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 Passive:
% 0.43/1.08 end_of_list.
% 0.43/1.08
% 0.43/1.08 UNIT CONFLICT from 173 and 10 at 0.01 seconds.
% 0.43/1.08
% 0.43/1.08 ---------------- PROOF ----------------
% 0.43/1.08 % SZS output start Refutation
% See solution above
% 0.43/1.08 ------------ end of proof -------------
% 0.43/1.08
% 0.43/1.08
% 0.43/1.08 ------------- memory usage ------------
% 0.43/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.43/1.08 type (bytes each) gets frees in use avail bytes
% 0.43/1.08 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.43/1.08 term ( 16) 12203 8678 3525 42 69.0 K
% 0.43/1.08 gen_ptr ( 8) 15905 2119 13786 14 107.8 K
% 0.43/1.08 context ( 808) 8779 8777 2 3 3.9 K
% 0.43/1.08 trail ( 12) 1937 1937 0 5 0.1 K
% 0.43/1.08 bt_node ( 68) 2810 2807 3 10 0.9 K
% 0.43/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.43/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.43/1.08 ac_match_free_vars_pos (4020)
% 0.43/1.08 0 0 0 0 0.0 K
% 0.43/1.08 discrim ( 12) 2684 309 2375 0 27.8 K
% 0.43/1.08 flat ( 40) 23770 23770 0 59 2.3 K
% 0.74/1.08 discrim_pos ( 12) 498 498 0 1 0.0 K
% 0.74/1.08 fpa_head ( 12) 861 0 861 0 10.1 K
% 0.74/1.08 fpa_tree ( 28) 249 249 0 13 0.4 K
% 0.74/1.08 fpa_pos ( 36) 259 259 0 1 0.0 K
% 0.74/1.08 literal ( 12) 714 541 173 1 2.0 K
% 0.74/1.08 clause ( 24) 714 541 173 1 4.1 K
% 0.74/1.08 list ( 12) 145 89 56 4 0.7 K
% 0.74/1.08 list_pos ( 20) 671 139 532 0 10.4 K
% 0.74/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.08
% 0.74/1.08 -------------- statistics -------------
% 0.74/1.08 Clauses input 9
% 0.74/1.08 Usable input 0
% 0.74/1.08 Sos input 9
% 0.74/1.08 Demodulators input 0
% 0.74/1.08 Passive input 0
% 0.74/1.08
% 0.74/1.08 Processed BS (before search) 12
% 0.74/1.08 Forward subsumed BS 2
% 0.74/1.08 Kept BS 10
% 0.74/1.08 New demodulators BS 7
% 0.74/1.08 Back demodulated BS 1
% 0.74/1.08
% 0.74/1.08 Clauses or pairs given 661
% 0.74/1.08 Clauses generated 437
% 0.74/1.08 Forward subsumed 274
% 0.74/1.08 Deleted by weight 0
% 0.74/1.08 Deleted by variable count 0
% 0.74/1.08 Kept 163
% 0.74/1.08 New demodulators 79
% 0.74/1.08 Back demodulated 27
% 0.74/1.08 Ordered paramod prunes 0
% 0.74/1.08 Basic paramod prunes 1042
% 0.74/1.08 Prime paramod prunes 39
% 0.74/1.08 Semantic prunes 0
% 0.74/1.08
% 0.74/1.08 Rewrite attmepts 4433
% 0.74/1.08 Rewrites 383
% 0.74/1.08
% 0.74/1.08 FPA overloads 0
% 0.74/1.08 FPA underloads 0
% 0.74/1.08
% 0.74/1.08 Usable size 0
% 0.74/1.08 Sos size 144
% 0.74/1.08 Demodulators size 72
% 0.74/1.08 Passive size 0
% 0.74/1.08 Disabled size 28
% 0.74/1.08
% 0.74/1.08 Proofs found 1
% 0.74/1.08
% 0.74/1.08 ----------- times (seconds) ----------- Wed Jun 1 17:23:46 2022
% 0.74/1.08
% 0.74/1.08 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.08 input time 0.00
% 0.74/1.08 paramodulation time 0.00
% 0.74/1.08 demodulation time 0.00
% 0.74/1.08 orient time 0.00
% 0.74/1.08 weigh time 0.00
% 0.74/1.08 forward subsume time 0.00
% 0.74/1.08 back demod find time 0.00
% 0.74/1.08 conflict time 0.00
% 0.74/1.08 LRPO time 0.00
% 0.74/1.08 store clause time 0.00
% 0.74/1.08 disable clause time 0.00
% 0.74/1.08 prime paramod time 0.00
% 0.74/1.08 semantics time 0.00
% 0.74/1.08
% 0.74/1.08 EQP interrupted
%------------------------------------------------------------------------------