TSTP Solution File: GRP406-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP406-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:46:31 EDT 2022
% Result : Unsatisfiable 0.85s 1.28s
% Output : Refutation 0.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 1
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 3 RR)
% Number of literals : 25 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 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 : 89 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))),C),
file('GRP406-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(inverse(multiply(inverse(B),C)),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))),inverse(multiply(inverse(multiply(inverse(multiply(A,D)),B)),multiply(inverse(D),multiply(inverse(D),D))))))))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(4,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),D)),multiply(inverse(C),multiply(inverse(C),C)))),multiply(A,inverse(multiply(inverse(D),multiply(inverse(B),multiply(inverse(B),B)))))),
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(inverse(B),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,C)),D)),multiply(inverse(C),multiply(inverse(C),C))))),multiply(inverse(inverse(multiply(inverse(multiply(inverse(multiply(A,C)),D)),multiply(inverse(C),multiply(inverse(C),C))))),inverse(multiply(inverse(multiply(inverse(multiply(A,C)),D)),multiply(inverse(C),multiply(inverse(C),C))))))))),inverse(multiply(inverse(multiply(inverse(multiply(inverse(D),E)),B)),multiply(inverse(E),multiply(inverse(E),E))))),
inference(para,[status(thm),theory(equality)],[1,3]),
[iquote('para(1,3)')] ).
cnf(9,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),C)),inverse(multiply(multiply(A,inverse(multiply(inverse(D),multiply(inverse(B),multiply(inverse(B),B))))),multiply(inverse(D),multiply(inverse(D),D))))),multiply(inverse(C),multiply(inverse(C),C))),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(C),multiply(inverse(B),multiply(inverse(B),B)))))),C),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(16,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,multiply(C,inverse(multiply(inverse(D),multiply(inverse(E),multiply(inverse(E),E))))))),multiply(inverse(multiply(inverse(multiply(C,E)),B)),D)),
inference(para,[status(thm),theory(equality)],[4,11]),
[iquote('para(4,11)')] ).
cnf(20,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(inverse(multiply(D,E)),B)),multiply(inverse(multiply(D,E)),C))),
inference(para,[status(thm),theory(equality)],[1,16]),
[iquote('para(1,16)')] ).
cnf(21,plain,
equal(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(multiply(A,B)),D)),multiply(inverse(multiply(E,C)),multiply(E,D))),
inference(flip,[status(thm),theory(equality)],[20]),
[iquote('flip(20)')] ).
cnf(33,plain,
equal(multiply(inverse(multiply(A,B)),inverse(multiply(inverse(multiply(inverse(multiply(C,D)),multiply(C,E))),multiply(inverse(D),multiply(inverse(D),D))))),multiply(inverse(multiply(A,B)),E)),
inference(para,[status(thm),theory(equality)],[21,1]),
[iquote('para(21,1)')] ).
cnf(62,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),multiply(inverse(B),multiply(inverse(B),B)))),C),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,1]),1]),1]),
[iquote('para(33,1),demod([1]),flip(1)')] ).
cnf(71,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[62,11]),
[iquote('para(62,11)')] ).
cnf(163,plain,
equal(multiply(inverse(multiply(inverse(A),B)),multiply(inverse(A),inverse(multiply(inverse(multiply(inverse(C),multiply(inverse(C),C))),multiply(inverse(C),multiply(inverse(C),C)))))),multiply(inverse(B),multiply(inverse(B),B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,9]),1,4]),
[iquote('para(6,9),demod([1,4])')] ).
cnf(333,plain,
equal(multiply(inverse(multiply(inverse(A),B)),multiply(inverse(A),inverse(multiply(inverse(multiply(C,multiply(inverse(D),D))),multiply(C,multiply(inverse(D),D)))))),multiply(inverse(B),multiply(inverse(B),B))),
inference(para,[status(thm),theory(equality)],[71,163]),
[iquote('para(71,163)')] ).
cnf(339,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,inverse(multiply(inverse(multiply(C,multiply(inverse(D),D))),multiply(C,multiply(inverse(D),D)))))),multiply(inverse(B),multiply(inverse(B),B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[333,71]),1]),
[iquote('para(333,71),flip(1)')] ).
cnf(343,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(B),multiply(inverse(B),B))),multiply(inverse(B),multiply(inverse(B),B))))),multiply(A,inverse(multiply(inverse(multiply(C,multiply(inverse(D),D))),multiply(C,multiply(inverse(D),D)))))),
inference(para,[status(thm),theory(equality)],[339,1]),
[iquote('para(339,1)')] ).
cnf(615,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(B,multiply(inverse(C),C))),multiply(B,multiply(inverse(C),C))))),multiply(A,inverse(multiply(inverse(multiply(D,multiply(inverse(E),E))),multiply(D,multiply(inverse(E),E)))))),
inference(para,[status(thm),theory(equality)],[71,343]),
[iquote('para(71,343)')] ).
cnf(811,plain,
equal(inverse(multiply(inverse(multiply(A,multiply(inverse(B),B))),multiply(A,multiply(inverse(B),B)))),inverse(multiply(inverse(multiply(C,multiply(inverse(D),D))),multiply(C,multiply(inverse(D),D))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[615,1]),1]),
[iquote('para(615,1),demod([1])')] ).
cnf(828,plain,
equal(inverse(multiply(inverse(A),A)),inverse(multiply(inverse(multiply(B,multiply(inverse(C),C))),multiply(B,multiply(inverse(C),C))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,811]),11]),
[iquote('para(11,811),demod([11])')] ).
cnf(835,plain,
equal(multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(B,multiply(inverse(C),C))),multiply(B,multiply(inverse(C),C)))),multiply(inverse(D),multiply(inverse(D),D))))),multiply(A,D)),
inference(para,[status(thm),theory(equality)],[828,1]),
[iquote('para(828,1)')] ).
cnf(838,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,B)),multiply(inverse(C),C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[828,11]),835]),
[iquote('para(828,11),demod([835])')] ).
cnf(839,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,C)),multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[838]),
[iquote('flip(838)')] ).
cnf(842,plain,
~ equal(multiply(inverse(multiply(A,B)),multiply(A,B)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[839,2]),
[iquote('para(839,2)')] ).
cnf(843,plain,
$false,
inference(conflict,[status(thm)],[842,838]),
[iquote('conflict(842,838)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP406-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/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 : Tue Jun 14 01:43:04 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.85/1.28 ----- EQP 0.9e, May 2009 -----
% 0.85/1.28 The job began on n011.cluster.edu, Tue Jun 14 01:43:05 2022
% 0.85/1.28 The command was "./eqp09e".
% 0.85/1.28
% 0.85/1.28 set(prolog_style_variables).
% 0.85/1.28 set(lrpo).
% 0.85/1.28 set(basic_paramod).
% 0.85/1.28 set(functional_subsume).
% 0.85/1.28 set(ordered_paramod).
% 0.85/1.28 set(prime_paramod).
% 0.85/1.28 set(para_pairs).
% 0.85/1.28 assign(pick_given_ratio,4).
% 0.85/1.28 clear(print_kept).
% 0.85/1.28 clear(print_new_demod).
% 0.85/1.28 clear(print_back_demod).
% 0.85/1.28 clear(print_given).
% 0.85/1.28 assign(max_mem,64000).
% 0.85/1.28 end_of_commands.
% 0.85/1.28
% 0.85/1.28 Usable:
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Sos:
% 0.85/1.28 0 (wt=-1) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))) = C.
% 0.85/1.28 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Demodulators:
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Passive:
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Starting to process input.
% 0.85/1.28
% 0.85/1.28 ** KEPT: 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))) = C.
% 0.85/1.28 1 is a new demodulator.
% 0.85/1.28
% 0.85/1.28 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.85/1.28 ---------------- PROOF FOUND ----------------
% 0.85/1.28 % SZS status Unsatisfiable
% 0.85/1.28
% 0.85/1.28
% 0.85/1.28 After processing input:
% 0.85/1.28
% 0.85/1.28 Usable:
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Sos:
% 0.85/1.28 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.85/1.28 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))) = C.
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Demodulators:
% 0.85/1.28 1 (wt=20) [] multiply(A,inverse(multiply(inverse(multiply(inverse(multiply(A,B)),C)),multiply(inverse(B),multiply(inverse(B),B))))) = C.
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 Passive:
% 0.85/1.28 end_of_list.
% 0.85/1.28
% 0.85/1.28 UNIT CONFLICT from 842 and 838 at 0.19 seconds.
% 0.85/1.28
% 0.85/1.28 ---------------- PROOF ----------------
% 0.85/1.28 % SZS output start Refutation
% See solution above
% 0.85/1.28 ------------ end of proof -------------
% 0.85/1.28
% 0.85/1.28
% 0.85/1.28 ------------- memory usage ------------
% 0.85/1.28 Memory dynamically allocated (tp_alloc): 7324.
% 0.85/1.28 type (bytes each) gets frees in use avail bytes
% 0.85/1.28 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.85/1.28 term ( 16) 168251 92058 76193 103 1486.9 K
% 0.85/1.28 gen_ptr ( 8) 585542 17414 568128 72 4439.1 K
% 0.85/1.28 context ( 808) 116094 116092 2 3 3.9 K
% 0.85/1.28 trail ( 12) 7426 7426 0 11 0.1 K
% 0.85/1.28 bt_node ( 68) 23417 23413 4 186 12.6 K
% 0.85/1.28 ac_position (285432) 0 0 0 0 0.0 K
% 0.85/1.28 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.85/1.28 ac_match_free_vars_pos (4020)
% 0.85/1.28 0 0 0 0 0.0 K
% 0.85/1.28 discrim ( 12) 84217 9450 74767 569 882.8 K
% 0.85/1.28 flat ( 40) 690655 690655 0 385 15.0 K
% 0.85/1.28 discrim_pos ( 12) 1188 1188 0 1 0.0 K
% 0.85/1.28 fpa_head ( 12) 3983 0 3983 0 46.7 K
% 0.85/1.28 fpa_tree ( 28) 5785 5785 0 29 0.8 K
% 0.85/1.28 fpa_pos ( 36) 1240 1240 0 1 0.0 K
% 0.85/1.28 literal ( 12) 3020 2178 842 0 9.9 K
% 0.85/1.28 clause ( 24) 3020 2178 842 0 19.7 K
% 0.85/1.28 list ( 12) 457 401 56 3 0.7 K
% 0.85/1.28 list_pos ( 20) 3105 449 2656 4 52.0 K
% 0.85/1.28 pair_index ( 40) 2 0 2 0 0.1 K
% 0.85/1.28
% 0.85/1.28 -------------- statistics -------------
% 0.85/1.28 Clauses input 2
% 0.85/1.28 Usable input 0
% 0.85/1.28 Sos input 2
% 0.85/1.28 Demodulators input 0
% 0.85/1.28 Passive input 0
% 0.85/1.28
% 0.85/1.28 Processed BS (before search) 2
% 0.85/1.28 Forward subsumed BS 0
% 0.85/1.28 Kept BS 2
% 0.85/1.28 New demodulators BS 1
% 0.85/1.28 Back demodulated BS 0
% 0.85/1.28
% 0.85/1.28 Clauses or pairs given 876
% 0.85/1.28 Clauses generated 1633
% 0.85/1.28 Forward subsumed 793
% 0.85/1.28 Deleted by weight 0
% 0.85/1.28 Deleted by variable count 0
% 0.85/1.28 Kept 840
% 0.85/1.28 New demodulators 397
% 0.85/1.28 Back demodulated 91
% 0.85/1.28 Ordered paramod prunes 0
% 0.85/1.28 Basic paramod prunes 13190
% 0.85/1.28 Prime paramod prunes 41
% 0.85/1.28 Semantic prunes 0
% 0.85/1.28
% 0.85/1.28 Rewrite attmepts 84798
% 0.85/1.28 Rewrites 718
% 0.85/1.28
% 0.85/1.28 FPA overloads 0
% 0.85/1.28 FPA underloads 0
% 0.85/1.28
% 0.85/1.28 Usable size 0
% 0.85/1.28 Sos size 750
% 0.85/1.28 Demodulators size 315
% 0.85/1.28 Passive size 0
% 0.85/1.28 Disabled size 91
% 0.85/1.28
% 0.85/1.28 Proofs found 1
% 0.85/1.28
% 0.85/1.28 ----------- times (seconds) ----------- Tue Jun 14 01:43:05 2022
% 0.85/1.28
% 0.85/1.28 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 0.85/1.28 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.85/1.28 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.85/1.28 input time 0.00
% 0.85/1.28 paramodulation time 0.01
% 0.85/1.28 demodulation time 0.04
% 0.85/1.28 orient time 0.01
% 0.85/1.28 weigh time 0.01
% 0.85/1.28 forward subsume time 0.00
% 0.85/1.28 back demod find time 0.01
% 0.85/1.28 conflict time 0.00
% 0.85/1.28 LRPO time 0.00
% 0.85/1.28 store clause time 0.08
% 0.85/1.28 disable clause time 0.00
% 0.85/1.28 prime paramod time 0.01
% 0.85/1.28 semantics time 0.00
% 0.85/1.28
% 0.85/1.28 EQP interrupted
%------------------------------------------------------------------------------