TSTP Solution File: GRP115-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP115-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:42 EDT 2022
% Result : Unsatisfiable 0.73s 1.11s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 2 RR)
% Number of literals : 16 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))),B),
file('GRP115-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(a,multiply(a,a)),identity),
file('GRP115-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,multiply(multiply(A,multiply(B,C)),multiply(identity,multiply(C,C)))),multiply(multiply(A,multiply(multiply(A,B),D)),multiply(identity,multiply(D,D)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(multiply(A,multiply(multiply(A,multiply(multiply(A,B),multiply(identity,multiply(multiply(identity,C),multiply(identity,C))))),C)),B),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(14,plain,
equal(multiply(multiply(A,multiply(multiply(A,multiply(A,B)),C)),multiply(identity,multiply(C,C))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(20,plain,
equal(multiply(multiply(A,B),multiply(identity,C)),multiply(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,8]),1]),
[iquote('para(1,8),flip(1)')] ).
cnf(26,plain,
equal(multiply(A,multiply(multiply(multiply(A,multiply(A,B)),C),multiply(C,C))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),20]),
[iquote('back_demod(14),demod([20])')] ).
cnf(32,plain,
equal(multiply(A,multiply(multiply(A,multiply(A,multiply(B,multiply(identity,multiply(C,C))))),C)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),20,20]),
[iquote('back_demod(8),demod([20,20])')] ).
cnf(42,plain,
equal(multiply(A,multiply(A,multiply(multiply(A,B),identity))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,26]),20]),
[iquote('para(20,26),demod([20])')] ).
cnf(48,plain,
equal(multiply(A,multiply(multiply(A,B),identity)),multiply(A,multiply(A,multiply(B,identity)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,42]),1]),
[iquote('para(42,42),flip(1)')] ).
cnf(49,plain,
equal(multiply(A,multiply(A,multiply(A,multiply(B,identity)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),48]),
[iquote('back_demod(42),demod([48])')] ).
cnf(76,plain,
equal(multiply(A,multiply(multiply(A,multiply(A,multiply(B,multiply(C,multiply(D,D))))),D)),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[20,32]),
[iquote('para(20,32)')] ).
cnf(77,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),76]),
[iquote('back_demod(32),demod([76])')] ).
cnf(128,plain,
equal(multiply(A,multiply(A,multiply(A,B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[49]),77]),
[iquote('back_demod(49),demod([77])')] ).
cnf(137,plain,
equal(multiply(A,multiply(A,A)),identity),
inference(para,[status(thm),theory(equality)],[77,128]),
[iquote('para(77,128)')] ).
cnf(138,plain,
$false,
inference(conflict,[status(thm)],[137,2]),
[iquote('conflict(137,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP115-1 : TPTP v8.1.0. Released v1.2.0.
% 0.10/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 09:38:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.11 ----- EQP 0.9e, May 2009 -----
% 0.73/1.11 The job began on n014.cluster.edu, Mon Jun 13 09:38:53 2022
% 0.73/1.11 The command was "./eqp09e".
% 0.73/1.11
% 0.73/1.11 set(prolog_style_variables).
% 0.73/1.11 set(lrpo).
% 0.73/1.11 set(basic_paramod).
% 0.73/1.11 set(functional_subsume).
% 0.73/1.11 set(ordered_paramod).
% 0.73/1.11 set(prime_paramod).
% 0.73/1.11 set(para_pairs).
% 0.73/1.11 assign(pick_given_ratio,4).
% 0.73/1.11 clear(print_kept).
% 0.73/1.11 clear(print_new_demod).
% 0.73/1.11 clear(print_back_demod).
% 0.73/1.11 clear(print_given).
% 0.73/1.11 assign(max_mem,64000).
% 0.73/1.11 end_of_commands.
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 0 (wt=-1) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.73/1.11 0 (wt=-1) [] -(multiply(a,multiply(a,a)) = identity).
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Starting to process input.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.73/1.11 1 is a new demodulator.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 2 (wt=7) [] -(multiply(a,multiply(a,a)) = identity).
% 0.73/1.11 ---------------- PROOF FOUND ----------------
% 0.73/1.11 % SZS status Unsatisfiable
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 After processing input:
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 2 (wt=7) [] -(multiply(a,multiply(a,a)) = identity).
% 0.73/1.11 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 UNIT CONFLICT from 137 and 2 at 0.03 seconds.
% 0.73/1.11
% 0.73/1.11 ---------------- PROOF ----------------
% 0.73/1.11 % SZS output start Refutation
% See solution above
% 0.73/1.11 ------------ end of proof -------------
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 ------------- memory usage ------------
% 0.73/1.11 Memory dynamically allocated (tp_alloc): 976.
% 0.73/1.11 type (bytes each) gets frees in use avail bytes
% 0.73/1.11 sym_ent ( 96) 54 0 54 0 5.1 K
% 0.73/1.11 term ( 16) 68117 62126 5991 48 117.4 K
% 0.73/1.11 gen_ptr ( 8) 50834 10591 40243 20 314.6 K
% 0.73/1.11 context ( 808) 9668 9666 2 33 27.6 K
% 0.73/1.11 trail ( 12) 13515 13515 0 6 0.1 K
% 0.73/1.11 bt_node ( 68) 838 835 3 24 1.8 K
% 0.73/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_free_vars_pos (4020)
% 0.73/1.11 0 0 0 0 0.0 K
% 0.73/1.11 discrim ( 12) 8347 7783 564 2167 32.0 K
% 0.73/1.11 flat ( 40) 91148 91148 0 155 6.1 K
% 0.73/1.11 discrim_pos ( 12) 762 762 0 1 0.0 K
% 0.73/1.11 fpa_head ( 12) 688 0 688 0 8.1 K
% 0.73/1.11 fpa_tree ( 28) 781 781 0 25 0.7 K
% 0.73/1.11 fpa_pos ( 36) 248 248 0 1 0.0 K
% 0.73/1.11 literal ( 12) 392 255 137 1 1.6 K
% 0.73/1.11 clause ( 24) 392 255 137 1 3.2 K
% 0.73/1.11 list ( 12) 170 114 56 5 0.7 K
% 0.73/1.11 list_pos ( 20) 774 591 183 20 4.0 K
% 0.73/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.11
% 0.73/1.11 -------------- statistics -------------
% 0.73/1.11 Clauses input 2
% 0.73/1.11 Usable input 0
% 0.73/1.11 Sos input 2
% 0.73/1.11 Demodulators input 0
% 0.73/1.11 Passive input 0
% 0.73/1.11
% 0.73/1.11 Processed BS (before search) 2
% 0.73/1.11 Forward subsumed BS 0
% 0.73/1.11 Kept BS 2
% 0.73/1.11 New demodulators BS 1
% 0.73/1.11 Back demodulated BS 0
% 0.73/1.11
% 0.73/1.11 Clauses or pairs given 38
% 0.73/1.11 Clauses generated 195
% 0.73/1.11 Forward subsumed 60
% 0.73/1.11 Deleted by weight 0
% 0.73/1.11 Deleted by variable count 0
% 0.73/1.11 Kept 135
% 0.73/1.11 New demodulators 110
% 0.73/1.11 Back demodulated 120
% 0.73/1.11 Ordered paramod prunes 0
% 0.73/1.11 Basic paramod prunes 67
% 0.73/1.11 Prime paramod prunes 5
% 0.73/1.11 Semantic prunes 0
% 0.73/1.11
% 0.73/1.11 Rewrite attmepts 8330
% 0.73/1.11 Rewrites 733
% 0.73/1.11
% 0.73/1.11 FPA overloads 0
% 0.73/1.11 FPA underloads 0
% 0.73/1.11
% 0.73/1.11 Usable size 0
% 0.73/1.11 Sos size 16
% 0.73/1.11 Demodulators size 15
% 0.73/1.11 Passive size 0
% 0.73/1.11 Disabled size 120
% 0.73/1.11
% 0.73/1.11 Proofs found 1
% 0.73/1.11
% 0.73/1.11 ----------- times (seconds) ----------- Mon Jun 13 09:38:53 2022
% 0.73/1.11
% 0.73/1.11 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.73/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.11 input time 0.00
% 0.73/1.11 paramodulation time 0.00
% 0.73/1.11 demodulation time 0.01
% 0.73/1.11 orient time 0.00
% 0.73/1.11 weigh time 0.00
% 0.73/1.11 forward subsume time 0.00
% 0.73/1.11 back demod find time 0.01
% 0.73/1.11 conflict time 0.00
% 0.73/1.11 LRPO time 0.00
% 0.73/1.11 store clause time 0.00
% 0.73/1.11 disable clause time 0.00
% 0.73/1.11 prime paramod time 0.00
% 0.73/1.11 semantics time 0.00
% 0.73/1.11
% 0.73/1.11 EQP interrupted
%------------------------------------------------------------------------------