TSTP Solution File: GRP412-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP412-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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:46:33 EDT 2022
% Result : Unsatisfiable 0.95s 1.34s
% Output : Refutation 0.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 2 RR)
% Number of literals : 25 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 14 ( 3 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 : 87 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))),C),
file('GRP412-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,inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),inverse(multiply(inverse(C),D))),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(multiply(B,inverse(C))),inverse(A))),D))),A)),multiply(B,inverse(multiply(multiply(multiply(inverse(C),C),inverse(D)),C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(6,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)),inverse(D)),multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B)))),inverse(multiply(multiply(multiply(inverse(E),E),inverse(multiply(inverse(multiply(inverse(C),inverse(E))),D))),E))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(10,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(C)),B)))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,B)))),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(D))),C))),D)),
inference(para,[status(thm),theory(equality)],[1,10]),
[iquote('para(1,10)')] ).
cnf(12,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),C))),A),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(C,B))))),
inference(flip,[status(thm),theory(equality)],[11]),
[iquote('flip(11)')] ).
cnf(20,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(multiply(inverse(B),B),inverse(A))),multiply(multiply(inverse(B),B),inverse(C))))),A),C),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),1]),
[iquote('para(10,11),flip(1)')] ).
cnf(38,plain,
equal(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(multiply(C,A)))))),C),
inference(para,[status(thm),theory(equality)],[12,1]),
[iquote('para(12,1)')] ).
cnf(45,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(C,B)))),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(multiply(C,B))))),
inference(para,[status(thm),theory(equality)],[38,10]),
[iquote('para(38,10)')] ).
cnf(67,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(C))),multiply(inverse(multiply(D,inverse(B))),multiply(D,inverse(C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,45]),20]),
[iquote('para(20,45),demod([20])')] ).
cnf(80,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(inverse(B),inverse(A))),multiply(inverse(B),C)))),A)),C),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(117,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(multiply(D,inverse(B))),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[80,67]),80]),
[iquote('para(80,67),demod([80])')] ).
cnf(120,plain,
equal(multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(C,inverse(B))),multiply(C,D)))),B))),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[117,1]),
[iquote('para(117,1)')] ).
cnf(139,plain,
equal(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,C)))),A)),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[120,1]),1]),1]),
[iquote('para(120,1),demod([1]),flip(1)')] ).
cnf(143,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),C),B)))),multiply(multiply(multiply(inverse(D),D),inverse(multiply(inverse(multiply(E,inverse(D))),multiply(E,C)))),D)),
inference(para,[status(thm),theory(equality)],[139,10]),
[iquote('para(139,10)')] ).
cnf(469,plain,
equal(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(C))))),A),C),
inference(para,[status(thm),theory(equality)],[143,10]),
[iquote('para(143,10)')] ).
cnf(470,plain,
equal(multiply(inverse(multiply(multiply(multiply(inverse(A),A),inverse(multiply(inverse(multiply(B,inverse(A))),multiply(B,inverse(C))))),inverse(D))),C),multiply(inverse(multiply(E,inverse(D))),multiply(E,A))),
inference(para,[status(thm),theory(equality)],[469,117]),
[iquote('para(469,117)')] ).
cnf(471,plain,
equal(multiply(inverse(multiply(A,inverse(B))),multiply(A,C)),multiply(inverse(multiply(multiply(multiply(inverse(C),C),inverse(multiply(inverse(multiply(D,inverse(C))),multiply(D,inverse(E))))),inverse(B))),E)),
inference(flip,[status(thm),theory(equality)],[470]),
[iquote('flip(470)')] ).
cnf(550,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(B,inverse(C))))),multiply(A,inverse(multiply(multiply(multiply(inverse(D),D),inverse(E)),multiply(B,inverse(C)))))),E),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[471,10]),469]),
[iquote('para(471,10),demod([469])')] ).
cnf(556,plain,
equal(multiply(multiply(inverse(multiply(A,inverse(B))),multiply(A,inverse(B))),inverse(C)),multiply(multiply(inverse(D),D),inverse(C))),
inference(para,[status(thm),theory(equality)],[550,38]),
[iquote('para(550,38)')] ).
cnf(707,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),multiply(multiply(inverse(C),C),inverse(B))),
inference(para,[status(thm),theory(equality)],[556,556]),
[iquote('para(556,556)')] ).
cnf(715,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[707,38]),38]),
[iquote('para(707,38),demod([38])')] ).
cnf(716,plain,
$false,
inference(conflict,[status(thm)],[715,2]),
[iquote('conflict(715,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP412-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 06:05:54 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.95/1.34 ----- EQP 0.9e, May 2009 -----
% 0.95/1.34 The job began on n007.cluster.edu, Tue Jun 14 06:05:55 2022
% 0.95/1.34 The command was "./eqp09e".
% 0.95/1.34
% 0.95/1.34 set(prolog_style_variables).
% 0.95/1.34 set(lrpo).
% 0.95/1.34 set(basic_paramod).
% 0.95/1.34 set(functional_subsume).
% 0.95/1.34 set(ordered_paramod).
% 0.95/1.34 set(prime_paramod).
% 0.95/1.34 set(para_pairs).
% 0.95/1.34 assign(pick_given_ratio,4).
% 0.95/1.34 clear(print_kept).
% 0.95/1.34 clear(print_new_demod).
% 0.95/1.34 clear(print_back_demod).
% 0.95/1.34 clear(print_given).
% 0.95/1.34 assign(max_mem,64000).
% 0.95/1.34 end_of_commands.
% 0.95/1.34
% 0.95/1.34 Usable:
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Sos:
% 0.95/1.34 0 (wt=-1) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 0.95/1.34 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Demodulators:
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Passive:
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Starting to process input.
% 0.95/1.34
% 0.95/1.34 ** KEPT: 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 0.95/1.34 1 is a new demodulator.
% 0.95/1.34
% 0.95/1.34 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.95/1.34 ---------------- PROOF FOUND ----------------
% 0.95/1.34 % SZS status Unsatisfiable
% 0.95/1.34
% 0.95/1.34
% 0.95/1.34 After processing input:
% 0.95/1.34
% 0.95/1.34 Usable:
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Sos:
% 0.95/1.34 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.95/1.34 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Demodulators:
% 0.95/1.34 1 (wt=20) [] multiply(A,inverse(multiply(multiply(multiply(inverse(B),B),inverse(multiply(inverse(multiply(A,inverse(B))),C))),B))) = C.
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 Passive:
% 0.95/1.34 end_of_list.
% 0.95/1.34
% 0.95/1.34 UNIT CONFLICT from 715 and 2 at 0.21 seconds.
% 0.95/1.34
% 0.95/1.34 ---------------- PROOF ----------------
% 0.95/1.34 % SZS output start Refutation
% See solution above
% 0.95/1.34 ------------ end of proof -------------
% 0.95/1.34
% 0.95/1.34
% 0.95/1.34 ------------- memory usage ------------
% 0.95/1.34 Memory dynamically allocated (tp_alloc): 7812.
% 0.95/1.34 type (bytes each) gets frees in use avail bytes
% 0.95/1.34 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.95/1.34 term ( 16) 170922 93219 77703 281 1520.4 K
% 0.95/1.34 gen_ptr ( 8) 604051 11280 592771 64 4631.5 K
% 0.95/1.34 context ( 808) 118124 118122 2 2 3.2 K
% 0.95/1.34 trail ( 12) 13181 13181 0 12 0.1 K
% 0.95/1.34 bt_node ( 68) 20142 20139 3 171 11.6 K
% 0.95/1.34 ac_position (285432) 0 0 0 0 0.0 K
% 0.95/1.34 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.95/1.34 ac_match_free_vars_pos (4020)
% 0.95/1.34 0 0 0 0 0.0 K
% 0.95/1.34 discrim ( 12) 85143 4601 80542 306 947.4 K
% 0.95/1.34 flat ( 40) 805941 805941 0 542 21.2 K
% 0.95/1.34 discrim_pos ( 12) 1070 1070 0 1 0.0 K
% 0.95/1.34 fpa_head ( 12) 5785 0 5785 0 67.8 K
% 0.95/1.34 fpa_tree ( 28) 4571 4571 0 51 1.4 K
% 0.95/1.34 fpa_pos ( 36) 1043 1043 0 1 0.0 K
% 0.95/1.34 literal ( 12) 2796 2081 715 1 8.4 K
% 0.95/1.34 clause ( 24) 2796 2081 715 1 16.8 K
% 0.95/1.34 list ( 12) 387 331 56 3 0.7 K
% 0.95/1.34 list_pos ( 20) 2642 421 2221 25 43.9 K
% 0.95/1.34 pair_index ( 40) 2 0 2 0 0.1 K
% 0.95/1.34
% 0.95/1.34 -------------- statistics -------------
% 0.95/1.34 Clauses input 2
% 0.95/1.34 Usable input 0
% 0.95/1.34 Sos input 2
% 0.95/1.34 Demodulators input 0
% 0.95/1.34 Passive input 0
% 0.95/1.34
% 0.95/1.34 Processed BS (before search) 2
% 0.95/1.34 Forward subsumed BS 0
% 0.95/1.34 Kept BS 2
% 0.95/1.34 New demodulators BS 1
% 0.95/1.34 Back demodulated BS 0
% 0.95/1.34
% 0.95/1.34 Clauses or pairs given 859
% 0.95/1.34 Clauses generated 1527
% 0.95/1.34 Forward subsumed 814
% 0.95/1.34 Deleted by weight 0
% 0.95/1.34 Deleted by variable count 0
% 0.95/1.34 Kept 713
% 0.95/1.34 New demodulators 327
% 0.95/1.34 Back demodulated 85
% 0.95/1.34 Ordered paramod prunes 0
% 0.95/1.34 Basic paramod prunes 14138
% 0.95/1.34 Prime paramod prunes 23
% 0.95/1.34 Semantic prunes 0
% 0.95/1.34
% 0.95/1.34 Rewrite attmepts 85375
% 0.95/1.34 Rewrites 570
% 0.95/1.34
% 0.95/1.34 FPA overloads 0
% 0.95/1.34 FPA underloads 0
% 0.95/1.34
% 0.95/1.34 Usable size 0
% 0.95/1.34 Sos size 629
% 0.95/1.34 Demodulators size 249
% 0.95/1.34 Passive size 0
% 0.95/1.34 Disabled size 85
% 0.95/1.34
% 0.95/1.34 Proofs found 1
% 0.95/1.34
% 0.95/1.34 ----------- times (seconds) ----------- Tue Jun 14 06:05:55 2022
% 0.95/1.34
% 0.95/1.34 user CPU time 0.21 (0 hr, 0 min, 0 sec)
% 0.95/1.34 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.95/1.34 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.95/1.34 input time 0.00
% 0.95/1.34 paramodulation time 0.03
% 0.95/1.34 demodulation time 0.04
% 0.95/1.34 orient time 0.01
% 0.95/1.34 weigh time 0.00
% 0.95/1.34 forward subsume time 0.01
% 0.95/1.34 back demod find time 0.01
% 0.95/1.34 conflict time 0.00
% 0.95/1.34 LRPO time 0.01
% 0.95/1.34 store clause time 0.10
% 0.95/1.34 disable clause time 0.00
% 0.95/1.34 prime paramod time 0.02
% 0.95/1.34 semantics time 0.00
% 0.95/1.34
% 0.95/1.34 EQP interrupted
%------------------------------------------------------------------------------