TSTP Solution File: GRP494-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP494-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n024.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:40 EDT 2022
% Result : Unsatisfiable 0.72s 1.13s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 3 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))),B),
file('GRP494-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP494-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP494-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(9,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,double_divide(A,double_divide(B,identity)))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(11,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(A,identity),double_divide(identity,identity))),identity),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(13,plain,
equal(double_divide(double_divide(identity,A),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(17,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,13]),4]),1]),
[iquote('para(4,13),demod([4]),flip(1)')] ).
cnf(21,plain,
equal(double_divide(double_divide(identity,A),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[13]),17]),
[iquote('back_demod(13),demod([17])')] ).
cnf(22,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),17,21]),
[iquote('back_demod(11),demod([17,21])')] ).
cnf(23,plain,
$false,
inference(conflict,[status(thm)],[22,5]),
[iquote('conflict(22,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP494-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jun 13 04:47:33 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.72/1.13 ----- EQP 0.9e, May 2009 -----
% 0.72/1.13 The job began on n024.cluster.edu, Mon Jun 13 04:47:34 2022
% 0.72/1.13 The command was "./eqp09e".
% 0.72/1.13
% 0.72/1.13 set(prolog_style_variables).
% 0.72/1.13 set(lrpo).
% 0.72/1.13 set(basic_paramod).
% 0.72/1.13 set(functional_subsume).
% 0.72/1.13 set(ordered_paramod).
% 0.72/1.13 set(prime_paramod).
% 0.72/1.13 set(para_pairs).
% 0.72/1.13 assign(pick_given_ratio,4).
% 0.72/1.13 clear(print_kept).
% 0.72/1.13 clear(print_new_demod).
% 0.72/1.13 clear(print_back_demod).
% 0.72/1.13 clear(print_given).
% 0.72/1.13 assign(max_mem,64000).
% 0.72/1.13 end_of_commands.
% 0.72/1.13
% 0.72/1.13 Usable:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Sos:
% 0.72/1.13 0 (wt=-1) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.72/1.13 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.13 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.72/1.13 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.72/1.13 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Demodulators:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Passive:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Starting to process input.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.72/1.13 1 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.13 2 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.13 3 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.13 4 is a new demodulator.
% 0.72/1.13
% 0.72/1.13 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.72/1.13 ---------------- PROOF FOUND ----------------
% 0.72/1.13 % SZS status Unsatisfiable
% 0.72/1.13
% 0.72/1.13
% 0.72/1.13 After processing input:
% 0.72/1.13
% 0.72/1.13 Usable:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Sos:
% 0.72/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.13 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.72/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.13 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Demodulators:
% 0.72/1.13 1 (wt=17) [] double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B.
% 0.72/1.13 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.13 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.13 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 Passive:
% 0.72/1.13 end_of_list.
% 0.72/1.13
% 0.72/1.13 UNIT CONFLICT from 22 and 5 at 0.00 seconds.
% 0.72/1.13
% 0.72/1.13 ---------------- PROOF ----------------
% 0.72/1.13 % SZS output start Refutation
% See solution above
% 0.72/1.13 ------------ end of proof -------------
% 0.72/1.13
% 0.72/1.13
% 0.72/1.13 ------------- memory usage ------------
% 0.72/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.13 type (bytes each) gets frees in use avail bytes
% 0.72/1.13 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.72/1.13 term ( 16) 1167 804 363 19 7.4 K
% 0.72/1.13 gen_ptr ( 8) 2014 295 1719 11 13.5 K
% 0.72/1.13 context ( 808) 802 800 2 2 3.2 K
% 0.72/1.13 trail ( 12) 56 56 0 5 0.1 K
% 0.72/1.13 bt_node ( 68) 302 299 3 12 1.0 K
% 0.72/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.13 ac_match_free_vars_pos (4020)
% 0.72/1.13 0 0 0 0 0.0 K
% 0.72/1.13 discrim ( 12) 439 125 314 39 4.1 K
% 0.72/1.13 flat ( 40) 1580 1580 0 25 1.0 K
% 0.72/1.13 discrim_pos ( 12) 16 16 0 1 0.0 K
% 0.72/1.13 fpa_head ( 12) 272 0 272 0 3.2 K
% 0.72/1.13 fpa_tree ( 28) 166 166 0 19 0.5 K
% 0.72/1.13 fpa_pos ( 36) 42 42 0 1 0.0 K
% 0.72/1.13 literal ( 12) 49 27 22 1 0.3 K
% 0.72/1.13 clause ( 24) 49 27 22 1 0.5 K
% 0.72/1.13 list ( 12) 79 21 58 1 0.7 K
% 0.72/1.13 list_pos ( 20) 105 30 75 4 1.5 K
% 0.72/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.13
% 0.72/1.13 -------------- statistics -------------
% 0.72/1.13 Clauses input 5
% 0.72/1.13 Usable input 0
% 0.72/1.13 Sos input 5
% 0.72/1.13 Demodulators input 0
% 0.72/1.13 Passive input 0
% 0.72/1.13
% 0.72/1.13 Processed BS (before search) 5
% 0.72/1.13 Forward subsumed BS 0
% 0.72/1.13 Kept BS 5
% 0.72/1.13 New demodulators BS 4
% 0.72/1.13 Back demodulated BS 0
% 0.72/1.13
% 0.72/1.13 Clauses or pairs given 21
% 0.72/1.13 Clauses generated 23
% 0.72/1.13 Forward subsumed 6
% 0.72/1.13 Deleted by weight 0
% 0.72/1.13 Deleted by variable count 0
% 0.72/1.13 Kept 17
% 0.72/1.13 New demodulators 16
% 0.72/1.13 Back demodulated 5
% 0.72/1.13 Ordered paramod prunes 0
% 0.72/1.13 Basic paramod prunes 17
% 0.72/1.13 Prime paramod prunes 0
% 0.72/1.13 Semantic prunes 0
% 0.72/1.13
% 0.72/1.13 Rewrite attmepts 361
% 0.72/1.13 Rewrites 16
% 0.72/1.13
% 0.72/1.13 FPA overloads 0
% 0.72/1.13 FPA underloads 0
% 0.72/1.13
% 0.72/1.13 Usable size 0
% 0.72/1.13 Sos size 16
% 0.72/1.13 Demodulators size 15
% 0.72/1.13 Passive size 0
% 0.72/1.13 Disabled size 5
% 0.72/1.13
% 0.72/1.13 Proofs found 1
% 0.72/1.13
% 0.72/1.13 ----------- times (seconds) ----------- Mon Jun 13 04:47:34 2022
% 0.72/1.13
% 0.72/1.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.13 input time 0.00
% 0.72/1.13 paramodulation time 0.00
% 0.72/1.13 demodulation time 0.00
% 0.72/1.13 orient time 0.00
% 0.72/1.13 weigh time 0.00
% 0.72/1.13 forward subsume time 0.00
% 0.72/1.13 back demod find time 0.00
% 0.72/1.13 conflict time 0.00
% 0.72/1.13 LRPO time 0.00
% 0.72/1.13 store clause time 0.00
% 0.72/1.13 disable clause time 0.00
% 0.72/1.13 prime paramod time 0.00
% 0.72/1.13 semantics time 0.00
% 0.72/1.13
% 0.72/1.13 EQP interrupted
%------------------------------------------------------------------------------