TSTP Solution File: GRP710-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:01 EDT 2022
% Result : Unsatisfiable 0.74s 1.28s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 5
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 6 RR)
% Number of literals : 34 ( 0 equ; 5 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 61 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,unit),A),
file('GRP710-11.p',unknown),
[] ).
cnf(2,plain,
equal(mult(unit,A),A),
file('GRP710-11.p',unknown),
[] ).
cnf(3,plain,
equal(mult(mult(mult(A,B),B),C),mult(A,mult(B,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(mult(A,i(A)),unit),
file('GRP710-11.p',unknown),
[] ).
cnf(5,plain,
equal(mult(i(A),A),unit),
file('GRP710-11.p',unknown),
[] ).
cnf(6,plain,
~ equal(mult(A,x4),x3),
file('GRP710-11.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,B),B),mult(A,mult(B,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),1]),1]),
[iquote('para(3,1),demod([1]),flip(1)')] ).
cnf(8,plain,
equal(mult(mult(A,mult(B,B)),C),mult(A,mult(B,mult(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),7]),
[iquote('back_demod(3),demod([7])')] ).
cnf(11,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,8]),2]),
[iquote('para(2,8),demod([2])')] ).
cnf(12,plain,
equal(mult(A,mult(B,mult(B,i(mult(A,mult(B,B)))))),unit),
inference(para,[status(thm),theory(equality)],[8,4]),
[iquote('para(8,4)')] ).
cnf(14,plain,
equal(mult(i(mult(A,A)),mult(A,mult(A,B))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,8]),2]),1]),
[iquote('para(5,8),demod([2]),flip(1)')] ).
cnf(19,plain,
equal(mult(mult(A,mult(B,mult(B,mult(C,C)))),D),mult(A,mult(B,mult(B,mult(C,mult(C,D)))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,8]),8]),
[iquote('para(8,8),demod([8])')] ).
cnf(29,plain,
equal(mult(i(mult(A,A)),A),i(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,14]),1]),
[iquote('para(4,14),demod([1])')] ).
cnf(30,plain,
equal(i(i(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,14]),1,29]),
[iquote('para(5,14),demod([1,29])')] ).
cnf(31,plain,
equal(mult(i(mult(mult(A,B),mult(A,B))),mult(mult(A,B),mult(A,mult(B,B)))),B),
inference(para,[status(thm),theory(equality)],[7,14]),
[iquote('para(7,14)')] ).
cnf(34,plain,
equal(mult(A,mult(A,i(mult(B,mult(A,A))))),i(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,14]),1,29]),1]),
[iquote('para(12,14),demod([1,29]),flip(1)')] ).
cnf(59,plain,
~ equal(mult(A,mult(B,mult(B,mult(C,mult(C,x4))))),x3),
inference(para,[status(thm),theory(equality)],[19,6]),
[iquote('para(19,6)')] ).
cnf(73,plain,
~ equal(mult(A,i(mult(B,mult(B,x4)))),x3),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,59]),1]),
[iquote('para(5,59),demod([1])')] ).
cnf(168,plain,
equal(i(mult(A,mult(B,B))),mult(i(mult(B,B)),i(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,14]),1]),
[iquote('para(34,14),flip(1)')] ).
cnf(171,plain,
equal(i(mult(i(mult(A,A)),i(B))),mult(B,mult(A,A))),
inference(para,[status(thm),theory(equality)],[168,30]),
[iquote('para(168,30)')] ).
cnf(178,plain,
equal(i(mult(i(mult(A,A)),B)),mult(i(B),mult(A,A))),
inference(para,[status(thm),theory(equality)],[30,171]),
[iquote('para(30,171)')] ).
cnf(351,plain,
equal(mult(i(A),mult(A,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,178]),30]),1]),
[iquote('para(29,178),demod([30]),flip(1)')] ).
cnf(356,plain,
equal(i(mult(i(A),i(A))),mult(A,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[351,14]),5,1]),
[iquote('para(351,14),demod([5,1])')] ).
cnf(361,plain,
equal(i(mult(A,A)),mult(i(A),i(A))),
inference(para,[status(thm),theory(equality)],[356,30]),
[iquote('para(356,30)')] ).
cnf(381,plain,
equal(i(mult(i(A),mult(i(A),B))),mult(i(B),mult(A,A))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[178]),361,11]),
[iquote('back_demod(178),demod([361,11])')] ).
cnf(397,plain,
equal(mult(i(mult(A,B)),mult(i(mult(A,B)),mult(mult(A,B),mult(A,mult(B,B))))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),361,11]),
[iquote('back_demod(31),demod([361,11])')] ).
cnf(398,plain,
equal(mult(i(A),mult(i(A),mult(A,mult(A,B)))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),361,11]),
[iquote('back_demod(14),demod([361,11])')] ).
cnf(435,plain,
equal(i(mult(A,mult(A,B))),mult(i(B),mult(i(A),i(A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,381]),30]),
[iquote('para(30,381),demod([30])')] ).
cnf(458,plain,
~ equal(mult(A,mult(i(x4),mult(i(B),i(B)))),x3),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[73]),435]),
[iquote('back_demod(73),demod([435])')] ).
cnf(481,plain,
~ equal(mult(A,mult(i(x4),mult(B,B))),x3),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,458]),30]),
[iquote('para(30,458),demod([30])')] ).
cnf(647,plain,
equal(mult(i(A),mult(A,mult(A,B))),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[351,8]),1]),
[iquote('para(351,8),flip(1)')] ).
cnf(648,plain,
equal(mult(i(A),mult(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[398]),647]),
[iquote('back_demod(398),demod([647])')] ).
cnf(649,plain,
equal(mult(i(mult(A,B)),mult(A,mult(B,B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[397]),648]),
[iquote('back_demod(397),demod([648])')] ).
cnf(650,plain,
$false,
inference(conflict,[status(thm)],[649,481]),
[iquote('conflict(649,481)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP710-11 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 10:19:12 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.28 ----- EQP 0.9e, May 2009 -----
% 0.74/1.28 The job began on n021.cluster.edu, Mon Jun 13 10:19:12 2022
% 0.74/1.28 The command was "./eqp09e".
% 0.74/1.28
% 0.74/1.28 set(prolog_style_variables).
% 0.74/1.28 set(lrpo).
% 0.74/1.28 set(basic_paramod).
% 0.74/1.28 set(functional_subsume).
% 0.74/1.28 set(ordered_paramod).
% 0.74/1.28 set(prime_paramod).
% 0.74/1.28 set(para_pairs).
% 0.74/1.28 assign(pick_given_ratio,4).
% 0.74/1.28 clear(print_kept).
% 0.74/1.28 clear(print_new_demod).
% 0.74/1.28 clear(print_back_demod).
% 0.74/1.28 clear(print_given).
% 0.74/1.28 assign(max_mem,64000).
% 0.74/1.28 end_of_commands.
% 0.74/1.28
% 0.74/1.28 Usable:
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Sos:
% 0.74/1.28 0 (wt=-1) [] mult(A,unit) = A.
% 0.74/1.28 0 (wt=-1) [] mult(unit,A) = A.
% 0.74/1.28 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C).
% 0.74/1.28 0 (wt=-1) [] mult(A,i(A)) = unit.
% 0.74/1.28 0 (wt=-1) [] mult(i(A),A) = unit.
% 0.74/1.28 0 (wt=-1) [] -(mult(A,x4) = x3).
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Demodulators:
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Passive:
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Starting to process input.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 1 (wt=5) [] mult(A,unit) = A.
% 0.74/1.28 1 is a new demodulator.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 2 (wt=5) [] mult(unit,A) = A.
% 0.74/1.28 2 is a new demodulator.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.74/1.28 3 is a new demodulator.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.74/1.28 4 is a new demodulator.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 5 (wt=6) [] mult(i(A),A) = unit.
% 0.74/1.28 5 is a new demodulator.
% 0.74/1.28
% 0.74/1.28 ** KEPT: 6 (wt=5) [] -(mult(A,x4) = x3).
% 0.74/1.28 ---------------- PROOF FOUND ----------------
% 0.74/1.28 % SZS status Unsatisfiable
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 After processing input:
% 0.74/1.28
% 0.74/1.28 Usable:
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Sos:
% 0.74/1.28 1 (wt=5) [] mult(A,unit) = A.
% 0.74/1.28 2 (wt=5) [] mult(unit,A) = A.
% 0.74/1.28 6 (wt=5) [] -(mult(A,x4) = x3).
% 0.74/1.28 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.74/1.28 5 (wt=6) [] mult(i(A),A) = unit.
% 0.74/1.28 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Demodulators:
% 0.74/1.28 1 (wt=5) [] mult(A,unit) = A.
% 0.74/1.28 2 (wt=5) [] mult(unit,A) = A.
% 0.74/1.28 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.74/1.28 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.74/1.28 5 (wt=6) [] mult(i(A),A) = unit.
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 Passive:
% 0.74/1.28 end_of_list.
% 0.74/1.28
% 0.74/1.28 UNIT CONFLICT from 649 and 481 at 0.14 seconds.
% 0.74/1.28
% 0.74/1.28 ---------------- PROOF ----------------
% 0.74/1.28 % SZS output start Refutation
% See solution above
% 0.74/1.28 ------------ end of proof -------------
% 0.74/1.28
% 0.74/1.28
% 0.74/1.28 ------------- memory usage ------------
% 0.74/1.28 Memory dynamically allocated (tp_alloc): 3417.
% 0.74/1.28 type (bytes each) gets frees in use avail bytes
% 0.74/1.28 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.74/1.28 term ( 16) 217757 181971 35786 57 697.5 K
% 0.74/1.28 gen_ptr ( 8) 270646 12632 258014 33 2016.0 K
% 0.74/1.28 context ( 808) 94492 94490 2 7 7.1 K
% 0.74/1.28 trail ( 12) 167839 167839 0 13 0.2 K
% 0.74/1.28 bt_node ( 68) 22351 22346 5 53 3.9 K
% 0.74/1.28 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.28 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.28 ac_match_free_vars_pos (4020)
% 0.74/1.28 0 0 0 0 0.0 K
% 0.74/1.28 discrim ( 12) 35878 4852 31026 44 364.1 K
% 0.74/1.28 flat ( 40) 730383 730383 0 506 19.8 K
% 0.74/1.28 discrim_pos ( 12) 5119 5119 0 1 0.0 K
% 0.74/1.28 fpa_head ( 12) 1702 0 1702 0 19.9 K
% 0.74/1.28 fpa_tree ( 28) 9104 9104 0 53 1.4 K
% 0.74/1.28 fpa_pos ( 36) 949 949 0 1 0.0 K
% 0.74/1.28 literal ( 12) 1645 996 649 1 7.6 K
% 0.74/1.28 clause ( 24) 1645 996 649 1 15.2 K
% 0.74/1.28 list ( 12) 359 301 58 1 0.7 K
% 0.74/1.28 list_pos ( 20) 2532 617 1915 8 37.6 K
% 0.74/1.28 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.28
% 0.74/1.28 -------------- statistics -------------
% 0.74/1.28 Clauses input 6
% 0.74/1.28 Usable input 0
% 0.74/1.28 Sos input 6
% 0.74/1.28 Demodulators input 0
% 0.74/1.28 Passive input 0
% 0.74/1.28
% 0.74/1.28 Processed BS (before search) 6
% 0.74/1.28 Forward subsumed BS 0
% 0.74/1.28 Kept BS 6
% 0.74/1.28 New demodulators BS 5
% 0.74/1.28 Back demodulated BS 0
% 0.74/1.28
% 0.74/1.28 Clauses or pairs given 3156
% 0.74/1.28 Clauses generated 1330
% 0.74/1.28 Forward subsumed 687
% 0.74/1.28 Deleted by weight 0
% 0.74/1.28 Deleted by variable count 0
% 0.74/1.28 Kept 643
% 0.74/1.28 New demodulators 295
% 0.74/1.28 Back demodulated 133
% 0.74/1.28 Ordered paramod prunes 0
% 0.74/1.28 Basic paramod prunes 3800
% 0.74/1.28 Prime paramod prunes 1255
% 0.74/1.28 Semantic prunes 0
% 0.74/1.28
% 0.74/1.28 Rewrite attmepts 47706
% 0.74/1.28 Rewrites 3546
% 0.74/1.28
% 0.74/1.28 FPA overloads 0
% 0.74/1.28 FPA underloads 0
% 0.74/1.28
% 0.74/1.28 Usable size 0
% 0.74/1.28 Sos size 515
% 0.74/1.28 Demodulators size 221
% 0.74/1.28 Passive size 0
% 0.74/1.28 Disabled size 133
% 0.74/1.28
% 0.74/1.28 Proofs found 1
% 0.74/1.28
% 0.74/1.28 ----------- times (seconds) ----------- Mon Jun 13 10:19:13 2022
% 0.74/1.28
% 0.74/1.28 user CPU time 0.14 (0 hr, 0 min, 0 sec)
% 0.74/1.28 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.74/1.28 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.74/1.28 input time 0.00
% 0.74/1.28 paramodulation time 0.03
% 0.74/1.28 demodulation time 0.03
% 0.74/1.28 orient time 0.01
% 0.74/1.28 weigh time 0.00
% 0.74/1.28 forward subsume time 0.00
% 0.74/1.28 back demod find time 0.01
% 0.74/1.28 conflict time 0.02
% 0.74/1.28 LRPO time 0.00
% 0.74/1.28 store clause time 0.02
% 0.74/1.28 disable clause time 0.00
% 0.74/1.28 prime paramod time 0.01
% 0.74/1.28 semantics time 0.00
% 0.74/1.28
% 0.74/1.28 EQP interrupted
%------------------------------------------------------------------------------