TSTP Solution File: GRP756-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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:49:10 EDT 2022
% Result : Unsatisfiable 0.73s 1.24s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of clauses : 40 ( 40 unt; 0 nHn; 2 RR)
% Number of literals : 40 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 106 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP756-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP756-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP756-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP756-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,mult(mult(B,B),C)),mult(mult(A,B),mult(B,C))),
file('GRP756-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(mult(A,B),mult(B,C)),mult(A,mult(mult(B,B),C))),
inference(flip,[status(thm),theory(equality)],[5]),
[iquote('flip(5)')] ).
cnf(7,plain,
~ equal(mult(mult(a,b),c),mult(a,mult(b,c))),
file('GRP756-1.p',unknown),
[] ).
cnf(10,plain,
equal(mult(mult(A,B),mult(B,ld(mult(B,B),C))),mult(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,5]),1]),
[iquote('para(1,5),flip(1)')] ).
cnf(11,plain,
equal(ld(A,mult(mult(A,B),mult(B,C))),mult(mult(B,B),C)),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(12,plain,
equal(mult(mult(A,A),B),ld(C,mult(mult(C,A),mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[11]),
[iquote('flip(11)')] ).
cnf(16,plain,
equal(mult(mult(A,B),C),mult(A,mult(mult(B,B),ld(B,C)))),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(17,plain,
equal(mult(A,mult(mult(B,B),ld(B,C))),mult(mult(A,B),C)),
inference(flip,[status(thm),theory(equality)],[16]),
[iquote('flip(16)')] ).
cnf(22,plain,
equal(ld(mult(A,B),mult(A,mult(mult(B,B),C))),mult(B,C)),
inference(para,[status(thm),theory(equality)],[6,2]),
[iquote('para(6,2)')] ).
cnf(29,plain,
equal(mult(A,mult(B,mult(mult(B,B),C))),mult(mult(A,B),mult(B,mult(B,C)))),
inference(para,[status(thm),theory(equality)],[6,5]),
[iquote('para(6,5)')] ).
cnf(39,plain,
equal(mult(rd(A,B),C),mult(A,mult(B,ld(mult(B,B),C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,10]),1]),
[iquote('para(3,10),flip(1)')] ).
cnf(43,plain,
equal(mult(A,mult(B,ld(mult(B,B),B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),39]),
[iquote('back_demod(3),demod([39])')] ).
cnf(48,plain,
equal(ld(A,A),mult(B,ld(mult(B,B),B))),
inference(para,[status(thm),theory(equality)],[43,2]),
[iquote('para(43,2)')] ).
cnf(49,plain,
equal(mult(A,ld(mult(A,A),A)),ld(B,B)),
inference(flip,[status(thm),theory(equality)],[48]),
[iquote('flip(48)')] ).
cnf(53,plain,
equal(rd(ld(A,A),ld(mult(B,B),B)),B),
inference(para,[status(thm),theory(equality)],[49,4]),
[iquote('para(49,4)')] ).
cnf(83,plain,
equal(mult(A,ld(B,B)),A),
inference(para,[status(thm),theory(equality)],[49,43]),
[iquote('para(49,43)')] ).
cnf(196,plain,
equal(mult(A,ld(B,mult(mult(B,C),D))),mult(mult(A,C),D)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,17]),1]),
[iquote('para(12,17),demod([1])')] ).
cnf(212,plain,
equal(mult(A,mult(B,mult(mult(B,B),ld(B,ld(B,C))))),mult(mult(A,B),C)),
inference(para,[status(thm),theory(equality)],[16,17]),
[iquote('para(16,17)')] ).
cnf(213,plain,
equal(mult(mult(A,B),C),mult(A,mult(B,mult(mult(B,B),ld(B,ld(B,C)))))),
inference(flip,[status(thm),theory(equality)],[212]),
[iquote('flip(212)')] ).
cnf(398,plain,
equal(mult(mult(A,ld(B,C)),D),mult(A,ld(B,mult(C,D)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,196]),1]),
[iquote('para(1,196),flip(1)')] ).
cnf(653,plain,
equal(rd(mult(A,ld(B,mult(C,D))),D),mult(A,ld(B,C))),
inference(para,[status(thm),theory(equality)],[398,4]),
[iquote('para(398,4)')] ).
cnf(676,plain,
equal(mult(mult(A,B),mult(B,mult(B,mult(B,ld(mult(B,B),C))))),mult(A,mult(B,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,29]),1]),
[iquote('para(10,29),flip(1)')] ).
cnf(747,plain,
equal(ld(mult(A,B),mult(A,mult(mult(mult(B,B),C),mult(C,mult(C,D))))),mult(B,mult(C,mult(mult(C,C),D)))),
inference(para,[status(thm),theory(equality)],[29,22]),
[iquote('para(29,22)')] ).
cnf(748,plain,
equal(mult(A,mult(B,mult(mult(B,B),C))),ld(mult(D,A),mult(D,mult(mult(mult(A,A),B),mult(B,mult(B,C)))))),
inference(flip,[status(thm),theory(equality)],[747]),
[iquote('flip(747)')] ).
cnf(850,plain,
equal(rd(A,B),mult(A,ld(mult(C,B),C))),
inference(para,[status(thm),theory(equality)],[83,653]),
[iquote('para(83,653)')] ).
cnf(851,plain,
equal(mult(A,ld(mult(B,C),B)),rd(A,C)),
inference(flip,[status(thm),theory(equality)],[850]),
[iquote('flip(850)')] ).
cnf(858,plain,
equal(rd(rd(A,B),ld(mult(C,B),C)),A),
inference(para,[status(thm),theory(equality)],[851,4]),
[iquote('para(851,4)')] ).
cnf(882,plain,
equal(rd(A,ld(mult(B,C),B)),mult(A,C)),
inference(para,[status(thm),theory(equality)],[4,858]),
[iquote('para(4,858)')] ).
cnf(886,plain,
equal(mult(ld(A,A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[53]),882]),
[iquote('back_demod(53),demod([882])')] ).
cnf(900,plain,
equal(rd(A,A),ld(B,B)),
inference(para,[status(thm),theory(equality)],[886,4]),
[iquote('para(886,4)')] ).
cnf(901,plain,
equal(ld(A,A),rd(B,B)),
inference(flip,[status(thm),theory(equality)],[900]),
[iquote('flip(900)')] ).
cnf(978,plain,
equal(mult(A,mult(A,ld(mult(A,A),B))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[901,886]),39]),
[iquote('para(901,886),demod([39])')] ).
cnf(979,plain,
equal(mult(mult(A,B),mult(B,C)),mult(A,mult(B,mult(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[676]),978]),
[iquote('back_demod(676),demod([978])')] ).
cnf(1120,plain,
equal(mult(A,mult(B,mult(mult(B,B),C))),mult(A,mult(B,mult(B,mult(B,C))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[748]),979,22]),
[iquote('back_demod(748),demod([979,22])')] ).
cnf(1212,plain,
equal(mult(mult(A,B),C),mult(A,mult(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[213]),1120,1,1]),
[iquote('back_demod(213),demod([1120,1,1])')] ).
cnf(1213,plain,
$false,
inference(conflict,[status(thm)],[1212,7]),
[iquote('conflict(1212,7)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP756-1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n024.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 08:59:48 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.24 ----- EQP 0.9e, May 2009 -----
% 0.73/1.24 The job began on n024.cluster.edu, Tue Jun 14 08:59:49 2022
% 0.73/1.24 The command was "./eqp09e".
% 0.73/1.24
% 0.73/1.24 set(prolog_style_variables).
% 0.73/1.24 set(lrpo).
% 0.73/1.24 set(basic_paramod).
% 0.73/1.24 set(functional_subsume).
% 0.73/1.24 set(ordered_paramod).
% 0.73/1.24 set(prime_paramod).
% 0.73/1.24 set(para_pairs).
% 0.73/1.24 assign(pick_given_ratio,4).
% 0.73/1.24 clear(print_kept).
% 0.73/1.24 clear(print_new_demod).
% 0.73/1.24 clear(print_back_demod).
% 0.73/1.24 clear(print_given).
% 0.73/1.24 assign(max_mem,64000).
% 0.73/1.24 end_of_commands.
% 0.73/1.24
% 0.73/1.24 Usable:
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Sos:
% 0.73/1.24 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.73/1.24 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.73/1.24 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.73/1.24 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.73/1.24 0 (wt=-1) [] mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)).
% 0.73/1.24 0 (wt=-1) [] -(mult(mult(a,b),c) = mult(a,mult(b,c))).
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Demodulators:
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Passive:
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Starting to process input.
% 0.73/1.24
% 0.73/1.24 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.24 1 is a new demodulator.
% 0.73/1.24
% 0.73/1.24 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.24 2 is a new demodulator.
% 0.73/1.24
% 0.73/1.24 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.24 3 is a new demodulator.
% 0.73/1.24
% 0.73/1.24 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.24 4 is a new demodulator.
% 0.73/1.24
% 0.73/1.24 ** KEPT: 5 (wt=15) [] mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)).
% 0.73/1.24
% 0.73/1.24 ** KEPT: 6 (wt=15) [flip(5)] mult(mult(A,B),mult(B,C)) = mult(A,mult(mult(B,B),C)).
% 0.73/1.24 clause forward subsumed: 0 (wt=15) [flip(6)] mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)).
% 0.73/1.24
% 0.73/1.24 ** KEPT: 7 (wt=11) [] -(mult(mult(a,b),c) = mult(a,mult(b,c))).
% 0.73/1.24 ---------------- PROOF FOUND ----------------
% 0.73/1.24 % SZS status Unsatisfiable
% 0.73/1.24
% 0.73/1.24
% 0.73/1.24 After processing input:
% 0.73/1.24
% 0.73/1.24 Usable:
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Sos:
% 0.73/1.24 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.24 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.24 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.24 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.24 7 (wt=11) [] -(mult(mult(a,b),c) = mult(a,mult(b,c))).
% 0.73/1.24 5 (wt=15) [] mult(A,mult(mult(B,B),C)) = mult(mult(A,B),mult(B,C)).
% 0.73/1.24 6 (wt=15) [flip(5)] mult(mult(A,B),mult(B,C)) = mult(A,mult(mult(B,B),C)).
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Demodulators:
% 0.73/1.24 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.24 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.24 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.24 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 Passive:
% 0.73/1.24 end_of_list.
% 0.73/1.24
% 0.73/1.24 UNIT CONFLICT from 1212 and 7 at 0.13 seconds.
% 0.73/1.24
% 0.73/1.24 ---------------- PROOF ----------------
% 0.73/1.24 % SZS output start Refutation
% See solution above
% 0.73/1.24 ------------ end of proof -------------
% 0.73/1.24
% 0.73/1.24
% 0.73/1.24 ------------- memory usage ------------
% 0.73/1.24 Memory dynamically allocated (tp_alloc): 3906.
% 0.73/1.24 type (bytes each) gets frees in use avail bytes
% 0.73/1.24 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.73/1.24 term ( 16) 111571 63935 47636 28 926.2 K
% 0.73/1.24 gen_ptr ( 8) 267628 22687 244941 39 1913.9 K
% 0.73/1.24 context ( 808) 59185 59183 2 4 4.7 K
% 0.73/1.24 trail ( 12) 16592 16592 0 6 0.1 K
% 0.73/1.24 bt_node ( 68) 7883 7880 3 12 1.0 K
% 0.73/1.24 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.24 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.24 ac_match_free_vars_pos (4020)
% 0.73/1.24 0 0 0 0 0.0 K
% 0.73/1.24 discrim ( 12) 36876 12056 24820 1380 307.0 K
% 0.73/1.24 flat ( 40) 366237 366237 0 127 5.0 K
% 0.73/1.24 discrim_pos ( 12) 2222 2222 0 1 0.0 K
% 0.73/1.24 fpa_head ( 12) 5262 0 5262 0 61.7 K
% 0.73/1.24 fpa_tree ( 28) 1774 1774 0 25 0.7 K
% 0.73/1.24 fpa_pos ( 36) 1515 1515 0 1 0.0 K
% 0.73/1.24 literal ( 12) 4209 2997 1212 1 14.2 K
% 0.73/1.24 clause ( 24) 4209 2997 1212 1 28.4 K
% 0.73/1.24 list ( 12) 362 303 59 2 0.7 K
% 0.73/1.24 list_pos ( 20) 5206 1634 3572 85 71.4 K
% 0.73/1.24 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.24
% 0.73/1.24 -------------- statistics -------------
% 0.73/1.24 Clauses input 6
% 0.73/1.24 Usable input 0
% 0.73/1.24 Sos input 6
% 0.73/1.24 Demodulators input 0
% 0.73/1.24 Passive input 0
% 0.73/1.24
% 0.73/1.24 Processed BS (before search) 8
% 0.73/1.24 Forward subsumed BS 1
% 0.73/1.24 Kept BS 7
% 0.73/1.24 New demodulators BS 4
% 0.73/1.24 Back demodulated BS 0
% 0.73/1.24
% 0.73/1.24 Clauses or pairs given 1172
% 0.73/1.24 Clauses generated 2213
% 0.73/1.24 Forward subsumed 1008
% 0.73/1.24 Deleted by weight 0
% 0.73/1.24 Deleted by variable count 0
% 0.73/1.24 Kept 1205
% 0.73/1.24 New demodulators 299
% 0.73/1.24 Back demodulated 379
% 0.73/1.24 Ordered paramod prunes 0
% 0.73/1.24 Basic paramod prunes 2589
% 0.73/1.24 Prime paramod prunes 29
% 0.73/1.24 Semantic prunes 0
% 0.73/1.24
% 0.73/1.24 Rewrite attmepts 44262
% 0.73/1.24 Rewrites 1506
% 0.73/1.24
% 0.73/1.24 FPA overloads 0
% 0.73/1.24 FPA underloads 0
% 0.73/1.24
% 0.73/1.24 Usable size 0
% 0.73/1.24 Sos size 832
% 0.73/1.24 Demodulators size 211
% 0.73/1.24 Passive size 0
% 0.73/1.24 Disabled size 379
% 0.73/1.24
% 0.73/1.24 Proofs found 1
% 0.73/1.24
% 0.73/1.24 ----------- times (seconds) ----------- Tue Jun 14 08:59:49 2022
% 0.73/1.24
% 0.73/1.24 user CPU time 0.13 (0 hr, 0 min, 0 sec)
% 0.73/1.24 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.73/1.24 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.24 input time 0.00
% 0.73/1.24 paramodulation time 0.01
% 0.73/1.24 demodulation time 0.02
% 0.73/1.24 orient time 0.01
% 0.73/1.24 weigh time 0.01
% 0.73/1.24 forward subsume time 0.01
% 0.73/1.24 back demod find time 0.00
% 0.73/1.24 conflict time 0.00
% 0.73/1.24 LRPO time 0.01
% 0.73/1.24 store clause time 0.04
% 0.73/1.24 disable clause time 0.01
% 0.73/1.24 prime paramod time 0.00
% 0.73/1.24 semantics time 0.00
% 0.73/1.24
% 0.73/1.24 EQP interrupted
%------------------------------------------------------------------------------