TSTP Solution File: GRP483-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP483-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:47:37 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 5 RR)
% Number of literals : 26 ( 0 equ; 3 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B),C),
file('GRP483-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP483-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP483-1.p',unknown),
[] ).
cnf(4,plain,
equal(double_divide(A,double_divide(A,identity)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),1]),
[iquote('demod([3]),flip(1)')] ).
cnf(5,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),4]),
[iquote('back_demod(1),demod([4])')] ).
cnf(6,plain,
~ equal(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity),double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2,2,2,2]),1]),
[iquote('demod([2,2,2,2]),flip(1)')] ).
cnf(7,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),B),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(10,plain,
equal(double_divide(double_divide(identity,identity),double_divide(A,identity)),A),
inference(para,[status(thm),theory(equality)],[4,7]),
[iquote('para(4,7)')] ).
cnf(12,plain,
equal(double_divide(identity,identity),identity),
inference(para,[status(thm),theory(equality)],[10,4]),
[iquote('para(10,4)')] ).
cnf(14,plain,
equal(double_divide(identity,double_divide(A,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),12]),
[iquote('back_demod(10),demod([12])')] ).
cnf(19,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,7]),14]),
[iquote('para(12,7),demod([14])')] ).
cnf(27,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,5]),14,19]),
[iquote('para(12,5),demod([14,19])')] ).
cnf(29,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(para,[status(thm),theory(equality)],[27,27]),
[iquote('para(27,27)')] ).
cnf(30,plain,
equal(double_divide(double_divide(double_divide(A,B),double_divide(double_divide(C,identity),double_divide(A,identity))),double_divide(B,identity)),C),
inference(para,[status(thm),theory(equality)],[19,5]),
[iquote('para(19,5)')] ).
cnf(33,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),B),double_divide(A,identity)),
inference(para,[status(thm),theory(equality)],[19,7]),
[iquote('para(19,7)')] ).
cnf(36,plain,
equal(double_divide(double_divide(identity,double_divide(A,B)),double_divide(B,identity)),double_divide(A,identity)),
inference(para,[status(thm),theory(equality)],[19,33]),
[iquote('para(19,33)')] ).
cnf(40,plain,
equal(double_divide(double_divide(double_divide(A,identity),B),identity),double_divide(double_divide(identity,B),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,33]),1]),
[iquote('para(27,33),flip(1)')] ).
cnf(42,plain,
~ equal(double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity),double_divide(double_divide(identity,a3),double_divide(c3,b3))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),40]),1]),
[iquote('back_demod(6),demod([40]),flip(1)')] ).
cnf(49,plain,
equal(double_divide(double_divide(identity,A),double_divide(B,identity)),double_divide(double_divide(B,A),identity)),
inference(para,[status(thm),theory(equality)],[27,36]),
[iquote('para(27,36)')] ).
cnf(51,plain,
equal(double_divide(double_divide(double_divide(A,B),double_divide(C,double_divide(A,identity))),double_divide(B,identity)),double_divide(C,identity)),
inference(para,[status(thm),theory(equality)],[19,30]),
[iquote('para(19,30)')] ).
cnf(78,plain,
equal(double_divide(double_divide(A,double_divide(B,identity)),identity),double_divide(B,double_divide(A,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[29,49]),1]),
[iquote('para(29,49),flip(1)')] ).
cnf(79,plain,
~ equal(double_divide(double_divide(identity,a3),double_divide(c3,b3)),double_divide(double_divide(b3,a3),double_divide(c3,identity))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[42]),78]),1]),
[iquote('back_demod(42),demod([78]),flip(1)')] ).
cnf(156,plain,
equal(double_divide(double_divide(double_divide(A,B),C),double_divide(B,identity)),double_divide(double_divide(identity,C),A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,51]),40]),
[iquote('para(27,51),demod([40])')] ).
cnf(242,plain,
equal(double_divide(double_divide(A,B),double_divide(C,identity)),double_divide(double_divide(identity,B),double_divide(C,A))),
inference(para,[status(thm),theory(equality)],[27,156]),
[iquote('para(27,156)')] ).
cnf(243,plain,
equal(double_divide(double_divide(identity,A),double_divide(B,C)),double_divide(double_divide(C,A),double_divide(B,identity))),
inference(flip,[status(thm),theory(equality)],[242]),
[iquote('flip(242)')] ).
cnf(244,plain,
$false,
inference(conflict,[status(thm)],[243,79]),
[iquote('conflict(243,79)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP483-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n005.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 10:49:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.71/1.13 ----- EQP 0.9e, May 2009 -----
% 0.71/1.13 The job began on n005.cluster.edu, Tue Jun 14 10:49:09 2022
% 0.71/1.13 The command was "./eqp09e".
% 0.71/1.13
% 0.71/1.13 set(prolog_style_variables).
% 0.71/1.13 set(lrpo).
% 0.71/1.13 set(basic_paramod).
% 0.71/1.13 set(functional_subsume).
% 0.71/1.13 set(ordered_paramod).
% 0.71/1.13 set(prime_paramod).
% 0.71/1.13 set(para_pairs).
% 0.71/1.13 assign(pick_given_ratio,4).
% 0.71/1.13 clear(print_kept).
% 0.71/1.13 clear(print_new_demod).
% 0.71/1.13 clear(print_back_demod).
% 0.71/1.13 clear(print_given).
% 0.71/1.13 assign(max_mem,64000).
% 0.71/1.13 end_of_commands.
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 0 (wt=-1) [] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B) = C.
% 0.71/1.13 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.71/1.13 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Starting to process input.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 1 (wt=21) [] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,double_divide(D,double_divide(D,identity))),double_divide(A,identity))),B) = C.
% 0.71/1.13 1 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 2 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 3 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 4 is a new demodulator.
% 0.71/1.13 -> 4 back demodulating 1.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 5 (wt=17) [back_demod(1),demod([4])] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B) = C.
% 0.71/1.13 5 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 6 (wt=19) [demod([2,2,2,2]),flip(1)] -(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) = double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)).
% 0.71/1.13 ---------------- PROOF FOUND ----------------
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 After processing input:
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 5 (wt=17) [back_demod(1),demod([4])] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B) = C.
% 0.71/1.13 6 (wt=19) [demod([2,2,2,2]),flip(1)] -(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) = double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 5 (wt=17) [back_demod(1),demod([4])] double_divide(double_divide(double_divide(A,double_divide(B,identity)),double_divide(double_divide(C,identity),double_divide(A,identity))),B) = C.
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 UNIT CONFLICT from 243 and 79 at 0.02 seconds.
% 0.71/1.13
% 0.71/1.13 ---------------- PROOF ----------------
% 0.71/1.13 % SZS output start Refutation
% See solution above
% 0.71/1.13 ------------ end of proof -------------
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 ------------- memory usage ------------
% 0.71/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.13 type (bytes each) gets frees in use avail bytes
% 0.71/1.13 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.71/1.13 term ( 16) 27619 23929 3690 23 71.6 K
% 0.71/1.13 gen_ptr ( 8) 23062 8114 14948 25 117.0 K
% 0.71/1.13 context ( 808) 26513 26511 2 3 3.9 K
% 0.71/1.13 trail ( 12) 902 902 0 4 0.0 K
% 0.71/1.13 bt_node ( 68) 12320 12317 3 12 1.0 K
% 0.71/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_free_vars_pos (4020)
% 0.71/1.13 0 0 0 0 0.0 K
% 0.71/1.13 discrim ( 12) 2824 1115 1709 5 20.1 K
% 0.71/1.13 flat ( 40) 47972 47972 0 25 1.0 K
% 0.71/1.13 discrim_pos ( 12) 2051 2051 0 1 0.0 K
% 0.71/1.13 fpa_head ( 12) 504 0 504 0 5.9 K
% 0.71/1.13 fpa_tree ( 28) 1036 1036 0 29 0.8 K
% 0.71/1.13 fpa_pos ( 36) 418 418 0 1 0.0 K
% 0.71/1.13 literal ( 12) 1494 1251 243 1 2.9 K
% 0.71/1.13 clause ( 24) 1494 1251 243 1 5.7 K
% 0.71/1.13 list ( 12) 234 178 56 4 0.7 K
% 0.71/1.13 list_pos ( 20) 1086 445 641 5 12.6 K
% 0.71/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.13
% 0.71/1.13 -------------- statistics -------------
% 0.71/1.13 Clauses input 5
% 0.71/1.13 Usable input 0
% 0.71/1.13 Sos input 5
% 0.71/1.13 Demodulators input 0
% 0.71/1.13 Passive input 0
% 0.71/1.13
% 0.71/1.13 Processed BS (before search) 6
% 0.71/1.13 Forward subsumed BS 0
% 0.71/1.13 Kept BS 6
% 0.71/1.13 New demodulators BS 5
% 0.71/1.13 Back demodulated BS 1
% 0.71/1.13
% 0.71/1.13 Clauses or pairs given 1389
% 0.71/1.13 Clauses generated 1087
% 0.71/1.13 Forward subsumed 850
% 0.71/1.13 Deleted by weight 0
% 0.71/1.13 Deleted by variable count 0
% 0.71/1.13 Kept 237
% 0.71/1.13 New demodulators 170
% 0.71/1.13 Back demodulated 89
% 0.71/1.13 Ordered paramod prunes 0
% 0.71/1.13 Basic paramod prunes 5628
% 0.71/1.13 Prime paramod prunes 286
% 0.71/1.13 Semantic prunes 0
% 0.71/1.13
% 0.71/1.13 Rewrite attmepts 11978
% 0.71/1.13 Rewrites 1629
% 0.71/1.13
% 0.71/1.13 FPA overloads 0
% 0.71/1.13 FPA underloads 0
% 0.71/1.13
% 0.71/1.13 Usable size 0
% 0.71/1.13 Sos size 152
% 0.71/1.13 Demodulators size 95
% 0.71/1.13 Passive size 0
% 0.71/1.13 Disabled size 90
% 0.71/1.13
% 0.71/1.13 Proofs found 1
% 0.71/1.13
% 0.71/1.13 ----------- times (seconds) ----------- Tue Jun 14 10:49:09 2022
% 0.71/1.13
% 0.71/1.13 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.13 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.71/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.13 input time 0.00
% 0.71/1.13 paramodulation time 0.01
% 0.71/1.13 demodulation time 0.00
% 0.71/1.13 orient time 0.00
% 0.71/1.13 weigh time 0.00
% 0.71/1.13 forward subsume time 0.00
% 0.71/1.13 back demod find time 0.00
% 0.71/1.13 conflict time 0.00
% 0.71/1.13 LRPO time 0.00
% 0.71/1.13 store clause time 0.00
% 0.71/1.13 disable clause time 0.00
% 0.71/1.13 prime paramod time 0.00
% 0.71/1.13 semantics time 0.00
% 0.71/1.13
% 0.71/1.13 EQP interrupted
%------------------------------------------------------------------------------