TSTP Solution File: GRP548-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP548-1 : TPTP v8.1.0. Bugfixed v2.7.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:55 EDT 2022
% Result : Unsatisfiable 0.72s 1.14s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% 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; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,divide(A,B)),divide(divide(B,C),A)),C),
file('GRP548-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP548-1.p',unknown),
[] ).
cnf(4,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(a,divide(identity,b)),divide(b,divide(identity,a))),
inference(demod,[status(thm),theory(equality)],[2,2]),
[iquote('demod([2,2])')] ).
cnf(10,plain,
equal(divide(identity,divide(divide(A,B),A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(11,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),10]),
[iquote('para(4,1),demod([10])')] ).
cnf(14,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(21,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,1]),14]),
[iquote('para(12,1),demod([14])')] ).
cnf(25,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
inference(para,[status(thm),theory(equality)],[21,11]),
[iquote('para(21,11)')] ).
cnf(40,plain,
equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
inference(para,[status(thm),theory(equality)],[21,25]),
[iquote('para(21,25)')] ).
cnf(41,plain,
$false,
inference(conflict,[status(thm)],[40,5]),
[iquote('conflict(40,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP548-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.13/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n025.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 09:31:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.72/1.14 ----- EQP 0.9e, May 2009 -----
% 0.72/1.14 The job began on n025.cluster.edu, Tue Jun 14 09:31:25 2022
% 0.72/1.14 The command was "./eqp09e".
% 0.72/1.14
% 0.72/1.14 set(prolog_style_variables).
% 0.72/1.14 set(lrpo).
% 0.72/1.14 set(basic_paramod).
% 0.72/1.14 set(functional_subsume).
% 0.72/1.14 set(ordered_paramod).
% 0.72/1.14 set(prime_paramod).
% 0.72/1.14 set(para_pairs).
% 0.72/1.14 assign(pick_given_ratio,4).
% 0.72/1.14 clear(print_kept).
% 0.72/1.14 clear(print_new_demod).
% 0.72/1.14 clear(print_back_demod).
% 0.72/1.14 clear(print_given).
% 0.72/1.14 assign(max_mem,64000).
% 0.72/1.14 end_of_commands.
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 0 (wt=-1) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.14 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.14 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.72/1.14 0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.14 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Starting to process input.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.14 1 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.14 2 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.14 3 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.14 4 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.72/1.14 ---------------- PROOF FOUND ----------------
% 0.72/1.14 % SZS status Unsatisfiable
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 After processing input:
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.14 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.14 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.14 5 (wt=11) [demod([2,2])] -(divide(a,divide(identity,b)) = divide(b,divide(identity,a))).
% 0.72/1.14 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.14 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.14 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.14 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 UNIT CONFLICT from 40 and 5 at 0.00 seconds.
% 0.72/1.14
% 0.72/1.14 ---------------- PROOF ----------------
% 0.72/1.14 % SZS output start Refutation
% See solution above
% 0.72/1.14 ------------ end of proof -------------
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 ------------- memory usage ------------
% 0.72/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.14 type (bytes each) gets frees in use avail bytes
% 0.72/1.14 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.72/1.14 term ( 16) 2542 1951 591 16 11.7 K
% 0.72/1.14 gen_ptr ( 8) 2796 533 2263 11 17.8 K
% 0.72/1.14 context ( 808) 1964 1962 2 2 3.2 K
% 0.72/1.14 trail ( 12) 185 185 0 5 0.1 K
% 0.72/1.14 bt_node ( 68) 765 762 3 14 1.1 K
% 0.72/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_free_vars_pos (4020)
% 0.72/1.14 0 0 0 0 0.0 K
% 0.72/1.14 discrim ( 12) 512 42 470 0 5.5 K
% 0.72/1.14 flat ( 40) 3639 3639 0 25 1.0 K
% 0.72/1.14 discrim_pos ( 12) 104 104 0 1 0.0 K
% 0.72/1.14 fpa_head ( 12) 257 0 257 0 3.0 K
% 0.72/1.14 fpa_tree ( 28) 104 104 0 13 0.4 K
% 0.72/1.14 fpa_pos ( 36) 62 62 0 1 0.0 K
% 0.72/1.14 literal ( 12) 162 122 40 1 0.5 K
% 0.72/1.14 clause ( 24) 162 122 40 1 1.0 K
% 0.72/1.14 list ( 12) 81 25 56 3 0.7 K
% 0.72/1.14 list_pos ( 20) 152 25 127 0 2.5 K
% 0.72/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.14
% 0.72/1.14 -------------- statistics -------------
% 0.72/1.14 Clauses input 5
% 0.72/1.14 Usable input 0
% 0.72/1.14 Sos input 5
% 0.72/1.14 Demodulators input 0
% 0.72/1.14 Passive input 0
% 0.72/1.14
% 0.72/1.14 Processed BS (before search) 5
% 0.72/1.14 Forward subsumed BS 0
% 0.72/1.14 Kept BS 5
% 0.72/1.14 New demodulators BS 4
% 0.72/1.14 Back demodulated BS 0
% 0.72/1.14
% 0.72/1.14 Clauses or pairs given 84
% 0.72/1.14 Clauses generated 108
% 0.72/1.14 Forward subsumed 73
% 0.72/1.14 Deleted by weight 0
% 0.72/1.14 Deleted by variable count 0
% 0.72/1.14 Kept 35
% 0.72/1.14 New demodulators 18
% 0.72/1.14 Back demodulated 4
% 0.72/1.14 Ordered paramod prunes 0
% 0.72/1.14 Basic paramod prunes 94
% 0.72/1.14 Prime paramod prunes 1
% 0.72/1.14 Semantic prunes 0
% 0.72/1.14
% 0.72/1.14 Rewrite attmepts 911
% 0.72/1.14 Rewrites 93
% 0.72/1.14
% 0.72/1.14 FPA overloads 0
% 0.72/1.14 FPA underloads 0
% 0.72/1.14
% 0.72/1.14 Usable size 0
% 0.72/1.14 Sos size 35
% 0.72/1.14 Demodulators size 18
% 0.72/1.14 Passive size 0
% 0.72/1.14 Disabled size 4
% 0.72/1.14
% 0.72/1.14 Proofs found 1
% 0.72/1.14
% 0.72/1.14 ----------- times (seconds) ----------- Tue Jun 14 09:31:25 2022
% 0.72/1.14
% 0.72/1.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.14 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.14 input time 0.00
% 0.72/1.14 paramodulation time 0.00
% 0.72/1.14 demodulation time 0.00
% 0.72/1.14 orient time 0.00
% 0.72/1.14 weigh time 0.00
% 0.72/1.14 forward subsume time 0.00
% 0.72/1.14 back demod find time 0.00
% 0.72/1.14 conflict time 0.00
% 0.72/1.14 LRPO time 0.00
% 0.72/1.14 store clause time 0.00
% 0.72/1.14 disable clause time 0.00
% 0.72/1.14 prime paramod time 0.00
% 0.72/1.14 semantics time 0.00
% 0.72/1.14
% 0.72/1.14 EQP interrupted
%------------------------------------------------------------------------------