TSTP Solution File: GRP455-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP455-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:30 EDT 2022
% Result : Unsatisfiable 0.74s 1.11s
% Output : Refutation 0.74s
% 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 : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C),B),
file('GRP455-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP455-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(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),4]),
[iquote('back_demod(1),demod([4])')] ).
cnf(6,plain,
~ equal(divide(identity,divide(identity,a2)),a2),
inference(demod,[status(thm),theory(equality)],[2]),
[iquote('demod([2])')] ).
cnf(7,plain,
equal(divide(divide(identity,divide(identity,divide(A,divide(identity,B)))),B),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(8,plain,
equal(divide(divide(identity,divide(A,divide(B,identity))),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(10,plain,
equal(divide(divide(identity,divide(identity,divide(A,identity))),identity),A),
inference(para,[status(thm),theory(equality)],[4,7]),
[iquote('para(4,7)')] ).
cnf(11,plain,
equal(divide(identity,divide(identity,divide(A,identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(12,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),11]),
[iquote('back_demod(10),demod([11])')] ).
cnf(13,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),12]),
[iquote('back_demod(11),demod([12])')] ).
cnf(14,plain,
$false,
inference(conflict,[status(thm)],[13,6]),
[iquote('conflict(13,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP455-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n019.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 : Mon Jun 13 09:36:24 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.74/1.11 ----- EQP 0.9e, May 2009 -----
% 0.74/1.11 The job began on n019.cluster.edu, Mon Jun 13 09:36:25 2022
% 0.74/1.11 The command was "./eqp09e".
% 0.74/1.11
% 0.74/1.11 set(prolog_style_variables).
% 0.74/1.11 set(lrpo).
% 0.74/1.11 set(basic_paramod).
% 0.74/1.11 set(functional_subsume).
% 0.74/1.11 set(ordered_paramod).
% 0.74/1.11 set(prime_paramod).
% 0.74/1.11 set(para_pairs).
% 0.74/1.11 assign(pick_given_ratio,4).
% 0.74/1.11 clear(print_kept).
% 0.74/1.11 clear(print_new_demod).
% 0.74/1.11 clear(print_back_demod).
% 0.74/1.11 clear(print_given).
% 0.74/1.11 assign(max_mem,64000).
% 0.74/1.11 end_of_commands.
% 0.74/1.11
% 0.74/1.11 Usable:
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Sos:
% 0.74/1.11 0 (wt=-1) [] divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.74/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.11 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.74/1.11 0 (wt=-1) [] identity = divide(A,A).
% 0.74/1.11 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Demodulators:
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Passive:
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Starting to process input.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 1 (wt=17) [] divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.74/1.11 1 is a new demodulator.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.11 2 is a new demodulator.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.11 3 is a new demodulator.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.11 4 is a new demodulator.
% 0.74/1.11 -> 4 back demodulating 1.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.11 5 is a new demodulator.
% 0.74/1.11
% 0.74/1.11 ** KEPT: 6 (wt=7) [demod([2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.11 ---------------- PROOF FOUND ----------------
% 0.74/1.11 % SZS status Unsatisfiable
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 After processing input:
% 0.74/1.11
% 0.74/1.11 Usable:
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Sos:
% 0.74/1.11 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.11 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.11 6 (wt=7) [demod([2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.11 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.11 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Demodulators:
% 0.74/1.11 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.11 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.11 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.11 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 Passive:
% 0.74/1.11 end_of_list.
% 0.74/1.11
% 0.74/1.11 UNIT CONFLICT from 13 and 6 at 0.00 seconds.
% 0.74/1.11
% 0.74/1.11 ---------------- PROOF ----------------
% 0.74/1.11 % SZS output start Refutation
% See solution above
% 0.74/1.11 ------------ end of proof -------------
% 0.74/1.11
% 0.74/1.11
% 0.74/1.11 ------------- memory usage ------------
% 0.74/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.11 type (bytes each) gets frees in use avail bytes
% 0.74/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.11 term ( 16) 784 650 134 18 2.9 K
% 0.74/1.11 gen_ptr ( 8) 650 165 485 11 3.9 K
% 0.74/1.11 context ( 808) 378 376 2 3 3.9 K
% 0.74/1.11 trail ( 12) 34 34 0 3 0.0 K
% 0.74/1.11 bt_node ( 68) 123 120 3 2 0.3 K
% 0.74/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.11 ac_match_free_vars_pos (4020)
% 0.74/1.11 0 0 0 0 0.0 K
% 0.74/1.11 discrim ( 12) 144 47 97 15 1.3 K
% 0.74/1.11 flat ( 40) 440 440 0 13 0.5 K
% 0.74/1.11 discrim_pos ( 12) 12 12 0 1 0.0 K
% 0.74/1.11 fpa_head ( 12) 122 0 122 0 1.4 K
% 0.74/1.11 fpa_tree ( 28) 45 45 0 7 0.2 K
% 0.74/1.11 fpa_pos ( 36) 24 24 0 1 0.0 K
% 0.74/1.11 literal ( 12) 33 20 13 1 0.2 K
% 0.74/1.11 clause ( 24) 33 20 13 1 0.3 K
% 0.74/1.11 list ( 12) 70 12 58 2 0.7 K
% 0.74/1.11 list_pos ( 20) 60 20 40 4 0.9 K
% 0.74/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.11
% 0.74/1.11 -------------- statistics -------------
% 0.74/1.11 Clauses input 5
% 0.74/1.11 Usable input 0
% 0.74/1.11 Sos input 5
% 0.74/1.11 Demodulators input 0
% 0.74/1.11 Passive input 0
% 0.74/1.11
% 0.74/1.11 Processed BS (before search) 6
% 0.74/1.11 Forward subsumed BS 0
% 0.74/1.11 Kept BS 6
% 0.74/1.11 New demodulators BS 5
% 0.74/1.11 Back demodulated BS 1
% 0.74/1.11
% 0.74/1.11 Clauses or pairs given 18
% 0.74/1.11 Clauses generated 13
% 0.74/1.11 Forward subsumed 6
% 0.74/1.11 Deleted by weight 0
% 0.74/1.11 Deleted by variable count 0
% 0.74/1.11 Kept 7
% 0.74/1.11 New demodulators 6
% 0.74/1.11 Back demodulated 2
% 0.74/1.11 Ordered paramod prunes 0
% 0.74/1.11 Basic paramod prunes 5
% 0.74/1.11 Prime paramod prunes 0
% 0.74/1.11 Semantic prunes 0
% 0.74/1.11
% 0.74/1.11 Rewrite attmepts 152
% 0.74/1.11 Rewrites 12
% 0.74/1.11
% 0.74/1.11 FPA overloads 0
% 0.74/1.11 FPA underloads 0
% 0.74/1.11
% 0.74/1.11 Usable size 0
% 0.74/1.11 Sos size 9
% 0.74/1.11 Demodulators size 8
% 0.74/1.11 Passive size 0
% 0.74/1.11 Disabled size 3
% 0.74/1.11
% 0.74/1.11 Proofs found 1
% 0.74/1.11
% 0.74/1.11 ----------- times (seconds) ----------- Mon Jun 13 09:36:25 2022
% 0.74/1.11
% 0.74/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.11 input time 0.00
% 0.74/1.11 paramodulation time 0.00
% 0.74/1.11 demodulation time 0.00
% 0.74/1.11 orient time 0.00
% 0.74/1.11 weigh time 0.00
% 0.74/1.11 forward subsume time 0.00
% 0.74/1.11 back demod find time 0.00
% 0.74/1.11 conflict time 0.00
% 0.74/1.11 LRPO time 0.00
% 0.74/1.11 store clause time 0.00
% 0.74/1.11 disable clause time 0.00
% 0.74/1.11 prime paramod time 0.00
% 0.74/1.11 semantics time 0.00
% 0.74/1.11
% 0.74/1.11 EQP interrupted
%------------------------------------------------------------------------------