TSTP Solution File: GRP685-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n003.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:48:53 EDT 2022
% Result : Unsatisfiable 0.78s 1.15s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 0 equ; 2 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ld(A,mult(A,A)),A),
file('GRP685-11.p',unknown),
[] ).
cnf(2,plain,
equal(rd(mult(A,A),A),A),
file('GRP685-11.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,ld(A,B)),ld(A,mult(A,B))),
file('GRP685-11.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),mult(rd(A,B),B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(mult(rd(A,A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2]),4]),
[iquote('back_demod(2),demod([4])')] ).
cnf(8,plain,
equal(mult(rd(mult(A,B),rd(C,D)),rd(C,D)),mult(A,mult(rd(B,D),D))),
inference(demod,[status(thm),theory(equality)],[4,4]),
[iquote('demod([4,4])')] ).
cnf(9,plain,
equal(mult(rd(rd(A,A),B),B),ld(A,mult(A,ld(B,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),1]),
[iquote('demod([4]),flip(1)')] ).
cnf(10,plain,
~ equal(mult(rd(x6,rd(x7,x8)),rd(x7,x8)),mult(rd(x6,x8),x8)),
inference(demod,[status(thm),theory(equality)],[4,4]),
[iquote('demod([4,4])')] ).
cnf(12,plain,
equal(rd(A,A),ld(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,4]),9,3,1]),
[iquote('para(5,4),demod([9,3,1])')] ).
cnf(14,plain,
equal(mult(ld(A,A),A),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),12]),
[iquote('back_demod(5),demod([12])')] ).
cnf(22,plain,
equal(mult(rd(mult(A,B),mult(rd(C,D),D)),mult(rd(C,D),D)),mult(A,mult(rd(B,D),D))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(41,plain,
equal(mult(rd(A,rd(B,C)),rd(B,C)),mult(ld(A,A),mult(rd(A,C),C))),
inference(para,[status(thm),theory(equality)],[14,8]),
[iquote('para(14,8)')] ).
cnf(46,plain,
~ equal(mult(ld(x6,x6),mult(rd(x6,x8),x8)),mult(rd(x6,x8),x8)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),41]),
[iquote('back_demod(10),demod([41])')] ).
cnf(74,plain,
equal(mult(rd(mult(A,B),C),C),mult(A,mult(rd(B,C),C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,22]),14,12,14]),
[iquote('para(12,22),demod([14,12,14])')] ).
cnf(82,plain,
equal(mult(ld(A,A),mult(rd(A,B),B)),mult(rd(A,B),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,74]),1]),
[iquote('para(14,74),flip(1)')] ).
cnf(83,plain,
$false,
inference(conflict,[status(thm)],[82,46]),
[iquote('conflict(82,46)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.14 % Problem : GRP685-11 : TPTP v8.1.0. Released v8.1.0.
% 0.05/0.15 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Tue Jun 14 11:57:10 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.78/1.15 ----- EQP 0.9e, May 2009 -----
% 0.78/1.15 The job began on n003.cluster.edu, Tue Jun 14 11:57:11 2022
% 0.78/1.15 The command was "./eqp09e".
% 0.78/1.15
% 0.78/1.15 set(prolog_style_variables).
% 0.78/1.15 set(lrpo).
% 0.78/1.15 set(basic_paramod).
% 0.78/1.15 set(functional_subsume).
% 0.78/1.15 set(ordered_paramod).
% 0.78/1.15 set(prime_paramod).
% 0.78/1.15 set(para_pairs).
% 0.78/1.15 assign(pick_given_ratio,4).
% 0.78/1.15 clear(print_kept).
% 0.78/1.15 clear(print_new_demod).
% 0.78/1.15 clear(print_back_demod).
% 0.78/1.15 clear(print_given).
% 0.78/1.15 assign(max_mem,64000).
% 0.78/1.15 end_of_commands.
% 0.78/1.15
% 0.78/1.15 Usable:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Sos:
% 0.78/1.15 0 (wt=-1) [] ld(A,mult(A,A)) = A.
% 0.78/1.15 0 (wt=-1) [] rd(mult(A,A),A) = A.
% 0.78/1.15 0 (wt=-1) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.78/1.15 0 (wt=-1) [] mult(rd(A,B),B) = rd(mult(A,B),B).
% 0.78/1.15 0 (wt=-1) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.78/1.15 0 (wt=-1) [] rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)).
% 0.78/1.15 0 (wt=-1) [] ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B).
% 0.78/1.15 0 (wt=-1) [] -(rd(mult(x6,rd(x7,x8)),rd(x7,x8)) = rd(mult(x6,x8),x8)).
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Demodulators:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Passive:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Starting to process input.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.78/1.15 1 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 2 (wt=7) [] rd(mult(A,A),A) = A.
% 0.78/1.15 2 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.78/1.15 3 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.78/1.15 4 is a new demodulator.
% 0.78/1.15 -> 4 back demodulating 2.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.78/1.15 5 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.78/1.15
% 0.78/1.15 ** KEPT: 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.78/1.15 clause forward subsumed: 0 (wt=19) [flip(7)] ld(ld(A,D),mult(ld(A,D),mult(B,C))) = mult(ld(A,mult(A,B)),C).
% 0.78/1.15
% 0.78/1.15 ** KEPT: 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.78/1.15 8 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.78/1.15 9 is a new demodulator.
% 0.78/1.15
% 0.78/1.15 ** KEPT: 10 (wt=15) [demod([4,4])] -(mult(rd(x6,rd(x7,x8)),rd(x7,x8)) = mult(rd(x6,x8),x8)).
% 0.78/1.15 ---------------- PROOF FOUND ----------------
% 0.78/1.15 % SZS status Unsatisfiable
% 0.78/1.15
% 0.78/1.15
% 0.78/1.15 After processing input:
% 0.78/1.15
% 0.78/1.15 Usable:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Sos:
% 0.78/1.15 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.78/1.15 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.78/1.15 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.78/1.15 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.78/1.15 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.78/1.15 10 (wt=15) [demod([4,4])] -(mult(rd(x6,rd(x7,x8)),rd(x7,x8)) = mult(rd(x6,x8),x8)).
% 0.78/1.15 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.78/1.15 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.78/1.15 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Demodulators:
% 0.78/1.15 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.78/1.15 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.78/1.15 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.78/1.15 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.78/1.15 8 (wt=19) [demod([4,4])] mult(rd(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,mult(rd(B,D),D)).
% 0.78/1.15 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 Passive:
% 0.78/1.15 end_of_list.
% 0.78/1.15
% 0.78/1.15 UNIT CONFLICT from 82 and 46 at 0.00 seconds.
% 0.78/1.15
% 0.78/1.15 ---------------- PROOF ----------------
% 0.78/1.15 % SZS output start Refutation
% See solution above
% 0.78/1.15 ------------ end of proof -------------
% 0.78/1.15
% 0.78/1.15
% 0.78/1.15 ------------- memory usage ------------
% 0.78/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.78/1.15 type (bytes each) gets frees in use avail bytes
% 0.78/1.15 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.78/1.15 term ( 16) 5332 3614 1718 24 33.7 K
% 0.78/1.15 gen_ptr ( 8) 7892 1114 6778 15 53.1 K
% 0.78/1.15 context ( 808) 3500 3498 2 3 3.9 K
% 0.78/1.15 trail ( 12) 299 299 0 5 0.1 K
% 0.78/1.15 bt_node ( 68) 1331 1328 3 8 0.7 K
% 0.78/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.15 ac_match_free_vars_pos (4020)
% 0.78/1.15 0 0 0 0 0.0 K
% 0.78/1.15 discrim ( 12) 1874 432 1442 4 16.9 K
% 0.78/1.15 flat ( 40) 8025 8025 0 31 1.2 K
% 0.78/1.15 discrim_pos ( 12) 139 139 0 1 0.0 K
% 0.78/1.15 fpa_head ( 12) 1257 0 1257 0 14.7 K
% 0.78/1.15 fpa_tree ( 28) 272 272 0 25 0.7 K
% 0.78/1.15 fpa_pos ( 36) 149 149 0 1 0.0 K
% 0.78/1.15 literal ( 12) 246 164 82 1 1.0 K
% 0.78/1.15 clause ( 24) 246 164 82 1 1.9 K
% 0.78/1.15 list ( 12) 126 70 56 4 0.7 K
% 0.78/1.15 list_pos ( 20) 366 118 248 0 4.8 K
% 0.78/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.15
% 0.78/1.15 -------------- statistics -------------
% 0.78/1.15 Clauses input 8
% 0.78/1.15 Usable input 0
% 0.78/1.15 Sos input 8
% 0.78/1.15 Demodulators input 0
% 0.78/1.15 Passive input 0
% 0.78/1.15
% 0.78/1.15 Processed BS (before search) 11
% 0.78/1.15 Forward subsumed BS 1
% 0.78/1.15 Kept BS 10
% 0.78/1.15 New demodulators BS 7
% 0.78/1.15 Back demodulated BS 1
% 0.78/1.15
% 0.78/1.15 Clauses or pairs given 163
% 0.78/1.15 Clauses generated 134
% 0.78/1.15 Forward subsumed 62
% 0.78/1.15 Deleted by weight 0
% 0.78/1.15 Deleted by variable count 0
% 0.78/1.15 Kept 72
% 0.78/1.15 New demodulators 60
% 0.78/1.15 Back demodulated 22
% 0.78/1.15 Ordered paramod prunes 0
% 0.78/1.15 Basic paramod prunes 102
% 0.78/1.15 Prime paramod prunes 1
% 0.78/1.15 Semantic prunes 0
% 0.78/1.15
% 0.78/1.15 Rewrite attmepts 1550
% 0.78/1.15 Rewrites 130
% 0.78/1.15
% 0.78/1.15 FPA overloads 0
% 0.78/1.15 FPA underloads 0
% 0.78/1.15
% 0.78/1.15 Usable size 0
% 0.78/1.15 Sos size 58
% 0.78/1.15 Demodulators size 51
% 0.78/1.15 Passive size 0
% 0.78/1.15 Disabled size 23
% 0.78/1.15
% 0.78/1.15 Proofs found 1
% 0.78/1.15
% 0.78/1.15 ----------- times (seconds) ----------- Tue Jun 14 11:57:11 2022
% 0.78/1.15
% 0.78/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.78/1.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.78/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.15 input time 0.00
% 0.78/1.15 paramodulation time 0.00
% 0.78/1.15 demodulation time 0.00
% 0.78/1.15 orient time 0.00
% 0.78/1.15 weigh time 0.00
% 0.78/1.15 forward subsume time 0.00
% 0.78/1.15 back demod find time 0.00
% 0.78/1.15 conflict time 0.00
% 0.78/1.15 LRPO time 0.00
% 0.78/1.15 store clause time 0.00
% 0.78/1.15 disable clause time 0.00
% 0.78/1.15 prime paramod time 0.00
% 0.78/1.15 semantics time 0.00
% 0.78/1.15
% 0.78/1.15 EQP interrupted
%------------------------------------------------------------------------------