TSTP Solution File: GRP001-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:07 EDT 2022
% Result : Unsatisfiable 0.76s 1.15s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP001-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP001-2.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(A,identity),A),
file('GRP001-2.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(A,A),identity),
file('GRP001-2.p',unknown),
[] ).
cnf(7,plain,
equal(multiply(a,b),c),
file('GRP001-2.p',unknown),
[] ).
cnf(8,plain,
~ equal(multiply(b,a),c),
file('GRP001-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,3]),1]),1]),
[iquote('para(6,3),demod([1]),flip(1)')] ).
cnf(14,plain,
equal(multiply(A,multiply(B,multiply(A,B))),identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,3]),1]),
[iquote('para(6,3),flip(1)')] ).
cnf(22,plain,
equal(multiply(A,multiply(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,13]),4]),1]),
[iquote('para(14,13),demod([4]),flip(1)')] ).
cnf(23,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[22,13]),
[iquote('para(22,13)')] ).
cnf(25,plain,
equal(multiply(b,a),c),
inference(para,[status(thm),theory(equality)],[23,7]),
[iquote('para(23,7)')] ).
cnf(26,plain,
$false,
inference(conflict,[status(thm)],[25,8]),
[iquote('conflict(25,8)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 18:41:39 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.76/1.15 ----- EQP 0.9e, May 2009 -----
% 0.76/1.15 The job began on n025.cluster.edu, Mon Jun 13 18:41:40 2022
% 0.76/1.15 The command was "./eqp09e".
% 0.76/1.15
% 0.76/1.15 set(prolog_style_variables).
% 0.76/1.15 set(lrpo).
% 0.76/1.15 set(basic_paramod).
% 0.76/1.15 set(functional_subsume).
% 0.76/1.15 set(ordered_paramod).
% 0.76/1.15 set(prime_paramod).
% 0.76/1.15 set(para_pairs).
% 0.76/1.15 assign(pick_given_ratio,4).
% 0.76/1.15 clear(print_kept).
% 0.76/1.15 clear(print_new_demod).
% 0.76/1.15 clear(print_back_demod).
% 0.76/1.15 clear(print_given).
% 0.76/1.15 assign(max_mem,64000).
% 0.76/1.15 end_of_commands.
% 0.76/1.15
% 0.76/1.15 Usable:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Sos:
% 0.76/1.15 0 (wt=-1) [] multiply(identity,A) = A.
% 0.76/1.15 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.76/1.15 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.15 0 (wt=-1) [] multiply(A,identity) = A.
% 0.76/1.15 0 (wt=-1) [] multiply(A,inverse(A)) = identity.
% 0.76/1.15 0 (wt=-1) [] multiply(A,A) = identity.
% 0.76/1.15 0 (wt=-1) [] multiply(a,b) = c.
% 0.76/1.15 0 (wt=-1) [] -(multiply(b,a) = c).
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Demodulators:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Passive:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Starting to process input.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.76/1.15 1 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.76/1.15 2 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.15 3 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 4 (wt=5) [] multiply(A,identity) = A.
% 0.76/1.15 4 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.76/1.15 5 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 6 (wt=5) [] multiply(A,A) = identity.
% 0.76/1.15 6 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 7 (wt=5) [] multiply(a,b) = c.
% 0.76/1.15 7 is a new demodulator.
% 0.76/1.15
% 0.76/1.15 ** KEPT: 8 (wt=5) [] -(multiply(b,a) = c).
% 0.76/1.15 ---------------- PROOF FOUND ----------------
% 0.76/1.15 % SZS status Unsatisfiable
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 After processing input:
% 0.76/1.15
% 0.76/1.15 Usable:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Sos:
% 0.76/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.76/1.15 4 (wt=5) [] multiply(A,identity) = A.
% 0.76/1.15 6 (wt=5) [] multiply(A,A) = identity.
% 0.76/1.15 7 (wt=5) [] multiply(a,b) = c.
% 0.76/1.15 8 (wt=5) [] -(multiply(b,a) = c).
% 0.76/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.76/1.15 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.76/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Demodulators:
% 0.76/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.76/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.76/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.76/1.15 4 (wt=5) [] multiply(A,identity) = A.
% 0.76/1.15 5 (wt=6) [] multiply(A,inverse(A)) = identity.
% 0.76/1.15 6 (wt=5) [] multiply(A,A) = identity.
% 0.76/1.15 7 (wt=5) [] multiply(a,b) = c.
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 Passive:
% 0.76/1.15 end_of_list.
% 0.76/1.15
% 0.76/1.15 UNIT CONFLICT from 25 and 8 at 0.00 seconds.
% 0.76/1.15
% 0.76/1.15 ---------------- PROOF ----------------
% 0.76/1.15 % SZS output start Refutation
% See solution above
% 0.76/1.15 ------------ end of proof -------------
% 0.76/1.15
% 0.76/1.15
% 0.76/1.15 ------------- memory usage ------------
% 0.76/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.76/1.15 type (bytes each) gets frees in use avail bytes
% 0.76/1.15 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.76/1.15 term ( 16) 1483 1300 183 13 3.7 K
% 0.76/1.15 gen_ptr ( 8) 1048 472 576 11 4.6 K
% 0.76/1.15 context ( 808) 1141 1139 2 3 3.9 K
% 0.76/1.15 trail ( 12) 77 77 0 3 0.0 K
% 0.76/1.15 bt_node ( 68) 520 517 3 2 0.3 K
% 0.76/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.15 ac_match_free_vars_pos (4020)
% 0.76/1.15 0 0 0 0 0.0 K
% 0.76/1.15 discrim ( 12) 169 63 106 29 1.6 K
% 0.76/1.15 flat ( 40) 1193 1193 0 10 0.4 K
% 0.76/1.15 discrim_pos ( 12) 72 72 0 1 0.0 K
% 0.76/1.15 fpa_head ( 12) 118 0 118 0 1.4 K
% 0.76/1.15 fpa_tree ( 28) 47 47 0 7 0.2 K
% 0.76/1.15 fpa_pos ( 36) 47 47 0 1 0.0 K
% 0.76/1.15 literal ( 12) 104 79 25 1 0.3 K
% 0.76/1.15 clause ( 24) 104 79 25 1 0.6 K
% 0.76/1.15 list ( 12) 81 25 56 3 0.7 K
% 0.76/1.15 list_pos ( 20) 120 53 67 16 1.6 K
% 0.76/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.15
% 0.76/1.15 -------------- statistics -------------
% 0.76/1.15 Clauses input 8
% 0.76/1.15 Usable input 0
% 0.76/1.15 Sos input 8
% 0.76/1.15 Demodulators input 0
% 0.76/1.15 Passive input 0
% 0.76/1.15
% 0.76/1.15 Processed BS (before search) 8
% 0.76/1.15 Forward subsumed BS 0
% 0.76/1.15 Kept BS 8
% 0.76/1.15 New demodulators BS 7
% 0.76/1.15 Back demodulated BS 0
% 0.76/1.15
% 0.76/1.15 Clauses or pairs given 117
% 0.76/1.15 Clauses generated 71
% 0.76/1.15 Forward subsumed 54
% 0.76/1.15 Deleted by weight 0
% 0.76/1.15 Deleted by variable count 0
% 0.76/1.15 Kept 17
% 0.76/1.15 New demodulators 15
% 0.76/1.15 Back demodulated 9
% 0.76/1.15 Ordered paramod prunes 0
% 0.76/1.15 Basic paramod prunes 73
% 0.76/1.15 Prime paramod prunes 8
% 0.76/1.15 Semantic prunes 0
% 0.76/1.15
% 0.76/1.15 Rewrite attmepts 380
% 0.76/1.15 Rewrites 63
% 0.76/1.15
% 0.76/1.15 FPA overloads 0
% 0.76/1.15 FPA underloads 0
% 0.76/1.15
% 0.76/1.15 Usable size 0
% 0.76/1.15 Sos size 15
% 0.76/1.15 Demodulators size 13
% 0.76/1.15 Passive size 0
% 0.76/1.15 Disabled size 9
% 0.76/1.15
% 0.76/1.15 Proofs found 1
% 0.76/1.15
% 0.76/1.15 ----------- times (seconds) ----------- Mon Jun 13 18:41:40 2022
% 0.76/1.15
% 0.76/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.76/1.15 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.76/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.15 input time 0.00
% 0.76/1.15 paramodulation time 0.00
% 0.76/1.15 demodulation time 0.00
% 0.76/1.15 orient time 0.00
% 0.76/1.15 weigh time 0.00
% 0.76/1.15 forward subsume time 0.00
% 0.76/1.15 back demod find time 0.00
% 0.76/1.15 conflict time 0.00
% 0.76/1.15 LRPO time 0.00
% 0.76/1.15 store clause time 0.00
% 0.76/1.15 disable clause time 0.00
% 0.76/1.15 prime paramod time 0.00
% 0.76/1.15 semantics time 0.00
% 0.76/1.15
% 0.76/1.15 EQP interrupted
%------------------------------------------------------------------------------