TSTP Solution File: GRP569-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP569-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:01 EDT 2022
% Result : Unsatisfiable 0.47s 1.11s
% Output : Refutation 0.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 0 equ; 1 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 : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)),B),
file('GRP569-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP569-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP569-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(10,plain,
equal(double_divide(double_divide(A,identity),double_divide(identity,identity)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(17,plain,
equal(double_divide(double_divide(identity,double_divide(A,double_divide(identity,identity))),double_divide(identity,identity)),double_divide(A,identity)),
inference(para,[status(thm),theory(equality)],[10,1]),
[iquote('para(10,1)')] ).
cnf(22,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,17]),10]),1]),
[iquote('para(4,17),demod([10]),flip(1)')] ).
cnf(23,plain,
$false,
inference(conflict,[status(thm)],[22,5]),
[iquote('conflict(22,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP569-1 : TPTP v8.1.0. Released v2.6.0.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Mon Jun 13 17:24:08 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.47/1.11 ----- EQP 0.9e, May 2009 -----
% 0.47/1.11 The job began on n017.cluster.edu, Mon Jun 13 17:24:09 2022
% 0.47/1.11 The command was "./eqp09e".
% 0.47/1.11
% 0.47/1.11 set(prolog_style_variables).
% 0.47/1.11 set(lrpo).
% 0.47/1.11 set(basic_paramod).
% 0.47/1.11 set(functional_subsume).
% 0.47/1.11 set(ordered_paramod).
% 0.47/1.11 set(prime_paramod).
% 0.47/1.11 set(para_pairs).
% 0.47/1.11 assign(pick_given_ratio,4).
% 0.47/1.11 clear(print_kept).
% 0.47/1.11 clear(print_new_demod).
% 0.47/1.11 clear(print_back_demod).
% 0.47/1.11 clear(print_given).
% 0.47/1.11 assign(max_mem,64000).
% 0.47/1.11 end_of_commands.
% 0.47/1.11
% 0.47/1.11 Usable:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Sos:
% 0.47/1.11 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.47/1.11 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.47/1.11 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.47/1.11 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.47/1.11 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Demodulators:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Passive:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Starting to process input.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.47/1.11 1 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.47/1.11 2 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.47/1.11 3 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.47/1.11 4 is a new demodulator.
% 0.47/1.11
% 0.47/1.11 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.47/1.11 ---------------- PROOF FOUND ----------------
% 0.47/1.11 % SZS status Unsatisfiable
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 After processing input:
% 0.47/1.11
% 0.47/1.11 Usable:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Sos:
% 0.47/1.11 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.47/1.11 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.47/1.11 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.47/1.11 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.47/1.11 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Demodulators:
% 0.47/1.11 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(A,C)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.47/1.11 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.47/1.11 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.47/1.11 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 Passive:
% 0.47/1.11 end_of_list.
% 0.47/1.11
% 0.47/1.11 UNIT CONFLICT from 22 and 5 at 0.00 seconds.
% 0.47/1.11
% 0.47/1.11 ---------------- PROOF ----------------
% 0.47/1.11 % SZS output start Refutation
% See solution above
% 0.47/1.11 ------------ end of proof -------------
% 0.47/1.11
% 0.47/1.11
% 0.47/1.11 ------------- memory usage ------------
% 0.47/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.47/1.11 type (bytes each) gets frees in use avail bytes
% 0.47/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.47/1.11 term ( 16) 1589 1148 441 41 9.3 K
% 0.47/1.11 gen_ptr ( 8) 2531 581 1950 34 15.5 K
% 0.47/1.11 context ( 808) 1301 1299 2 2 3.2 K
% 0.47/1.11 trail ( 12) 73 73 0 5 0.1 K
% 0.47/1.11 bt_node ( 68) 510 505 5 10 1.0 K
% 0.47/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.47/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.47/1.11 ac_match_free_vars_pos (4020)
% 0.47/1.11 0 0 0 0 0.0 K
% 0.47/1.11 discrim ( 12) 456 288 168 208 4.4 K
% 0.47/1.11 flat ( 40) 3106 3106 0 37 1.4 K
% 0.47/1.11 discrim_pos ( 12) 32 32 0 1 0.0 K
% 0.47/1.11 fpa_head ( 12) 227 0 227 0 2.7 K
% 0.47/1.11 fpa_tree ( 28) 128 128 0 23 0.6 K
% 0.47/1.11 fpa_pos ( 36) 36 36 0 1 0.0 K
% 0.47/1.11 literal ( 12) 66 44 22 1 0.3 K
% 0.47/1.11 clause ( 24) 66 44 22 1 0.5 K
% 0.47/1.11 list ( 12) 73 17 56 3 0.7 K
% 0.47/1.11 list_pos ( 20) 106 56 50 19 1.3 K
% 0.47/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.47/1.11
% 0.47/1.11 -------------- statistics -------------
% 0.47/1.11 Clauses input 5
% 0.47/1.11 Usable input 0
% 0.47/1.11 Sos input 5
% 0.47/1.11 Demodulators input 0
% 0.47/1.11 Passive input 0
% 0.47/1.11
% 0.47/1.11 Processed BS (before search) 5
% 0.47/1.11 Forward subsumed BS 0
% 0.47/1.11 Kept BS 5
% 0.47/1.11 New demodulators BS 4
% 0.47/1.11 Back demodulated BS 0
% 0.47/1.11
% 0.47/1.11 Clauses or pairs given 33
% 0.47/1.11 Clauses generated 36
% 0.47/1.11 Forward subsumed 19
% 0.47/1.11 Deleted by weight 0
% 0.47/1.11 Deleted by variable count 0
% 0.47/1.11 Kept 17
% 0.47/1.11 New demodulators 10
% 0.47/1.11 Back demodulated 11
% 0.47/1.11 Ordered paramod prunes 0
% 0.47/1.11 Basic paramod prunes 38
% 0.47/1.11 Prime paramod prunes 0
% 0.47/1.11 Semantic prunes 0
% 0.47/1.11
% 0.47/1.11 Rewrite attmepts 675
% 0.47/1.11 Rewrites 28
% 0.47/1.11
% 0.47/1.11 FPA overloads 0
% 0.47/1.11 FPA underloads 0
% 0.47/1.11
% 0.47/1.11 Usable size 0
% 0.47/1.11 Sos size 10
% 0.47/1.11 Demodulators size 9
% 0.47/1.11 Passive size 0
% 0.47/1.11 Disabled size 11
% 0.47/1.11
% 0.47/1.11 Proofs found 1
% 0.47/1.11
% 0.47/1.11 ----------- times (seconds) ----------- Mon Jun 13 17:24:09 2022
% 0.47/1.11
% 0.47/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.47/1.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.47/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.47/1.11 input time 0.00
% 0.47/1.11 paramodulation time 0.00
% 0.47/1.11 demodulation time 0.00
% 0.47/1.11 orient time 0.00
% 0.47/1.11 weigh time 0.00
% 0.47/1.11 forward subsume time 0.00
% 0.47/1.11 back demod find time 0.00
% 0.47/1.11 conflict time 0.00
% 0.47/1.11 LRPO time 0.00
% 0.47/1.11 store clause time 0.00
% 0.47/1.11 disable clause time 0.00
% 0.47/1.11 prime paramod time 0.00
% 0.47/1.11 semantics time 0.00
% 0.47/1.11
% 0.47/1.11 EQP interrupted
%------------------------------------------------------------------------------