TSTP Solution File: GRP557-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP557-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:58 EDT 2022
% Result : Unsatisfiable 0.74s 1.14s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 3 RR)
% Number of literals : 23 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,inverse(divide(divide(B,C),divide(A,C)))),B),
file('GRP557-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP557-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(6,plain,
equal(divide(A,inverse(divide(B,divide(A,inverse(divide(divide(B,C),divide(D,C))))))),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(divide(A,inverse(divide(multiply(B,C),divide(A,inverse(C))))),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(11,plain,
equal(divide(A,inverse(divide(multiply(B,C),multiply(A,C)))),B),
inference(para,[status(thm),theory(equality)],[3,8]),
[iquote('para(3,8)')] ).
cnf(16,plain,
equal(divide(A,inverse(divide(B,B))),A),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(17,plain,
equal(multiply(A,divide(B,B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,3]),1]),
[iquote('para(16,3),flip(1)')] ).
cnf(18,plain,
equal(divide(A,inverse(multiply(inverse(B),B))),A),
inference(para,[status(thm),theory(equality)],[3,16]),
[iquote('para(3,16)')] ).
cnf(22,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,3]),1]),
[iquote('para(18,3),flip(1)')] ).
cnf(52,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,11]),17]),
[iquote('para(17,11),demod([17])')] ).
cnf(57,plain,
equal(divide(inverse(divide(A,A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[16,52]),
[iquote('para(16,52)')] ).
cnf(65,plain,
equal(multiply(inverse(divide(A,A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[57,3]),1]),
[iquote('para(57,3),flip(1)')] ).
cnf(66,plain,
equal(divide(A,A),inverse(divide(B,B))),
inference(para,[status(thm),theory(equality)],[65,17]),
[iquote('para(65,17)')] ).
cnf(67,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(flip,[status(thm),theory(equality)],[66]),
[iquote('flip(66)')] ).
cnf(71,plain,
equal(divide(A,divide(B,B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[67,3]),17]),
[iquote('para(67,3),demod([17])')] ).
cnf(72,plain,
equal(divide(divide(A,A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[71,52]),
[iquote('para(71,52)')] ).
cnf(73,plain,
equal(multiply(divide(A,A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,3]),1]),
[iquote('para(72,3),flip(1)')] ).
cnf(75,plain,
equal(multiply(inverse(A),A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[73,22]),
[iquote('para(73,22)')] ).
cnf(76,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[75]),
[iquote('flip(75)')] ).
cnf(77,plain,
$false,
inference(conflict,[status(thm)],[76,5]),
[iquote('conflict(76,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP557-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 23:54:53 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.74/1.14 ----- EQP 0.9e, May 2009 -----
% 0.74/1.14 The job began on n017.cluster.edu, Mon Jun 13 23:54:54 2022
% 0.74/1.14 The command was "./eqp09e".
% 0.74/1.14
% 0.74/1.14 set(prolog_style_variables).
% 0.74/1.14 set(lrpo).
% 0.74/1.14 set(basic_paramod).
% 0.74/1.14 set(functional_subsume).
% 0.74/1.14 set(ordered_paramod).
% 0.74/1.14 set(prime_paramod).
% 0.74/1.14 set(para_pairs).
% 0.74/1.14 assign(pick_given_ratio,4).
% 0.74/1.14 clear(print_kept).
% 0.74/1.14 clear(print_new_demod).
% 0.74/1.14 clear(print_back_demod).
% 0.74/1.14 clear(print_given).
% 0.74/1.14 assign(max_mem,64000).
% 0.74/1.14 end_of_commands.
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 0 (wt=-1) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.74/1.14 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.74/1.14 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Starting to process input.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.74/1.14 1 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.74/1.14 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.74/1.14 ---------------- PROOF FOUND ----------------
% 0.74/1.14 % SZS status Unsatisfiable
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 After processing input:
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.74/1.14 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.74/1.14 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.74/1.14 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 1 (wt=12) [] divide(A,inverse(divide(divide(B,C),divide(A,C)))) = B.
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 UNIT CONFLICT from 76 and 5 at 0.00 seconds.
% 0.74/1.14
% 0.74/1.14 ---------------- PROOF ----------------
% 0.74/1.14 % SZS output start Refutation
% See solution above
% 0.74/1.14 ------------ end of proof -------------
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 ------------- memory usage ------------
% 0.74/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.14 type (bytes each) gets frees in use avail bytes
% 0.74/1.14 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.14 term ( 16) 3878 2920 958 19 18.8 K
% 0.74/1.14 gen_ptr ( 8) 4992 532 4460 22 35.0 K
% 0.74/1.14 context ( 808) 3637 3635 2 2 3.2 K
% 0.74/1.14 trail ( 12) 435 435 0 5 0.1 K
% 0.74/1.14 bt_node ( 68) 1909 1906 3 12 1.0 K
% 0.74/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_free_vars_pos (4020)
% 0.74/1.14 0 0 0 0 0.0 K
% 0.74/1.14 discrim ( 12) 873 0 873 0 10.2 K
% 0.74/1.14 flat ( 40) 4989 4989 0 16 0.6 K
% 0.74/1.14 discrim_pos ( 12) 75 75 0 1 0.0 K
% 0.74/1.14 fpa_head ( 12) 864 0 864 0 10.1 K
% 0.74/1.14 fpa_tree ( 28) 169 169 0 9 0.2 K
% 0.74/1.14 fpa_pos ( 36) 140 140 0 1 0.0 K
% 0.74/1.14 literal ( 12) 257 181 76 1 0.9 K
% 0.74/1.14 clause ( 24) 257 181 76 1 1.8 K
% 0.74/1.14 list ( 12) 123 67 56 3 0.7 K
% 0.74/1.14 list_pos ( 20) 292 3 289 0 5.6 K
% 0.74/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.14
% 0.74/1.14 -------------- statistics -------------
% 0.74/1.14 Clauses input 3
% 0.74/1.14 Usable input 0
% 0.74/1.14 Sos input 3
% 0.74/1.14 Demodulators input 0
% 0.74/1.14 Passive input 0
% 0.74/1.14
% 0.74/1.14 Processed BS (before search) 5
% 0.74/1.14 Forward subsumed BS 1
% 0.74/1.14 Kept BS 4
% 0.74/1.14 New demodulators BS 1
% 0.74/1.14 Back demodulated BS 0
% 0.74/1.14
% 0.74/1.14 Clauses or pairs given 341
% 0.74/1.14 Clauses generated 169
% 0.74/1.14 Forward subsumed 97
% 0.74/1.14 Deleted by weight 0
% 0.74/1.14 Deleted by variable count 0
% 0.74/1.14 Kept 72
% 0.74/1.14 New demodulators 63
% 0.74/1.14 Back demodulated 0
% 0.74/1.14 Ordered paramod prunes 0
% 0.74/1.14 Basic paramod prunes 992
% 0.74/1.14 Prime paramod prunes 3
% 0.74/1.14 Semantic prunes 0
% 0.74/1.14
% 0.74/1.14 Rewrite attmepts 1001
% 0.74/1.14 Rewrites 63
% 0.74/1.14
% 0.74/1.14 FPA overloads 0
% 0.74/1.14 FPA underloads 0
% 0.74/1.14
% 0.74/1.14 Usable size 0
% 0.74/1.14 Sos size 75
% 0.74/1.14 Demodulators size 64
% 0.74/1.14 Passive size 0
% 0.74/1.14 Disabled size 0
% 0.74/1.14
% 0.74/1.14 Proofs found 1
% 0.74/1.14
% 0.74/1.14 ----------- times (seconds) ----------- Mon Jun 13 23:54:54 2022
% 0.74/1.14
% 0.74/1.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.14 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.14 input time 0.00
% 0.74/1.14 paramodulation time 0.00
% 0.74/1.14 demodulation time 0.00
% 0.74/1.14 orient time 0.00
% 0.74/1.14 weigh time 0.00
% 0.74/1.14 forward subsume time 0.00
% 0.74/1.14 back demod find time 0.00
% 0.74/1.14 conflict time 0.00
% 0.74/1.14 LRPO time 0.00
% 0.74/1.14 store clause time 0.00
% 0.74/1.14 disable clause time 0.00
% 0.74/1.14 prime paramod time 0.00
% 0.74/1.14 semantics time 0.00
% 0.74/1.14
% 0.74/1.14 EQP interrupted
%------------------------------------------------------------------------------