TSTP Solution File: GRP682-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP682-10 : TPTP v8.1.0. Released v8.1.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:48:50 EDT 2022
% Result : Unsatisfiable 0.45s 1.09s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 2 RR)
% Number of literals : 15 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ld(A,mult(A,A)),A),
file('GRP682-10.p',unknown),
[] ).
cnf(2,plain,
equal(rd(mult(A,A),A),A),
file('GRP682-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(A,ld(A,B)),ld(A,mult(A,B))),
file('GRP682-10.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(6,plain,
equal(ld(ld(A,B),mult(ld(A,B),mult(C,D))),mult(ld(A,mult(A,C)),D)),
file('GRP682-10.p',unknown),
[] ).
cnf(7,plain,
equal(mult(ld(A,mult(A,B)),C),ld(ld(A,D),mult(ld(A,D),mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[6]),
[iquote('flip(6)')] ).
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(ld(ld(x0,x1),mult(ld(x0,x1),x2)),ld(x0,mult(x0,x2))),
file('GRP682-10.p',unknown),
[] ).
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(16,plain,
equal(mult(ld(A,mult(A,B)),C),ld(A,mult(A,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,6]),1]),1]),
[iquote('para(1,6),demod([1]),flip(1)')] ).
cnf(17,plain,
equal(ld(ld(A,B),mult(ld(A,B),mult(C,D))),ld(A,mult(A,mult(C,D)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),16]),1]),
[iquote('back_demod(7),demod([16]),flip(1)')] ).
cnf(55,plain,
equal(ld(ld(A,B),mult(ld(A,B),C)),ld(A,mult(A,C))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,17]),14]),
[iquote('para(14,17),demod([14])')] ).
cnf(56,plain,
$false,
inference(conflict,[status(thm)],[55,10]),
[iquote('conflict(55,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP682-10 : TPTP v8.1.0. Released v8.1.0.
% 0.10/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n009.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 14:26:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.09 ----- EQP 0.9e, May 2009 -----
% 0.45/1.09 The job began on n009.cluster.edu, Mon Jun 13 14:26:23 2022
% 0.45/1.09 The command was "./eqp09e".
% 0.45/1.09
% 0.45/1.09 set(prolog_style_variables).
% 0.45/1.09 set(lrpo).
% 0.45/1.09 set(basic_paramod).
% 0.45/1.09 set(functional_subsume).
% 0.45/1.09 set(ordered_paramod).
% 0.45/1.09 set(prime_paramod).
% 0.45/1.09 set(para_pairs).
% 0.45/1.09 assign(pick_given_ratio,4).
% 0.45/1.09 clear(print_kept).
% 0.45/1.09 clear(print_new_demod).
% 0.45/1.09 clear(print_back_demod).
% 0.45/1.09 clear(print_given).
% 0.45/1.09 assign(max_mem,64000).
% 0.45/1.09 end_of_commands.
% 0.45/1.09
% 0.45/1.09 Usable:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Sos:
% 0.45/1.09 0 (wt=-1) [] ld(A,mult(A,A)) = A.
% 0.45/1.09 0 (wt=-1) [] rd(mult(A,A),A) = A.
% 0.45/1.09 0 (wt=-1) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.45/1.09 0 (wt=-1) [] mult(rd(A,B),B) = rd(mult(A,B),B).
% 0.45/1.09 0 (wt=-1) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.45/1.09 0 (wt=-1) [] rd(mult(mult(A,B),rd(C,D)),rd(C,D)) = mult(A,rd(mult(B,D),D)).
% 0.45/1.09 0 (wt=-1) [] ld(A,mult(A,ld(B,B))) = rd(mult(rd(A,A),B),B).
% 0.45/1.09 0 (wt=-1) [] -(ld(ld(x0,x1),mult(ld(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Demodulators:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Passive:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Starting to process input.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.45/1.09 1 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 2 (wt=7) [] rd(mult(A,A),A) = A.
% 0.45/1.09 2 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.45/1.09 3 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.45/1.09 4 is a new demodulator.
% 0.45/1.09 -> 4 back demodulating 2.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.45/1.09 5 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.45/1.09
% 0.45/1.09 ** 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.45/1.09 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.45/1.09
% 0.45/1.09 ** 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.45/1.09 8 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.45/1.09 9 is a new demodulator.
% 0.45/1.09
% 0.45/1.09 ** KEPT: 10 (wt=15) [] -(ld(ld(x0,x1),mult(ld(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.45/1.09 ---------------- PROOF FOUND ----------------
% 0.45/1.09 % SZS status Unsatisfiable
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 After processing input:
% 0.45/1.09
% 0.45/1.09 Usable:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Sos:
% 0.45/1.09 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.45/1.09 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.45/1.09 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.45/1.09 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.45/1.09 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.45/1.09 10 (wt=15) [] -(ld(ld(x0,x1),mult(ld(x0,x1),x2)) = ld(x0,mult(x0,x2))).
% 0.45/1.09 6 (wt=19) [] ld(ld(A,B),mult(ld(A,B),mult(C,D))) = mult(ld(A,mult(A,C)),D).
% 0.45/1.09 7 (wt=19) [flip(6)] mult(ld(A,mult(A,B)),C) = ld(ld(A,D),mult(ld(A,D),mult(B,C))).
% 0.45/1.09 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.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Demodulators:
% 0.45/1.09 1 (wt=7) [] ld(A,mult(A,A)) = A.
% 0.45/1.09 3 (wt=11) [] mult(A,ld(A,B)) = ld(A,mult(A,B)).
% 0.45/1.09 4 (wt=11) [flip(1)] rd(mult(A,B),B) = mult(rd(A,B),B).
% 0.45/1.09 5 (wt=7) [back_demod(2),demod([4])] mult(rd(A,A),A) = A.
% 0.45/1.09 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.45/1.09 9 (wt=15) [demod([4]),flip(1)] mult(rd(rd(A,A),B),B) = ld(A,mult(A,ld(B,B))).
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 Passive:
% 0.45/1.09 end_of_list.
% 0.45/1.09
% 0.45/1.09 UNIT CONFLICT from 55 and 10 at 0.00 seconds.
% 0.45/1.09
% 0.45/1.09 ---------------- PROOF ----------------
% 0.45/1.09 % SZS output start Refutation
% See solution above
% 0.45/1.09 ------------ end of proof -------------
% 0.45/1.09
% 0.45/1.09
% 0.45/1.09 ------------- memory usage ------------
% 0.45/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.45/1.09 type (bytes each) gets frees in use avail bytes
% 0.45/1.09 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.45/1.09 term ( 16) 3596 2511 1085 20 21.4 K
% 0.45/1.09 gen_ptr ( 8) 4844 637 4207 14 33.0 K
% 0.45/1.09 context ( 808) 2226 2224 2 3 3.9 K
% 0.45/1.09 trail ( 12) 161 161 0 4 0.0 K
% 0.45/1.09 bt_node ( 68) 900 897 3 8 0.7 K
% 0.45/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/1.09 ac_match_free_vars_pos (4020)
% 0.45/1.09 0 0 0 0 0.0 K
% 0.45/1.09 discrim ( 12) 1178 195 983 0 11.5 K
% 0.45/1.09 flat ( 40) 4708 4708 0 27 1.1 K
% 0.45/1.09 discrim_pos ( 12) 83 83 0 1 0.0 K
% 0.45/1.09 fpa_head ( 12) 956 0 956 0 11.2 K
% 0.45/1.09 fpa_tree ( 28) 160 160 0 21 0.6 K
% 0.45/1.09 fpa_pos ( 36) 98 98 0 1 0.0 K
% 0.45/1.09 literal ( 12) 157 102 55 1 0.7 K
% 0.45/1.09 clause ( 24) 157 102 55 1 1.3 K
% 0.45/1.09 list ( 12) 102 46 56 4 0.7 K
% 0.45/1.09 list_pos ( 20) 240 70 170 0 3.3 K
% 0.45/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/1.09
% 0.45/1.09 -------------- statistics -------------
% 0.45/1.09 Clauses input 8
% 0.45/1.09 Usable input 0
% 0.45/1.09 Sos input 8
% 0.45/1.09 Demodulators input 0
% 0.45/1.09 Passive input 0
% 0.45/1.09
% 0.45/1.09 Processed BS (before search) 11
% 0.45/1.09 Forward subsumed BS 1
% 0.45/1.09 Kept BS 10
% 0.45/1.09 New demodulators BS 7
% 0.45/1.09 Back demodulated BS 1
% 0.45/1.09
% 0.45/1.09 Clauses or pairs given 114
% 0.45/1.09 Clauses generated 82
% 0.45/1.09 Forward subsumed 37
% 0.45/1.09 Deleted by weight 0
% 0.45/1.09 Deleted by variable count 0
% 0.45/1.09 Kept 45
% 0.45/1.09 New demodulators 36
% 0.45/1.09 Back demodulated 12
% 0.45/1.09 Ordered paramod prunes 0
% 0.45/1.09 Basic paramod prunes 63
% 0.45/1.09 Prime paramod prunes 1
% 0.45/1.09 Semantic prunes 0
% 0.45/1.09
% 0.45/1.09 Rewrite attmepts 929
% 0.45/1.09 Rewrites 75
% 0.45/1.09
% 0.45/1.09 FPA overloads 0
% 0.45/1.09 FPA underloads 0
% 0.45/1.09
% 0.45/1.09 Usable size 0
% 0.45/1.09 Sos size 41
% 0.45/1.09 Demodulators size 34
% 0.45/1.09 Passive size 0
% 0.45/1.09 Disabled size 13
% 0.45/1.09
% 0.45/1.09 Proofs found 1
% 0.45/1.09
% 0.45/1.09 ----------- times (seconds) ----------- Mon Jun 13 14:26:23 2022
% 0.45/1.09
% 0.45/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/1.09 input time 0.00
% 0.45/1.09 paramodulation time 0.00
% 0.45/1.09 demodulation time 0.00
% 0.45/1.09 orient time 0.00
% 0.45/1.09 weigh time 0.00
% 0.45/1.09 forward subsume time 0.00
% 0.45/1.09 back demod find time 0.00
% 0.45/1.09 conflict time 0.00
% 0.45/1.09 LRPO time 0.00
% 0.45/1.09 store clause time 0.00
% 0.45/1.09 disable clause time 0.00
% 0.45/1.09 prime paramod time 0.00
% 0.45/1.09 semantics time 0.00
% 0.45/1.09
% 0.45/1.09 EQP interrupted
%------------------------------------------------------------------------------