TSTP Solution File: GRP578-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP578-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:48:03 EDT 2022
% Result : Unsatisfiable 0.75s 1.13s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 5 RR)
% Number of literals : 27 ( 0 equ; 1 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 : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(double_divide(B,A),C),double_divide(B,identity))),double_divide(identity,identity)),C),
file('GRP578-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP578-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP578-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(double_divide(identity,identity),double_divide(double_divide(A,B),double_divide(double_divide(C,double_divide(double_divide(double_divide(D,C),A),double_divide(D,identity))),identity))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(8,plain,
equal(double_divide(double_divide(double_divide(A,double_divide(identity,B)),C),double_divide(A,identity)),double_divide(double_divide(B,C),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(9,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(double_divide(identity,B),double_divide(A,identity))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(10,plain,
equal(double_divide(double_divide(A,double_divide(identity,double_divide(B,identity))),double_divide(identity,identity)),double_divide(double_divide(B,A),identity)),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(double_divide(double_divide(double_divide(A,identity),double_divide(identity,double_divide(A,identity))),double_divide(identity,identity)),double_divide(identity,identity)),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(13,plain,
equal(double_divide(double_divide(double_divide(double_divide(identity,A),identity),identity),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(19,plain,
equal(double_divide(double_divide(A,identity),double_divide(identity,identity)),double_divide(double_divide(identity,A),identity)),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(23,plain,
equal(double_divide(double_divide(double_divide(identity,identity),identity),double_divide(identity,identity)),double_divide(double_divide(double_divide(A,B),B),double_divide(A,identity))),
inference(para,[status(thm),theory(equality)],[4,6]),
[iquote('para(4,6)')] ).
cnf(24,plain,
equal(double_divide(double_divide(double_divide(A,B),B),double_divide(A,identity)),double_divide(double_divide(double_divide(identity,identity),identity),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[23]),
[iquote('flip(23)')] ).
cnf(31,plain,
equal(double_divide(double_divide(double_divide(identity,identity),identity),double_divide(identity,identity)),double_divide(identity,identity)),
inference(para,[status(thm),theory(equality)],[4,12]),
[iquote('para(4,12)')] ).
cnf(32,plain,
equal(double_divide(double_divide(double_divide(A,B),B),double_divide(A,identity)),double_divide(identity,identity)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[24]),31]),
[iquote('back_demod(24),demod([31])')] ).
cnf(33,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,A),identity)),identity),A),
inference(para,[status(thm),theory(equality)],[19,13]),
[iquote('para(19,13)')] ).
cnf(41,plain,
equal(double_divide(double_divide(double_divide(identity,A),double_divide(double_divide(A,B),double_divide(identity,identity))),double_divide(identity,identity)),B),
inference(para,[status(thm),theory(equality)],[8,1]),
[iquote('para(8,1)')] ).
cnf(43,plain,
equal(double_divide(double_divide(double_divide(identity,A),identity),double_divide(identity,identity)),double_divide(A,identity)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,41]),4]),
[iquote('para(4,41),demod([4])')] ).
cnf(45,plain,
equal(double_divide(double_divide(double_divide(identity,A),identity),identity),double_divide(A,double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,43]),1]),
[iquote('para(33,43),flip(1)')] ).
cnf(46,plain,
equal(double_divide(double_divide(A,double_divide(identity,identity)),double_divide(identity,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),45]),
[iquote('back_demod(13),demod([45])')] ).
cnf(56,plain,
equal(double_divide(double_divide(identity,identity),double_divide(identity,identity)),double_divide(double_divide(identity,A),A)),
inference(para,[status(thm),theory(equality)],[32,46]),
[iquote('para(32,46)')] ).
cnf(57,plain,
equal(double_divide(double_divide(identity,A),A),double_divide(double_divide(identity,identity),double_divide(identity,identity))),
inference(flip,[status(thm),theory(equality)],[56]),
[iquote('flip(56)')] ).
cnf(65,plain,
equal(double_divide(double_divide(identity,identity),double_divide(identity,identity)),identity),
inference(para,[status(thm),theory(equality)],[57,46]),
[iquote('para(57,46)')] ).
cnf(72,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)],[65,46]),4]),1]),
[iquote('para(65,46),demod([4]),flip(1)')] ).
cnf(106,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[46]),72,72]),
[iquote('back_demod(46),demod([72,72])')] ).
cnf(107,plain,
$false,
inference(conflict,[status(thm)],[106,5]),
[iquote('conflict(106,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP578-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Mon Jun 13 23:51:19 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.75/1.13 ----- EQP 0.9e, May 2009 -----
% 0.75/1.13 The job began on n011.cluster.edu, Mon Jun 13 23:51:20 2022
% 0.75/1.13 The command was "./eqp09e".
% 0.75/1.13
% 0.75/1.13 set(prolog_style_variables).
% 0.75/1.13 set(lrpo).
% 0.75/1.13 set(basic_paramod).
% 0.75/1.13 set(functional_subsume).
% 0.75/1.13 set(ordered_paramod).
% 0.75/1.13 set(prime_paramod).
% 0.75/1.13 set(para_pairs).
% 0.75/1.13 assign(pick_given_ratio,4).
% 0.75/1.13 clear(print_kept).
% 0.75/1.13 clear(print_new_demod).
% 0.75/1.13 clear(print_back_demod).
% 0.75/1.13 clear(print_given).
% 0.75/1.13 assign(max_mem,64000).
% 0.75/1.13 end_of_commands.
% 0.75/1.13
% 0.75/1.13 Usable:
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Sos:
% 0.75/1.13 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(double_divide(B,A),C),double_divide(B,identity))),double_divide(identity,identity)) = C.
% 0.75/1.13 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.75/1.13 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.75/1.13 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.75/1.13 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Demodulators:
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Passive:
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Starting to process input.
% 0.75/1.13
% 0.75/1.13 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(double_divide(B,A),C),double_divide(B,identity))),double_divide(identity,identity)) = C.
% 0.75/1.13 1 is a new demodulator.
% 0.75/1.13
% 0.75/1.13 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.75/1.13 2 is a new demodulator.
% 0.75/1.13
% 0.75/1.13 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.75/1.13 3 is a new demodulator.
% 0.75/1.13
% 0.75/1.13 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.75/1.13 4 is a new demodulator.
% 0.75/1.13
% 0.75/1.13 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.75/1.13 ---------------- PROOF FOUND ----------------
% 0.75/1.13 % SZS status Unsatisfiable
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 After processing input:
% 0.75/1.13
% 0.75/1.13 Usable:
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Sos:
% 0.75/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.75/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.75/1.13 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.75/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.75/1.13 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(double_divide(B,A),C),double_divide(B,identity))),double_divide(identity,identity)) = C.
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Demodulators:
% 0.75/1.13 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(double_divide(B,A),C),double_divide(B,identity))),double_divide(identity,identity)) = C.
% 0.75/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.75/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.75/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 Passive:
% 0.75/1.13 end_of_list.
% 0.75/1.13
% 0.75/1.13 UNIT CONFLICT from 106 and 5 at 0.01 seconds.
% 0.75/1.13
% 0.75/1.13 ---------------- PROOF ----------------
% 0.75/1.13 % SZS output start Refutation
% See solution above
% 0.75/1.13 ------------ end of proof -------------
% 0.75/1.13
% 0.75/1.13
% 0.75/1.13 ------------- memory usage ------------
% 0.75/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.75/1.13 type (bytes each) gets frees in use avail bytes
% 0.75/1.13 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.75/1.13 term ( 16) 5292 2991 2301 29 45.1 K
% 0.75/1.13 gen_ptr ( 8) 14711 2564 12147 26 95.1 K
% 0.75/1.13 context ( 808) 6082 6080 2 3 3.9 K
% 0.75/1.13 trail ( 12) 476 476 0 6 0.1 K
% 0.75/1.13 bt_node ( 68) 2886 2881 5 20 1.7 K
% 0.75/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.13 ac_match_free_vars_pos (4020)
% 0.75/1.13 0 0 0 0 0.0 K
% 0.75/1.13 discrim ( 12) 2700 1465 1235 423 19.4 K
% 0.75/1.13 flat ( 40) 13175 13175 0 43 1.7 K
% 0.75/1.13 discrim_pos ( 12) 139 139 0 1 0.0 K
% 0.75/1.13 fpa_head ( 12) 647 0 647 0 7.6 K
% 0.75/1.13 fpa_tree ( 28) 1056 1056 0 23 0.6 K
% 0.75/1.13 fpa_pos ( 36) 197 197 0 1 0.0 K
% 0.75/1.13 literal ( 12) 268 162 106 1 1.3 K
% 0.75/1.13 clause ( 24) 268 162 106 1 2.5 K
% 0.75/1.13 list ( 12) 150 93 57 3 0.7 K
% 0.75/1.13 list_pos ( 20) 543 239 304 14 6.2 K
% 0.75/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.13
% 0.75/1.13 -------------- statistics -------------
% 0.75/1.13 Clauses input 5
% 0.75/1.13 Usable input 0
% 0.75/1.13 Sos input 5
% 0.75/1.13 Demodulators input 0
% 0.75/1.13 Passive input 0
% 0.75/1.13
% 0.75/1.13 Processed BS (before search) 5
% 0.75/1.13 Forward subsumed BS 0
% 0.75/1.13 Kept BS 5
% 0.75/1.13 New demodulators BS 4
% 0.75/1.13 Back demodulated BS 0
% 0.75/1.13
% 0.75/1.13 Clauses or pairs given 189
% 0.75/1.13 Clauses generated 149
% 0.75/1.13 Forward subsumed 48
% 0.75/1.13 Deleted by weight 0
% 0.75/1.13 Deleted by variable count 0
% 0.75/1.13 Kept 101
% 0.75/1.13 New demodulators 87
% 0.75/1.13 Back demodulated 47
% 0.75/1.13 Ordered paramod prunes 0
% 0.75/1.13 Basic paramod prunes 803
% 0.75/1.13 Prime paramod prunes 7
% 0.75/1.13 Semantic prunes 0
% 0.75/1.13
% 0.75/1.13 Rewrite attmepts 2657
% 0.75/1.13 Rewrites 125
% 0.75/1.13
% 0.75/1.13 FPA overloads 0
% 0.75/1.13 FPA underloads 0
% 0.75/1.13
% 0.75/1.13 Usable size 0
% 0.75/1.13 Sos size 58
% 0.75/1.13 Demodulators size 50
% 0.75/1.13 Passive size 0
% 0.75/1.13 Disabled size 47
% 0.75/1.13
% 0.75/1.13 Proofs found 1
% 0.75/1.13
% 0.75/1.13 ----------- times (seconds) ----------- Mon Jun 13 23:51:20 2022
% 0.75/1.13
% 0.75/1.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.75/1.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.75/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.13 input time 0.00
% 0.75/1.13 paramodulation time 0.00
% 0.75/1.13 demodulation time 0.00
% 0.75/1.13 orient time 0.00
% 0.75/1.13 weigh time 0.00
% 0.75/1.13 forward subsume time 0.00
% 0.75/1.13 back demod find time 0.00
% 0.75/1.13 conflict time 0.00
% 0.75/1.13 LRPO time 0.00
% 0.75/1.13 store clause time 0.00
% 0.75/1.13 disable clause time 0.00
% 0.75/1.13 prime paramod time 0.00
% 0.75/1.13 semantics time 0.00
% 0.75/1.13
% 0.75/1.13 EQP interrupted
%------------------------------------------------------------------------------