TSTP Solution File: GRP538-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP538-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:53 EDT 2022
% Result : Unsatisfiable 0.45s 1.11s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 2 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
file('GRP538-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP538-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP538-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(7,plain,
equal(inverse(A),divide(identity,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),6]),1]),
[iquote('back_demod(5),demod([6]),flip(1)')] ).
cnf(8,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),6]),1]),
[iquote('back_demod(3),demod([6]),flip(1)')] ).
cnf(9,plain,
~ equal(divide(identity,divide(identity,a2)),a2),
inference(demod,[status(thm),theory(equality)],[7,8,6,8]),
[iquote('demod([7,8,6,8])')] ).
cnf(14,plain,
equal(divide(identity,divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(17,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[6,14]),
[iquote('para(6,14)')] ).
cnf(18,plain,
$false,
inference(conflict,[status(thm)],[17,9]),
[iquote('conflict(17,9)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP538-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n010.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 : Mon Jun 13 14:53:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/1.11 ----- EQP 0.9e, May 2009 -----
% 0.45/1.11 The job began on n010.cluster.edu, Mon Jun 13 14:53:55 2022
% 0.45/1.11 The command was "./eqp09e".
% 0.45/1.11
% 0.45/1.11 set(prolog_style_variables).
% 0.45/1.11 set(lrpo).
% 0.45/1.11 set(basic_paramod).
% 0.45/1.11 set(functional_subsume).
% 0.45/1.11 set(ordered_paramod).
% 0.45/1.11 set(prime_paramod).
% 0.45/1.11 set(para_pairs).
% 0.45/1.11 assign(pick_given_ratio,4).
% 0.45/1.11 clear(print_kept).
% 0.45/1.11 clear(print_new_demod).
% 0.45/1.11 clear(print_back_demod).
% 0.45/1.11 clear(print_given).
% 0.45/1.11 assign(max_mem,64000).
% 0.45/1.11 end_of_commands.
% 0.45/1.11
% 0.45/1.11 Usable:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Sos:
% 0.45/1.11 0 (wt=-1) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.45/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.45/1.11 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.45/1.11 0 (wt=-1) [] identity = divide(A,A).
% 0.45/1.11 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Demodulators:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Passive:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Starting to process input.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.45/1.11 1 is a new demodulator.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.45/1.11 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.45/1.11 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.45/1.11 6 is a new demodulator.
% 0.45/1.11 -> 6 back demodulating 5.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.45/1.11 7 is a new demodulator.
% 0.45/1.11 -> 7 back demodulating 4.
% 0.45/1.11 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.45/1.11 -> 6 back demodulating 3.
% 0.45/1.11
% 0.45/1.11 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.45/1.11 8 is a new demodulator.
% 0.45/1.11 -> 8 back demodulating 2.
% 0.45/1.11 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.45/1.11
% 0.45/1.11 ** KEPT: 9 (wt=7) [demod([7,8,6,8])] -(divide(identity,divide(identity,a2)) = a2).
% 0.45/1.11 ---------------- PROOF FOUND ----------------
% 0.45/1.11 % SZS status Unsatisfiable
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 After processing input:
% 0.45/1.11
% 0.45/1.11 Usable:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Sos:
% 0.45/1.11 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.45/1.11 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.45/1.11 9 (wt=7) [demod([7,8,6,8])] -(divide(identity,divide(identity,a2)) = a2).
% 0.45/1.11 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.45/1.11 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Demodulators:
% 0.45/1.11 1 (wt=11) [] divide(divide(A,B),divide(divide(A,C),B)) = C.
% 0.45/1.11 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.45/1.11 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.45/1.11 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 Passive:
% 0.45/1.11 end_of_list.
% 0.45/1.11
% 0.45/1.11 UNIT CONFLICT from 17 and 9 at 0.00 seconds.
% 0.45/1.11
% 0.45/1.11 ---------------- PROOF ----------------
% 0.45/1.11 % SZS output start Refutation
% See solution above
% 0.45/1.11 ------------ end of proof -------------
% 0.45/1.11
% 0.45/1.11
% 0.45/1.11 ------------- memory usage ------------
% 0.45/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.45/1.11 type (bytes each) gets frees in use avail bytes
% 0.45/1.11 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.45/1.11 term ( 16) 917 747 170 13 3.5 K
% 0.45/1.11 gen_ptr ( 8) 667 145 522 11 4.2 K
% 0.45/1.11 context ( 808) 302 300 2 2 3.2 K
% 0.45/1.11 trail ( 12) 38 38 0 4 0.0 K
% 0.45/1.11 bt_node ( 68) 75 72 3 6 0.6 K
% 0.45/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/1.11 ac_match_free_vars_pos (4020)
% 0.45/1.11 0 0 0 0 0.0 K
% 0.45/1.11 discrim ( 12) 156 20 136 0 1.6 K
% 0.45/1.11 flat ( 40) 672 672 0 15 0.6 K
% 0.45/1.11 discrim_pos ( 12) 16 16 0 1 0.0 K
% 0.45/1.11 fpa_head ( 12) 110 0 110 0 1.3 K
% 0.45/1.11 fpa_tree ( 28) 28 28 0 5 0.1 K
% 0.45/1.11 fpa_pos ( 36) 26 26 0 1 0.0 K
% 0.45/1.11 literal ( 12) 48 31 17 1 0.2 K
% 0.45/1.11 clause ( 24) 48 31 17 1 0.4 K
% 0.45/1.11 list ( 12) 68 12 56 4 0.7 K
% 0.45/1.11 list_pos ( 20) 72 23 49 0 1.0 K
% 0.45/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/1.11
% 0.45/1.11 -------------- statistics -------------
% 0.45/1.11 Clauses input 5
% 0.45/1.11 Usable input 0
% 0.45/1.11 Sos input 5
% 0.45/1.11 Demodulators input 0
% 0.45/1.11 Passive input 0
% 0.45/1.11
% 0.45/1.11 Processed BS (before search) 13
% 0.45/1.11 Forward subsumed BS 4
% 0.45/1.11 Kept BS 9
% 0.45/1.11 New demodulators BS 4
% 0.45/1.11 Back demodulated BS 4
% 0.45/1.11
% 0.45/1.11 Clauses or pairs given 11
% 0.45/1.11 Clauses generated 15
% 0.45/1.11 Forward subsumed 7
% 0.45/1.11 Deleted by weight 0
% 0.45/1.11 Deleted by variable count 0
% 0.45/1.11 Kept 8
% 0.45/1.11 New demodulators 5
% 0.45/1.11 Back demodulated 0
% 0.45/1.11 Ordered paramod prunes 0
% 0.45/1.11 Basic paramod prunes 0
% 0.45/1.11 Prime paramod prunes 0
% 0.45/1.11 Semantic prunes 0
% 0.45/1.11
% 0.45/1.11 Rewrite attmepts 160
% 0.45/1.11 Rewrites 12
% 0.45/1.11
% 0.45/1.11 FPA overloads 0
% 0.45/1.11 FPA underloads 0
% 0.45/1.11
% 0.45/1.11 Usable size 0
% 0.45/1.11 Sos size 12
% 0.45/1.11 Demodulators size 9
% 0.45/1.11 Passive size 0
% 0.45/1.11 Disabled size 4
% 0.45/1.11
% 0.45/1.11 Proofs found 1
% 0.45/1.11
% 0.45/1.11 ----------- times (seconds) ----------- Mon Jun 13 14:53:55 2022
% 0.45/1.11
% 0.45/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/1.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.45/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/1.11 input time 0.00
% 0.45/1.11 paramodulation time 0.00
% 0.45/1.11 demodulation time 0.00
% 0.45/1.11 orient time 0.00
% 0.45/1.11 weigh time 0.00
% 0.45/1.11 forward subsume time 0.00
% 0.45/1.11 back demod find time 0.00
% 0.45/1.11 conflict time 0.00
% 0.45/1.11 LRPO time 0.00
% 0.45/1.11 store clause time 0.00
% 0.45/1.11 disable clause time 0.00
% 0.45/1.11 prime paramod time 0.00
% 0.45/1.11 semantics time 0.00
% 0.45/1.11
% 0.45/1.11 EQP interrupted
%------------------------------------------------------------------------------