TSTP Solution File: GRP581-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP581-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n007.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:04 EDT 2022
% Result : Unsatisfiable 0.73s 1.07s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)),C),
file('GRP581-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP581-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP581-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(11,plain,
equal(double_divide(double_divide(identity,double_divide(double_divide(identity,A),identity)),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,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,11]),4,4]),1]),
[iquote('para(4,11),demod([4,4]),flip(1)')] ).
cnf(13,plain,
$false,
inference(conflict,[status(thm)],[12,5]),
[iquote('conflict(12,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP581-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n007.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 : Mon Jun 13 04:14:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.07 ----- EQP 0.9e, May 2009 -----
% 0.73/1.07 The job began on n007.cluster.edu, Mon Jun 13 04:14:24 2022
% 0.73/1.07 The command was "./eqp09e".
% 0.73/1.07
% 0.73/1.07 set(prolog_style_variables).
% 0.73/1.07 set(lrpo).
% 0.73/1.07 set(basic_paramod).
% 0.73/1.07 set(functional_subsume).
% 0.73/1.07 set(ordered_paramod).
% 0.73/1.07 set(prime_paramod).
% 0.73/1.07 set(para_pairs).
% 0.73/1.07 assign(pick_given_ratio,4).
% 0.73/1.07 clear(print_kept).
% 0.73/1.07 clear(print_new_demod).
% 0.73/1.07 clear(print_back_demod).
% 0.73/1.07 clear(print_given).
% 0.73/1.07 assign(max_mem,64000).
% 0.73/1.07 end_of_commands.
% 0.73/1.07
% 0.73/1.07 Usable:
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Sos:
% 0.73/1.07 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.73/1.07 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.73/1.07 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.73/1.07 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.73/1.07 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Demodulators:
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Passive:
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Starting to process input.
% 0.73/1.07
% 0.73/1.07 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.73/1.07 1 is a new demodulator.
% 0.73/1.07
% 0.73/1.07 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.73/1.07 2 is a new demodulator.
% 0.73/1.07
% 0.73/1.07 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.73/1.07 3 is a new demodulator.
% 0.73/1.07
% 0.73/1.07 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.73/1.07 4 is a new demodulator.
% 0.73/1.07
% 0.73/1.07 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.73/1.07 ---------------- PROOF FOUND ----------------
% 0.73/1.07 % SZS status Unsatisfiable
% 0.73/1.07
% 0.73/1.07
% 0.73/1.07 After processing input:
% 0.73/1.07
% 0.73/1.07 Usable:
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Sos:
% 0.73/1.07 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.73/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.73/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.73/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.73/1.07 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Demodulators:
% 0.73/1.07 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C.
% 0.73/1.07 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.73/1.07 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.73/1.07 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 Passive:
% 0.73/1.07 end_of_list.
% 0.73/1.07
% 0.73/1.07 UNIT CONFLICT from 12 and 5 at 0.00 seconds.
% 0.73/1.07
% 0.73/1.07 ---------------- PROOF ----------------
% 0.73/1.07 % SZS output start Refutation
% See solution above
% 0.73/1.07 ------------ end of proof -------------
% 0.73/1.07
% 0.73/1.07
% 0.73/1.07 ------------- memory usage ------------
% 0.73/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.07 type (bytes each) gets frees in use avail bytes
% 0.73/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.07 term ( 16) 834 661 173 21 3.7 K
% 0.73/1.07 gen_ptr ( 8) 792 81 711 7 5.6 K
% 0.73/1.07 context ( 808) 485 483 2 2 3.2 K
% 0.73/1.07 trail ( 12) 17 17 0 4 0.0 K
% 0.73/1.07 bt_node ( 68) 186 183 3 12 1.0 K
% 0.73/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.07 ac_match_free_vars_pos (4020)
% 0.73/1.07 0 0 0 0 0.0 K
% 0.73/1.07 discrim ( 12) 216 0 216 0 2.5 K
% 0.73/1.07 flat ( 40) 884 884 0 25 1.0 K
% 0.73/1.07 discrim_pos ( 12) 9 9 0 1 0.0 K
% 0.73/1.07 fpa_head ( 12) 177 0 177 0 2.1 K
% 0.73/1.07 fpa_tree ( 28) 58 58 0 15 0.4 K
% 0.73/1.07 fpa_pos ( 36) 20 20 0 1 0.0 K
% 0.73/1.07 literal ( 12) 32 20 12 1 0.2 K
% 0.73/1.07 clause ( 24) 32 20 12 1 0.3 K
% 0.73/1.07 list ( 12) 67 11 56 3 0.7 K
% 0.73/1.07 list_pos ( 20) 46 5 41 0 0.8 K
% 0.73/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.07
% 0.73/1.07 -------------- statistics -------------
% 0.73/1.07 Clauses input 5
% 0.73/1.07 Usable input 0
% 0.73/1.07 Sos input 5
% 0.73/1.07 Demodulators input 0
% 0.73/1.07 Passive input 0
% 0.73/1.07
% 0.73/1.07 Processed BS (before search) 5
% 0.73/1.07 Forward subsumed BS 0
% 0.73/1.07 Kept BS 5
% 0.73/1.07 New demodulators BS 4
% 0.73/1.07 Back demodulated BS 0
% 0.73/1.07
% 0.73/1.07 Clauses or pairs given 18
% 0.73/1.07 Clauses generated 14
% 0.73/1.07 Forward subsumed 7
% 0.73/1.07 Deleted by weight 0
% 0.73/1.07 Deleted by variable count 0
% 0.73/1.07 Kept 7
% 0.73/1.07 New demodulators 4
% 0.73/1.07 Back demodulated 0
% 0.73/1.07 Ordered paramod prunes 0
% 0.73/1.07 Basic paramod prunes 2
% 0.73/1.07 Prime paramod prunes 0
% 0.73/1.07 Semantic prunes 0
% 0.73/1.07
% 0.73/1.07 Rewrite attmepts 212
% 0.73/1.07 Rewrites 7
% 0.73/1.07
% 0.73/1.07 FPA overloads 0
% 0.73/1.07 FPA underloads 0
% 0.73/1.07
% 0.73/1.07 Usable size 0
% 0.73/1.07 Sos size 11
% 0.73/1.07 Demodulators size 8
% 0.73/1.07 Passive size 0
% 0.73/1.07 Disabled size 0
% 0.73/1.07
% 0.73/1.07 Proofs found 1
% 0.73/1.07
% 0.73/1.07 ----------- times (seconds) ----------- Mon Jun 13 04:14:24 2022
% 0.73/1.07
% 0.73/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.73/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.73/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.07 input time 0.00
% 0.73/1.07 paramodulation time 0.00
% 0.73/1.07 demodulation time 0.00
% 0.73/1.07 orient time 0.00
% 0.73/1.07 weigh time 0.00
% 0.73/1.07 forward subsume time 0.00
% 0.73/1.07 back demod find time 0.00
% 0.73/1.07 conflict time 0.00
% 0.73/1.07 LRPO time 0.00
% 0.73/1.07 store clause time 0.00
% 0.73/1.07 disable clause time 0.00
% 0.73/1.07 prime paramod time 0.00
% 0.73/1.07 semantics time 0.00
% 0.73/1.07
% 0.73/1.07 EQP interrupted
%------------------------------------------------------------------------------