TSTP Solution File: GRP493-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP493-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.74s 1.09s
% Output : Refutation 0.74s
% 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 : 5 ( 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 : 10 ( 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('GRP493-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP493-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP493-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(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(16,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(18,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,16]),4]),1]),
[iquote('para(4,16),demod([4]),flip(1)')] ).
cnf(19,plain,
$false,
inference(conflict,[status(thm)],[18,5]),
[iquote('conflict(18,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP493-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n024.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 13:20:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.09 ----- EQP 0.9e, May 2009 -----
% 0.74/1.09 The job began on n024.cluster.edu, Tue Jun 14 13:20:19 2022
% 0.74/1.09 The command was "./eqp09e".
% 0.74/1.09
% 0.74/1.09 set(prolog_style_variables).
% 0.74/1.09 set(lrpo).
% 0.74/1.09 set(basic_paramod).
% 0.74/1.09 set(functional_subsume).
% 0.74/1.09 set(ordered_paramod).
% 0.74/1.09 set(prime_paramod).
% 0.74/1.09 set(para_pairs).
% 0.74/1.09 assign(pick_given_ratio,4).
% 0.74/1.09 clear(print_kept).
% 0.74/1.09 clear(print_new_demod).
% 0.74/1.09 clear(print_back_demod).
% 0.74/1.09 clear(print_given).
% 0.74/1.09 assign(max_mem,64000).
% 0.74/1.09 end_of_commands.
% 0.74/1.09
% 0.74/1.09 Usable:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Sos:
% 0.74/1.09 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.74/1.09 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.74/1.09 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.74/1.09 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.74/1.09 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Demodulators:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Passive:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Starting to process input.
% 0.74/1.09
% 0.74/1.09 ** 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.74/1.09 1 is a new demodulator.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.74/1.09 2 is a new demodulator.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.74/1.09 3 is a new demodulator.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.74/1.09 4 is a new demodulator.
% 0.74/1.09
% 0.74/1.09 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.74/1.09 ---------------- PROOF FOUND ----------------
% 0.74/1.09 % SZS status Unsatisfiable
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 After processing input:
% 0.74/1.09
% 0.74/1.09 Usable:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Sos:
% 0.74/1.09 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.74/1.09 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.74/1.09 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.74/1.09 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.74/1.09 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.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Demodulators:
% 0.74/1.09 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.74/1.09 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.74/1.09 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.74/1.09 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 Passive:
% 0.74/1.09 end_of_list.
% 0.74/1.09
% 0.74/1.09 UNIT CONFLICT from 18 and 5 at 0.00 seconds.
% 0.74/1.09
% 0.74/1.09 ---------------- PROOF ----------------
% 0.74/1.09 % SZS output start Refutation
% See solution above
% 0.74/1.09 ------------ end of proof -------------
% 0.74/1.09
% 0.74/1.09
% 0.74/1.09 ------------- memory usage ------------
% 0.74/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.09 type (bytes each) gets frees in use avail bytes
% 0.74/1.09 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.09 term ( 16) 1058 747 311 21 6.4 K
% 0.74/1.09 gen_ptr ( 8) 1651 155 1496 8 11.8 K
% 0.74/1.09 context ( 808) 738 736 2 2 3.2 K
% 0.74/1.09 trail ( 12) 47 47 0 5 0.1 K
% 0.74/1.09 bt_node ( 68) 310 307 3 12 1.0 K
% 0.74/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.09 ac_match_free_vars_pos (4020)
% 0.74/1.09 0 0 0 0 0.0 K
% 0.74/1.09 discrim ( 12) 403 55 348 8 4.2 K
% 0.74/1.09 flat ( 40) 1395 1395 0 25 1.0 K
% 0.74/1.09 discrim_pos ( 12) 9 9 0 1 0.0 K
% 0.74/1.09 fpa_head ( 12) 258 0 258 0 3.0 K
% 0.74/1.09 fpa_tree ( 28) 154 154 0 19 0.5 K
% 0.74/1.09 fpa_pos ( 36) 34 34 0 1 0.0 K
% 0.74/1.09 literal ( 12) 41 23 18 1 0.2 K
% 0.74/1.09 clause ( 24) 41 23 18 1 0.4 K
% 0.74/1.09 list ( 12) 75 19 56 3 0.7 K
% 0.74/1.09 list_pos ( 20) 74 10 64 0 1.2 K
% 0.74/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.09
% 0.74/1.09 -------------- statistics -------------
% 0.74/1.09 Clauses input 5
% 0.74/1.09 Usable input 0
% 0.74/1.09 Sos input 5
% 0.74/1.09 Demodulators input 0
% 0.74/1.09 Passive input 0
% 0.74/1.09
% 0.74/1.09 Processed BS (before search) 5
% 0.74/1.09 Forward subsumed BS 0
% 0.74/1.09 Kept BS 5
% 0.74/1.09 New demodulators BS 4
% 0.74/1.09 Back demodulated BS 0
% 0.74/1.09
% 0.74/1.09 Clauses or pairs given 24
% 0.74/1.09 Clauses generated 19
% 0.74/1.09 Forward subsumed 6
% 0.74/1.09 Deleted by weight 0
% 0.74/1.09 Deleted by variable count 0
% 0.74/1.09 Kept 13
% 0.74/1.09 New demodulators 12
% 0.74/1.09 Back demodulated 1
% 0.74/1.09 Ordered paramod prunes 0
% 0.74/1.09 Basic paramod prunes 17
% 0.74/1.09 Prime paramod prunes 0
% 0.74/1.09 Semantic prunes 0
% 0.74/1.09
% 0.74/1.09 Rewrite attmepts 305
% 0.74/1.09 Rewrites 9
% 0.74/1.09
% 0.74/1.09 FPA overloads 0
% 0.74/1.09 FPA underloads 0
% 0.74/1.09
% 0.74/1.09 Usable size 0
% 0.74/1.09 Sos size 16
% 0.74/1.09 Demodulators size 15
% 0.74/1.09 Passive size 0
% 0.74/1.09 Disabled size 1
% 0.74/1.09
% 0.74/1.09 Proofs found 1
% 0.74/1.09
% 0.74/1.09 ----------- times (seconds) ----------- Tue Jun 14 13:20:19 2022
% 0.74/1.09
% 0.74/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.09 input time 0.00
% 0.74/1.09 paramodulation time 0.00
% 0.74/1.09 demodulation time 0.00
% 0.74/1.09 orient time 0.00
% 0.74/1.09 weigh time 0.00
% 0.74/1.09 forward subsume time 0.00
% 0.74/1.09 back demod find time 0.00
% 0.74/1.09 conflict time 0.00
% 0.74/1.09 LRPO time 0.00
% 0.74/1.09 store clause time 0.00
% 0.74/1.09 disable clause time 0.00
% 0.74/1.09 prime paramod time 0.00
% 0.74/1.09 semantics time 0.00
% 0.74/1.09
% 0.74/1.09 EQP interrupted
%------------------------------------------------------------------------------