TSTP Solution File: GRP699-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:55 EDT 2022
% Result : Unsatisfiable 0.73s 1.38s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 2 RR)
% Number of literals : 30 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP699-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP699-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP699-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP699-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP699-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP699-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(mult(A,B),A),mult(A,C)),mult(A,mult(mult(mult(B,A),A),C))),
file('GRP699-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(A,mult(B,mult(B,C))),B),mult(mult(A,B),mult(B,mult(C,B)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
~ equal(mult(mult(a,c),ld(c,mult(b,c))),mult(mult(a,b),c)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(26,plain,
equal(mult(mult(mult(A,B),A),A),mult(A,mult(mult(B,A),A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,7]),5]),
[iquote('para(5,7),demod([5])')] ).
cnf(50,plain,
equal(mult(mult(A,mult(B,C)),B),mult(mult(A,B),mult(B,mult(ld(B,C),B)))),
inference(para,[status(thm),theory(equality)],[1,9]),
[iquote('para(1,9)')] ).
cnf(57,plain,
equal(mult(A,mult(mult(ld(A,B),A),A)),mult(mult(B,A),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,26]),1]),
[iquote('para(1,26),flip(1)')] ).
cnf(61,plain,
equal(rd(mult(A,mult(mult(B,A),A)),A),mult(mult(A,B),A)),
inference(para,[status(thm),theory(equality)],[26,4]),
[iquote('para(26,4)')] ).
cnf(68,plain,
equal(mult(mult(ld(A,B),A),A),ld(A,mult(mult(B,A),A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,2]),1]),
[iquote('para(57,2),flip(1)')] ).
cnf(90,plain,
equal(rd(mult(A,mult(B,A)),A),mult(mult(A,rd(B,A)),A)),
inference(para,[status(thm),theory(equality)],[3,61]),
[iquote('para(3,61)')] ).
cnf(185,plain,
equal(rd(ld(A,mult(mult(B,A),A)),A),mult(ld(A,B),A)),
inference(para,[status(thm),theory(equality)],[68,4]),
[iquote('para(68,4)')] ).
cnf(194,plain,
equal(mult(mult(A,rd(rd(B,A),A)),A),rd(mult(A,B),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,90]),1]),
[iquote('para(3,90),flip(1)')] ).
cnf(406,plain,
equal(rd(ld(A,mult(B,A)),A),mult(ld(A,rd(B,A)),A)),
inference(para,[status(thm),theory(equality)],[3,185]),
[iquote('para(3,185)')] ).
cnf(442,plain,
equal(mult(ld(A,rd(rd(B,A),A)),A),rd(ld(A,B),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,406]),1]),
[iquote('para(3,406),flip(1)')] ).
cnf(543,plain,
equal(mult(mult(A,B),A),mult(A,mult(A,mult(ld(A,B),A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,50]),6]),
[iquote('para(6,50),demod([6])')] ).
cnf(746,plain,
equal(rd(mult(A,B),A),mult(A,mult(A,rd(ld(A,B),A)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[194]),543,442]),1]),
[iquote('back_demod(194),demod([543,442]),flip(1)')] ).
cnf(802,plain,
equal(mult(mult(A,B),C),mult(mult(A,C),mult(C,mult(ld(C,ld(C,B)),C)))),
inference(para,[status(thm),theory(equality)],[1,50]),
[iquote('para(1,50)')] ).
cnf(803,plain,
equal(mult(mult(A,B),mult(B,mult(ld(B,ld(B,C)),B))),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[802]),
[iquote('flip(802)')] ).
cnf(809,plain,
equal(mult(A,mult(A,rd(ld(A,ld(A,B)),A))),rd(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,746]),1]),
[iquote('para(1,746),flip(1)')] ).
cnf(813,plain,
equal(mult(A,rd(ld(A,ld(A,B)),A)),ld(A,rd(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[809,2]),1]),
[iquote('para(809,2),flip(1)')] ).
cnf(815,plain,
equal(rd(ld(A,ld(A,B)),A),ld(A,ld(A,rd(B,A)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[813,2]),1]),
[iquote('para(813,2),flip(1)')] ).
cnf(817,plain,
equal(mult(ld(A,ld(A,rd(B,A))),A),ld(A,ld(A,B))),
inference(para,[status(thm),theory(equality)],[815,3]),
[iquote('para(815,3)')] ).
cnf(819,plain,
equal(mult(ld(A,ld(A,B)),A),ld(A,ld(A,mult(B,A)))),
inference(para,[status(thm),theory(equality)],[4,817]),
[iquote('para(4,817)')] ).
cnf(820,plain,
equal(mult(mult(A,B),ld(B,mult(C,B))),mult(mult(A,C),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[803]),819,1]),
[iquote('back_demod(803),demod([819,1])')] ).
cnf(821,plain,
$false,
inference(conflict,[status(thm)],[820,10]),
[iquote('conflict(820,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP699-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n014.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 09:41:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.38 ----- EQP 0.9e, May 2009 -----
% 0.73/1.38 The job began on n014.cluster.edu, Tue Jun 14 09:41:37 2022
% 0.73/1.38 The command was "./eqp09e".
% 0.73/1.38
% 0.73/1.38 set(prolog_style_variables).
% 0.73/1.38 set(lrpo).
% 0.73/1.38 set(basic_paramod).
% 0.73/1.38 set(functional_subsume).
% 0.73/1.38 set(ordered_paramod).
% 0.73/1.38 set(prime_paramod).
% 0.73/1.38 set(para_pairs).
% 0.73/1.38 assign(pick_given_ratio,4).
% 0.73/1.38 clear(print_kept).
% 0.73/1.38 clear(print_new_demod).
% 0.73/1.38 clear(print_back_demod).
% 0.73/1.38 clear(print_given).
% 0.73/1.38 assign(max_mem,64000).
% 0.73/1.38 end_of_commands.
% 0.73/1.38
% 0.73/1.38 Usable:
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Sos:
% 0.73/1.38 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.73/1.38 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.73/1.38 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.73/1.38 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.73/1.38 0 (wt=-1) [] mult(A,unit) = A.
% 0.73/1.38 0 (wt=-1) [] mult(unit,A) = A.
% 0.73/1.38 0 (wt=-1) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.73/1.38 0 (wt=-1) [] mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B).
% 0.73/1.38 0 (wt=-1) [] -(mult(mult(a,b),c) = mult(mult(a,c),ld(c,mult(b,c)))).
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Demodulators:
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Passive:
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Starting to process input.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.38 1 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.38 2 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.38 3 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.38 4 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.38 5 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.38 6 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 7 (wt=19) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.73/1.38
% 0.73/1.38 ** KEPT: 8 (wt=19) [flip(7)] mult(A,mult(mult(mult(B,A),A),C)) = mult(mult(mult(A,B),A),mult(A,C)).
% 0.73/1.38 clause forward subsumed: 0 (wt=19) [flip(8)] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.73/1.38
% 0.73/1.38 ** KEPT: 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.73/1.38 9 is a new demodulator.
% 0.73/1.38
% 0.73/1.38 ** KEPT: 10 (wt=15) [flip(1)] -(mult(mult(a,c),ld(c,mult(b,c))) = mult(mult(a,b),c)).
% 0.73/1.38 ---------------- PROOF FOUND ----------------
% 0.73/1.38 % SZS status Unsatisfiable
% 0.73/1.38
% 0.73/1.38
% 0.73/1.38 After processing input:
% 0.73/1.38
% 0.73/1.38 Usable:
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Sos:
% 0.73/1.38 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.38 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.38 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.38 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.38 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.38 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.38 10 (wt=15) [flip(1)] -(mult(mult(a,c),ld(c,mult(b,c))) = mult(mult(a,b),c)).
% 0.73/1.38 7 (wt=19) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.73/1.38 8 (wt=19) [flip(7)] mult(A,mult(mult(mult(B,A),A),C)) = mult(mult(mult(A,B),A),mult(A,C)).
% 0.73/1.38 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Demodulators:
% 0.73/1.38 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.73/1.38 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.73/1.38 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.73/1.38 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.73/1.38 5 (wt=5) [] mult(A,unit) = A.
% 0.73/1.38 6 (wt=5) [] mult(unit,A) = A.
% 0.73/1.38 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 Passive:
% 0.73/1.38 end_of_list.
% 0.73/1.38
% 0.73/1.38 UNIT CONFLICT from 820 and 10 at 0.25 seconds.
% 0.73/1.38
% 0.73/1.38 ---------------- PROOF ----------------
% 0.73/1.38 % SZS output start Refutation
% See solution above
% 0.73/1.38 ------------ end of proof -------------
% 0.73/1.38
% 0.73/1.38
% 0.73/1.38 ------------- memory usage ------------
% 0.73/1.38 Memory dynamically allocated (tp_alloc): 7324.
% 0.73/1.38 type (bytes each) gets frees in use avail bytes
% 0.73/1.38 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.73/1.38 term ( 16) 392943 309345 83598 3326 1694.6 K
% 0.73/1.38 gen_ptr ( 8) 678116 108324 569792 29 4451.7 K
% 0.73/1.38 context ( 808) 139286 139284 2 6 6.3 K
% 0.73/1.38 trail ( 12) 29896 29896 0 6 0.1 K
% 0.73/1.38 bt_node ( 68) 12794 12791 3 20 1.5 K
% 0.73/1.38 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.38 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.38 ac_match_free_vars_pos (4020)
% 0.73/1.38 0 0 0 0 0.0 K
% 0.73/1.38 discrim ( 12) 86152 80161 5991 31962 444.8 K
% 0.73/1.38 flat ( 40) 1086601 1086601 0 695 27.1 K
% 0.73/1.38 discrim_pos ( 12) 7077 7077 0 1 0.0 K
% 0.73/1.38 fpa_head ( 12) 15206 0 15206 0 178.2 K
% 0.73/1.38 fpa_tree ( 28) 5060 5060 0 119 3.3 K
% 0.73/1.38 fpa_pos ( 36) 1294 1294 0 1 0.0 K
% 0.73/1.38 literal ( 12) 3063 2243 820 1 9.6 K
% 0.73/1.38 clause ( 24) 3063 2243 820 1 19.2 K
% 0.73/1.38 list ( 12) 533 476 57 5 0.7 K
% 0.73/1.38 list_pos ( 20) 4412 3154 1258 653 37.3 K
% 0.73/1.38 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.38
% 0.73/1.38 -------------- statistics -------------
% 0.73/1.38 Clauses input 9
% 0.73/1.38 Usable input 0
% 0.73/1.38 Sos input 9
% 0.73/1.38 Demodulators input 0
% 0.73/1.38 Passive input 0
% 0.73/1.38
% 0.73/1.38 Processed BS (before search) 11
% 0.73/1.38 Forward subsumed BS 1
% 0.73/1.38 Kept BS 10
% 0.73/1.38 New demodulators BS 7
% 0.73/1.38 Back demodulated BS 0
% 0.73/1.38
% 0.73/1.38 Clauses or pairs given 1692
% 0.73/1.38 Clauses generated 1805
% 0.73/1.38 Forward subsumed 995
% 0.73/1.38 Deleted by weight 0
% 0.73/1.38 Deleted by variable count 0
% 0.73/1.38 Kept 810
% 0.73/1.38 New demodulators 467
% 0.73/1.38 Back demodulated 668
% 0.73/1.38 Ordered paramod prunes 0
% 0.73/1.38 Basic paramod prunes 4685
% 0.73/1.38 Prime paramod prunes 132
% 0.73/1.38 Semantic prunes 0
% 0.73/1.38
% 0.73/1.38 Rewrite attmepts 120829
% 0.73/1.38 Rewrites 6681
% 0.73/1.38
% 0.73/1.38 FPA overloads 0
% 0.73/1.38 FPA underloads 0
% 0.73/1.38
% 0.73/1.38 Usable size 0
% 0.73/1.38 Sos size 151
% 0.73/1.38 Demodulators size 129
% 0.73/1.38 Passive size 0
% 0.73/1.38 Disabled size 668
% 0.73/1.38
% 0.73/1.38 Proofs found 1
% 0.73/1.38
% 0.73/1.38 ----------- times (seconds) ----------- Tue Jun 14 09:41:37 2022
% 0.73/1.38
% 0.73/1.38 user CPU time 0.25 (0 hr, 0 min, 0 sec)
% 0.73/1.38 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.73/1.38 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.38 input time 0.00
% 0.73/1.38 paramodulation time 0.01
% 0.73/1.38 demodulation time 0.07
% 0.73/1.38 orient time 0.02
% 0.73/1.38 weigh time 0.01
% 0.73/1.38 forward subsume time 0.01
% 0.73/1.38 back demod find time 0.01
% 0.73/1.38 conflict time 0.00
% 0.73/1.38 LRPO time 0.01
% 0.73/1.38 store clause time 0.10
% 0.73/1.38 disable clause time 0.01
% 0.73/1.38 prime paramod time 0.00
% 0.73/1.38 semantics time 0.00
% 0.73/1.38
% 0.73/1.38 EQP interrupted
%------------------------------------------------------------------------------