TSTP Solution File: GRP536-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP536-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:52 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of clauses : 16 ( 16 unt; 0 nHn; 3 RR)
% Number of literals : 16 ( 0 equ; 2 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,divide(divide(A,B),C)),B),C),
file('GRP536-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP536-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(6,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('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(a,divide(identity,b)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[8,8]),
[iquote('demod([8,8])')] ).
cnf(11,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(12,plain,
equal(divide(divide(A,divide(identity,B)),A),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(14,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[6,12]),
[iquote('para(6,12)')] ).
cnf(16,plain,
equal(divide(divide(A,B),A),divide(identity,B)),
inference(para,[status(thm),theory(equality)],[14,12]),
[iquote('para(14,12)')] ).
cnf(17,plain,
equal(divide(A,identity),A),
inference(para,[status(thm),theory(equality)],[14,12]),
[iquote('para(14,12)')] ).
cnf(18,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,1]),17]),
[iquote('para(17,1),demod([17])')] ).
cnf(19,plain,
equal(divide(A,B),divide(identity,divide(B,A))),
inference(para,[status(thm),theory(equality)],[18,16]),
[iquote('para(18,16)')] ).
cnf(43,plain,
equal(divide(identity,divide(divide(A,B),C)),divide(B,divide(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,16]),1]),
[iquote('para(11,16),flip(1)')] ).
cnf(55,plain,
~ equal(divide(b,divide(identity,a)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,9]),43]),
[iquote('para(19,9),demod([43])')] ).
cnf(56,plain,
$false,
inference(conflict,[status(thm)],[55]),
[iquote('xx_conflict(55)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP536-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n014.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 12:55:07 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.10 ----- EQP 0.9e, May 2009 -----
% 0.70/1.10 The job began on n014.cluster.edu, Mon Jun 13 12:55:08 2022
% 0.70/1.10 The command was "./eqp09e".
% 0.70/1.10
% 0.70/1.10 set(prolog_style_variables).
% 0.70/1.10 set(lrpo).
% 0.70/1.10 set(basic_paramod).
% 0.70/1.10 set(functional_subsume).
% 0.70/1.10 set(ordered_paramod).
% 0.70/1.10 set(prime_paramod).
% 0.70/1.10 set(para_pairs).
% 0.70/1.10 assign(pick_given_ratio,4).
% 0.70/1.10 clear(print_kept).
% 0.70/1.10 clear(print_new_demod).
% 0.70/1.10 clear(print_back_demod).
% 0.70/1.10 clear(print_given).
% 0.70/1.10 assign(max_mem,64000).
% 0.70/1.10 end_of_commands.
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 0 (wt=-1) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.70/1.10 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.10 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.10 0 (wt=-1) [] identity = divide(A,A).
% 0.70/1.10 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Starting to process input.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.70/1.10 1 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.70/1.10 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.70/1.10 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.70/1.10 6 is a new demodulator.
% 0.70/1.10 -> 6 back demodulating 5.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.70/1.10 7 is a new demodulator.
% 0.70/1.10 -> 7 back demodulating 4.
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.70/1.10 -> 6 back demodulating 3.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.70/1.10 8 is a new demodulator.
% 0.70/1.10 -> 8 back demodulating 2.
% 0.70/1.10 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 9 (wt=11) [demod([8,8])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.70/1.10 ---------------- PROOF FOUND ----------------
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 After processing input:
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.70/1.10 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.70/1.10 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.70/1.10 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.70/1.10 9 (wt=11) [demod([8,8])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.70/1.10 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.70/1.10 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.70/1.10 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 UNIT CONFLICT from 55 and x=x at 0.00 seconds.
% 0.70/1.10
% 0.70/1.10 ---------------- PROOF ----------------
% 0.70/1.10 % SZS output start Refutation
% See solution above
% 0.70/1.10 ------------ end of proof -------------
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 ------------- memory usage ------------
% 0.70/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.10 type (bytes each) gets frees in use avail bytes
% 0.70/1.10 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.70/1.10 term ( 16) 3417 2765 652 14 12.8 K
% 0.70/1.10 gen_ptr ( 8) 3335 928 2407 15 18.9 K
% 0.70/1.10 context ( 808) 2104 2102 2 3 3.9 K
% 0.70/1.10 trail ( 12) 295 295 0 6 0.1 K
% 0.70/1.10 bt_node ( 68) 885 882 3 10 0.9 K
% 0.70/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_free_vars_pos (4020)
% 0.70/1.10 0 0 0 0 0.0 K
% 0.70/1.10 discrim ( 12) 591 149 442 0 5.2 K
% 0.70/1.10 flat ( 40) 4705 4705 0 21 0.8 K
% 0.70/1.10 discrim_pos ( 12) 133 133 0 1 0.0 K
% 0.70/1.10 fpa_head ( 12) 275 0 275 0 3.2 K
% 0.70/1.10 fpa_tree ( 28) 120 120 0 13 0.4 K
% 0.70/1.10 fpa_pos ( 36) 97 97 0 1 0.0 K
% 0.70/1.10 literal ( 12) 226 171 55 1 0.7 K
% 0.70/1.10 clause ( 24) 226 171 55 1 1.3 K
% 0.70/1.10 list ( 12) 102 46 56 4 0.7 K
% 0.70/1.10 list_pos ( 20) 242 78 164 0 3.2 K
% 0.70/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.10
% 0.70/1.10 -------------- statistics -------------
% 0.70/1.10 Clauses input 5
% 0.70/1.10 Usable input 0
% 0.70/1.10 Sos input 5
% 0.70/1.10 Demodulators input 0
% 0.70/1.10 Passive input 0
% 0.70/1.10
% 0.70/1.10 Processed BS (before search) 13
% 0.70/1.10 Forward subsumed BS 4
% 0.70/1.10 Kept BS 9
% 0.70/1.10 New demodulators BS 4
% 0.70/1.10 Back demodulated BS 4
% 0.70/1.10
% 0.70/1.10 Clauses or pairs given 150
% 0.70/1.10 Clauses generated 146
% 0.70/1.10 Forward subsumed 100
% 0.70/1.10 Deleted by weight 0
% 0.70/1.10 Deleted by variable count 0
% 0.70/1.10 Kept 46
% 0.70/1.10 New demodulators 39
% 0.70/1.10 Back demodulated 11
% 0.70/1.10 Ordered paramod prunes 0
% 0.70/1.10 Basic paramod prunes 319
% 0.70/1.10 Prime paramod prunes 10
% 0.70/1.10 Semantic prunes 0
% 0.70/1.10
% 0.70/1.10 Rewrite attmepts 957
% 0.70/1.10 Rewrites 109
% 0.70/1.10
% 0.70/1.10 FPA overloads 0
% 0.70/1.10 FPA underloads 0
% 0.70/1.10
% 0.70/1.10 Usable size 0
% 0.70/1.10 Sos size 39
% 0.70/1.10 Demodulators size 32
% 0.70/1.10 Passive size 0
% 0.70/1.10 Disabled size 15
% 0.70/1.10
% 0.70/1.10 Proofs found 1
% 0.70/1.10
% 0.70/1.10 ----------- times (seconds) ----------- Mon Jun 13 12:55:08 2022
% 0.70/1.10
% 0.70/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.70/1.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.10 input time 0.00
% 0.70/1.10 paramodulation time 0.00
% 0.70/1.10 demodulation time 0.00
% 0.70/1.10 orient time 0.00
% 0.70/1.10 weigh time 0.00
% 0.70/1.10 forward subsume time 0.00
% 0.70/1.10 back demod find time 0.00
% 0.70/1.10 conflict time 0.00
% 0.70/1.10 LRPO time 0.00
% 0.70/1.10 store clause time 0.00
% 0.70/1.10 disable clause time 0.00
% 0.70/1.10 prime paramod time 0.00
% 0.70/1.10 semantics time 0.00
% 0.70/1.10
% 0.70/1.10 EQP interrupted
%------------------------------------------------------------------------------