TSTP Solution File: GRP657-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:39 EDT 2022
% Result : Unsatisfiable 0.74s 1.40s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 3 RR)
% Number of literals : 31 ( 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; 0 con; 1-2 aty)
% Number of variables : 65 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP657-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP657-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP657-10.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP657-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(mult(A,B),mult(C,A)),mult(A,mult(mult(B,C),A))),
file('GRP657-10.p',unknown),
[] ).
cnf(6,plain,
equal(mult(A,mult(mult(B,C),A)),mult(mult(A,B),mult(C,A))),
inference(flip,[status(thm),theory(equality)],[5]),
[iquote('flip(5)')] ).
cnf(7,plain,
~ equal(tuple(mult(A,x1(A)),mult(x1_2(A),A)),tuple(x1(A),x1_2(A))),
file('GRP657-10.p',unknown),
[] ).
cnf(9,plain,
equal(rd(A,ld(B,A)),B),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(17,plain,
equal(rd(mult(A,mult(mult(B,C),A)),mult(C,A)),mult(A,B)),
inference(para,[status(thm),theory(equality)],[5,4]),
[iquote('para(5,4)')] ).
cnf(54,plain,
equal(rd(mult(A,mult(B,A)),mult(C,A)),mult(A,rd(B,C))),
inference(para,[status(thm),theory(equality)],[3,17]),
[iquote('para(3,17)')] ).
cnf(129,plain,
equal(mult(A,rd(B,B)),A),
inference(para,[status(thm),theory(equality)],[54,4]),
[iquote('para(54,4)')] ).
cnf(130,plain,
equal(ld(A,A),rd(B,B)),
inference(para,[status(thm),theory(equality)],[129,2]),
[iquote('para(129,2)')] ).
cnf(131,plain,
equal(rd(A,A),ld(B,B)),
inference(flip,[status(thm),theory(equality)],[130]),
[iquote('flip(130)')] ).
cnf(133,plain,
equal(rd(A,A),rd(B,B)),
inference(para,[status(thm),theory(equality)],[130,130]),
[iquote('para(130,130)')] ).
cnf(138,plain,
equal(mult(ld(A,A),B),B),
inference(para,[status(thm),theory(equality)],[131,3]),
[iquote('para(131,3)')] ).
cnf(143,plain,
equal(mult(rd(A,A),B),B),
inference(para,[status(thm),theory(equality)],[133,3]),
[iquote('para(133,3)')] ).
cnf(182,plain,
equal(mult(mult(A,B),A),mult(A,mult(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[129,6]),143]),1]),
[iquote('para(129,6),demod([143]),flip(1)')] ).
cnf(183,plain,
equal(mult(A,mult(ld(A,B),A)),mult(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,182]),1]),
[iquote('para(1,182),flip(1)')] ).
cnf(189,plain,
equal(rd(mult(A,mult(B,A)),A),mult(A,B)),
inference(para,[status(thm),theory(equality)],[182,4]),
[iquote('para(182,4)')] ).
cnf(193,plain,
equal(mult(ld(A,B),A),ld(A,mult(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[183,2]),1]),
[iquote('para(183,2),flip(1)')] ).
cnf(211,plain,
equal(rd(mult(A,B),A),mult(A,rd(B,A))),
inference(para,[status(thm),theory(equality)],[3,189]),
[iquote('para(3,189)')] ).
cnf(237,plain,
equal(rd(A,A),mult(A,rd(rd(B,B),A))),
inference(para,[status(thm),theory(equality)],[129,211]),
[iquote('para(129,211)')] ).
cnf(238,plain,
equal(mult(A,rd(rd(B,B),A)),rd(A,A)),
inference(flip,[status(thm),theory(equality)],[237]),
[iquote('flip(237)')] ).
cnf(270,plain,
equal(ld(A,rd(A,A)),rd(rd(B,B),A)),
inference(para,[status(thm),theory(equality)],[238,2]),
[iquote('para(238,2)')] ).
cnf(341,plain,
equal(ld(A,ld(B,B)),rd(rd(C,C),A)),
inference(para,[status(thm),theory(equality)],[131,270]),
[iquote('para(131,270)')] ).
cnf(342,plain,
equal(rd(rd(A,A),B),ld(B,ld(C,C))),
inference(flip,[status(thm),theory(equality)],[341]),
[iquote('flip(341)')] ).
cnf(401,plain,
equal(ld(ld(A,rd(B,B)),ld(C,C)),A),
inference(para,[status(thm),theory(equality)],[342,9]),
[iquote('para(342,9)')] ).
cnf(532,plain,
equal(ld(A,A),ld(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[401,1]),193,143]),
[iquote('para(401,1),demod([193,143])')] ).
cnf(535,plain,
equal(mult(A,ld(B,B)),A),
inference(para,[status(thm),theory(equality)],[532,1]),
[iquote('para(532,1)')] ).
cnf(2590,plain,
~ equal(tuple(x1(ld(A,A)),x1_2(ld(A,A))),tuple(x1(ld(A,A)),x1_2(ld(A,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[138,7]),535]),
[iquote('para(138,7),demod([535])')] ).
cnf(2591,plain,
$false,
inference(conflict,[status(thm)],[2590]),
[iquote('xx_conflict(2590)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP657-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n010.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 12:06:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.74/1.40 ----- EQP 0.9e, May 2009 -----
% 0.74/1.40 The job began on n010.cluster.edu, Tue Jun 14 12:06:10 2022
% 0.74/1.40 The command was "./eqp09e".
% 0.74/1.40
% 0.74/1.40 set(prolog_style_variables).
% 0.74/1.40 set(lrpo).
% 0.74/1.40 set(basic_paramod).
% 0.74/1.40 set(functional_subsume).
% 0.74/1.40 set(ordered_paramod).
% 0.74/1.40 set(prime_paramod).
% 0.74/1.40 set(para_pairs).
% 0.74/1.40 assign(pick_given_ratio,4).
% 0.74/1.40 clear(print_kept).
% 0.74/1.40 clear(print_new_demod).
% 0.74/1.40 clear(print_back_demod).
% 0.74/1.40 clear(print_given).
% 0.74/1.40 assign(max_mem,64000).
% 0.74/1.40 end_of_commands.
% 0.74/1.40
% 0.74/1.40 Usable:
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Sos:
% 0.74/1.40 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.74/1.40 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.74/1.40 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.74/1.40 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.74/1.40 0 (wt=-1) [] mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)).
% 0.74/1.40 0 (wt=-1) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Demodulators:
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Passive:
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Starting to process input.
% 0.74/1.40
% 0.74/1.40 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.40 1 is a new demodulator.
% 0.74/1.40
% 0.74/1.40 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.40 2 is a new demodulator.
% 0.74/1.40
% 0.74/1.40 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.40 3 is a new demodulator.
% 0.74/1.40
% 0.74/1.40 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.40 4 is a new demodulator.
% 0.74/1.40
% 0.74/1.40 ** KEPT: 5 (wt=15) [] mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)).
% 0.74/1.40
% 0.74/1.40 ** KEPT: 6 (wt=15) [flip(5)] mult(A,mult(mult(B,C),A)) = mult(mult(A,B),mult(C,A)).
% 0.74/1.40 clause forward subsumed: 0 (wt=15) [flip(6)] mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)).
% 0.74/1.40
% 0.74/1.40 ** KEPT: 7 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.40 ---------------- PROOF FOUND ----------------
% 0.74/1.40 % SZS status Unsatisfiable
% 0.74/1.40
% 0.74/1.40
% 0.74/1.40 After processing input:
% 0.74/1.40
% 0.74/1.40 Usable:
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Sos:
% 0.74/1.40 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.40 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.40 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.40 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.40 5 (wt=15) [] mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)).
% 0.74/1.40 6 (wt=15) [flip(5)] mult(A,mult(mult(B,C),A)) = mult(mult(A,B),mult(C,A)).
% 0.74/1.40 7 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Demodulators:
% 0.74/1.40 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.40 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.40 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.40 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 Passive:
% 0.74/1.40 end_of_list.
% 0.74/1.40
% 0.74/1.40 UNIT CONFLICT from 2590 and x=x at 0.22 seconds.
% 0.74/1.40
% 0.74/1.40 ---------------- PROOF ----------------
% 0.74/1.40 % SZS output start Refutation
% See solution above
% 0.74/1.40 ------------ end of proof -------------
% 0.74/1.40
% 0.74/1.40
% 0.74/1.40 ------------- memory usage ------------
% 0.74/1.40 Memory dynamically allocated (tp_alloc): 7812.
% 0.74/1.40 type (bytes each) gets frees in use avail bytes
% 0.74/1.40 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.40 term ( 16) 225169 120569 104600 48 2033.8 K
% 0.74/1.40 gen_ptr ( 8) 516632 16168 500464 30 3910.1 K
% 0.74/1.40 context ( 808) 128519 128517 2 3 3.9 K
% 0.74/1.40 trail ( 12) 15844 15844 0 6 0.1 K
% 0.74/1.40 bt_node ( 68) 25242 25239 3 16 1.3 K
% 0.74/1.40 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.40 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.40 ac_match_free_vars_pos (4020)
% 0.74/1.40 0 0 0 0 0.0 K
% 0.74/1.40 discrim ( 12) 85827 3640 82187 0 963.1 K
% 0.74/1.40 flat ( 40) 716272 716272 0 111 4.3 K
% 0.74/1.40 discrim_pos ( 12) 3781 3781 0 1 0.0 K
% 0.74/1.40 fpa_head ( 12) 8274 0 8274 0 97.0 K
% 0.74/1.40 fpa_tree ( 28) 3272 3272 0 19 0.5 K
% 0.74/1.40 fpa_pos ( 36) 3175 3175 0 1 0.0 K
% 0.74/1.40 literal ( 12) 9245 6655 2590 1 30.4 K
% 0.74/1.40 clause ( 24) 9245 6655 2590 1 60.7 K
% 0.74/1.40 list ( 12) 645 589 56 6 0.7 K
% 0.74/1.40 list_pos ( 20) 8902 1182 7720 0 150.8 K
% 0.74/1.40 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.40
% 0.74/1.40 -------------- statistics -------------
% 0.74/1.40 Clauses input 6
% 0.74/1.40 Usable input 0
% 0.74/1.40 Sos input 6
% 0.74/1.40 Demodulators input 0
% 0.74/1.40 Passive input 0
% 0.74/1.40
% 0.74/1.40 Processed BS (before search) 8
% 0.74/1.40 Forward subsumed BS 1
% 0.74/1.40 Kept BS 7
% 0.74/1.40 New demodulators BS 4
% 0.74/1.40 Back demodulated BS 0
% 0.74/1.40
% 0.74/1.40 Clauses or pairs given 3852
% 0.74/1.40 Clauses generated 4868
% 0.74/1.40 Forward subsumed 2285
% 0.74/1.40 Deleted by weight 0
% 0.74/1.40 Deleted by variable count 0
% 0.74/1.40 Kept 2583
% 0.74/1.40 New demodulators 582
% 0.74/1.40 Back demodulated 250
% 0.74/1.40 Ordered paramod prunes 0
% 0.74/1.40 Basic paramod prunes 10217
% 0.74/1.40 Prime paramod prunes 184
% 0.74/1.40 Semantic prunes 0
% 0.74/1.40
% 0.74/1.40 Rewrite attmepts 89429
% 0.74/1.40 Rewrites 2022
% 0.74/1.40
% 0.74/1.40 FPA overloads 0
% 0.74/1.40 FPA underloads 0
% 0.74/1.40
% 0.74/1.40 Usable size 0
% 0.74/1.40 Sos size 2339
% 0.74/1.40 Demodulators size 453
% 0.74/1.40 Passive size 0
% 0.74/1.40 Disabled size 250
% 0.74/1.40
% 0.74/1.40 Proofs found 1
% 0.74/1.40
% 0.74/1.40 ----------- times (seconds) ----------- Tue Jun 14 12:06:10 2022
% 0.74/1.40
% 0.74/1.40 user CPU time 0.22 (0 hr, 0 min, 0 sec)
% 0.74/1.40 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.74/1.40 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.40 input time 0.00
% 0.74/1.40 paramodulation time 0.03
% 0.74/1.40 demodulation time 0.04
% 0.74/1.40 orient time 0.01
% 0.74/1.40 weigh time 0.00
% 0.74/1.40 forward subsume time 0.02
% 0.74/1.40 back demod find time 0.01
% 0.74/1.40 conflict time 0.00
% 0.74/1.40 LRPO time 0.01
% 0.74/1.40 store clause time 0.06
% 0.74/1.40 disable clause time 0.00
% 0.74/1.40 prime paramod time 0.01
% 0.74/1.40 semantics time 0.00
% 0.74/1.40
% 0.74/1.40 EQP interrupted
%------------------------------------------------------------------------------