TSTP Solution File: GRP497-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:41 EDT 2022
% Result : Unsatisfiable 0.69s 1.06s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 5 RR)
% Number of literals : 23 ( 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 : 31 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),identity)),C),
file('GRP497-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP497-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP497-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(7,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(double_divide(A,double_divide(B,C)),identity),double_divide(D,identity))),double_divide(double_divide(D,B),identity)),double_divide(identity,double_divide(C,double_divide(A,identity)))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(10,plain,
equal(double_divide(identity,identity),identity),
inference(para,[status(thm),theory(equality)],[1,4]),
[iquote('para(1,4)')] ).
cnf(11,plain,
equal(double_divide(identity,double_divide(double_divide(A,double_divide(B,A)),identity)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),10]),
[iquote('para(4,1),demod([10])')] ).
cnf(13,plain,
equal(double_divide(double_divide(identity,double_divide(identity,double_divide(A,identity))),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),10]),
[iquote('para(4,1),demod([10])')] ).
cnf(17,plain,
equal(double_divide(identity,double_divide(double_divide(double_divide(A,identity),identity),identity)),A),
inference(para,[status(thm),theory(equality)],[4,11]),
[iquote('para(4,11)')] ).
cnf(20,plain,
equal(double_divide(identity,double_divide(A,identity)),double_divide(B,double_divide(A,B))),
inference(para,[status(thm),theory(equality)],[11,11]),
[iquote('para(11,11)')] ).
cnf(46,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(double_divide(A,double_divide(identity,B)),identity),identity)),identity),double_divide(identity,double_divide(B,double_divide(A,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,7]),10,10]),
[iquote('para(10,7),demod([10,10])')] ).
cnf(52,plain,
equal(double_divide(double_divide(identity,double_divide(identity,A)),identity),double_divide(identity,double_divide(identity,double_divide(A,identity)))),
inference(para,[status(thm),theory(equality)],[13,13]),
[iquote('para(13,13)')] ).
cnf(53,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)],[13]),52]),
[iquote('back_demod(13),demod([52])')] ).
cnf(59,plain,
equal(double_divide(double_divide(A,identity),identity),double_divide(identity,double_divide(A,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,11]),1]),
[iquote('para(17,11),flip(1)')] ).
cnf(62,plain,
equal(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)],[53]),59]),
[iquote('back_demod(53),demod([59])')] ).
cnf(73,plain,
equal(double_divide(A,double_divide(identity,B)),double_divide(identity,double_divide(B,double_divide(A,identity)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),59,52,59,62]),
[iquote('back_demod(46),demod([59,52,59,62])')] ).
cnf(78,plain,
~ equal(double_divide(identity,double_divide(a2,identity)),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[5]),59]),
[iquote('back_demod(5),demod([59])')] ).
cnf(88,plain,
equal(double_divide(A,double_divide(B,A)),double_divide(C,double_divide(B,C))),
inference(para,[status(thm),theory(equality)],[20,20]),
[iquote('para(20,20)')] ).
cnf(91,plain,
~ equal(double_divide(A,double_divide(a2,A)),a2),
inference(para,[status(thm),theory(equality)],[88,78]),
[iquote('para(88,78)')] ).
cnf(96,plain,
equal(double_divide(identity,double_divide(identity,double_divide(A,identity))),double_divide(A,identity)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,73]),1]),
[iquote('para(10,73),flip(1)')] ).
cnf(101,plain,
equal(double_divide(identity,double_divide(A,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[62]),96]),
[iquote('back_demod(62),demod([96])')] ).
cnf(102,plain,
$false,
inference(conflict,[status(thm)],[101,91]),
[iquote('conflict(101,91)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP497-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n025.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 08:12:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.06 ----- EQP 0.9e, May 2009 -----
% 0.69/1.06 The job began on n025.cluster.edu, Tue Jun 14 08:12:40 2022
% 0.69/1.06 The command was "./eqp09e".
% 0.69/1.06
% 0.69/1.06 set(prolog_style_variables).
% 0.69/1.06 set(lrpo).
% 0.69/1.06 set(basic_paramod).
% 0.69/1.06 set(functional_subsume).
% 0.69/1.06 set(ordered_paramod).
% 0.69/1.06 set(prime_paramod).
% 0.69/1.06 set(para_pairs).
% 0.69/1.06 assign(pick_given_ratio,4).
% 0.69/1.06 clear(print_kept).
% 0.69/1.06 clear(print_new_demod).
% 0.69/1.06 clear(print_back_demod).
% 0.69/1.06 clear(print_given).
% 0.69/1.06 assign(max_mem,64000).
% 0.69/1.06 end_of_commands.
% 0.69/1.06
% 0.69/1.06 Usable:
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Sos:
% 0.69/1.06 0 (wt=-1) [] double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),identity)) = C.
% 0.69/1.06 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.69/1.06 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.69/1.06 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.69/1.06 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Demodulators:
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Passive:
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Starting to process input.
% 0.69/1.06
% 0.69/1.06 ** KEPT: 1 (wt=17) [] double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),identity)) = C.
% 0.69/1.06 1 is a new demodulator.
% 0.69/1.06
% 0.69/1.06 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.69/1.06 2 is a new demodulator.
% 0.69/1.06
% 0.69/1.06 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.69/1.06 3 is a new demodulator.
% 0.69/1.06
% 0.69/1.06 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.69/1.06 4 is a new demodulator.
% 0.69/1.06
% 0.69/1.06 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.69/1.06 ---------------- PROOF FOUND ----------------
% 0.69/1.06 % SZS status Unsatisfiable
% 0.69/1.06
% 0.69/1.06
% 0.69/1.06 After processing input:
% 0.69/1.06
% 0.69/1.06 Usable:
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Sos:
% 0.69/1.06 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.69/1.06 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.69/1.06 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.69/1.06 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.69/1.06 1 (wt=17) [] double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),identity)) = C.
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Demodulators:
% 0.69/1.06 1 (wt=17) [] double_divide(double_divide(identity,double_divide(A,double_divide(B,identity))),double_divide(double_divide(B,double_divide(C,A)),identity)) = C.
% 0.69/1.06 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.69/1.06 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.69/1.06 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 Passive:
% 0.69/1.06 end_of_list.
% 0.69/1.06
% 0.69/1.06 UNIT CONFLICT from 101 and 91 at 0.00 seconds.
% 0.69/1.06
% 0.69/1.06 ---------------- PROOF ----------------
% 0.69/1.06 % SZS output start Refutation
% See solution above
% 0.69/1.06 ------------ end of proof -------------
% 0.69/1.06
% 0.69/1.06
% 0.69/1.06 ------------- memory usage ------------
% 0.69/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.06 type (bytes each) gets frees in use avail bytes
% 0.69/1.06 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.69/1.06 term ( 16) 6086 4034 2052 29 40.2 K
% 0.69/1.06 gen_ptr ( 8) 11626 2022 9604 22 75.2 K
% 0.69/1.06 context ( 808) 6070 6068 2 3 3.9 K
% 0.69/1.06 trail ( 12) 458 458 0 6 0.1 K
% 0.69/1.06 bt_node ( 68) 2314 2311 3 18 1.4 K
% 0.69/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.06 ac_match_free_vars_pos (4020)
% 0.69/1.06 0 0 0 0 0.0 K
% 0.69/1.06 discrim ( 12) 2023 826 1197 21 14.3 K
% 0.69/1.06 flat ( 40) 14103 14103 0 39 1.5 K
% 0.69/1.06 discrim_pos ( 12) 227 227 0 1 0.0 K
% 0.69/1.06 fpa_head ( 12) 590 0 590 0 6.9 K
% 0.69/1.06 fpa_tree ( 28) 644 644 0 23 0.6 K
% 0.69/1.06 fpa_pos ( 36) 171 171 0 1 0.0 K
% 0.69/1.06 literal ( 12) 316 215 101 1 1.2 K
% 0.69/1.06 clause ( 24) 316 215 101 1 2.4 K
% 0.69/1.06 list ( 12) 129 72 57 3 0.7 K
% 0.69/1.06 list_pos ( 20) 458 195 263 4 5.2 K
% 0.69/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.06
% 0.69/1.06 -------------- statistics -------------
% 0.69/1.06 Clauses input 5
% 0.69/1.06 Usable input 0
% 0.69/1.06 Sos input 5
% 0.69/1.06 Demodulators input 0
% 0.69/1.06 Passive input 0
% 0.69/1.06
% 0.69/1.06 Processed BS (before search) 5
% 0.69/1.06 Forward subsumed BS 0
% 0.69/1.06 Kept BS 5
% 0.69/1.06 New demodulators BS 4
% 0.69/1.06 Back demodulated BS 0
% 0.69/1.06
% 0.69/1.06 Clauses or pairs given 204
% 0.69/1.06 Clauses generated 187
% 0.69/1.06 Forward subsumed 91
% 0.69/1.06 Deleted by weight 0
% 0.69/1.06 Deleted by variable count 0
% 0.69/1.06 Kept 96
% 0.69/1.06 New demodulators 66
% 0.69/1.06 Back demodulated 40
% 0.69/1.06 Ordered paramod prunes 0
% 0.69/1.06 Basic paramod prunes 559
% 0.69/1.06 Prime paramod prunes 10
% 0.69/1.06 Semantic prunes 0
% 0.69/1.06
% 0.69/1.06 Rewrite attmepts 3065
% 0.69/1.06 Rewrites 195
% 0.69/1.06
% 0.69/1.06 FPA overloads 0
% 0.69/1.06 FPA underloads 0
% 0.69/1.06
% 0.69/1.06 Usable size 0
% 0.69/1.06 Sos size 60
% 0.69/1.06 Demodulators size 41
% 0.69/1.06 Passive size 0
% 0.69/1.06 Disabled size 40
% 0.69/1.06
% 0.69/1.06 Proofs found 1
% 0.69/1.06
% 0.69/1.06 ----------- times (seconds) ----------- Tue Jun 14 08:12:40 2022
% 0.69/1.06
% 0.69/1.06 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.06 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.06 input time 0.00
% 0.69/1.06 paramodulation time 0.00
% 0.69/1.06 demodulation time 0.00
% 0.69/1.06 orient time 0.00
% 0.69/1.06 weigh time 0.00
% 0.69/1.06 forward subsume time 0.00
% 0.69/1.06 back demod find time 0.00
% 0.69/1.06 conflict time 0.00
% 0.69/1.06 LRPO time 0.00
% 0.69/1.06 store clause time 0.00
% 0.69/1.06 disable clause time 0.00
% 0.69/1.06 prime paramod time 0.00
% 0.69/1.06 semantics time 0.00
% 0.69/1.06
% 0.69/1.06 EQP interrupted
%------------------------------------------------------------------------------