TSTP Solution File: GRP491-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP491-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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:39 EDT 2022
% Result : Unsatisfiable 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 0 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 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 : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))),C),
file('GRP491-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP491-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP491-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(double_divide(identity,double_divide(identity,A)),double_divide(identity,double_divide(double_divide(B,identity),double_divide(C,double_divide(identity,double_divide(double_divide(double_divide(A,D),identity),double_divide(B,D))))))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(identity,identity),double_divide(B,double_divide(A,identity))))),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,identity)),double_divide(double_divide(A,identity),identity)),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(double_divide(double_divide(A,identity),identity),double_divide(double_divide(identity,A),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[11]),
[iquote('flip(11)')] ).
cnf(13,plain,
equal(double_divide(double_divide(double_divide(identity,identity),identity),identity),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,11]),4]),1]),
[iquote('para(4,11),demod([4]),flip(1)')] ).
cnf(16,plain,
equal(double_divide(double_divide(identity,double_divide(identity,A)),double_divide(identity,double_divide(double_divide(B,identity),B))),double_divide(identity,A)),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(18,plain,
~ equal(double_divide(double_divide(identity,a2),double_divide(identity,identity)),a2),
inference(para,[status(thm),theory(equality)],[12,5]),
[iquote('para(12,5)')] ).
cnf(24,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(identity,identity),identity))),A),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(27,plain,
equal(double_divide(identity,double_divide(identity,double_divide(double_divide(A,identity),A))),double_divide(identity,identity)),
inference(para,[status(thm),theory(equality)],[4,16]),
[iquote('para(4,16)')] ).
cnf(30,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)],[13,27]),27,4]),1]),
[iquote('para(13,27),demod([27,4]),flip(1)')] ).
cnf(34,plain,
equal(double_divide(double_divide(identity,A),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),30,30,30]),
[iquote('back_demod(24),demod([30,30,30])')] ).
cnf(41,plain,
~ equal(a2,a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[18]),30,34]),
[iquote('back_demod(18),demod([30,34])')] ).
cnf(42,plain,
$false,
inference(conflict,[status(thm)],[41]),
[iquote('xx_conflict(41)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP491-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 14:38:09 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.44/1.07 ----- EQP 0.9e, May 2009 -----
% 0.44/1.07 The job began on n007.cluster.edu, Mon Jun 13 14:38:09 2022
% 0.44/1.07 The command was "./eqp09e".
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(lrpo).
% 0.44/1.07 set(basic_paramod).
% 0.44/1.07 set(functional_subsume).
% 0.44/1.07 set(ordered_paramod).
% 0.44/1.07 set(prime_paramod).
% 0.44/1.07 set(para_pairs).
% 0.44/1.07 assign(pick_given_ratio,4).
% 0.44/1.07 clear(print_kept).
% 0.44/1.07 clear(print_new_demod).
% 0.44/1.07 clear(print_back_demod).
% 0.44/1.07 clear(print_given).
% 0.44/1.07 assign(max_mem,64000).
% 0.44/1.07 end_of_commands.
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 0 (wt=-1) [] double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = C.
% 0.44/1.07 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.44/1.07 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.44/1.07 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.44/1.07 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Starting to process input.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = C.
% 0.44/1.07 1 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.44/1.07 2 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.44/1.07 3 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.44/1.07 4 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.44/1.07 ---------------- PROOF FOUND ----------------
% 0.44/1.07 % SZS status Unsatisfiable
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 After processing input:
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.44/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.44/1.07 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.44/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.44/1.07 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = C.
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(identity,double_divide(double_divide(double_divide(A,B),identity),double_divide(C,B)))) = C.
% 0.44/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.44/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.44/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 UNIT CONFLICT from 41 and x=x at 0.00 seconds.
% 0.44/1.07
% 0.44/1.07 ---------------- PROOF ----------------
% 0.44/1.07 % SZS output start Refutation
% See solution above
% 0.44/1.07 ------------ end of proof -------------
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 ------------- memory usage ------------
% 0.44/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.44/1.07 type (bytes each) gets frees in use avail bytes
% 0.44/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.44/1.07 term ( 16) 2205 1459 746 29 15.0 K
% 0.44/1.07 gen_ptr ( 8) 4651 722 3929 17 30.8 K
% 0.44/1.07 context ( 808) 2547 2545 2 3 3.9 K
% 0.44/1.07 trail ( 12) 108 108 0 5 0.1 K
% 0.44/1.07 bt_node ( 68) 1365 1362 3 22 1.7 K
% 0.44/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.44/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.44/1.07 ac_match_free_vars_pos (4020)
% 0.44/1.07 0 0 0 0 0.0 K
% 0.44/1.07 discrim ( 12) 843 325 518 110 7.4 K
% 0.44/1.07 flat ( 40) 4175 4175 0 27 1.1 K
% 0.44/1.07 discrim_pos ( 12) 44 44 0 1 0.0 K
% 0.44/1.07 fpa_head ( 12) 403 0 403 0 4.7 K
% 0.44/1.07 fpa_tree ( 28) 382 382 0 17 0.5 K
% 0.44/1.07 fpa_pos ( 36) 76 76 0 1 0.0 K
% 0.44/1.07 literal ( 12) 106 65 41 0 0.5 K
% 0.44/1.07 clause ( 24) 106 65 41 0 1.0 K
% 0.44/1.07 list ( 12) 95 38 57 2 0.7 K
% 0.44/1.07 list_pos ( 20) 196 75 121 8 2.5 K
% 0.44/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.44/1.07
% 0.44/1.07 -------------- statistics -------------
% 0.44/1.07 Clauses input 5
% 0.44/1.07 Usable input 0
% 0.44/1.07 Sos input 5
% 0.44/1.07 Demodulators input 0
% 0.44/1.07 Passive input 0
% 0.44/1.07
% 0.44/1.07 Processed BS (before search) 5
% 0.44/1.07 Forward subsumed BS 0
% 0.44/1.07 Kept BS 5
% 0.44/1.07 New demodulators BS 4
% 0.44/1.07 Back demodulated BS 0
% 0.44/1.07
% 0.44/1.07 Clauses or pairs given 88
% 0.44/1.07 Clauses generated 57
% 0.44/1.07 Forward subsumed 21
% 0.44/1.07 Deleted by weight 0
% 0.44/1.07 Deleted by variable count 0
% 0.44/1.07 Kept 36
% 0.44/1.07 New demodulators 32
% 0.44/1.07 Back demodulated 14
% 0.44/1.07 Ordered paramod prunes 0
% 0.44/1.07 Basic paramod prunes 253
% 0.44/1.07 Prime paramod prunes 1
% 0.44/1.07 Semantic prunes 0
% 0.44/1.07
% 0.44/1.07 Rewrite attmepts 911
% 0.44/1.07 Rewrites 42
% 0.44/1.07
% 0.44/1.07 FPA overloads 0
% 0.44/1.07 FPA underloads 0
% 0.44/1.07
% 0.44/1.07 Usable size 0
% 0.44/1.07 Sos size 26
% 0.44/1.07 Demodulators size 23
% 0.44/1.07 Passive size 0
% 0.44/1.07 Disabled size 14
% 0.44/1.07
% 0.44/1.07 Proofs found 1
% 0.44/1.07
% 0.44/1.07 ----------- times (seconds) ----------- Mon Jun 13 14:38:09 2022
% 0.44/1.07
% 0.44/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.44/1.07 input time 0.00
% 0.44/1.07 paramodulation time 0.00
% 0.44/1.07 demodulation time 0.00
% 0.44/1.07 orient time 0.00
% 0.44/1.07 weigh time 0.00
% 0.44/1.07 forward subsume time 0.00
% 0.44/1.07 back demod find time 0.00
% 0.44/1.07 conflict time 0.00
% 0.44/1.07 LRPO time 0.00
% 0.44/1.07 store clause time 0.00
% 0.44/1.07 disable clause time 0.00
% 0.44/1.07 prime paramod time 0.00
% 0.44/1.07 semantics time 0.00
% 0.44/1.07
% 0.44/1.07 EQP interrupted
%------------------------------------------------------------------------------