TSTP Solution File: GRP680-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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.78s 1.20s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of clauses : 31 ( 31 unt; 0 nHn; 5 RR)
% Number of literals : 31 ( 0 equ; 4 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 42 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP680-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP680-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP680-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP680-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,A)),C),mult(A,mult(B,mult(A,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(i(A),mult(A,B)),B),
file('GRP680-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP680-1.p',unknown),
[] ).
cnf(10,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[9]),
[iquote('flip(9)')] ).
cnf(11,plain,
~ equal(mult(i(op_c),a),mult(a,i(op_c))),
file('GRP680-1.p',unknown),
[] ).
cnf(12,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(15,plain,
equal(ld(rd(A,B),A),B),
inference(para,[status(thm),theory(equality)],[3,2]),
[iquote('para(3,2)')] ).
cnf(28,plain,
equal(mult(i(A),B),ld(A,B)),
inference(para,[status(thm),theory(equality)],[1,8]),
[iquote('para(1,8)')] ).
cnf(29,plain,
~ equal(mult(a,i(op_c)),ld(op_c,a)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),28]),1]),
[iquote('back_demod(11),demod([28]),flip(1)')] ).
cnf(30,plain,
equal(mult(ld(op_c,A),op_c),A),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(39,plain,
equal(mult(op_c,mult(A,mult(B,A))),mult(A,mult(B,mult(A,op_c)))),
inference(para,[status(thm),theory(equality)],[10,7]),
[iquote('para(10,7)')] ).
cnf(40,plain,
equal(mult(A,mult(B,mult(A,op_c))),mult(op_c,mult(A,mult(B,A)))),
inference(flip,[status(thm),theory(equality)],[39]),
[iquote('flip(39)')] ).
cnf(41,plain,
equal(i(A),ld(A,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[28,5]),1]),
[iquote('para(28,5),flip(1)')] ).
cnf(42,plain,
~ equal(mult(a,ld(op_c,unit)),ld(op_c,a)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[29]),41]),
[iquote('back_demod(29),demod([41])')] ).
cnf(43,plain,
equal(mult(ld(A,unit),B),ld(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),41]),
[iquote('back_demod(28),demod([41])')] ).
cnf(44,plain,
equal(ld(ld(op_c,A),A),op_c),
inference(para,[status(thm),theory(equality)],[30,2]),
[iquote('para(30,2)')] ).
cnf(62,plain,
equal(ld(ld(A,unit),ld(A,B)),B),
inference(para,[status(thm),theory(equality)],[43,2]),
[iquote('para(43,2)')] ).
cnf(68,plain,
equal(mult(A,B),ld(rd(unit,A),B)),
inference(para,[status(thm),theory(equality)],[15,43]),
[iquote('para(15,43)')] ).
cnf(69,plain,
equal(ld(rd(unit,A),B),mult(A,B)),
inference(flip,[status(thm),theory(equality)],[68]),
[iquote('flip(68)')] ).
cnf(70,plain,
equal(mult(A,rd(unit,A)),unit),
inference(para,[status(thm),theory(equality)],[69,12]),
[iquote('para(69,12)')] ).
cnf(71,plain,
equal(rd(unit,A),ld(A,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[70,2]),1]),
[iquote('para(70,2),flip(1)')] ).
cnf(72,plain,
equal(mult(A,B),ld(ld(A,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[69]),71]),1]),
[iquote('back_demod(69),demod([71]),flip(1)')] ).
cnf(91,plain,
~ equal(ld(ld(a,unit),ld(op_c,unit)),ld(op_c,a)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),72]),
[iquote('back_demod(42),demod([72])')] ).
cnf(92,plain,
equal(ld(ld(A,unit),ld(ld(B,unit),ld(ld(A,unit),op_c))),ld(ld(op_c,unit),ld(ld(A,unit),ld(ld(B,unit),A)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),72,72,72,72,72,72]),
[iquote('back_demod(40),demod([72,72,72,72,72,72])')] ).
cnf(108,plain,
equal(ld(ld(A,unit),unit),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),72]),
[iquote('back_demod(5),demod([72])')] ).
cnf(480,plain,
equal(ld(ld(A,unit),ld(op_c,unit)),ld(op_c,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[44,92]),108,12,108,108,62]),1]),
[iquote('para(44,92),demod([108,12,108,108,62]),flip(1)')] ).
cnf(481,plain,
$false,
inference(conflict,[status(thm)],[480,91]),
[iquote('conflict(480,91)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP680-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 07:35:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.78/1.19 ----- EQP 0.9e, May 2009 -----
% 0.78/1.19 The job began on n016.cluster.edu, Tue Jun 14 07:35:46 2022
% 0.78/1.19 The command was "./eqp09e".
% 0.78/1.19
% 0.78/1.19 set(prolog_style_variables).
% 0.78/1.19 set(lrpo).
% 0.78/1.19 set(basic_paramod).
% 0.78/1.19 set(functional_subsume).
% 0.78/1.19 set(ordered_paramod).
% 0.78/1.19 set(prime_paramod).
% 0.78/1.19 set(para_pairs).
% 0.78/1.19 assign(pick_given_ratio,4).
% 0.78/1.19 clear(print_kept).
% 0.78/1.19 clear(print_new_demod).
% 0.78/1.19 clear(print_back_demod).
% 0.78/1.19 clear(print_given).
% 0.78/1.19 assign(max_mem,64000).
% 0.78/1.19 end_of_commands.
% 0.78/1.19
% 0.78/1.19 Usable:
% 0.78/1.19 end_of_list.
% 0.78/1.19
% 0.78/1.19 Sos:
% 0.78/1.19 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.78/1.19 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.78/1.19 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.78/1.19 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.78/1.19 0 (wt=-1) [] mult(A,unit) = A.
% 0.78/1.19 0 (wt=-1) [] mult(unit,A) = A.
% 0.78/1.19 0 (wt=-1) [] mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C).
% 0.78/1.19 0 (wt=-1) [] mult(i(A),mult(A,B)) = B.
% 0.78/1.19 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 0.78/1.19 0 (wt=-1) [] -(mult(i(op_c),a) = mult(a,i(op_c))).
% 0.78/1.19 end_of_list.
% 0.78/1.19
% 0.78/1.19 Demodulators:
% 0.78/1.19 end_of_list.
% 0.78/1.19
% 0.78/1.19 Passive:
% 0.78/1.19 end_of_list.
% 0.78/1.19
% 0.78/1.19 Starting to process input.
% 0.78/1.19
% 0.78/1.19 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.78/1.19 1 is a new demodulator.
% 0.78/1.19
% 0.78/1.19 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.78/1.20 2 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.78/1.20 3 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.78/1.20 4 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.78/1.20 5 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.78/1.20 6 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.78/1.20 7 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 8 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.78/1.20 8 is a new demodulator.
% 0.78/1.20
% 0.78/1.20 ** KEPT: 9 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.78/1.20
% 0.78/1.20 ** KEPT: 10 (wt=7) [flip(9)] mult(A,op_c) = mult(op_c,A).
% 0.78/1.20 clause forward subsumed: 0 (wt=7) [flip(10)] mult(op_c,A) = mult(A,op_c).
% 0.78/1.20
% 0.78/1.20 ** KEPT: 11 (wt=9) [] -(mult(i(op_c),a) = mult(a,i(op_c))).
% 0.78/1.20 ---------------- PROOF FOUND ----------------
% 0.78/1.20 % SZS status Unsatisfiable
% 0.78/1.20
% 0.78/1.20
% 0.78/1.20 After processing input:
% 0.78/1.20
% 0.78/1.20 Usable:
% 0.78/1.20 end_of_list.
% 0.78/1.20
% 0.78/1.20 Sos:
% 0.78/1.20 5 (wt=5) [] mult(A,unit) = A.
% 0.78/1.20 6 (wt=5) [] mult(unit,A) = A.
% 0.78/1.20 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.78/1.20 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.78/1.20 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.78/1.20 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.78/1.20 9 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.78/1.20 10 (wt=7) [flip(9)] mult(A,op_c) = mult(op_c,A).
% 0.78/1.20 8 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.78/1.20 11 (wt=9) [] -(mult(i(op_c),a) = mult(a,i(op_c))).
% 0.78/1.20 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.78/1.20 end_of_list.
% 0.78/1.20
% 0.78/1.20 Demodulators:
% 0.78/1.20 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.78/1.20 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.78/1.20 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.78/1.20 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.78/1.20 5 (wt=5) [] mult(A,unit) = A.
% 0.78/1.20 6 (wt=5) [] mult(unit,A) = A.
% 0.78/1.20 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 0.78/1.20 8 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.78/1.20 end_of_list.
% 0.78/1.20
% 0.78/1.20 Passive:
% 0.78/1.20 end_of_list.
% 0.78/1.20
% 0.78/1.20 UNIT CONFLICT from 480 and 91 at 0.10 seconds.
% 0.78/1.20
% 0.78/1.20 ---------------- PROOF ----------------
% 0.78/1.20 % SZS output start Refutation
% See solution above
% 0.78/1.20 ------------ end of proof -------------
% 0.78/1.20
% 0.78/1.20
% 0.78/1.20 ------------- memory usage ------------
% 0.78/1.20 Memory dynamically allocated (tp_alloc): 2441.
% 0.78/1.20 type (bytes each) gets frees in use avail bytes
% 0.78/1.20 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.78/1.20 term ( 16) 127286 101852 25434 50 495.9 K
% 0.78/1.20 gen_ptr ( 8) 181940 14567 167373 30 1307.8 K
% 0.78/1.20 context ( 808) 96180 96178 2 8 7.9 K
% 0.78/1.20 trail ( 12) 9333 9333 0 6 0.1 K
% 0.78/1.20 bt_node ( 68) 22718 22715 3 28 2.1 K
% 0.78/1.20 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.20 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.20 ac_match_free_vars_pos (4020)
% 0.78/1.20 0 0 0 0 0.0 K
% 0.78/1.20 discrim ( 12) 27486 4704 22782 0 267.0 K
% 0.78/1.20 flat ( 40) 431880 431880 0 157 6.1 K
% 0.78/1.20 discrim_pos ( 12) 4420 4420 0 1 0.0 K
% 0.78/1.20 fpa_head ( 12) 3006 0 3006 0 35.2 K
% 0.78/1.20 fpa_tree ( 28) 6007 6007 0 63 1.7 K
% 0.78/1.20 fpa_pos ( 36) 907 907 0 1 0.0 K
% 0.78/1.20 literal ( 12) 1938 1458 480 1 5.6 K
% 0.78/1.20 clause ( 24) 1938 1458 480 1 11.3 K
% 0.78/1.20 list ( 12) 486 430 56 4 0.7 K
% 0.78/1.20 list_pos ( 20) 2172 737 1435 0 28.0 K
% 0.78/1.20 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.20
% 0.78/1.20 -------------- statistics -------------
% 0.78/1.20 Clauses input 10
% 0.78/1.20 Usable input 0
% 0.78/1.20 Sos input 10
% 0.78/1.20 Demodulators input 0
% 0.78/1.20 Passive input 0
% 0.78/1.20
% 0.78/1.20 Processed BS (before search) 12
% 0.78/1.20 Forward subsumed BS 1
% 0.78/1.20 Kept BS 11
% 0.78/1.20 New demodulators BS 8
% 0.78/1.20 Back demodulated BS 0
% 0.78/1.20
% 0.78/1.20 Clauses or pairs given 1890
% 0.78/1.20 Clauses generated 1336
% 0.78/1.20 Forward subsumed 867
% 0.78/1.20 Deleted by weight 0
% 0.78/1.20 Deleted by variable count 0
% 0.78/1.20 Kept 469
% 0.78/1.20 New demodulators 419
% 0.78/1.20 Back demodulated 148
% 0.78/1.20 Ordered paramod prunes 0
% 0.78/1.20 Basic paramod prunes 4272
% 0.78/1.20 Prime paramod prunes 315
% 0.78/1.20 Semantic prunes 0
% 0.78/1.20
% 0.78/1.20 Rewrite attmepts 63795
% 0.78/1.20 Rewrites 4016
% 0.78/1.20
% 0.78/1.20 FPA overloads 0
% 0.78/1.20 FPA underloads 0
% 0.78/1.20
% 0.78/1.20 Usable size 0
% 0.78/1.20 Sos size 331
% 0.78/1.20 Demodulators size 294
% 0.78/1.20 Passive size 0
% 0.78/1.20 Disabled size 148
% 0.78/1.20
% 0.78/1.20 Proofs found 1
% 0.78/1.20
% 0.78/1.20 ----------- times (seconds) ----------- Tue Jun 14 07:35:46 2022
% 0.78/1.20
% 0.78/1.20 user CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.78/1.20 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.78/1.20 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.20 input time 0.00
% 0.78/1.20 paramodulation time 0.01
% 0.78/1.20 demodulation time 0.03
% 0.78/1.20 orient time 0.00
% 0.78/1.20 weigh time 0.00
% 0.78/1.20 forward subsume time 0.00
% 0.78/1.20 back demod find time 0.01
% 0.78/1.20 conflict time 0.00
% 0.78/1.20 LRPO time 0.00
% 0.78/1.20 store clause time 0.02
% 0.78/1.20 disable clause time 0.00
% 0.78/1.20 prime paramod time 0.01
% 0.78/1.20 semantics time 0.00
% 0.78/1.20
% 0.78/1.20 EQP interrupted
%------------------------------------------------------------------------------