TSTP Solution File: GRP488-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP488-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:47:38 EDT 2022
% Result : Unsatisfiable 0.71s 1.10s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 5 RR)
% Number of literals : 32 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)),C),
file('GRP488-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP488-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP488-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(6,plain,
equal(double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),C),identity)),double_divide(double_divide(double_divide(identity,double_divide(double_divide(C,identity),double_divide(D,B))),D),identity)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity),double_divide(D,double_divide(double_divide(double_divide(identity,double_divide(double_divide(D,identity),C)),A),identity))),
inference(flip,[status(thm),theory(equality)],[6]),
[iquote('flip(6)')] ).
cnf(9,plain,
equal(double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),identity)),B),identity)),double_divide(B,identity)),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(10,plain,
equal(double_divide(A,double_divide(double_divide(double_divide(identity,identity),double_divide(A,identity)),identity)),identity),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(double_divide(double_divide(identity,identity),double_divide(identity,identity)),identity),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(12,plain,
equal(double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(double_divide(double_divide(identity,double_divide(double_divide(B,identity),double_divide(C,D))),C),identity))),E),identity)),double_divide(double_divide(double_divide(identity,double_divide(double_divide(E,identity),D)),B),identity)),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(17,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,identity),double_divide(identity,A))),double_divide(double_divide(A,B),identity)),double_divide(double_divide(double_divide(identity,double_divide(double_divide(B,identity),double_divide(C,identity))),C),identity)),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(18,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),B),identity),double_divide(double_divide(identity,double_divide(double_divide(identity,identity),double_divide(identity,C))),double_divide(double_divide(C,A),identity))),
inference(flip,[status(thm),theory(equality)],[17]),
[iquote('flip(17)')] ).
cnf(32,plain,
equal(double_divide(double_divide(identity,identity),identity),double_divide(identity,identity)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,1]),9]),
[iquote('para(11,1),demod([9])')] ).
cnf(35,plain,
equal(double_divide(A,double_divide(B,double_divide(double_divide(double_divide(identity,double_divide(double_divide(B,identity),C)),A),identity))),C),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(36,plain,
equal(double_divide(A,double_divide(B,double_divide(double_divide(double_divide(identity,identity),A),identity))),double_divide(double_divide(B,identity),identity)),
inference(para,[status(thm),theory(equality)],[4,35]),
[iquote('para(4,35)')] ).
cnf(38,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),identity),double_divide(A,double_divide(identity,identity))),B),
inference(para,[status(thm),theory(equality)],[4,35]),
[iquote('para(4,35)')] ).
cnf(40,plain,
equal(double_divide(double_divide(double_divide(double_divide(identity,identity),A),identity),identity),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,36]),1]),
[iquote('para(4,36),flip(1)')] ).
cnf(54,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,identity),double_divide(identity,A))),double_divide(double_divide(A,B),identity)),double_divide(B,identity)),
inference(para,[status(thm),theory(equality)],[1,9]),
[iquote('para(1,9)')] ).
cnf(55,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,identity))),B),identity),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),54]),
[iquote('back_demod(18),demod([54])')] ).
cnf(68,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,double_divide(identity,identity)))),B),identity),double_divide(identity,double_divide(double_divide(double_divide(identity,identity),A),identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,6]),1]),
[iquote('para(11,6),flip(1)')] ).
cnf(74,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),B)),double_divide(C,identity)),identity),double_divide(C,double_divide(double_divide(double_divide(identity,B),A),identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,12]),1]),
[iquote('para(1,12),flip(1)')] ).
cnf(76,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(double_divide(identity,identity),A)),identity),identity),A),
inference(para,[status(thm),theory(equality)],[4,38]),
[iquote('para(4,38)')] ).
cnf(131,plain,
equal(double_divide(A,double_divide(identity,double_divide(double_divide(identity,A),identity))),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[32,1]),74,4]),
[iquote('para(32,1),demod([74,4])')] ).
cnf(132,plain,
equal(double_divide(identity,identity),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,131]),4,32]),
[iquote('para(4,131),demod([4,32])')] ).
cnf(144,plain,
equal(double_divide(double_divide(double_divide(identity,double_divide(identity,A)),identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[76]),132]),
[iquote('back_demod(76),demod([132])')] ).
cnf(145,plain,
equal(double_divide(identity,double_divide(double_divide(identity,A),identity)),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[68]),132,55,132]),1]),
[iquote('back_demod(68),demod([132,55,132]),flip(1)')] ).
cnf(164,plain,
equal(double_divide(double_divide(double_divide(identity,A),identity),identity),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),132]),
[iquote('back_demod(40),demod([132])')] ).
cnf(165,plain,
equal(double_divide(double_divide(identity,A),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[144]),164]),
[iquote('back_demod(144),demod([164])')] ).
cnf(170,plain,
equal(double_divide(identity,A),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[145]),165]),
[iquote('back_demod(145),demod([165])')] ).
cnf(206,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(para,[status(thm),theory(equality)],[170,165]),
[iquote('para(170,165)')] ).
cnf(207,plain,
$false,
inference(conflict,[status(thm)],[206,5]),
[iquote('conflict(206,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP488-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n015.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 08:43:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.10 ----- EQP 0.9e, May 2009 -----
% 0.71/1.10 The job began on n015.cluster.edu, Mon Jun 13 08:43:38 2022
% 0.71/1.10 The command was "./eqp09e".
% 0.71/1.10
% 0.71/1.10 set(prolog_style_variables).
% 0.71/1.10 set(lrpo).
% 0.71/1.10 set(basic_paramod).
% 0.71/1.10 set(functional_subsume).
% 0.71/1.10 set(ordered_paramod).
% 0.71/1.10 set(prime_paramod).
% 0.71/1.10 set(para_pairs).
% 0.71/1.10 assign(pick_given_ratio,4).
% 0.71/1.10 clear(print_kept).
% 0.71/1.10 clear(print_new_demod).
% 0.71/1.10 clear(print_back_demod).
% 0.71/1.10 clear(print_given).
% 0.71/1.10 assign(max_mem,64000).
% 0.71/1.10 end_of_commands.
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 0 (wt=-1) [] double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C.
% 0.71/1.10 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.10 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.71/1.10 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.71/1.10 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Starting to process input.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 1 (wt=17) [] double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C.
% 0.71/1.10 1 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.10 2 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.10 3 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.10 4 is a new demodulator.
% 0.71/1.10
% 0.71/1.10 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.71/1.10 ---------------- PROOF FOUND ----------------
% 0.71/1.10 % SZS status Unsatisfiable
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 After processing input:
% 0.71/1.10
% 0.71/1.10 Usable:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Sos:
% 0.71/1.10 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.10 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.10 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.71/1.10 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.10 1 (wt=17) [] double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C.
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Demodulators:
% 0.71/1.10 1 (wt=17) [] double_divide(A,double_divide(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(B,C))),B),identity)) = C.
% 0.71/1.10 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.10 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.10 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 Passive:
% 0.71/1.10 end_of_list.
% 0.71/1.10
% 0.71/1.10 UNIT CONFLICT from 206 and 5 at 0.02 seconds.
% 0.71/1.10
% 0.71/1.10 ---------------- PROOF ----------------
% 0.71/1.10 % SZS output start Refutation
% See solution above
% 0.71/1.10 ------------ end of proof -------------
% 0.71/1.10
% 0.71/1.10
% 0.71/1.10 ------------- memory usage ------------
% 0.71/1.10 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.10 type (bytes each) gets frees in use avail bytes
% 0.71/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.71/1.10 term ( 16) 14532 8455 6077 39 118.6 K
% 0.71/1.10 gen_ptr ( 8) 40332 4584 35748 31 279.5 K
% 0.71/1.10 context ( 808) 13553 13551 2 3 3.9 K
% 0.71/1.10 trail ( 12) 1206 1206 0 8 0.1 K
% 0.71/1.10 bt_node ( 68) 3965 3962 3 22 1.7 K
% 0.71/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.10 ac_match_free_vars_pos (4020)
% 0.71/1.10 0 0 0 0 0.0 K
% 0.71/1.10 discrim ( 12) 4839 1949 2890 173 35.9 K
% 0.71/1.10 flat ( 40) 55532 55532 0 67 2.6 K
% 0.71/1.10 discrim_pos ( 12) 289 289 0 1 0.0 K
% 0.71/1.10 fpa_head ( 12) 1039 0 1039 0 12.2 K
% 0.71/1.10 fpa_tree ( 28) 2396 2396 0 23 0.6 K
% 0.71/1.10 fpa_pos ( 36) 329 329 0 1 0.0 K
% 0.71/1.10 literal ( 12) 600 394 206 1 2.4 K
% 0.71/1.10 clause ( 24) 600 394 206 1 4.9 K
% 0.71/1.10 list ( 12) 182 126 56 4 0.7 K
% 0.71/1.10 list_pos ( 20) 931 429 502 7 9.9 K
% 0.71/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.10
% 0.71/1.10 -------------- statistics -------------
% 0.71/1.10 Clauses input 5
% 0.71/1.10 Usable input 0
% 0.71/1.10 Sos input 5
% 0.71/1.10 Demodulators input 0
% 0.71/1.10 Passive input 0
% 0.71/1.10
% 0.71/1.10 Processed BS (before search) 5
% 0.71/1.10 Forward subsumed BS 0
% 0.71/1.10 Kept BS 5
% 0.71/1.10 New demodulators BS 4
% 0.71/1.10 Back demodulated BS 0
% 0.71/1.10
% 0.71/1.10 Clauses or pairs given 347
% 0.71/1.10 Clauses generated 338
% 0.71/1.10 Forward subsumed 137
% 0.71/1.10 Deleted by weight 0
% 0.71/1.10 Deleted by variable count 0
% 0.71/1.10 Kept 201
% 0.71/1.10 New demodulators 119
% 0.71/1.10 Back demodulated 88
% 0.71/1.10 Ordered paramod prunes 0
% 0.71/1.10 Basic paramod prunes 1745
% 0.71/1.10 Prime paramod prunes 21
% 0.71/1.10 Semantic prunes 0
% 0.71/1.10
% 0.71/1.10 Rewrite attmepts 7814
% 0.71/1.10 Rewrites 208
% 0.71/1.10
% 0.71/1.10 FPA overloads 0
% 0.71/1.10 FPA underloads 0
% 0.71/1.10
% 0.71/1.10 Usable size 0
% 0.71/1.10 Sos size 117
% 0.71/1.10 Demodulators size 63
% 0.71/1.10 Passive size 0
% 0.71/1.10 Disabled size 88
% 0.71/1.10
% 0.71/1.10 Proofs found 1
% 0.71/1.10
% 0.71/1.10 ----------- times (seconds) ----------- Mon Jun 13 08:43:38 2022
% 0.71/1.10
% 0.71/1.10 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.10 input time 0.00
% 0.71/1.10 paramodulation time 0.00
% 0.71/1.10 demodulation time 0.00
% 0.71/1.10 orient time 0.00
% 0.71/1.10 weigh time 0.00
% 0.71/1.10 forward subsume time 0.00
% 0.71/1.10 back demod find time 0.00
% 0.71/1.10 conflict time 0.00
% 0.71/1.10 LRPO time 0.00
% 0.71/1.10 store clause time 0.01
% 0.71/1.10 disable clause time 0.00
% 0.71/1.10 prime paramod time 0.00
% 0.71/1.10 semantics time 0.00
% 0.71/1.10
% 0.71/1.10 EQP interrupted
%------------------------------------------------------------------------------