TSTP Solution File: GRP582-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP582-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n015.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:48:04 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 29 ( 29 unt; 0 nHn; 5 RR)
% Number of literals : 29 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)),C),
file('GRP582-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP582-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP582-1.p',unknown),
[] ).
cnf(4,plain,
equal(double_divide(A,double_divide(A,identity)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),1]),
[iquote('demod([3]),flip(1)')] ).
cnf(5,plain,
~ equal(double_divide(double_divide(a2,identity),identity),a2),
inference(demod,[status(thm),theory(equality)],[2]),
[iquote('demod([2])')] ).
cnf(9,plain,
equal(double_divide(double_divide(A,double_divide(identity,double_divide(B,double_divide(double_divide(identity,identity),A)))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(10,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(double_divide(identity,A),double_divide(B,identity))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,A),identity)),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(double_divide(identity,identity),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,11]),4,4]),1]),
[iquote('para(4,11),demod([4,4]),flip(1)')] ).
cnf(13,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,A),identity)),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),12]),
[iquote('back_demod(11),demod([12])')] ).
cnf(14,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(double_divide(identity,A),double_divide(B,identity))),identity),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),12]),
[iquote('back_demod(10),demod([12])')] ).
cnf(15,plain,
equal(double_divide(double_divide(A,double_divide(identity,double_divide(B,double_divide(identity,A)))),identity),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),12,12]),
[iquote('back_demod(9),demod([12,12])')] ).
cnf(21,plain,
equal(double_divide(double_divide(identity,double_divide(identity,double_divide(A,identity))),identity),A),
inference(para,[status(thm),theory(equality)],[12,15]),
[iquote('para(12,15)')] ).
cnf(24,plain,
equal(double_divide(double_divide(double_divide(A,identity),identity),identity),double_divide(identity,A)),
inference(para,[status(thm),theory(equality)],[4,14]),
[iquote('para(4,14)')] ).
cnf(27,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(double_divide(identity,A),B)),identity),double_divide(identity,double_divide(double_divide(identity,B),identity))),
inference(para,[status(thm),theory(equality)],[13,14]),
[iquote('para(13,14)')] ).
cnf(28,plain,
equal(double_divide(identity,double_divide(double_divide(identity,double_divide(A,identity)),identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),27]),
[iquote('back_demod(14),demod([27])')] ).
cnf(30,plain,
equal(double_divide(double_divide(identity,A),identity),double_divide(identity,double_divide(A,identity))),
inference(para,[status(thm),theory(equality)],[21,13]),
[iquote('para(21,13)')] ).
cnf(31,plain,
equal(double_divide(identity,double_divide(identity,double_divide(double_divide(A,identity),identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[28]),30]),
[iquote('back_demod(28),demod([30])')] ).
cnf(32,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(double_divide(identity,A),B)),identity),double_divide(identity,double_divide(identity,double_divide(B,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[27]),30]),
[iquote('back_demod(27),demod([30])')] ).
cnf(37,plain,
equal(double_divide(double_divide(A,identity),identity),double_divide(identity,double_divide(identity,double_divide(identity,double_divide(A,identity))))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,31]),30]),1]),
[iquote('para(24,31),demod([30]),flip(1)')] ).
cnf(38,plain,
equal(double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,double_divide(identity,double_divide(A,identity)))))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),37]),
[iquote('back_demod(31),demod([37])')] ).
cnf(40,plain,
~ equal(double_divide(identity,double_divide(identity,double_divide(identity,double_divide(a2,identity)))),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),37]),
[iquote('back_demod(5),demod([37])')] ).
cnf(49,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(identity,double_divide(A,identity))),identity),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,32]),12,12,12]),
[iquote('para(30,32),demod([12,12,12])')] ).
cnf(81,plain,
equal(double_divide(double_divide(A,identity),double_divide(identity,double_divide(A,identity))),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[49,38]),12,12,12,12,12]),1]),
[iquote('para(49,38),demod([12,12,12,12,12]),flip(1)')] ).
cnf(82,plain,
equal(double_divide(identity,A),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[81,15]),12,37,30,30,30,37,38]),
[iquote('para(81,15),demod([12,37,30,30,30,37,38])')] ).
cnf(86,plain,
equal(double_divide(identity,double_divide(identity,double_divide(identity,double_divide(A,identity)))),double_divide(identity,double_divide(A,identity))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[82,30]),37]),
[iquote('para(82,30),demod([37])')] ).
cnf(95,plain,
~ equal(double_divide(identity,double_divide(a2,identity)),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),86]),
[iquote('back_demod(40),demod([86])')] ).
cnf(96,plain,
equal(double_divide(identity,double_divide(A,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),86,86]),
[iquote('back_demod(38),demod([86,86])')] ).
cnf(97,plain,
$false,
inference(conflict,[status(thm)],[96,95]),
[iquote('conflict(96,95)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP582-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 10:13:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.70/1.10 ----- EQP 0.9e, May 2009 -----
% 0.70/1.10 The job began on n015.cluster.edu, Mon Jun 13 10:13:23 2022
% 0.70/1.10 The command was "./eqp09e".
% 0.70/1.10
% 0.70/1.10 set(prolog_style_variables).
% 0.70/1.10 set(lrpo).
% 0.70/1.10 set(basic_paramod).
% 0.70/1.10 set(functional_subsume).
% 0.70/1.10 set(ordered_paramod).
% 0.70/1.10 set(prime_paramod).
% 0.70/1.10 set(para_pairs).
% 0.70/1.10 assign(pick_given_ratio,4).
% 0.70/1.10 clear(print_kept).
% 0.70/1.10 clear(print_new_demod).
% 0.70/1.10 clear(print_back_demod).
% 0.70/1.10 clear(print_given).
% 0.70/1.10 assign(max_mem,64000).
% 0.70/1.10 end_of_commands.
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.70/1.10 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.70/1.10 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.70/1.10 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.70/1.10 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Starting to process input.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.70/1.10 1 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.70/1.10 2 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.70/1.10 3 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.70/1.10 4 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.70/1.10 ---------------- PROOF FOUND ----------------
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 After processing input:
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.70/1.10 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.70/1.10 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.70/1.10 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.70/1.10 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.70/1.10 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.70/1.10 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.70/1.10 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 UNIT CONFLICT from 96 and 95 at 0.01 seconds.
% 0.70/1.10
% 0.70/1.10 ---------------- PROOF ----------------
% 0.70/1.10 % SZS output start Refutation
% See solution above
% 0.70/1.10 ------------ end of proof -------------
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 ------------- memory usage ------------
% 0.70/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.10 type (bytes each) gets frees in use avail bytes
% 0.70/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.70/1.10 term ( 16) 8889 7282 1607 21 31.4 K
% 0.70/1.10 gen_ptr ( 8) 10286 2749 7537 28 59.1 K
% 0.70/1.10 context ( 808) 11341 11339 2 6 6.3 K
% 0.70/1.10 trail ( 12) 362 362 0 4 0.0 K
% 0.70/1.10 bt_node ( 68) 5886 5883 3 14 1.1 K
% 0.70/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_free_vars_pos (4020)
% 0.70/1.10 0 0 0 0 0.0 K
% 0.70/1.10 discrim ( 12) 1541 733 808 70 10.3 K
% 0.70/1.10 flat ( 40) 19459 19459 0 31 1.2 K
% 0.70/1.10 discrim_pos ( 12) 655 655 0 1 0.0 K
% 0.70/1.10 fpa_head ( 12) 582 0 582 0 6.8 K
% 0.70/1.10 fpa_tree ( 28) 786 786 0 25 0.7 K
% 0.70/1.10 fpa_pos ( 36) 173 173 0 1 0.0 K
% 0.70/1.10 literal ( 12) 381 285 96 1 1.1 K
% 0.70/1.10 clause ( 24) 381 285 96 1 2.3 K
% 0.70/1.10 list ( 12) 136 79 57 2 0.7 K
% 0.70/1.10 list_pos ( 20) 457 220 237 4 4.7 K
% 0.70/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.10
% 0.70/1.10 -------------- statistics -------------
% 0.70/1.10 Clauses input 5
% 0.70/1.10 Usable input 0
% 0.70/1.10 Sos input 5
% 0.70/1.10 Demodulators input 0
% 0.70/1.10 Passive input 0
% 0.70/1.10
% 0.70/1.10 Processed BS (before search) 5
% 0.70/1.10 Forward subsumed BS 0
% 0.70/1.10 Kept BS 5
% 0.70/1.10 New demodulators BS 4
% 0.70/1.10 Back demodulated BS 0
% 0.70/1.10
% 0.70/1.10 Clauses or pairs given 434
% 0.70/1.10 Clauses generated 265
% 0.70/1.10 Forward subsumed 174
% 0.70/1.10 Deleted by weight 0
% 0.70/1.10 Deleted by variable count 0
% 0.70/1.10 Kept 91
% 0.70/1.10 New demodulators 73
% 0.70/1.10 Back demodulated 44
% 0.70/1.10 Ordered paramod prunes 0
% 0.70/1.10 Basic paramod prunes 2125
% 0.70/1.10 Prime paramod prunes 64
% 0.70/1.10 Semantic prunes 0
% 0.70/1.10
% 0.70/1.10 Rewrite attmepts 4800
% 0.70/1.10 Rewrites 569
% 0.70/1.10
% 0.70/1.10 FPA overloads 0
% 0.70/1.10 FPA underloads 0
% 0.70/1.10
% 0.70/1.10 Usable size 0
% 0.70/1.10 Sos size 51
% 0.70/1.10 Demodulators size 39
% 0.70/1.10 Passive size 0
% 0.70/1.10 Disabled size 44
% 0.70/1.10
% 0.70/1.10 Proofs found 1
% 0.70/1.10
% 0.70/1.10 ----------- times (seconds) ----------- Mon Jun 13 10:13:23 2022
% 0.70/1.10
% 0.70/1.10 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.70/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.10 input time 0.00
% 0.70/1.10 paramodulation time 0.00
% 0.70/1.10 demodulation time 0.00
% 0.70/1.10 orient time 0.00
% 0.70/1.10 weigh time 0.00
% 0.70/1.10 forward subsume time 0.00
% 0.70/1.10 back demod find time 0.00
% 0.70/1.10 conflict time 0.00
% 0.70/1.10 LRPO time 0.00
% 0.70/1.10 store clause time 0.00
% 0.70/1.10 disable clause time 0.00
% 0.70/1.10 prime paramod time 0.00
% 0.70/1.10 semantics time 0.00
% 0.70/1.10
% 0.70/1.10 EQP interrupted
%------------------------------------------------------------------------------