TSTP Solution File: GRP561-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP561-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n023.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:59 EDT 2022
% Result : Unsatisfiable 0.75s 1.15s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
file('GRP561-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP561-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(inverse(b1),inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(7,plain,
equal(divide(divide(divide(divide(divide(A,inverse(B)),C),inverse(D)),divide(A,C)),B),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(11,plain,
equal(divide(multiply(multiply(A,B),C),divide(A,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[3,8]),
[iquote('para(3,8)')] ).
cnf(13,plain,
equal(divide(multiply(multiply(A,B),C),multiply(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,11]),
[iquote('para(3,11)')] ).
cnf(33,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,7]),1]),
[iquote('para(7,7),demod([1])')] ).
cnf(35,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[3,33]),
[iquote('para(3,33)')] ).
cnf(38,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(para,[status(thm),theory(equality)],[3,35]),
[iquote('para(3,35)')] ).
cnf(46,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[35,8]),
[iquote('para(35,8)')] ).
cnf(48,plain,
equal(multiply(divide(A,A),B),B),
inference(para,[status(thm),theory(equality)],[46,35]),
[iquote('para(46,35)')] ).
cnf(62,plain,
equal(divide(multiply(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,13]),48]),
[iquote('para(48,13),demod([48])')] ).
cnf(64,plain,
equal(divide(A,A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[48,62]),
[iquote('para(48,62)')] ).
cnf(68,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[38,62]),1]),
[iquote('para(38,62),flip(1)')] ).
cnf(71,plain,
~ equal(divide(inverse(b1),inverse(b1)),divide(a1,a1)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),68]),
[iquote('back_demod(5),demod([68])')] ).
cnf(72,plain,
$false,
inference(conflict,[status(thm)],[71,64]),
[iquote('conflict(71,64)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP561-1 : TPTP v8.1.0. Released v2.6.0.
% 0.14/0.14 % Command : tptp2X_and_run_eqp %s
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 600
% 0.16/0.36 % DateTime : Tue Jun 14 06:21:21 EDT 2022
% 0.16/0.36 % CPUTime :
% 0.75/1.15 ----- EQP 0.9e, May 2009 -----
% 0.75/1.15 The job began on n023.cluster.edu, Tue Jun 14 06:21:21 2022
% 0.75/1.15 The command was "./eqp09e".
% 0.75/1.15
% 0.75/1.15 set(prolog_style_variables).
% 0.75/1.15 set(lrpo).
% 0.75/1.15 set(basic_paramod).
% 0.75/1.15 set(functional_subsume).
% 0.75/1.15 set(ordered_paramod).
% 0.75/1.15 set(prime_paramod).
% 0.75/1.15 set(para_pairs).
% 0.75/1.15 assign(pick_given_ratio,4).
% 0.75/1.15 clear(print_kept).
% 0.75/1.15 clear(print_new_demod).
% 0.75/1.15 clear(print_back_demod).
% 0.75/1.15 clear(print_given).
% 0.75/1.15 assign(max_mem,64000).
% 0.75/1.15 end_of_commands.
% 0.75/1.15
% 0.75/1.15 Usable:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Sos:
% 0.75/1.15 0 (wt=-1) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.75/1.15 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.15 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Demodulators:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Passive:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Starting to process input.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.75/1.15 1 is a new demodulator.
% 0.75/1.15
% 0.75/1.15 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.15
% 0.75/1.15 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.75/1.15 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.15
% 0.75/1.15 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.15 ---------------- PROOF FOUND ----------------
% 0.75/1.15 % SZS status Unsatisfiable
% 0.75/1.15
% 0.75/1.15
% 0.75/1.15 After processing input:
% 0.75/1.15
% 0.75/1.15 Usable:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Sos:
% 0.75/1.15 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.75/1.15 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.75/1.15 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.75/1.15 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Demodulators:
% 0.75/1.15 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 Passive:
% 0.75/1.15 end_of_list.
% 0.75/1.15
% 0.75/1.15 UNIT CONFLICT from 71 and 64 at 0.00 seconds.
% 0.75/1.15
% 0.75/1.15 ---------------- PROOF ----------------
% 0.75/1.15 % SZS output start Refutation
% See solution above
% 0.75/1.15 ------------ end of proof -------------
% 0.75/1.15
% 0.75/1.15
% 0.75/1.15 ------------- memory usage ------------
% 0.75/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.75/1.15 type (bytes each) gets frees in use avail bytes
% 0.75/1.15 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.75/1.15 term ( 16) 3368 2436 932 19 18.3 K
% 0.75/1.15 gen_ptr ( 8) 4451 570 3881 18 30.5 K
% 0.75/1.15 context ( 808) 3130 3128 2 2 3.2 K
% 0.75/1.15 trail ( 12) 679 679 0 5 0.1 K
% 0.75/1.15 bt_node ( 68) 1930 1927 3 12 1.0 K
% 0.75/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.15 ac_match_free_vars_pos (4020)
% 0.75/1.15 0 0 0 0 0.0 K
% 0.75/1.15 discrim ( 12) 1053 55 998 34 12.1 K
% 0.75/1.15 flat ( 40) 4484 4484 0 19 0.7 K
% 0.75/1.15 discrim_pos ( 12) 68 68 0 1 0.0 K
% 0.75/1.15 fpa_head ( 12) 716 0 716 0 8.4 K
% 0.75/1.15 fpa_tree ( 28) 246 246 0 11 0.3 K
% 0.75/1.15 fpa_pos ( 36) 136 136 0 1 0.0 K
% 0.75/1.15 literal ( 12) 228 157 71 0 0.8 K
% 0.75/1.15 clause ( 24) 228 157 71 0 1.7 K
% 0.75/1.15 list ( 12) 124 67 57 2 0.7 K
% 0.75/1.15 list_pos ( 20) 293 37 256 15 5.3 K
% 0.75/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.15
% 0.75/1.15 -------------- statistics -------------
% 0.75/1.15 Clauses input 3
% 0.75/1.15 Usable input 0
% 0.75/1.15 Sos input 3
% 0.75/1.15 Demodulators input 0
% 0.75/1.15 Passive input 0
% 0.75/1.15
% 0.75/1.15 Processed BS (before search) 5
% 0.75/1.15 Forward subsumed BS 1
% 0.75/1.15 Kept BS 4
% 0.75/1.15 New demodulators BS 1
% 0.75/1.15 Back demodulated BS 0
% 0.75/1.15
% 0.75/1.15 Clauses or pairs given 269
% 0.75/1.15 Clauses generated 150
% 0.75/1.15 Forward subsumed 83
% 0.75/1.15 Deleted by weight 0
% 0.75/1.15 Deleted by variable count 0
% 0.75/1.15 Kept 67
% 0.75/1.15 New demodulators 64
% 0.75/1.15 Back demodulated 7
% 0.75/1.15 Ordered paramod prunes 0
% 0.75/1.15 Basic paramod prunes 702
% 0.75/1.15 Prime paramod prunes 2
% 0.75/1.15 Semantic prunes 0
% 0.75/1.15
% 0.75/1.15 Rewrite attmepts 825
% 0.75/1.15 Rewrites 60
% 0.75/1.15
% 0.75/1.15 FPA overloads 0
% 0.75/1.15 FPA underloads 0
% 0.75/1.15
% 0.75/1.15 Usable size 0
% 0.75/1.15 Sos size 63
% 0.75/1.15 Demodulators size 59
% 0.75/1.15 Passive size 0
% 0.75/1.15 Disabled size 7
% 0.75/1.15
% 0.75/1.15 Proofs found 1
% 0.75/1.15
% 0.75/1.15 ----------- times (seconds) ----------- Tue Jun 14 06:21:21 2022
% 0.75/1.15
% 0.75/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.75/1.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.75/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.15 input time 0.00
% 0.75/1.15 paramodulation time 0.00
% 0.75/1.15 demodulation time 0.00
% 0.75/1.15 orient time 0.00
% 0.75/1.15 weigh time 0.00
% 0.75/1.15 forward subsume time 0.00
% 0.75/1.15 back demod find time 0.00
% 0.75/1.15 conflict time 0.00
% 0.75/1.15 LRPO time 0.00
% 0.75/1.15 store clause time 0.00
% 0.75/1.15 disable clause time 0.00
% 0.75/1.15 prime paramod time 0.00
% 0.75/1.15 semantics time 0.00
% 0.75/1.15
% 0.75/1.15 EQP interrupted
%------------------------------------------------------------------------------