%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP011-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:44:12 EDT 2022
% Result : Unsatisfiable 0.47s 1.11s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 4 RR)
% Number of literals : 14 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP011-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(identity,A),A),
file('GRP011-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(inverse(A),A),identity),
file('GRP011-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(d,c),multiply(b,c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(d,b),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),2]),1]),
[iquote('para(3,1),demod([2]),flip(1)')] ).
cnf(7,plain,
equal(multiply(d,multiply(c,A)),multiply(b,multiply(c,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),1]),1]),
[iquote('para(4,1),demod([1]),flip(1)')] ).
cnf(10,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[3,6]),
[iquote('para(3,6)')] ).
cnf(12,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(13,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),12]),
[iquote('back_demod(10),demod([12])')] ).
cnf(15,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,12]),13]),
[iquote('para(13,12),demod([13])')] ).
cnf(17,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[15,3]),
[iquote('para(15,3)')] ).
cnf(34,plain,
equal(d,b),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,7]),13,17,13]),
[iquote('para(17,7),demod([13,17,13])')] ).
cnf(35,plain,
$false,
inference(conflict,[status(thm)],[34,5]),
[iquote('conflict(34,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP011-4 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 05:05:12 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.11 ----- EQP 0.9e, May 2009 -----
% 0.47/1.11 The job began on n021.cluster.edu, Tue Jun 14 05:05:13 2022
% 0.47/1.11 The command was "./eqp09e".
% 0.47/1.11
% 0.47/1.11 set(prolog_style_variables).
% 0.47/1.11 set(lrpo).
% 0.47/1.11 set(basic_paramod).
% 0.47/1.11 set(functional_subsume).
% 0.47/1.11 set(ordered_paramod).
% 0.47/1.11 set(prime_paramod).
% 0.47/1.11 set(para_pairs).
% 0.47/1.11 assign(pick_given_ratio,4).
% 0.47/1.11 clear(print_kept).
% 0.47/1.11 clear(print_new_demod).
% 0.47/1.11 clear(print_back_demod).
% 0.47/1.11 clear(print_given).
% 0.47/1.11 assign(max_mem,64000).
% 0.47/1.11 end_of_commands.
% 0.47/1.11
% 0.47/1.11 Usable:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Sos:
% 0.47/1.11 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.47/1.11 0 (wt=-1) [] multiply(identity,A) = A.
% 0.47/1.11 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.47/1.11 0 (wt=-1) [] multiply(b,c) = multiply(d,c).
% 0.47/1.11 0 (wt=-1) [] -(b = d).
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Demodulators:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Passive:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Starting to process input.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.47/1.11 1 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 2 (wt=5) [] multiply(identity,A) = A.
% 0.47/1.11 2 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.47/1.11 3 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 4 (wt=7) [flip(1)] multiply(d,c) = multiply(b,c).
% 0.47/1.11 4 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 5 (wt=3) [flip(1)] -(d = b).
% 0.47/1.11 ---------------- PROOF FOUND ----------------
% 0.47/1.11 % SZS status Unsatisfiable
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 After processing input:
% 0.47/1.11
% 0.47/1.11 Usable:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Sos:
% 0.47/1.11 5 (wt=3) [flip(1)] -(d = b).
% 0.47/1.11 2 (wt=5) [] multiply(identity,A) = A.
% 0.47/1.11 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.47/1.11 4 (wt=7) [flip(1)] multiply(d,c) = multiply(b,c).
% 0.47/1.11 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Demodulators:
% 0.47/1.11 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.47/1.11 2 (wt=5) [] multiply(identity,A) = A.
% 0.47/1.11 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.47/1.11 4 (wt=7) [flip(1)] multiply(d,c) = multiply(b,c).
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Passive:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 UNIT CONFLICT from 34 and 5 at 0.00 seconds.
% 0.47/1.11
% 0.47/1.11 ---------------- PROOF ----------------
% 0.47/1.11 % SZS output start Refutation
% See solution above
% 0.47/1.11 ------------ end of proof -------------
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 ------------- memory usage ------------
% 0.47/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.47/1.11 type (bytes each) gets frees in use avail bytes
% 0.47/1.11 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.47/1.11 term ( 16) 2361 2055 306 18 6.2 K
% 0.47/1.11 gen_ptr ( 8) 1745 670 1075 14 8.5 K
% 0.47/1.11 context ( 808) 2355 2353 2 3 3.9 K
% 0.47/1.11 trail ( 12) 65 65 0 4 0.0 K
% 0.47/1.11 bt_node ( 68) 1199 1196 3 7 0.7 K
% 0.47/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.47/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.47/1.11 ac_match_free_vars_pos (4020)
% 0.47/1.11 0 0 0 0 0.0 K
% 0.47/1.11 discrim ( 12) 299 76 223 34 3.0 K
% 0.47/1.11 flat ( 40) 2772 2772 0 14 0.5 K
% 0.47/1.11 discrim_pos ( 12) 142 142 0 1 0.0 K
% 0.47/1.11 fpa_head ( 12) 194 0 194 0 2.3 K
% 0.47/1.11 fpa_tree ( 28) 85 85 0 7 0.2 K
% 0.47/1.11 fpa_pos ( 36) 66 66 0 1 0.0 K
% 0.47/1.11 literal ( 12) 142 108 34 1 0.4 K
% 0.47/1.11 clause ( 24) 142 108 34 1 0.8 K
% 0.47/1.11 list ( 12) 91 35 56 3 0.7 K
% 0.47/1.11 list_pos ( 20) 156 55 101 16 2.3 K
% 0.47/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.47/1.11
% 0.47/1.11 -------------- statistics -------------
% 0.47/1.11 Clauses input 5
% 0.47/1.11 Usable input 0
% 0.47/1.11 Sos input 5
% 0.47/1.11 Demodulators input 0
% 0.47/1.11 Passive input 0
% 0.47/1.11
% 0.47/1.11 Processed BS (before search) 5
% 0.47/1.11 Forward subsumed BS 0
% 0.47/1.11 Kept BS 5
% 0.47/1.11 New demodulators BS 4
% 0.47/1.11 Back demodulated BS 0
% 0.47/1.11
% 0.47/1.11 Clauses or pairs given 210
% 0.47/1.11 Clauses generated 101
% 0.47/1.11 Forward subsumed 72
% 0.47/1.11 Deleted by weight 0
% 0.47/1.11 Deleted by variable count 0
% 0.47/1.11 Kept 29
% 0.47/1.11 New demodulators 28
% 0.47/1.11 Back demodulated 10
% 0.47/1.11 Ordered paramod prunes 0
% 0.47/1.11 Basic paramod prunes 477
% 0.47/1.11 Prime paramod prunes 11
% 0.47/1.11 Semantic prunes 0
% 0.47/1.11
% 0.47/1.11 Rewrite attmepts 819
% 0.47/1.11 Rewrites 131
% 0.47/1.11
% 0.47/1.11 FPA overloads 0
% 0.47/1.11 FPA underloads 0
% 0.47/1.11
% 0.47/1.11 Usable size 0
% 0.47/1.11 Sos size 23
% 0.47/1.11 Demodulators size 22
% 0.47/1.11 Passive size 0
% 0.47/1.11 Disabled size 10
% 0.47/1.11
% 0.47/1.11 Proofs found 1
% 0.47/1.11
% 0.47/1.11 ----------- times (seconds) ----------- Tue Jun 14 05:05:13 2022
% 0.47/1.11
% 0.47/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.47/1.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.47/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.47/1.11 input time 0.00
% 0.47/1.11 paramodulation time 0.00
% 0.47/1.11 demodulation time 0.00
% 0.47/1.11 orient time 0.00
% 0.47/1.11 weigh time 0.00
% 0.47/1.11 forward subsume time 0.00
% 0.47/1.11 back demod find time 0.00
% 0.47/1.11 conflict time 0.00
% 0.47/1.11 LRPO time 0.00
% 0.47/1.11 store clause time 0.00
% 0.47/1.11 disable clause time 0.00
% 0.47/1.11 prime paramod time 0.00
% 0.47/1.11 semantics time 0.00
% 0.47/1.11
% 0.47/1.11 EQP interrupted
%------------------------------------------------------------------------------