TSTP Solution File: GRP487-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP487-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:38 EDT 2022
% Result : Unsatisfiable 0.76s 1.12s
% Output : Refutation 0.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 5 RR)
% Number of literals : 15 ( 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 23 ( 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('GRP487-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP487-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP487-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(identity,identity),identity),
inference(demod,[status(thm),theory(equality)],[3,2,4]),
[iquote('demod([3,2,4])')] ).
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(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(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(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(95,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(98,plain,
equal(double_divide(identity,identity),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,95]),4,32]),
[iquote('para(4,95),demod([4,32])')] ).
cnf(99,plain,
$false,
inference(conflict,[status(thm)],[98,5]),
[iquote('conflict(98,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP487-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n007.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 01:50:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.76/1.12 ----- EQP 0.9e, May 2009 -----
% 0.76/1.12 The job began on n007.cluster.edu, Tue Jun 14 01:50:55 2022
% 0.76/1.12 The command was "./eqp09e".
% 0.76/1.12
% 0.76/1.12 set(prolog_style_variables).
% 0.76/1.12 set(lrpo).
% 0.76/1.12 set(basic_paramod).
% 0.76/1.12 set(functional_subsume).
% 0.76/1.12 set(ordered_paramod).
% 0.76/1.12 set(prime_paramod).
% 0.76/1.12 set(para_pairs).
% 0.76/1.12 assign(pick_given_ratio,4).
% 0.76/1.12 clear(print_kept).
% 0.76/1.12 clear(print_new_demod).
% 0.76/1.12 clear(print_back_demod).
% 0.76/1.12 clear(print_given).
% 0.76/1.12 assign(max_mem,64000).
% 0.76/1.12 end_of_commands.
% 0.76/1.12
% 0.76/1.12 Usable:
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Sos:
% 0.76/1.12 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.76/1.12 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.76/1.12 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.76/1.12 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.76/1.12 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Demodulators:
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Passive:
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Starting to process input.
% 0.76/1.12
% 0.76/1.12 ** 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.76/1.12 1 is a new demodulator.
% 0.76/1.12
% 0.76/1.12 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.76/1.12 2 is a new demodulator.
% 0.76/1.12
% 0.76/1.12 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.76/1.12 3 is a new demodulator.
% 0.76/1.12
% 0.76/1.12 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.76/1.12 4 is a new demodulator.
% 0.76/1.12
% 0.76/1.12 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.76/1.12 ---------------- PROOF FOUND ----------------
% 0.76/1.12 % SZS status Unsatisfiable
% 0.76/1.12
% 0.76/1.12
% 0.76/1.12 After processing input:
% 0.76/1.12
% 0.76/1.12 Usable:
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Sos:
% 0.76/1.12 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.76/1.12 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.76/1.12 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.76/1.12 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.76/1.12 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.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Demodulators:
% 0.76/1.12 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.76/1.12 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.76/1.12 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.76/1.12 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 Passive:
% 0.76/1.12 end_of_list.
% 0.76/1.12
% 0.76/1.12 UNIT CONFLICT from 98 and 5 at 0.01 seconds.
% 0.76/1.12
% 0.76/1.12 ---------------- PROOF ----------------
% 0.76/1.12 % SZS output start Refutation
% See solution above
% 0.76/1.12 ------------ end of proof -------------
% 0.76/1.12
% 0.76/1.12
% 0.76/1.12 ------------- memory usage ------------
% 0.76/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.76/1.12 type (bytes each) gets frees in use avail bytes
% 0.76/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.76/1.12 term ( 16) 7684 4715 2969 41 58.4 K
% 0.76/1.12 gen_ptr ( 8) 18310 781 17529 14 137.1 K
% 0.76/1.12 context ( 808) 7442 7440 2 3 3.9 K
% 0.76/1.12 trail ( 12) 360 360 0 8 0.1 K
% 0.76/1.12 bt_node ( 68) 2423 2420 3 22 1.7 K
% 0.76/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.76/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.76/1.12 ac_match_free_vars_pos (4020)
% 0.76/1.12 0 0 0 0 0.0 K
% 0.76/1.12 discrim ( 12) 2401 170 2231 0 26.1 K
% 0.76/1.12 flat ( 40) 28012 28012 0 67 2.6 K
% 0.76/1.12 discrim_pos ( 12) 105 105 0 1 0.0 K
% 0.76/1.12 fpa_head ( 12) 802 0 802 0 9.4 K
% 0.76/1.12 fpa_tree ( 28) 627 627 0 23 0.6 K
% 0.76/1.12 fpa_pos ( 36) 159 159 0 1 0.0 K
% 0.76/1.12 literal ( 12) 291 193 98 1 1.2 K
% 0.76/1.12 clause ( 24) 291 193 98 1 2.3 K
% 0.76/1.12 list ( 12) 120 64 56 3 0.7 K
% 0.76/1.12 list_pos ( 20) 382 57 325 0 6.3 K
% 0.76/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.76/1.12
% 0.76/1.12 -------------- statistics -------------
% 0.76/1.12 Clauses input 5
% 0.76/1.12 Usable input 0
% 0.76/1.12 Sos input 5
% 0.76/1.12 Demodulators input 0
% 0.76/1.12 Passive input 0
% 0.76/1.12
% 0.76/1.12 Processed BS (before search) 5
% 0.76/1.12 Forward subsumed BS 0
% 0.76/1.12 Kept BS 5
% 0.76/1.12 New demodulators BS 4
% 0.76/1.12 Back demodulated BS 0
% 0.76/1.12
% 0.76/1.12 Clauses or pairs given 182
% 0.76/1.12 Clauses generated 160
% 0.76/1.12 Forward subsumed 67
% 0.76/1.12 Deleted by weight 0
% 0.76/1.12 Deleted by variable count 0
% 0.76/1.12 Kept 93
% 0.76/1.12 New demodulators 57
% 0.76/1.12 Back demodulated 11
% 0.76/1.12 Ordered paramod prunes 0
% 0.76/1.12 Basic paramod prunes 1030
% 0.76/1.12 Prime paramod prunes 14
% 0.76/1.12 Semantic prunes 0
% 0.76/1.12
% 0.76/1.12 Rewrite attmepts 3838
% 0.76/1.12 Rewrites 69
% 0.76/1.12
% 0.76/1.12 FPA overloads 0
% 0.76/1.12 FPA underloads 0
% 0.76/1.12
% 0.76/1.12 Usable size 0
% 0.76/1.12 Sos size 86
% 0.76/1.12 Demodulators size 56
% 0.76/1.12 Passive size 0
% 0.76/1.12 Disabled size 11
% 0.76/1.12
% 0.76/1.12 Proofs found 1
% 0.76/1.12
% 0.76/1.12 ----------- times (seconds) ----------- Tue Jun 14 01:50:55 2022
% 0.76/1.12
% 0.76/1.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.76/1.12 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.76/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.76/1.12 input time 0.00
% 0.76/1.12 paramodulation time 0.00
% 0.76/1.12 demodulation time 0.00
% 0.76/1.12 orient time 0.00
% 0.76/1.12 weigh time 0.00
% 0.76/1.12 forward subsume time 0.00
% 0.76/1.12 back demod find time 0.00
% 0.76/1.12 conflict time 0.00
% 0.76/1.12 LRPO time 0.00
% 0.76/1.12 store clause time 0.00
% 0.76/1.12 disable clause time 0.00
% 0.76/1.12 prime paramod time 0.00
% 0.76/1.12 semantics time 0.00
% 0.76/1.12
% 0.76/1.12 EQP interrupted
%------------------------------------------------------------------------------