TSTP Solution File: GRP451-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP451-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:29 EDT 2022
% Result : Unsatisfiable 0.76s 1.14s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 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 : 30 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C),B),
file('GRP451-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP451-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('GRP451-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(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(51,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(52,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[51]),
[iquote('flip(51)')] ).
cnf(74,plain,
~ equal(divide(inverse(b1),inverse(b1)),multiply(inverse(a1),a1)),
inference(para,[status(thm),theory(equality)],[52,6]),
[iquote('para(52,6)')] ).
cnf(79,plain,
equal(divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(C,C),A),D)))),D),B),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(80,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),79]),
[iquote('para(7,1),demod([79])')] ).
cnf(85,plain,
equal(multiply(inverse(A),A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[51,80]),
[iquote('para(51,80)')] ).
cnf(86,plain,
equal(divide(A,A),multiply(inverse(B),B)),
inference(flip,[status(thm),theory(equality)],[85]),
[iquote('flip(85)')] ).
cnf(87,plain,
$false,
inference(conflict,[status(thm)],[86,74]),
[iquote('conflict(86,74)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP451-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 22:28:34 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.76/1.14 ----- EQP 0.9e, May 2009 -----
% 0.76/1.14 The job began on n011.cluster.edu, Mon Jun 13 22:28:35 2022
% 0.76/1.14 The command was "./eqp09e".
% 0.76/1.14
% 0.76/1.14 set(prolog_style_variables).
% 0.76/1.14 set(lrpo).
% 0.76/1.14 set(basic_paramod).
% 0.76/1.14 set(functional_subsume).
% 0.76/1.14 set(ordered_paramod).
% 0.76/1.14 set(prime_paramod).
% 0.76/1.14 set(para_pairs).
% 0.76/1.14 assign(pick_given_ratio,4).
% 0.76/1.14 clear(print_kept).
% 0.76/1.14 clear(print_new_demod).
% 0.76/1.14 clear(print_back_demod).
% 0.76/1.14 clear(print_given).
% 0.76/1.14 assign(max_mem,64000).
% 0.76/1.14 end_of_commands.
% 0.76/1.14
% 0.76/1.14 Usable:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Sos:
% 0.76/1.14 0 (wt=-1) [] divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.76/1.14 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.76/1.14 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.76/1.14 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Demodulators:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Passive:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Starting to process input.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 1 (wt=19) [] divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.76/1.14 1 is a new demodulator.
% 0.76/1.14
% 0.76/1.14 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.76/1.14
% 0.76/1.14 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.76/1.14 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.76/1.14
% 0.76/1.14 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.76/1.14
% 0.76/1.14 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.76/1.14 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.76/1.14
% 0.76/1.14 ** KEPT: 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.76/1.14 ---------------- PROOF FOUND ----------------
% 0.76/1.14 % SZS status Unsatisfiable
% 0.76/1.14
% 0.76/1.14
% 0.76/1.14 After processing input:
% 0.76/1.14
% 0.76/1.14 Usable:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Sos:
% 0.76/1.14 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.76/1.14 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.76/1.14 6 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.76/1.14 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.76/1.14 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.76/1.14 1 (wt=19) [] divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Demodulators:
% 0.76/1.14 1 (wt=19) [] divide(divide(divide(A,A),divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 Passive:
% 0.76/1.14 end_of_list.
% 0.76/1.14
% 0.76/1.14 UNIT CONFLICT from 86 and 74 at 0.01 seconds.
% 0.76/1.14
% 0.76/1.14 ---------------- PROOF ----------------
% 0.76/1.14 % SZS output start Refutation
% See solution above
% 0.76/1.14 ------------ end of proof -------------
% 0.76/1.14
% 0.76/1.14
% 0.76/1.14 ------------- memory usage ------------
% 0.76/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.76/1.14 type (bytes each) gets frees in use avail bytes
% 0.76/1.14 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.76/1.14 term ( 16) 3238 1929 1309 23 25.7 K
% 0.76/1.14 gen_ptr ( 8) 5805 227 5578 14 43.7 K
% 0.76/1.14 context ( 808) 1922 1920 2 2 3.2 K
% 0.76/1.14 trail ( 12) 88 88 0 4 0.0 K
% 0.76/1.14 bt_node ( 68) 462 459 3 14 1.1 K
% 0.76/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.14 ac_match_free_vars_pos (4020)
% 0.76/1.14 0 0 0 0 0.0 K
% 0.76/1.14 discrim ( 12) 1138 11 1127 0 13.2 K
% 0.76/1.14 flat ( 40) 5201 5201 0 31 1.2 K
% 0.76/1.14 discrim_pos ( 12) 45 45 0 1 0.0 K
% 0.76/1.14 fpa_head ( 12) 966 0 966 0 11.3 K
% 0.76/1.14 fpa_tree ( 28) 187 187 0 11 0.3 K
% 0.76/1.14 fpa_pos ( 36) 103 103 0 1 0.0 K
% 0.76/1.14 literal ( 12) 272 186 86 1 1.0 K
% 0.76/1.14 clause ( 24) 272 186 86 1 2.0 K
% 0.76/1.14 list ( 12) 76 20 56 3 0.7 K
% 0.76/1.14 list_pos ( 20) 278 9 269 0 5.3 K
% 0.76/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.14
% 0.76/1.14 -------------- statistics -------------
% 0.76/1.14 Clauses input 4
% 0.76/1.14 Usable input 0
% 0.76/1.14 Sos input 4
% 0.76/1.14 Demodulators input 0
% 0.76/1.14 Passive input 0
% 0.76/1.14
% 0.76/1.14 Processed BS (before search) 8
% 0.76/1.14 Forward subsumed BS 2
% 0.76/1.14 Kept BS 6
% 0.76/1.14 New demodulators BS 1
% 0.76/1.14 Back demodulated BS 0
% 0.76/1.14
% 0.76/1.14 Clauses or pairs given 64
% 0.76/1.14 Clauses generated 128
% 0.76/1.14 Forward subsumed 48
% 0.76/1.14 Deleted by weight 0
% 0.76/1.14 Deleted by variable count 0
% 0.76/1.14 Kept 80
% 0.76/1.14 New demodulators 16
% 0.76/1.14 Back demodulated 1
% 0.76/1.14 Ordered paramod prunes 0
% 0.76/1.14 Basic paramod prunes 21
% 0.76/1.14 Prime paramod prunes 0
% 0.76/1.14 Semantic prunes 0
% 0.76/1.14
% 0.76/1.14 Rewrite attmepts 1008
% 0.76/1.14 Rewrites 2
% 0.76/1.14
% 0.76/1.14 FPA overloads 0
% 0.76/1.14 FPA underloads 0
% 0.76/1.14
% 0.76/1.14 Usable size 0
% 0.76/1.14 Sos size 84
% 0.76/1.14 Demodulators size 16
% 0.76/1.14 Passive size 0
% 0.76/1.14 Disabled size 1
% 0.76/1.14
% 0.76/1.14 Proofs found 1
% 0.76/1.14
% 0.76/1.14 ----------- times (seconds) ----------- Mon Jun 13 22:28:35 2022
% 0.76/1.14
% 0.76/1.14 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.76/1.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.76/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.14 input time 0.00
% 0.76/1.14 paramodulation time 0.00
% 0.76/1.14 demodulation time 0.00
% 0.76/1.14 orient time 0.00
% 0.76/1.14 weigh time 0.00
% 0.76/1.14 forward subsume time 0.00
% 0.76/1.14 back demod find time 0.00
% 0.76/1.14 conflict time 0.00
% 0.76/1.14 LRPO time 0.00
% 0.76/1.14 store clause time 0.00
% 0.76/1.14 disable clause time 0.00
% 0.76/1.14 prime paramod time 0.00
% 0.76/1.14 semantics time 0.00
% 0.76/1.14
% 0.76/1.14 EQP interrupted
%------------------------------------------------------------------------------