TSTP Solution File: GRP445-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP445-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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:27 EDT 2022
% Result : Unsatisfiable 0.67s 1.13s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of clauses : 21 ( 21 unt; 0 nHn; 3 RR)
% Number of literals : 21 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 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,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))),B),
file('GRP445-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP445-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('GRP445-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(multiply(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(divide(inverse(divide(A,A)),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[5,5]),
[iquote('para(5,5)')] ).
cnf(9,plain,
equal(inverse(A),divide(inverse(divide(B,B)),A)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(12,plain,
equal(divide(A,divide(divide(B,C),divide(divide(divide(A,A),A),C))),divide(divide(divide(divide(divide(A,A),divide(A,A)),B),D),divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),D))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(20,plain,
equal(divide(inverse(divide(A,A)),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[9,4]),
[iquote('para(9,4)')] ).
cnf(21,plain,
equal(divide(divide(A,A),B),divide(inverse(divide(C,C)),B)),
inference(flip,[status(thm),theory(equality)],[20]),
[iquote('flip(20)')] ).
cnf(54,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(55,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[54]),
[iquote('flip(54)')] ).
cnf(65,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(divide(divide(A,A),A),C))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(66,plain,
equal(divide(A,divide(inverse(B),divide(divide(divide(A,A),A),B))),divide(A,A)),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(77,plain,
~ equal(divide(inverse(b1),inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[55,6]),
[iquote('para(55,6)')] ).
cnf(205,plain,
equal(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(B,B)),C),divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),C)),divide(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,12]),66]),1]),
[iquote('para(5,12),demod([66]),flip(1)')] ).
cnf(566,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,12]),65,205]),
[iquote('para(21,12),demod([65,205])')] ).
cnf(577,plain,
equal(multiply(inverse(A),A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[54,566]),
[iquote('para(54,566)')] ).
cnf(578,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[577]),
[iquote('flip(577)')] ).
cnf(579,plain,
$false,
inference(conflict,[status(thm)],[578,77]),
[iquote('conflict(578,77)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP445-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n027.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:02:32 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.67/1.13 ----- EQP 0.9e, May 2009 -----
% 0.67/1.13 The job began on n027.cluster.edu, Mon Jun 13 14:02:33 2022
% 0.67/1.13 The command was "./eqp09e".
% 0.67/1.13
% 0.67/1.13 set(prolog_style_variables).
% 0.67/1.13 set(lrpo).
% 0.67/1.13 set(basic_paramod).
% 0.67/1.13 set(functional_subsume).
% 0.67/1.13 set(ordered_paramod).
% 0.67/1.13 set(prime_paramod).
% 0.67/1.13 set(para_pairs).
% 0.67/1.13 assign(pick_given_ratio,4).
% 0.67/1.13 clear(print_kept).
% 0.67/1.13 clear(print_new_demod).
% 0.67/1.13 clear(print_back_demod).
% 0.67/1.13 clear(print_given).
% 0.67/1.13 assign(max_mem,64000).
% 0.67/1.13 end_of_commands.
% 0.67/1.13
% 0.67/1.13 Usable:
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Sos:
% 0.67/1.13 0 (wt=-1) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 0.67/1.13 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.67/1.13 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.67/1.13 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Demodulators:
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Passive:
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Starting to process input.
% 0.67/1.13
% 0.67/1.13 ** KEPT: 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 0.67/1.13 1 is a new demodulator.
% 0.67/1.13
% 0.67/1.13 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.67/1.13
% 0.67/1.13 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.67/1.13 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.67/1.13
% 0.67/1.13 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.67/1.13
% 0.67/1.13 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.67/1.13 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.67/1.13
% 0.67/1.13 ** KEPT: 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.67/1.13 ---------------- PROOF FOUND ----------------
% 0.67/1.13 % SZS status Unsatisfiable
% 0.67/1.13
% 0.67/1.13
% 0.67/1.13 After processing input:
% 0.67/1.13
% 0.67/1.13 Usable:
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Sos:
% 0.67/1.13 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.67/1.13 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.67/1.13 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.67/1.13 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.67/1.13 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.67/1.13 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Demodulators:
% 0.67/1.13 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 Passive:
% 0.67/1.13 end_of_list.
% 0.67/1.13
% 0.67/1.13 UNIT CONFLICT from 578 and 77 at 0.04 seconds.
% 0.67/1.13
% 0.67/1.13 ---------------- PROOF ----------------
% 0.67/1.13 % SZS output start Refutation
% See solution above
% 0.67/1.13 ------------ end of proof -------------
% 0.67/1.13
% 0.67/1.13
% 0.67/1.13 ------------- memory usage ------------
% 0.67/1.13 Memory dynamically allocated (tp_alloc): 1464.
% 0.67/1.13 type (bytes each) gets frees in use avail bytes
% 0.67/1.13 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.67/1.13 term ( 16) 28256 14618 13638 46 265.0 K
% 0.67/1.13 gen_ptr ( 8) 69963 1298 68665 20 536.6 K
% 0.67/1.13 context ( 808) 19123 19121 2 2 3.2 K
% 0.67/1.13 trail ( 12) 371 371 0 6 0.1 K
% 0.67/1.13 bt_node ( 68) 3228 3225 3 14 1.1 K
% 0.67/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.67/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.67/1.13 ac_match_free_vars_pos (4020)
% 0.67/1.13 0 0 0 0 0.0 K
% 0.67/1.13 discrim ( 12) 10137 159 9978 0 116.9 K
% 0.67/1.13 flat ( 40) 78819 78819 0 119 4.6 K
% 0.67/1.13 discrim_pos ( 12) 413 413 0 1 0.0 K
% 0.67/1.13 fpa_head ( 12) 3790 0 3790 0 44.4 K
% 0.67/1.13 fpa_tree ( 28) 1385 1385 0 39 1.1 K
% 0.67/1.13 fpa_pos ( 36) 633 633 0 1 0.0 K
% 0.67/1.13 literal ( 12) 2020 1442 578 1 6.8 K
% 0.67/1.13 clause ( 24) 2020 1442 578 1 13.6 K
% 0.67/1.13 list ( 12) 114 58 56 3 0.7 K
% 0.67/1.13 list_pos ( 20) 1796 19 1777 0 34.7 K
% 0.67/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.67/1.13
% 0.67/1.13 -------------- statistics -------------
% 0.67/1.13 Clauses input 4
% 0.67/1.13 Usable input 0
% 0.67/1.13 Sos input 4
% 0.67/1.13 Demodulators input 0
% 0.67/1.13 Passive input 0
% 0.67/1.13
% 0.67/1.13 Processed BS (before search) 8
% 0.67/1.13 Forward subsumed BS 2
% 0.67/1.13 Kept BS 6
% 0.67/1.13 New demodulators BS 1
% 0.67/1.13 Back demodulated BS 0
% 0.67/1.13
% 0.67/1.13 Clauses or pairs given 724
% 0.67/1.13 Clauses generated 974
% 0.67/1.13 Forward subsumed 402
% 0.67/1.13 Deleted by weight 0
% 0.67/1.13 Deleted by variable count 0
% 0.67/1.13 Kept 572
% 0.67/1.13 New demodulators 54
% 0.67/1.13 Back demodulated 3
% 0.67/1.13 Ordered paramod prunes 0
% 0.67/1.13 Basic paramod prunes 1376
% 0.67/1.13 Prime paramod prunes 0
% 0.67/1.13 Semantic prunes 0
% 0.67/1.13
% 0.67/1.13 Rewrite attmepts 11811
% 0.67/1.13 Rewrites 30
% 0.67/1.13
% 0.67/1.13 FPA overloads 0
% 0.67/1.13 FPA underloads 0
% 0.67/1.13
% 0.67/1.13 Usable size 0
% 0.67/1.13 Sos size 574
% 0.67/1.13 Demodulators size 52
% 0.67/1.13 Passive size 0
% 0.67/1.13 Disabled size 3
% 0.67/1.13
% 0.67/1.13 Proofs found 1
% 0.67/1.13
% 0.67/1.13 ----------- times (seconds) ----------- Mon Jun 13 14:02:33 2022
% 0.67/1.13
% 0.67/1.13 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.67/1.13 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.67/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.67/1.13 input time 0.00
% 0.67/1.13 paramodulation time 0.01
% 0.67/1.13 demodulation time 0.01
% 0.67/1.13 orient time 0.00
% 0.67/1.13 weigh time 0.00
% 0.67/1.13 forward subsume time 0.00
% 0.67/1.13 back demod find time 0.00
% 0.67/1.13 conflict time 0.00
% 0.67/1.13 LRPO time 0.00
% 0.67/1.13 store clause time 0.01
% 0.67/1.13 disable clause time 0.00
% 0.67/1.13 prime paramod time 0.00
% 0.67/1.13 semantics time 0.00
% 0.67/1.13
% 0.67/1.13 EQP interrupted
%------------------------------------------------------------------------------