TSTP Solution File: BOO001-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n020.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:02 EDT 2022
% Result : Unsatisfiable 0.44s 1.10s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-3 aty)
% Number of variables : 23 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B,C),D,multiply(A,B,E)),multiply(A,B,multiply(C,D,E))),
file('BOO001-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B,B),B),
file('BOO001-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(A,B,inverse(B)),A),
file('BOO001-1.p',unknown),
[] ).
cnf(6,plain,
~ equal(inverse(inverse(a)),a),
file('BOO001-1.p',unknown),
[] ).
cnf(9,plain,
equal(multiply(A,B,multiply(C,A,D)),multiply(C,A,multiply(A,B,D))),
inference(para,[status(thm),theory(equality)],[2,1]),
[iquote('para(2,1)')] ).
cnf(10,plain,
equal(multiply(A,B,multiply(B,C,D)),multiply(B,C,multiply(A,B,D))),
inference(flip,[status(thm),theory(equality)],[9]),
[iquote('flip(9)')] ).
cnf(29,plain,
equal(multiply(A,B,multiply(C,A,B)),multiply(C,A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,10]),1]),
[iquote('para(2,10),flip(1)')] ).
cnf(36,plain,
equal(multiply(A,inverse(A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,29]),5]),
[iquote('para(5,29),demod([5])')] ).
cnf(41,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[36,5]),
[iquote('para(36,5)')] ).
cnf(42,plain,
$false,
inference(conflict,[status(thm)],[41,6]),
[iquote('conflict(41,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : BOO001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Wed Jun 1 20:08:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.44/1.10 ----- EQP 0.9e, May 2009 -----
% 0.44/1.10 The job began on n020.cluster.edu, Wed Jun 1 20:08:09 2022
% 0.44/1.10 The command was "./eqp09e".
% 0.44/1.10
% 0.44/1.10 set(prolog_style_variables).
% 0.44/1.10 set(lrpo).
% 0.44/1.10 set(basic_paramod).
% 0.44/1.10 set(functional_subsume).
% 0.44/1.10 set(ordered_paramod).
% 0.44/1.10 set(prime_paramod).
% 0.44/1.10 set(para_pairs).
% 0.44/1.10 assign(pick_given_ratio,4).
% 0.44/1.10 clear(print_kept).
% 0.44/1.10 clear(print_new_demod).
% 0.44/1.10 clear(print_back_demod).
% 0.44/1.10 clear(print_given).
% 0.44/1.10 assign(max_mem,64000).
% 0.44/1.10 end_of_commands.
% 0.44/1.10
% 0.44/1.10 Usable:
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Sos:
% 0.44/1.10 0 (wt=-1) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.44/1.10 0 (wt=-1) [] multiply(A,B,B) = B.
% 0.44/1.10 0 (wt=-1) [] multiply(A,A,B) = A.
% 0.44/1.10 0 (wt=-1) [] multiply(inverse(A),A,B) = B.
% 0.44/1.10 0 (wt=-1) [] multiply(A,B,inverse(B)) = A.
% 0.44/1.10 0 (wt=-1) [] -(inverse(inverse(a)) = a).
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Demodulators:
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Passive:
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Starting to process input.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.44/1.10 1 is a new demodulator.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 2 (wt=6) [] multiply(A,B,B) = B.
% 0.44/1.10 2 is a new demodulator.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 3 (wt=6) [] multiply(A,A,B) = A.
% 0.44/1.10 3 is a new demodulator.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.44/1.10 4 is a new demodulator.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 5 (wt=7) [] multiply(A,B,inverse(B)) = A.
% 0.44/1.10 5 is a new demodulator.
% 0.44/1.10
% 0.44/1.10 ** KEPT: 6 (wt=5) [] -(inverse(inverse(a)) = a).
% 0.44/1.10 ---------------- PROOF FOUND ----------------
% 0.44/1.10 % SZS status Unsatisfiable
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 After processing input:
% 0.44/1.10
% 0.44/1.10 Usable:
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Sos:
% 0.44/1.10 6 (wt=5) [] -(inverse(inverse(a)) = a).
% 0.44/1.10 2 (wt=6) [] multiply(A,B,B) = B.
% 0.44/1.10 3 (wt=6) [] multiply(A,A,B) = A.
% 0.44/1.10 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.44/1.10 5 (wt=7) [] multiply(A,B,inverse(B)) = A.
% 0.44/1.10 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Demodulators:
% 0.44/1.10 1 (wt=18) [] multiply(multiply(A,B,C),D,multiply(A,B,E)) = multiply(A,B,multiply(C,D,E)).
% 0.44/1.10 2 (wt=6) [] multiply(A,B,B) = B.
% 0.44/1.10 3 (wt=6) [] multiply(A,A,B) = A.
% 0.44/1.10 4 (wt=7) [] multiply(inverse(A),A,B) = B.
% 0.44/1.10 5 (wt=7) [] multiply(A,B,inverse(B)) = A.
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 Passive:
% 0.44/1.10 end_of_list.
% 0.44/1.10
% 0.44/1.10 UNIT CONFLICT from 41 and 6 at 0.00 seconds.
% 0.44/1.10
% 0.44/1.10 ---------------- PROOF ----------------
% 0.44/1.10 % SZS output start Refutation
% See solution above
% 0.44/1.10 ------------ end of proof -------------
% 0.44/1.10
% 0.44/1.10
% 0.44/1.10 ------------- memory usage ------------
% 0.44/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.44/1.10 type (bytes each) gets frees in use avail bytes
% 0.44/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.44/1.10 term ( 16) 2787 1909 878 25 17.5 K
% 0.44/1.10 gen_ptr ( 8) 3212 294 2918 9 22.9 K
% 0.44/1.10 context ( 808) 1125 1123 2 3 3.9 K
% 0.44/1.10 trail ( 12) 563 563 0 9 0.1 K
% 0.44/1.10 bt_node ( 68) 430 426 4 6 0.7 K
% 0.44/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.44/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.44/1.10 ac_match_free_vars_pos (4020)
% 0.44/1.10 0 0 0 0 0.0 K
% 0.44/1.10 discrim ( 12) 753 0 753 0 8.8 K
% 0.44/1.10 flat ( 40) 3865 3865 0 39 1.5 K
% 0.44/1.10 discrim_pos ( 12) 66 66 0 1 0.0 K
% 0.44/1.10 fpa_head ( 12) 237 0 237 0 2.8 K
% 0.44/1.10 fpa_tree ( 28) 43 43 0 5 0.1 K
% 0.44/1.10 fpa_pos ( 36) 61 61 0 1 0.0 K
% 0.44/1.10 literal ( 12) 143 102 41 1 0.5 K
% 0.44/1.10 clause ( 24) 143 102 41 1 1.0 K
% 0.44/1.10 list ( 12) 79 23 56 3 0.7 K
% 0.44/1.10 list_pos ( 20) 146 6 140 0 2.7 K
% 0.44/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.44/1.10
% 0.44/1.10 -------------- statistics -------------
% 0.44/1.10 Clauses input 6
% 0.44/1.10 Usable input 0
% 0.44/1.10 Sos input 6
% 0.44/1.10 Demodulators input 0
% 0.44/1.10 Passive input 0
% 0.44/1.10
% 0.44/1.10 Processed BS (before search) 6
% 0.44/1.10 Forward subsumed BS 0
% 0.44/1.10 Kept BS 6
% 0.44/1.10 New demodulators BS 5
% 0.44/1.10 Back demodulated BS 0
% 0.44/1.10
% 0.44/1.10 Clauses or pairs given 59
% 0.44/1.10 Clauses generated 85
% 0.44/1.10 Forward subsumed 50
% 0.44/1.10 Deleted by weight 0
% 0.44/1.10 Deleted by variable count 0
% 0.44/1.10 Kept 35
% 0.44/1.10 New demodulators 15
% 0.44/1.10 Back demodulated 0
% 0.44/1.10 Ordered paramod prunes 0
% 0.44/1.10 Basic paramod prunes 9
% 0.44/1.10 Prime paramod prunes 2
% 0.44/1.10 Semantic prunes 0
% 0.44/1.10
% 0.44/1.10 Rewrite attmepts 589
% 0.44/1.10 Rewrites 54
% 0.44/1.10
% 0.44/1.10 FPA overloads 0
% 0.44/1.10 FPA underloads 0
% 0.44/1.10
% 0.44/1.10 Usable size 0
% 0.44/1.10 Sos size 40
% 0.44/1.10 Demodulators size 20
% 0.44/1.10 Passive size 0
% 0.44/1.10 Disabled size 0
% 0.44/1.10
% 0.44/1.10 Proofs found 1
% 0.44/1.10
% 0.44/1.10 ----------- times (seconds) ----------- Wed Jun 1 20:08:09 2022
% 0.44/1.10
% 0.44/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.44/1.10 input time 0.00
% 0.44/1.10 paramodulation time 0.00
% 0.44/1.10 demodulation time 0.00
% 0.44/1.10 orient time 0.00
% 0.44/1.10 weigh time 0.00
% 0.44/1.10 forward subsume time 0.00
% 0.44/1.10 back demod find time 0.00
% 0.44/1.10 conflict time 0.00
% 0.44/1.10 LRPO time 0.00
% 0.44/1.10 store clause time 0.00
% 0.44/1.10 disable clause time 0.00
% 0.44/1.10 prime paramod time 0.00
% 0.44/1.10 semantics time 0.00
% 0.44/1.10
% 0.44/1.10 EQP interrupted
%------------------------------------------------------------------------------