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