TSTP Solution File: GRP117-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n004.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.74s 1.09s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% 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 : 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 : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))),B),
file('GRP117-1.p',unknown),
[] ).
cnf(2,plain,
~ equal(multiply(a,identity),a),
file('GRP117-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(4,plain,
equal(multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C))),multiply(A,multiply(multiply(A,multiply(B,D)),multiply(identity,multiply(D,D))))),
inference(flip,[status(thm),theory(equality)],[3]),
[iquote('flip(3)')] ).
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(28,plain,
equal(multiply(A,multiply(A,multiply(multiply(A,multiply(B,C)),multiply(identity,multiply(C,C))))),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(42,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(55,plain,
equal(multiply(A,multiply(A,multiply(A,multiply(multiply(B,C),multiply(C,C))))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),42]),
[iquote('back_demod(28),demod([42])')] ).
cnf(85,plain,
equal(multiply(A,multiply(A,multiply(A,multiply(B,multiply(multiply(C,D),multiply(D,D)))))),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,55]),42,42]),
[iquote('para(42,55),demod([42,42])')] ).
cnf(86,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[42,55]),42,85]),
[iquote('para(42,55),demod([42,85])')] ).
cnf(87,plain,
$false,
inference(conflict,[status(thm)],[86,2]),
[iquote('conflict(86,2)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP117-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n004.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 : Mon Jun 13 20:22:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.74/1.09 ----- EQP 0.9e, May 2009 -----
% 0.74/1.09 The job began on n004.cluster.edu, Mon Jun 13 20:22:39 2022
% 0.74/1.09 The command was "./eqp09e".
% 0.74/1.09
% 0.74/1.09 set(prolog_style_variables).
% 0.74/1.09 set(lrpo).
% 0.74/1.09 set(basic_paramod).
% 0.74/1.09 set(functional_subsume).
% 0.74/1.09 set(ordered_paramod).
% 0.74/1.09 set(prime_paramod).
% 0.74/1.09 set(para_pairs).
% 0.74/1.09 assign(pick_given_ratio,4).
% 0.74/1.09 clear(print_kept).
% 0.74/1.09 clear(print_new_demod).
% 0.74/1.09 clear(print_back_demod).
% 0.74/1.09 clear(print_given).
% 0.74/1.09 assign(max_mem,64000).
% 0.74/1.09 end_of_commands.
% 0.74/1.09
% 0.74/1.09 Usable:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Sos:
% 0.74/1.09 0 (wt=-1) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.74/1.09 0 (wt=-1) [] -(multiply(a,identity) = a).
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Demodulators:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Passive:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Starting to process input.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.74/1.09 1 is a new demodulator.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 2 (wt=5) [] -(multiply(a,identity) = a).
% 0.74/1.09 ---------------- PROOF FOUND ----------------
% 0.74/1.09 % SZS status Unsatisfiable
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 After processing input:
% 0.74/1.09
% 0.74/1.09 Usable:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Sos:
% 0.74/1.09 2 (wt=5) [] -(multiply(a,identity) = a).
% 0.74/1.09 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Demodulators:
% 0.74/1.09 1 (wt=17) [] multiply(A,multiply(multiply(A,multiply(multiply(A,B),C)),multiply(identity,multiply(C,C)))) = B.
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Passive:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 UNIT CONFLICT from 86 and 2 at 0.01 seconds.
% 0.74/1.09
% 0.74/1.09 ---------------- PROOF ----------------
% 0.74/1.09 % SZS output start Refutation
% See solution above
% 0.74/1.09 ------------ end of proof -------------
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 ------------- memory usage ------------
% 0.74/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.09 type (bytes each) gets frees in use avail bytes
% 0.74/1.09 sym_ent ( 96) 54 0 54 0 5.1 K
% 0.74/1.09 term ( 16) 7834 5054 2780 28 54.5 K
% 0.74/1.09 gen_ptr ( 8) 17412 2337 15075 10 117.9 K
% 0.74/1.09 context ( 808) 4187 4185 2 3 3.9 K
% 0.74/1.09 trail ( 12) 546 546 0 5 0.1 K
% 0.74/1.09 bt_node ( 68) 818 813 5 26 2.1 K
% 0.74/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.09 ac_match_free_vars_pos (4020)
% 0.74/1.09 0 0 0 0 0.0 K
% 0.74/1.09 discrim ( 12) 2649 1391 1258 146 16.5 K
% 0.74/1.09 flat ( 40) 20790 20790 0 57 2.2 K
% 0.74/1.09 discrim_pos ( 12) 171 171 0 1 0.0 K
% 0.74/1.09 fpa_head ( 12) 816 0 816 0 9.6 K
% 0.74/1.09 fpa_tree ( 28) 378 378 0 25 0.7 K
% 0.74/1.09 fpa_pos ( 36) 124 124 0 1 0.0 K
% 0.74/1.09 literal ( 12) 300 214 86 1 1.0 K
% 0.74/1.09 clause ( 24) 300 214 86 1 2.0 K
% 0.74/1.09 list ( 12) 97 41 56 3 0.7 K
% 0.74/1.09 list_pos ( 20) 377 183 194 0 3.8 K
% 0.74/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.09
% 0.74/1.09 -------------- statistics -------------
% 0.74/1.09 Clauses input 2
% 0.74/1.09 Usable input 0
% 0.74/1.09 Sos input 2
% 0.74/1.09 Demodulators input 0
% 0.74/1.09 Passive input 0
% 0.74/1.09
% 0.74/1.09 Processed BS (before search) 2
% 0.74/1.09 Forward subsumed BS 0
% 0.74/1.09 Kept BS 2
% 0.74/1.09 New demodulators BS 1
% 0.74/1.09 Back demodulated BS 0
% 0.74/1.09
% 0.74/1.09 Clauses or pairs given 44
% 0.74/1.09 Clauses generated 146
% 0.74/1.09 Forward subsumed 62
% 0.74/1.09 Deleted by weight 0
% 0.74/1.09 Deleted by variable count 0
% 0.74/1.09 Kept 84
% 0.74/1.09 New demodulators 37
% 0.74/1.09 Back demodulated 41
% 0.74/1.09 Ordered paramod prunes 0
% 0.74/1.09 Basic paramod prunes 109
% 0.74/1.09 Prime paramod prunes 3
% 0.74/1.09 Semantic prunes 0
% 0.74/1.09
% 0.74/1.09 Rewrite attmepts 3040
% 0.74/1.09 Rewrites 122
% 0.74/1.09
% 0.74/1.09 FPA overloads 0
% 0.74/1.09 FPA underloads 0
% 0.74/1.09
% 0.74/1.09 Usable size 0
% 0.74/1.09 Sos size 44
% 0.74/1.09 Demodulators size 21
% 0.74/1.09 Passive size 0
% 0.74/1.09 Disabled size 41
% 0.74/1.09
% 0.74/1.09 Proofs found 1
% 0.74/1.09
% 0.74/1.09 ----------- times (seconds) ----------- Mon Jun 13 20:22:39 2022
% 0.74/1.09
% 0.74/1.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.09 input time 0.00
% 0.74/1.09 paramodulation time 0.00
% 0.74/1.09 demodulation time 0.00
% 0.74/1.09 orient time 0.00
% 0.74/1.09 weigh time 0.00
% 0.74/1.09 forward subsume time 0.00
% 0.74/1.09 back demod find time 0.00
% 0.74/1.09 conflict time 0.00
% 0.74/1.09 LRPO time 0.00
% 0.74/1.09 store clause time 0.00
% 0.74/1.09 disable clause time 0.00
% 0.74/1.09 prime paramod time 0.00
% 0.74/1.09 semantics time 0.00
% 0.74/1.09
% 0.74/1.09 EQP interrupted
%------------------------------------------------------------------------------