TSTP Solution File: GRP530-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP530-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:50 EDT 2022
% Result : Unsatisfiable 0.82s 1.16s
% Output : Refutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 4 RR)
% Number of literals : 15 ( 0 equ; 3 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,divide(B,C)),divide(A,B)),C),
file('GRP530-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP530-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('GRP530-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(multiply(inverse(b2),b2),a2),a2),
file('GRP530-1.p',unknown),
[] ).
cnf(50,plain,
equal(inverse(divide(divide(A,B),A)),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(56,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(57,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[56]),
[iquote('flip(56)')] ).
cnf(62,plain,
equal(divide(multiply(inverse(A),A),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[56,5]),
[iquote('para(56,5)')] ).
cnf(63,plain,
equal(inverse(A),divide(multiply(inverse(B),B),A)),
inference(flip,[status(thm),theory(equality)],[62]),
[iquote('flip(62)')] ).
cnf(67,plain,
~ equal(divide(multiply(inverse(b2),b2),inverse(a2)),a2),
inference(para,[status(thm),theory(equality)],[57,6]),
[iquote('para(57,6)')] ).
cnf(86,plain,
equal(divide(multiply(inverse(A),A),divide(divide(B,C),B)),C),
inference(para,[status(thm),theory(equality)],[63,50]),
[iquote('para(63,50)')] ).
cnf(98,plain,
~ equal(divide(multiply(inverse(b2),b2),divide(divide(A,A),a2)),a2),
inference(para,[status(thm),theory(equality)],[4,67]),
[iquote('para(4,67)')] ).
cnf(99,plain,
$false,
inference(conflict,[status(thm)],[98,86]),
[iquote('conflict(98,86)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP530-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n025.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 : Tue Jun 14 03:44:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.82/1.16 ----- EQP 0.9e, May 2009 -----
% 0.82/1.16 The job began on n025.cluster.edu, Tue Jun 14 03:44:40 2022
% 0.82/1.16 The command was "./eqp09e".
% 0.82/1.16
% 0.82/1.16 set(prolog_style_variables).
% 0.82/1.16 set(lrpo).
% 0.82/1.16 set(basic_paramod).
% 0.82/1.16 set(functional_subsume).
% 0.82/1.16 set(ordered_paramod).
% 0.82/1.16 set(prime_paramod).
% 0.82/1.16 set(para_pairs).
% 0.82/1.16 assign(pick_given_ratio,4).
% 0.82/1.16 clear(print_kept).
% 0.82/1.16 clear(print_new_demod).
% 0.82/1.16 clear(print_back_demod).
% 0.82/1.16 clear(print_given).
% 0.82/1.16 assign(max_mem,64000).
% 0.82/1.16 end_of_commands.
% 0.82/1.16
% 0.82/1.16 Usable:
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Sos:
% 0.82/1.16 0 (wt=-1) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.82/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.82/1.16 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.82/1.16 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Demodulators:
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Passive:
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Starting to process input.
% 0.82/1.16
% 0.82/1.16 ** KEPT: 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.82/1.16 1 is a new demodulator.
% 0.82/1.16
% 0.82/1.16 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.82/1.16
% 0.82/1.16 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.82/1.16 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.82/1.16
% 0.82/1.16 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.82/1.16
% 0.82/1.16 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.82/1.16 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.82/1.16
% 0.82/1.16 ** KEPT: 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.82/1.16 ---------------- PROOF FOUND ----------------
% 0.82/1.16 % SZS status Unsatisfiable
% 0.82/1.16
% 0.82/1.16
% 0.82/1.16 After processing input:
% 0.82/1.16
% 0.82/1.16 Usable:
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Sos:
% 0.82/1.16 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.82/1.16 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.82/1.16 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.82/1.16 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.82/1.16 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.82/1.16 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Demodulators:
% 0.82/1.16 1 (wt=11) [] divide(divide(A,divide(B,C)),divide(A,B)) = C.
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 Passive:
% 0.82/1.16 end_of_list.
% 0.82/1.16
% 0.82/1.16 UNIT CONFLICT from 98 and 86 at 0.00 seconds.
% 0.82/1.16
% 0.82/1.16 ---------------- PROOF ----------------
% 0.82/1.16 % SZS output start Refutation
% See solution above
% 0.82/1.16 ------------ end of proof -------------
% 0.82/1.16
% 0.82/1.16
% 0.82/1.16 ------------- memory usage ------------
% 0.82/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.82/1.16 type (bytes each) gets frees in use avail bytes
% 0.82/1.16 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.82/1.16 term ( 16) 3172 1987 1185 14 23.0 K
% 0.82/1.16 gen_ptr ( 8) 4307 236 4071 14 31.9 K
% 0.82/1.16 context ( 808) 2146 2144 2 2 3.2 K
% 0.82/1.16 trail ( 12) 73 73 0 4 0.0 K
% 0.82/1.16 bt_node ( 68) 525 523 2 7 0.6 K
% 0.82/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.82/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.82/1.16 ac_match_free_vars_pos (4020)
% 0.82/1.16 0 0 0 0 0.0 K
% 0.82/1.16 discrim ( 12) 820 0 820 0 9.6 K
% 0.82/1.16 flat ( 40) 5170 5170 0 15 0.6 K
% 0.82/1.16 discrim_pos ( 12) 57 57 0 1 0.0 K
% 0.82/1.16 fpa_head ( 12) 511 0 511 0 6.0 K
% 0.82/1.16 fpa_tree ( 28) 150 150 0 17 0.5 K
% 0.82/1.16 fpa_pos ( 36) 119 119 0 1 0.0 K
% 0.82/1.16 literal ( 12) 318 220 98 0 1.1 K
% 0.82/1.16 clause ( 24) 318 220 98 0 2.3 K
% 0.82/1.16 list ( 12) 80 24 56 3 0.7 K
% 0.82/1.16 list_pos ( 20) 316 4 312 0 6.1 K
% 0.82/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.82/1.16
% 0.82/1.16 -------------- statistics -------------
% 0.82/1.16 Clauses input 4
% 0.82/1.16 Usable input 0
% 0.82/1.16 Sos input 4
% 0.82/1.16 Demodulators input 0
% 0.82/1.16 Passive input 0
% 0.82/1.16
% 0.82/1.16 Processed BS (before search) 8
% 0.82/1.16 Forward subsumed BS 2
% 0.82/1.16 Kept BS 6
% 0.82/1.16 New demodulators BS 1
% 0.82/1.16 Back demodulated BS 0
% 0.82/1.16
% 0.82/1.16 Clauses or pairs given 102
% 0.82/1.16 Clauses generated 154
% 0.82/1.16 Forward subsumed 62
% 0.82/1.16 Deleted by weight 0
% 0.82/1.16 Deleted by variable count 0
% 0.82/1.16 Kept 92
% 0.82/1.16 New demodulators 20
% 0.82/1.16 Back demodulated 0
% 0.82/1.16 Ordered paramod prunes 0
% 0.82/1.16 Basic paramod prunes 84
% 0.82/1.16 Prime paramod prunes 0
% 0.82/1.16 Semantic prunes 0
% 0.82/1.16
% 0.82/1.16 Rewrite attmepts 1015
% 0.82/1.16 Rewrites 6
% 0.82/1.16
% 0.82/1.16 FPA overloads 0
% 0.82/1.16 FPA underloads 0
% 0.82/1.16
% 0.82/1.16 Usable size 0
% 0.82/1.16 Sos size 97
% 0.82/1.16 Demodulators size 21
% 0.82/1.16 Passive size 0
% 0.82/1.16 Disabled size 0
% 0.82/1.16
% 0.82/1.16 Proofs found 1
% 0.82/1.16
% 0.82/1.16 ----------- times (seconds) ----------- Tue Jun 14 03:44:40 2022
% 0.82/1.16
% 0.82/1.16 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.82/1.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.82/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.82/1.16 input time 0.00
% 0.82/1.16 paramodulation time 0.00
% 0.82/1.16 demodulation time 0.00
% 0.82/1.16 orient time 0.00
% 0.82/1.16 weigh time 0.00
% 0.82/1.16 forward subsume time 0.00
% 0.82/1.16 back demod find time 0.00
% 0.82/1.16 conflict time 0.00
% 0.82/1.16 LRPO time 0.00
% 0.82/1.16 store clause time 0.00
% 0.82/1.16 disable clause time 0.00
% 0.82/1.16 prime paramod time 0.00
% 0.82/1.16 semantics time 0.00
% 0.82/1.16
% 0.82/1.16 EQP interrupted
%------------------------------------------------------------------------------