TSTP Solution File: GRP495-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP495-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:40 EDT 2022
% Result : Unsatisfiable 0.71s 1.13s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 5 RR)
% Number of literals : 34 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 54 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))),B),
file('GRP495-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP495-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP495-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(double_divide(double_divide(c3,b3),identity),a3),identity),double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2,2,2,2]),1]),
[iquote('demod([2,2,2,2]),flip(1)')] ).
cnf(8,plain,
equal(double_divide(identity,double_divide(double_divide(double_divide(A,B),double_divide(identity,identity)),double_divide(double_divide(identity,identity),B))),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(9,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,double_divide(B,identity)))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(10,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,double_divide(A,identity)),double_divide(identity,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(A,identity),double_divide(identity,identity))),identity),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(13,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(14,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,13]),4]),1]),
[iquote('para(4,13),demod([4]),flip(1)')] ).
cnf(15,plain,
equal(double_divide(double_divide(identity,A),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),14]),
[iquote('back_demod(13),demod([14])')] ).
cnf(16,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),14,15]),
[iquote('back_demod(11),demod([14,15])')] ).
cnf(18,plain,
equal(double_divide(double_divide(identity,A),double_divide(B,double_divide(A,identity))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),14,16]),
[iquote('back_demod(10),demod([14,16])')] ).
cnf(19,plain,
equal(double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(identity,B))),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),14,14]),
[iquote('back_demod(8),demod([14,14])')] ).
cnf(22,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),identity),double_divide(A,C))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),14]),
[iquote('back_demod(1),demod([14])')] ).
cnf(25,plain,
equal(double_divide(A,identity),double_divide(identity,A)),
inference(para,[status(thm),theory(equality)],[15,16]),
[iquote('para(15,16)')] ).
cnf(26,plain,
equal(double_divide(identity,A),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[25]),
[iquote('flip(25)')] ).
cnf(28,plain,
equal(double_divide(identity,double_divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[25,15]),
[iquote('para(25,15)')] ).
cnf(31,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,18]),28]),
[iquote('para(15,18),demod([28])')] ).
cnf(32,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(para,[status(thm),theory(equality)],[31,31]),
[iquote('para(31,31)')] ).
cnf(38,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(A,double_divide(B,identity)),identity)),B),
inference(para,[status(thm),theory(equality)],[26,9]),
[iquote('para(26,9)')] ).
cnf(40,plain,
equal(double_divide(double_divide(double_divide(double_divide(A,B),identity),double_divide(identity,B)),identity),A),
inference(para,[status(thm),theory(equality)],[26,19]),
[iquote('para(26,19)')] ).
cnf(66,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(B,identity)),identity),B),double_divide(identity,A)),
inference(para,[status(thm),theory(equality)],[38,31]),
[iquote('para(38,31)')] ).
cnf(77,plain,
equal(double_divide(double_divide(double_divide(A,B),identity),double_divide(identity,B)),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,16]),1]),
[iquote('para(40,16),flip(1)')] ).
cnf(120,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,double_divide(C,A)),identity),C)),B),
inference(para,[status(thm),theory(equality)],[31,22]),
[iquote('para(31,22)')] ).
cnf(134,plain,
equal(double_divide(double_divide(A,double_divide(B,identity)),identity),double_divide(B,double_divide(identity,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[66,31]),1]),
[iquote('para(66,31),flip(1)')] ).
cnf(138,plain,
~ equal(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity),double_divide(double_divide(b3,a3),double_divide(identity,c3))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),134]),
[iquote('back_demod(5),demod([134])')] ).
cnf(160,plain,
equal(double_divide(double_divide(identity,A),double_divide(B,identity)),double_divide(double_divide(B,A),identity)),
inference(para,[status(thm),theory(equality)],[77,31]),
[iquote('para(77,31)')] ).
cnf(245,plain,
equal(double_divide(double_divide(double_divide(A,identity),B),identity),double_divide(double_divide(identity,B),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,160]),1]),
[iquote('para(16,160),flip(1)')] ).
cnf(270,plain,
~ equal(double_divide(double_divide(identity,a3),double_divide(c3,b3)),double_divide(double_divide(b3,a3),double_divide(identity,c3))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[138]),245]),
[iquote('back_demod(138),demod([245])')] ).
cnf(390,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(B,identity),C)),double_divide(double_divide(C,A),B)),
inference(para,[status(thm),theory(equality)],[32,120]),
[iquote('para(32,120)')] ).
cnf(499,plain,
equal(double_divide(double_divide(identity,A),double_divide(B,C)),double_divide(double_divide(C,A),double_divide(identity,B))),
inference(para,[status(thm),theory(equality)],[32,390]),
[iquote('para(32,390)')] ).
cnf(500,plain,
$false,
inference(conflict,[status(thm)],[499,270]),
[iquote('conflict(499,270)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP495-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n021.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 : Tue Jun 14 13:43:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.13 ----- EQP 0.9e, May 2009 -----
% 0.71/1.13 The job began on n021.cluster.edu, Tue Jun 14 13:43:28 2022
% 0.71/1.13 The command was "./eqp09e".
% 0.71/1.13
% 0.71/1.13 set(prolog_style_variables).
% 0.71/1.13 set(lrpo).
% 0.71/1.13 set(basic_paramod).
% 0.71/1.13 set(functional_subsume).
% 0.71/1.13 set(ordered_paramod).
% 0.71/1.13 set(prime_paramod).
% 0.71/1.13 set(para_pairs).
% 0.71/1.13 assign(pick_given_ratio,4).
% 0.71/1.13 clear(print_kept).
% 0.71/1.13 clear(print_new_demod).
% 0.71/1.13 clear(print_back_demod).
% 0.71/1.13 clear(print_given).
% 0.71/1.13 assign(max_mem,64000).
% 0.71/1.13 end_of_commands.
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 0 (wt=-1) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.71/1.13 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.71/1.13 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Starting to process input.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.71/1.13 1 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 2 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 3 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 4 is a new demodulator.
% 0.71/1.13
% 0.71/1.13 ** KEPT: 5 (wt=19) [demod([2,2,2,2]),flip(1)] -(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) = double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)).
% 0.71/1.13 ---------------- PROOF FOUND ----------------
% 0.71/1.13 % SZS status Unsatisfiable
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 After processing input:
% 0.71/1.13
% 0.71/1.13 Usable:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Sos:
% 0.71/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.71/1.13 5 (wt=19) [demod([2,2,2,2]),flip(1)] -(double_divide(double_divide(double_divide(double_divide(c3,b3),identity),a3),identity) = double_divide(double_divide(c3,double_divide(double_divide(b3,a3),identity)),identity)).
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Demodulators:
% 0.71/1.13 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.71/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.71/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.71/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 Passive:
% 0.71/1.13 end_of_list.
% 0.71/1.13
% 0.71/1.13 UNIT CONFLICT from 499 and 270 at 0.03 seconds.
% 0.71/1.13
% 0.71/1.13 ---------------- PROOF ----------------
% 0.71/1.13 % SZS output start Refutation
% See solution above
% 0.71/1.13 ------------ end of proof -------------
% 0.71/1.13
% 0.71/1.13
% 0.71/1.13 ------------- memory usage ------------
% 0.71/1.13 Memory dynamically allocated (tp_alloc): 976.
% 0.71/1.13 type (bytes each) gets frees in use avail bytes
% 0.71/1.13 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.71/1.13 term ( 16) 51520 42658 8862 21 171.5 K
% 0.71/1.13 gen_ptr ( 8) 58120 18317 39803 33 311.2 K
% 0.71/1.13 context ( 808) 49069 49067 2 3 3.9 K
% 0.71/1.13 trail ( 12) 2403 2403 0 7 0.1 K
% 0.71/1.13 bt_node ( 68) 21620 21617 3 20 1.5 K
% 0.71/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.13 ac_match_free_vars_pos (4020)
% 0.71/1.13 0 0 0 0 0.0 K
% 0.71/1.13 discrim ( 12) 7543 4522 3021 222 38.0 K
% 0.71/1.13 flat ( 40) 106431 106431 0 35 1.4 K
% 0.71/1.13 discrim_pos ( 12) 3471 3471 0 1 0.0 K
% 0.71/1.13 fpa_head ( 12) 1085 0 1085 0 12.7 K
% 0.71/1.13 fpa_tree ( 28) 2975 2975 0 35 1.0 K
% 0.71/1.13 fpa_pos ( 36) 861 861 0 1 0.0 K
% 0.71/1.13 literal ( 12) 2872 2373 499 1 5.9 K
% 0.71/1.13 clause ( 24) 2872 2373 499 1 11.7 K
% 0.71/1.13 list ( 12) 421 365 56 3 0.7 K
% 0.71/1.13 list_pos ( 20) 2336 1176 1160 14 22.9 K
% 0.71/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.13
% 0.71/1.13 -------------- statistics -------------
% 0.71/1.13 Clauses input 5
% 0.71/1.13 Usable input 0
% 0.71/1.13 Sos input 5
% 0.71/1.13 Demodulators input 0
% 0.71/1.13 Passive input 0
% 0.71/1.13
% 0.71/1.13 Processed BS (before search) 5
% 0.71/1.13 Forward subsumed BS 0
% 0.71/1.13 Kept BS 5
% 0.71/1.13 New demodulators BS 4
% 0.71/1.13 Back demodulated BS 0
% 0.71/1.13
% 0.71/1.13 Clauses or pairs given 1963
% 0.71/1.13 Clauses generated 1987
% 0.71/1.13 Forward subsumed 1493
% 0.71/1.13 Deleted by weight 0
% 0.71/1.13 Deleted by variable count 0
% 0.71/1.13 Kept 494
% 0.71/1.13 New demodulators 358
% 0.71/1.13 Back demodulated 237
% 0.71/1.13 Ordered paramod prunes 0
% 0.71/1.13 Basic paramod prunes 7595
% 0.71/1.13 Prime paramod prunes 346
% 0.71/1.13 Semantic prunes 0
% 0.71/1.13
% 0.71/1.13 Rewrite attmepts 22955
% 0.71/1.13 Rewrites 2774
% 0.71/1.13
% 0.71/1.13 FPA overloads 0
% 0.71/1.13 FPA underloads 0
% 0.71/1.13
% 0.71/1.13 Usable size 0
% 0.71/1.13 Sos size 261
% 0.71/1.13 Demodulators size 140
% 0.71/1.13 Passive size 0
% 0.71/1.13 Disabled size 237
% 0.71/1.13
% 0.71/1.13 Proofs found 1
% 0.71/1.13
% 0.71/1.13 ----------- times (seconds) ----------- Tue Jun 14 13:43:28 2022
% 0.71/1.13
% 0.71/1.13 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.71/1.13 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.71/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.13 input time 0.00
% 0.71/1.13 paramodulation time 0.01
% 0.71/1.13 demodulation time 0.00
% 0.71/1.13 orient time 0.00
% 0.71/1.13 weigh time 0.00
% 0.71/1.13 forward subsume time 0.00
% 0.71/1.13 back demod find time 0.00
% 0.71/1.13 conflict time 0.00
% 0.71/1.13 LRPO time 0.00
% 0.71/1.13 store clause time 0.00
% 0.71/1.13 disable clause time 0.00
% 0.71/1.13 prime paramod time 0.00
% 0.71/1.13 semantics time 0.00
% 0.71/1.13
% 0.71/1.13 EQP interrupted
%------------------------------------------------------------------------------