TSTP Solution File: GRP517-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP517-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:47 EDT 2022
% Result : Unsatisfiable 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 2 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)),C),
file('GRP517-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(multiply(A,multiply(multiply(inverse(B),C),multiply(multiply(inverse(multiply(A,D)),B),D))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(multiply(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D),C),multiply(A,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(8,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(9,plain,
equal(multiply(multiply(inverse(A),B),multiply(multiply(inverse(B),C),A)),C),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(10,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[8,9]),
[iquote('para(8,9)')] ).
cnf(14,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(C,B))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(15,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(B),C)),
inference(para,[status(thm),theory(equality)],[8,14]),
[iquote('para(8,14)')] ).
cnf(16,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),15]),
[iquote('back_demod(14),demod([15])')] ).
cnf(18,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[10,16]),
[iquote('para(10,16)')] ).
cnf(19,plain,
$false,
inference(conflict,[status(thm)],[18,2]),
[iquote('conflict(18,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP517-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 21:17:19 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.07 ----- EQP 0.9e, May 2009 -----
% 0.42/1.07 The job began on n011.cluster.edu, Mon Jun 13 21:17:19 2022
% 0.42/1.07 The command was "./eqp09e".
% 0.42/1.07
% 0.42/1.07 set(prolog_style_variables).
% 0.42/1.07 set(lrpo).
% 0.42/1.07 set(basic_paramod).
% 0.42/1.07 set(functional_subsume).
% 0.42/1.07 set(ordered_paramod).
% 0.42/1.07 set(prime_paramod).
% 0.42/1.07 set(para_pairs).
% 0.42/1.07 assign(pick_given_ratio,4).
% 0.42/1.07 clear(print_kept).
% 0.42/1.07 clear(print_new_demod).
% 0.42/1.07 clear(print_back_demod).
% 0.42/1.07 clear(print_given).
% 0.42/1.07 assign(max_mem,64000).
% 0.42/1.07 end_of_commands.
% 0.42/1.07
% 0.42/1.07 Usable:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Sos:
% 0.42/1.07 0 (wt=-1) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.42/1.07 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Demodulators:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Passive:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Starting to process input.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.42/1.07 1 is a new demodulator.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.42/1.07 ---------------- PROOF FOUND ----------------
% 0.42/1.07 % SZS status Unsatisfiable
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 After processing input:
% 0.42/1.07
% 0.42/1.07 Usable:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Sos:
% 0.42/1.07 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.42/1.07 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Demodulators:
% 0.42/1.07 1 (wt=12) [] multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C.
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Passive:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 UNIT CONFLICT from 18 and 2 at 0.00 seconds.
% 0.42/1.07
% 0.42/1.07 ---------------- PROOF ----------------
% 0.42/1.07 % SZS output start Refutation
% See solution above
% 0.42/1.07 ------------ end of proof -------------
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 ------------- memory usage ------------
% 0.42/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.07 type (bytes each) gets frees in use avail bytes
% 0.42/1.07 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.42/1.07 term ( 16) 1070 785 285 18 5.8 K
% 0.42/1.07 gen_ptr ( 8) 1268 110 1158 11 9.1 K
% 0.42/1.07 context ( 808) 534 532 2 2 3.2 K
% 0.42/1.07 trail ( 12) 88 88 0 5 0.1 K
% 0.42/1.07 bt_node ( 68) 230 227 3 12 1.0 K
% 0.42/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.07 ac_match_free_vars_pos (4020)
% 0.42/1.07 0 0 0 0 0.0 K
% 0.42/1.07 discrim ( 12) 261 7 254 0 3.0 K
% 0.42/1.07 flat ( 40) 1377 1377 0 27 1.1 K
% 0.42/1.07 discrim_pos ( 12) 10 10 0 1 0.0 K
% 0.42/1.07 fpa_head ( 12) 197 0 197 0 2.3 K
% 0.42/1.07 fpa_tree ( 28) 33 33 0 5 0.1 K
% 0.42/1.07 fpa_pos ( 36) 30 30 0 1 0.0 K
% 0.42/1.07 literal ( 12) 50 32 18 1 0.2 K
% 0.42/1.07 clause ( 24) 50 32 18 1 0.4 K
% 0.42/1.07 list ( 12) 71 15 56 3 0.7 K
% 0.42/1.07 list_pos ( 20) 67 7 60 0 1.2 K
% 0.42/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.07
% 0.42/1.07 -------------- statistics -------------
% 0.42/1.07 Clauses input 2
% 0.42/1.07 Usable input 0
% 0.42/1.07 Sos input 2
% 0.42/1.07 Demodulators input 0
% 0.42/1.07 Passive input 0
% 0.42/1.07
% 0.42/1.07 Processed BS (before search) 2
% 0.42/1.07 Forward subsumed BS 0
% 0.42/1.07 Kept BS 2
% 0.42/1.07 New demodulators BS 1
% 0.42/1.07 Back demodulated BS 0
% 0.42/1.07
% 0.42/1.07 Clauses or pairs given 18
% 0.42/1.07 Clauses generated 28
% 0.42/1.07 Forward subsumed 12
% 0.42/1.07 Deleted by weight 0
% 0.42/1.07 Deleted by variable count 0
% 0.42/1.07 Kept 16
% 0.42/1.07 New demodulators 11
% 0.42/1.07 Back demodulated 1
% 0.42/1.07 Ordered paramod prunes 0
% 0.42/1.07 Basic paramod prunes 46
% 0.42/1.07 Prime paramod prunes 3
% 0.42/1.07 Semantic prunes 0
% 0.42/1.07
% 0.42/1.07 Rewrite attmepts 230
% 0.42/1.07 Rewrites 4
% 0.42/1.07
% 0.42/1.07 FPA overloads 0
% 0.42/1.07 FPA underloads 0
% 0.42/1.07
% 0.42/1.07 Usable size 0
% 0.42/1.07 Sos size 16
% 0.42/1.07 Demodulators size 11
% 0.42/1.07 Passive size 0
% 0.42/1.07 Disabled size 1
% 0.42/1.07
% 0.42/1.07 Proofs found 1
% 0.42/1.07
% 0.42/1.07 ----------- times (seconds) ----------- Mon Jun 13 21:17:19 2022
% 0.42/1.07
% 0.42/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.07 input time 0.00
% 0.42/1.07 paramodulation time 0.00
% 0.42/1.07 demodulation time 0.00
% 0.42/1.07 orient time 0.00
% 0.42/1.07 weigh time 0.00
% 0.42/1.07 forward subsume time 0.00
% 0.42/1.07 back demod find time 0.00
% 0.42/1.07 conflict time 0.00
% 0.42/1.07 LRPO time 0.00
% 0.42/1.07 store clause time 0.00
% 0.42/1.07 disable clause time 0.00
% 0.42/1.07 prime paramod time 0.00
% 0.42/1.07 semantics time 0.00
% 0.42/1.07
% 0.42/1.07 EQP interrupted
%------------------------------------------------------------------------------