TSTP Solution File: GRP010-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP010-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:11 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 5 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP010-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(identity,A),A),
file('GRP010-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(inverse(A),A),identity),
file('GRP010-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(c,b),identity),
file('GRP010-4.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(b,c),identity),
file('GRP010-4.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(c,multiply(b,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),2]),1]),
[iquote('para(4,1),demod([2]),flip(1)')] ).
cnf(7,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(11,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[3,7]),
[iquote('para(3,7)')] ).
cnf(12,plain,
equal(multiply(inverse(c),A),multiply(b,A)),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(14,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[7,7]),
[iquote('para(7,7)')] ).
cnf(15,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),14]),
[iquote('back_demod(11),demod([14])')] ).
cnf(20,plain,
equal(inverse(c),b),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,15]),15]),1]),
[iquote('para(12,15),demod([15]),flip(1)')] ).
cnf(22,plain,
equal(multiply(b,c),identity),
inference(para,[status(thm),theory(equality)],[20,3]),
[iquote('para(20,3)')] ).
cnf(23,plain,
$false,
inference(conflict,[status(thm)],[22,5]),
[iquote('conflict(22,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP010-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 06:31:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/1.10 ----- EQP 0.9e, May 2009 -----
% 0.71/1.10 The job began on n009.cluster.edu, Mon Jun 13 06:31:08 2022
% 0.71/1.10 The command was "./eqp09e".
% 0.71/1.10
% 0.71/1.10 set(prolog_style_variables).
% 0.71/1.10 set(lrpo).
% 0.71/1.10 set(basic_paramod).
% 0.71/1.10 set(functional_subsume).
% 0.71/1.10 set(ordered_paramod).
% 0.71/1.10 set(prime_paramod).
% 0.71/1.10 set(para_pairs).
% 0.71/1.10 assign(pick_given_ratio,4).
% 0.71/1.10 clear(print_kept).
% 0.71/1.10 clear(print_new_demod).
% 0.71/1.10 clear(print_back_demod).
% 0.71/1.10 clear(print_given).
% 0.71/1.10 assign(max_mem,64000).
% 0.71/1.10 end_of_commands.
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.10 0 (wt=-1) [] multiply(identity,A) = A.
% 0.71/1.10 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.71/1.10 0 (wt=-1) [] multiply(c,b) = identity.
% 0.71/1.10 0 (wt=-1) [] -(multiply(b,c) = identity).
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Starting to process input.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.10 1 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 2 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.10 2 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.10 3 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 4 (wt=5) [] multiply(c,b) = identity.
% 0.71/1.10 4 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 5 (wt=5) [] -(multiply(b,c) = identity).
% 0.71/1.10 ---------------- PROOF FOUND ----------------
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 After processing input:
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 2 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.10 4 (wt=5) [] multiply(c,b) = identity.
% 0.71/1.10 5 (wt=5) [] -(multiply(b,c) = identity).
% 0.71/1.10 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.10 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.71/1.10 2 (wt=5) [] multiply(identity,A) = A.
% 0.71/1.10 3 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.71/1.10 4 (wt=5) [] multiply(c,b) = identity.
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 UNIT CONFLICT from 22 and 5 at 0.00 seconds.
% 0.71/1.10
% 0.71/1.10 ---------------- PROOF ----------------
% 0.71/1.10 % SZS output start Refutation
% See solution above
% 0.71/1.10 ------------ end of proof -------------
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 ------------- memory usage ------------
% 0.71/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.10 type (bytes each) gets frees in use avail bytes
% 0.71/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.10 term ( 16) 1074 910 164 13 3.4 K
% 0.71/1.10 gen_ptr ( 8) 798 261 537 13 4.3 K
% 0.71/1.10 context ( 808) 841 839 2 3 3.9 K
% 0.71/1.10 trail ( 12) 30 30 0 4 0.0 K
% 0.71/1.10 bt_node ( 68) 407 405 2 4 0.4 K
% 0.71/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_free_vars_pos (4020)
% 0.71/1.10 0 0 0 0 0.0 K
% 0.71/1.10 discrim ( 12) 163 23 140 2 1.7 K
% 0.71/1.10 flat ( 40) 841 841 0 14 0.5 K
% 0.71/1.10 discrim_pos ( 12) 37 37 0 1 0.0 K
% 0.71/1.10 fpa_head ( 12) 122 0 122 0 1.4 K
% 0.71/1.10 fpa_tree ( 28) 42 42 0 5 0.1 K
% 0.71/1.10 fpa_pos ( 36) 42 42 0 1 0.0 K
% 0.71/1.10 literal ( 12) 74 52 22 1 0.3 K
% 0.71/1.10 clause ( 24) 74 52 22 1 0.5 K
% 0.71/1.10 list ( 12) 79 23 56 3 0.7 K
% 0.71/1.10 list_pos ( 20) 98 30 68 0 1.3 K
% 0.71/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.10
% 0.71/1.10 -------------- statistics -------------
% 0.71/1.10 Clauses input 5
% 0.71/1.10 Usable input 0
% 0.71/1.10 Sos input 5
% 0.71/1.10 Demodulators input 0
% 0.71/1.10 Passive input 0
% 0.71/1.10
% 0.71/1.10 Processed BS (before search) 5
% 0.71/1.10 Forward subsumed BS 0
% 0.71/1.10 Kept BS 5
% 0.71/1.10 New demodulators BS 4
% 0.71/1.10 Back demodulated BS 0
% 0.71/1.10
% 0.71/1.10 Clauses or pairs given 78
% 0.71/1.10 Clauses generated 46
% 0.71/1.10 Forward subsumed 29
% 0.71/1.10 Deleted by weight 0
% 0.71/1.10 Deleted by variable count 0
% 0.71/1.10 Kept 17
% 0.71/1.10 New demodulators 16
% 0.71/1.10 Back demodulated 5
% 0.71/1.10 Ordered paramod prunes 0
% 0.71/1.10 Basic paramod prunes 109
% 0.71/1.10 Prime paramod prunes 0
% 0.71/1.10 Semantic prunes 0
% 0.71/1.10
% 0.71/1.10 Rewrite attmepts 281
% 0.71/1.10 Rewrites 37
% 0.71/1.10
% 0.71/1.10 FPA overloads 0
% 0.71/1.10 FPA underloads 0
% 0.71/1.10
% 0.71/1.10 Usable size 0
% 0.71/1.10 Sos size 16
% 0.71/1.10 Demodulators size 15
% 0.71/1.10 Passive size 0
% 0.71/1.10 Disabled size 5
% 0.71/1.10
% 0.71/1.10 Proofs found 1
% 0.71/1.10
% 0.71/1.10 ----------- times (seconds) ----------- Mon Jun 13 06:31:08 2022
% 0.71/1.10
% 0.71/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.71/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.71/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.10 input time 0.00
% 0.71/1.10 paramodulation time 0.00
% 0.71/1.10 demodulation time 0.00
% 0.71/1.10 orient time 0.00
% 0.71/1.10 weigh time 0.00
% 0.71/1.10 forward subsume time 0.00
% 0.71/1.10 back demod find time 0.00
% 0.71/1.10 conflict time 0.00
% 0.71/1.10 LRPO time 0.00
% 0.71/1.10 store clause time 0.00
% 0.71/1.10 disable clause time 0.00
% 0.71/1.10 prime paramod time 0.00
% 0.71/1.10 semantics time 0.00
% 0.71/1.10
% 0.71/1.10 EQP interrupted
%------------------------------------------------------------------------------