TSTP Solution File: GRP573-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP573-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:02 EDT 2022
% Result : Unsatisfiable 0.72s 1.12s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 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 : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,double_divide(double_divide(B,double_divide(C,A)),double_divide(C,identity))),double_divide(identity,identity)),B),
file('GRP573-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP573-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP573-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(identity,double_divide(identity,double_divide(A,identity))),double_divide(identity,identity)),A),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(11,plain,
equal(double_divide(double_divide(identity,identity),double_divide(identity,identity)),identity),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(20,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)],[11,1]),4,11]),1]),
[iquote('para(11,1),demod([4,11]),flip(1)')] ).
cnf(21,plain,
$false,
inference(conflict,[status(thm)],[20,5]),
[iquote('conflict(20,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP573-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 23:05:39 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.72/1.12 ----- EQP 0.9e, May 2009 -----
% 0.72/1.12 The job began on n010.cluster.edu, Mon Jun 13 23:05:40 2022
% 0.72/1.12 The command was "./eqp09e".
% 0.72/1.12
% 0.72/1.12 set(prolog_style_variables).
% 0.72/1.12 set(lrpo).
% 0.72/1.12 set(basic_paramod).
% 0.72/1.12 set(functional_subsume).
% 0.72/1.12 set(ordered_paramod).
% 0.72/1.12 set(prime_paramod).
% 0.72/1.12 set(para_pairs).
% 0.72/1.12 assign(pick_given_ratio,4).
% 0.72/1.12 clear(print_kept).
% 0.72/1.12 clear(print_new_demod).
% 0.72/1.12 clear(print_back_demod).
% 0.72/1.12 clear(print_given).
% 0.72/1.12 assign(max_mem,64000).
% 0.72/1.12 end_of_commands.
% 0.72/1.12
% 0.72/1.12 Usable:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Sos:
% 0.72/1.12 0 (wt=-1) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(C,A)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.72/1.12 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.12 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.72/1.12 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.72/1.12 0 (wt=-1) [] -(multiply(inverse(a1),a1) = identity).
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Demodulators:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Passive:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Starting to process input.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(C,A)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.72/1.12 1 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.12 2 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.12 3 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.12 4 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.72/1.12 ---------------- PROOF FOUND ----------------
% 0.72/1.12 % SZS status Unsatisfiable
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 After processing input:
% 0.72/1.12
% 0.72/1.12 Usable:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Sos:
% 0.72/1.12 5 (wt=5) [demod([3,2,4])] -(double_divide(identity,identity) = identity).
% 0.72/1.12 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.12 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.12 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.12 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(C,A)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Demodulators:
% 0.72/1.12 1 (wt=17) [] double_divide(double_divide(A,double_divide(double_divide(B,double_divide(C,A)),double_divide(C,identity))),double_divide(identity,identity)) = B.
% 0.72/1.12 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.72/1.12 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.72/1.12 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Passive:
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 UNIT CONFLICT from 20 and 5 at 0.00 seconds.
% 0.72/1.12
% 0.72/1.12 ---------------- PROOF ----------------
% 0.72/1.12 % SZS output start Refutation
% See solution above
% 0.72/1.12 ------------ end of proof -------------
% 0.72/1.12
% 0.72/1.12
% 0.72/1.12 ------------- memory usage ------------
% 0.72/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.12 type (bytes each) gets frees in use avail bytes
% 0.72/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.72/1.12 term ( 16) 1258 857 401 21 8.2 K
% 0.72/1.12 gen_ptr ( 8) 2030 95 1935 8 15.2 K
% 0.72/1.12 context ( 808) 1261 1259 2 2 3.2 K
% 0.72/1.12 trail ( 12) 26 26 0 5 0.1 K
% 0.72/1.12 bt_node ( 68) 687 682 5 10 1.0 K
% 0.72/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.12 ac_match_free_vars_pos (4020)
% 0.72/1.12 0 0 0 0 0.0 K
% 0.72/1.12 discrim ( 12) 428 0 428 0 5.0 K
% 0.72/1.12 flat ( 40) 2184 2184 0 37 1.4 K
% 0.72/1.12 discrim_pos ( 12) 11 11 0 1 0.0 K
% 0.72/1.12 fpa_head ( 12) 264 0 264 0 3.1 K
% 0.72/1.12 fpa_tree ( 28) 118 118 0 21 0.6 K
% 0.72/1.12 fpa_pos ( 36) 32 32 0 1 0.0 K
% 0.72/1.12 literal ( 12) 55 35 20 1 0.2 K
% 0.72/1.12 clause ( 24) 55 35 20 1 0.5 K
% 0.72/1.12 list ( 12) 71 15 56 3 0.7 K
% 0.72/1.12 list_pos ( 20) 74 5 69 0 1.3 K
% 0.72/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.12
% 0.72/1.12 -------------- statistics -------------
% 0.72/1.12 Clauses input 5
% 0.72/1.12 Usable input 0
% 0.72/1.12 Sos input 5
% 0.72/1.12 Demodulators input 0
% 0.72/1.12 Passive input 0
% 0.72/1.12
% 0.72/1.12 Processed BS (before search) 5
% 0.72/1.12 Forward subsumed BS 0
% 0.72/1.12 Kept BS 5
% 0.72/1.12 New demodulators BS 4
% 0.72/1.12 Back demodulated BS 0
% 0.72/1.12
% 0.72/1.12 Clauses or pairs given 43
% 0.72/1.12 Clauses generated 27
% 0.72/1.12 Forward subsumed 12
% 0.72/1.12 Deleted by weight 0
% 0.72/1.12 Deleted by variable count 0
% 0.72/1.12 Kept 15
% 0.72/1.12 New demodulators 8
% 0.72/1.12 Back demodulated 0
% 0.72/1.12 Ordered paramod prunes 0
% 0.72/1.12 Basic paramod prunes 84
% 0.72/1.12 Prime paramod prunes 0
% 0.72/1.12 Semantic prunes 0
% 0.72/1.12
% 0.72/1.12 Rewrite attmepts 447
% 0.72/1.12 Rewrites 7
% 0.72/1.12
% 0.72/1.12 FPA overloads 0
% 0.72/1.12 FPA underloads 0
% 0.72/1.12
% 0.72/1.12 Usable size 0
% 0.72/1.12 Sos size 19
% 0.72/1.12 Demodulators size 12
% 0.72/1.12 Passive size 0
% 0.72/1.12 Disabled size 0
% 0.72/1.12
% 0.72/1.12 Proofs found 1
% 0.72/1.12
% 0.72/1.12 ----------- times (seconds) ----------- Mon Jun 13 23:05:40 2022
% 0.72/1.12
% 0.72/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.12 input time 0.00
% 0.72/1.12 paramodulation time 0.00
% 0.72/1.12 demodulation time 0.00
% 0.72/1.12 orient time 0.00
% 0.72/1.12 weigh time 0.00
% 0.72/1.12 forward subsume time 0.00
% 0.72/1.12 back demod find time 0.00
% 0.72/1.12 conflict time 0.00
% 0.72/1.12 LRPO time 0.00
% 0.72/1.12 store clause time 0.00
% 0.72/1.12 disable clause time 0.00
% 0.72/1.12 prime paramod time 0.00
% 0.72/1.12 semantics time 0.00
% 0.72/1.12
% 0.72/1.12 EQP interrupted
%------------------------------------------------------------------------------