%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP418-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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:45 EDT 2022
% Result : Unsatisfiable 0.75s 1.43s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 1
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 0 equ; 2 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))),B),
file('GRP418-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(inverse(multiply(inverse(multiply(A,inverse(multiply(B,inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))),multiply(inverse(multiply(D,inverse(multiply(inverse(B),inverse(multiply(E,inverse(multiply(inverse(E),E)))))))),multiply(D,E))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(B)),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(12,plain,
equal(inverse(multiply(inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(B)),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),inverse(multiply(inverse(D),inverse(multiply(multiply(A,C),inverse(multiply(inverse(multiply(A,C)),multiply(A,C))))))))),B)),D),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(74,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),multiply(inverse(multiply(D,inverse(multiply(inverse(inverse(inverse(multiply(C,inverse(multiply(inverse(C),C)))))),inverse(multiply(E,inverse(multiply(inverse(E),E)))))))),inverse(multiply(inverse(B),inverse(multiply(multiply(D,E),inverse(multiply(inverse(multiply(D,E)),multiply(D,E))))))))),
inference(para,[status(thm),theory(equality)],[12,1]),
[iquote('para(12,1)')] ).
cnf(75,plain,
equal(multiply(inverse(multiply(A,inverse(multiply(inverse(inverse(inverse(multiply(B,inverse(multiply(inverse(B),B)))))),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),inverse(multiply(inverse(D),inverse(multiply(multiply(A,C),inverse(multiply(inverse(multiply(A,C)),multiply(A,C)))))))),inverse(multiply(inverse(multiply(E,D)),multiply(E,B)))),
inference(flip,[status(thm),theory(equality)],[74]),
[iquote('flip(74)')] ).
cnf(803,plain,
equal(inverse(multiply(inverse(inverse(multiply(inverse(multiply(A,B)),multiply(A,C)))),inverse(multiply(C,inverse(multiply(inverse(C),C)))))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[75,1]),9]),
[iquote('para(75,1),demod([9])')] ).
cnf(809,plain,
equal(inverse(multiply(inverse(multiply(A,B)),multiply(A,C))),inverse(multiply(inverse(multiply(D,B)),multiply(D,C)))),
inference(para,[status(thm),theory(equality)],[803,1]),
[iquote('para(803,1)')] ).
cnf(818,plain,
equal(multiply(inverse(multiply(A,B)),multiply(A,C)),multiply(inverse(multiply(D,B)),multiply(D,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[809,1]),1]),
[iquote('para(809,1),demod([1])')] ).
cnf(826,plain,
equal(multiply(A,multiply(inverse(multiply(B,inverse(multiply(inverse(A),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),D)),multiply(inverse(multiply(E,multiply(B,C))),multiply(E,D))),
inference(para,[status(thm),theory(equality)],[1,818]),
[iquote('para(1,818)')] ).
cnf(1087,plain,
equal(multiply(inverse(A),A),multiply(inverse(multiply(B,multiply(C,D))),multiply(B,multiply(C,D)))),
inference(para,[status(thm),theory(equality)],[9,826]),
[iquote('para(9,826)')] ).
cnf(1088,plain,
equal(multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))),multiply(inverse(D),D)),
inference(flip,[status(thm),theory(equality)],[1087]),
[iquote('flip(1087)')] ).
cnf(1089,plain,
~ equal(multiply(inverse(multiply(A,multiply(B,C))),multiply(A,multiply(B,C))),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[1087,2]),
[iquote('para(1087,2)')] ).
cnf(1090,plain,
$false,
inference(conflict,[status(thm)],[1089,1088]),
[iquote('conflict(1089,1088)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP418-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n016.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 : Tue Jun 14 08:50:31 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.75/1.43 ----- EQP 0.9e, May 2009 -----
% 0.75/1.43 The job began on n016.cluster.edu, Tue Jun 14 08:50:31 2022
% 0.75/1.43 The command was "./eqp09e".
% 0.75/1.43
% 0.75/1.43 set(prolog_style_variables).
% 0.75/1.43 set(lrpo).
% 0.75/1.43 set(basic_paramod).
% 0.75/1.43 set(functional_subsume).
% 0.75/1.43 set(ordered_paramod).
% 0.75/1.43 set(prime_paramod).
% 0.75/1.43 set(para_pairs).
% 0.75/1.43 assign(pick_given_ratio,4).
% 0.75/1.43 clear(print_kept).
% 0.75/1.43 clear(print_new_demod).
% 0.75/1.43 clear(print_back_demod).
% 0.75/1.43 clear(print_given).
% 0.75/1.43 assign(max_mem,64000).
% 0.75/1.43 end_of_commands.
% 0.75/1.43
% 0.75/1.43 Usable:
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Sos:
% 0.75/1.43 0 (wt=-1) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))) = B.
% 0.75/1.43 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Demodulators:
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Passive:
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Starting to process input.
% 0.75/1.43
% 0.75/1.43 ** KEPT: 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))) = B.
% 0.75/1.43 1 is a new demodulator.
% 0.75/1.43
% 0.75/1.43 ** KEPT: 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.43 ---------------- PROOF FOUND ----------------
% 0.75/1.43 % SZS status Unsatisfiable
% 0.75/1.43
% 0.75/1.43
% 0.75/1.43 After processing input:
% 0.75/1.43
% 0.75/1.43 Usable:
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Sos:
% 0.75/1.43 2 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.43 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))) = B.
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Demodulators:
% 0.75/1.43 1 (wt=22) [] inverse(multiply(inverse(multiply(A,inverse(multiply(inverse(B),inverse(multiply(C,inverse(multiply(inverse(C),C)))))))),multiply(A,C))) = B.
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 Passive:
% 0.75/1.43 end_of_list.
% 0.75/1.43
% 0.75/1.43 UNIT CONFLICT from 1089 and 1088 at 0.31 seconds.
% 0.75/1.43
% 0.75/1.43 ---------------- PROOF ----------------
% 0.75/1.43 % SZS output start Refutation
% See solution above
% 0.75/1.44 ------------ end of proof -------------
% 0.75/1.44
% 0.75/1.44
% 0.75/1.44 ------------- memory usage ------------
% 0.75/1.44 Memory dynamically allocated (tp_alloc): 18554.
% 0.75/1.44 type (bytes each) gets frees in use avail bytes
% 0.75/1.44 sym_ent ( 96) 55 0 55 0 5.2 K
% 0.75/1.44 term ( 16) 352903 158148 194755 486 3809.1 K
% 0.75/1.44 gen_ptr ( 8) 1579769 3551 1576218 14 12314.3 K
% 0.75/1.44 context ( 808) 256780 256778 2 2 3.2 K
% 0.75/1.44 trail ( 12) 10506 10506 0 15 0.2 K
% 0.75/1.44 bt_node ( 68) 40042 40038 4 228 15.4 K
% 0.75/1.44 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.44 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.44 ac_match_free_vars_pos (4020)
% 0.75/1.44 0 0 0 0 0.0 K
% 0.75/1.44 discrim ( 12) 176517 268 176249 0 2065.4 K
% 0.75/1.44 flat ( 40) 1358980 1358980 0 917 35.8 K
% 0.75/1.44 discrim_pos ( 12) 890 890 0 1 0.0 K
% 0.75/1.44 fpa_head ( 12) 2903 0 2903 0 34.0 K
% 0.75/1.44 fpa_tree ( 28) 3571 3571 0 21 0.6 K
% 0.75/1.44 fpa_pos ( 36) 1422 1422 0 1 0.0 K
% 0.75/1.44 literal ( 12) 3778 2689 1089 1 12.8 K
% 0.75/1.44 clause ( 24) 3778 2689 1089 1 25.5 K
% 0.75/1.44 list ( 12) 392 336 56 3 0.7 K
% 0.75/1.44 list_pos ( 20) 3615 42 3573 0 69.8 K
% 0.75/1.44 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.44
% 0.75/1.44 -------------- statistics -------------
% 0.75/1.44 Clauses input 2
% 0.75/1.44 Usable input 0
% 0.75/1.44 Sos input 2
% 0.75/1.44 Demodulators input 0
% 0.75/1.44 Passive input 0
% 0.75/1.44
% 0.75/1.44 Processed BS (before search) 2
% 0.75/1.44 Forward subsumed BS 0
% 0.75/1.44 Kept BS 2
% 0.75/1.44 New demodulators BS 1
% 0.75/1.44 Back demodulated BS 0
% 0.75/1.44
% 0.75/1.44 Clauses or pairs given 1517
% 0.75/1.44 Clauses generated 1922
% 0.75/1.44 Forward subsumed 835
% 0.75/1.44 Deleted by weight 0
% 0.75/1.44 Deleted by variable count 0
% 0.75/1.44 Kept 1087
% 0.75/1.44 New demodulators 332
% 0.75/1.44 Back demodulated 8
% 0.75/1.44 Ordered paramod prunes 0
% 0.75/1.44 Basic paramod prunes 26244
% 0.75/1.44 Prime paramod prunes 0
% 0.75/1.44 Semantic prunes 0
% 0.75/1.44
% 0.75/1.44 Rewrite attmepts 192481
% 0.75/1.44 Rewrites 278
% 0.75/1.44
% 0.75/1.44 FPA overloads 0
% 0.75/1.44 FPA underloads 0
% 0.75/1.44
% 0.75/1.44 Usable size 0
% 0.75/1.44 Sos size 1080
% 0.75/1.44 Demodulators size 325
% 0.75/1.44 Passive size 0
% 0.75/1.44 Disabled size 8
% 0.75/1.44
% 0.75/1.44 Proofs found 1
% 0.75/1.44
% 0.75/1.44 ----------- times (seconds) ----------- Tue Jun 14 08:50:32 2022
% 0.75/1.44
% 0.75/1.44 user CPU time 0.31 (0 hr, 0 min, 0 sec)
% 0.75/1.44 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.75/1.44 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.75/1.44 input time 0.00
% 0.75/1.44 paramodulation time 0.03
% 0.75/1.44 demodulation time 0.04
% 0.75/1.44 orient time 0.01
% 0.75/1.44 weigh time 0.00
% 0.75/1.44 forward subsume time 0.01
% 0.75/1.44 back demod find time 0.01
% 0.75/1.44 conflict time 0.00
% 0.75/1.44 LRPO time 0.00
% 0.75/1.44 store clause time 0.17
% 0.75/1.44 disable clause time 0.00
% 0.75/1.44 prime paramod time 0.01
% 0.75/1.44 semantics time 0.00
% 0.75/1.44
% 0.75/1.44 EQP interrupted
%------------------------------------------------------------------------------