TSTP Solution File: GRP570-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP570-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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.66s 1.06s
% Output : Refutation 0.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 10 ( 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('GRP570-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),double_divide(double_divide(B,A),identity)),
file('GRP570-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),double_divide(A,identity)),
file('GRP570-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(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(25,plain,
equal(double_divide(double_divide(A,identity),identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),22]),
[iquote('back_demod(10),demod([22])')] ).
cnf(26,plain,
$false,
inference(conflict,[status(thm)],[25,5]),
[iquote('conflict(25,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP570-1 : TPTP v8.1.0. Released v2.6.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 22:00:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/1.06 ----- EQP 0.9e, May 2009 -----
% 0.66/1.06 The job began on n014.cluster.edu, Mon Jun 13 22:00:52 2022
% 0.66/1.06 The command was "./eqp09e".
% 0.66/1.06
% 0.66/1.06 set(prolog_style_variables).
% 0.66/1.06 set(lrpo).
% 0.66/1.06 set(basic_paramod).
% 0.66/1.06 set(functional_subsume).
% 0.66/1.06 set(ordered_paramod).
% 0.66/1.06 set(prime_paramod).
% 0.66/1.06 set(para_pairs).
% 0.66/1.06 assign(pick_given_ratio,4).
% 0.66/1.06 clear(print_kept).
% 0.66/1.06 clear(print_new_demod).
% 0.66/1.06 clear(print_back_demod).
% 0.66/1.06 clear(print_given).
% 0.66/1.06 assign(max_mem,64000).
% 0.66/1.06 end_of_commands.
% 0.66/1.06
% 0.66/1.06 Usable:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Sos:
% 0.66/1.06 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.66/1.06 0 (wt=-1) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.66/1.06 0 (wt=-1) [] inverse(A) = double_divide(A,identity).
% 0.66/1.06 0 (wt=-1) [] identity = double_divide(A,inverse(A)).
% 0.66/1.06 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Demodulators:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Passive:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Starting to process input.
% 0.66/1.06
% 0.66/1.06 ** 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.66/1.06 1 is a new demodulator.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.66/1.06 2 is a new demodulator.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.66/1.06 3 is a new demodulator.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.66/1.06 4 is a new demodulator.
% 0.66/1.06
% 0.66/1.06 ** KEPT: 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.66/1.06 ---------------- PROOF FOUND ----------------
% 0.66/1.06 % SZS status Unsatisfiable
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 After processing input:
% 0.66/1.06
% 0.66/1.06 Usable:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Sos:
% 0.66/1.06 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.66/1.06 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.66/1.06 5 (wt=7) [demod([2])] -(double_divide(double_divide(a2,identity),identity) = a2).
% 0.66/1.06 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.66/1.06 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.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Demodulators:
% 0.66/1.06 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.66/1.06 2 (wt=9) [] multiply(A,B) = double_divide(double_divide(B,A),identity).
% 0.66/1.06 3 (wt=6) [] inverse(A) = double_divide(A,identity).
% 0.66/1.06 4 (wt=7) [demod([3]),flip(1)] double_divide(A,double_divide(A,identity)) = identity.
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 Passive:
% 0.66/1.06 end_of_list.
% 0.66/1.06
% 0.66/1.06 UNIT CONFLICT from 25 and 5 at 0.00 seconds.
% 0.66/1.06
% 0.66/1.06 ---------------- PROOF ----------------
% 0.66/1.06 % SZS output start Refutation
% See solution above
% 0.66/1.06 ------------ end of proof -------------
% 0.66/1.06
% 0.66/1.06
% 0.66/1.06 ------------- memory usage ------------
% 0.66/1.06 Memory dynamically allocated (tp_alloc): 488.
% 0.66/1.06 type (bytes each) gets frees in use avail bytes
% 0.66/1.06 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.66/1.06 term ( 16) 1670 1196 474 19 9.5 K
% 0.66/1.06 gen_ptr ( 8) 2766 706 2060 15 16.2 K
% 0.66/1.06 context ( 808) 1378 1376 2 2 3.2 K
% 0.66/1.06 trail ( 12) 79 79 0 5 0.1 K
% 0.66/1.06 bt_node ( 68) 514 509 5 10 1.0 K
% 0.66/1.06 ac_position (285432) 0 0 0 0 0.0 K
% 0.66/1.06 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.66/1.06 ac_match_free_vars_pos (4020)
% 0.66/1.06 0 0 0 0 0.0 K
% 0.66/1.06 discrim ( 12) 481 360 121 257 4.4 K
% 0.66/1.06 flat ( 40) 3271 3271 0 37 1.4 K
% 0.66/1.06 discrim_pos ( 12) 41 41 0 1 0.0 K
% 0.66/1.06 fpa_head ( 12) 236 0 236 0 2.8 K
% 0.66/1.06 fpa_tree ( 28) 143 143 0 23 0.6 K
% 0.66/1.06 fpa_pos ( 36) 42 42 0 1 0.0 K
% 0.66/1.06 literal ( 12) 74 49 25 1 0.3 K
% 0.66/1.06 clause ( 24) 74 49 25 1 0.6 K
% 0.66/1.06 list ( 12) 76 19 57 2 0.7 K
% 0.66/1.06 list_pos ( 20) 127 76 51 18 1.3 K
% 0.66/1.06 pair_index ( 40) 2 0 2 0 0.1 K
% 0.66/1.06
% 0.66/1.06 -------------- statistics -------------
% 0.66/1.06 Clauses input 5
% 0.66/1.06 Usable input 0
% 0.66/1.06 Sos input 5
% 0.66/1.06 Demodulators input 0
% 0.66/1.06 Passive input 0
% 0.66/1.06
% 0.66/1.06 Processed BS (before search) 5
% 0.66/1.06 Forward subsumed BS 0
% 0.66/1.06 Kept BS 5
% 0.66/1.06 New demodulators BS 4
% 0.66/1.06 Back demodulated BS 0
% 0.66/1.06
% 0.66/1.06 Clauses or pairs given 31
% 0.66/1.06 Clauses generated 40
% 0.66/1.06 Forward subsumed 20
% 0.66/1.06 Deleted by weight 0
% 0.66/1.06 Deleted by variable count 0
% 0.66/1.06 Kept 20
% 0.66/1.06 New demodulators 13
% 0.66/1.06 Back demodulated 15
% 0.66/1.06 Ordered paramod prunes 0
% 0.66/1.06 Basic paramod prunes 38
% 0.66/1.06 Prime paramod prunes 0
% 0.66/1.06 Semantic prunes 0
% 0.66/1.06
% 0.66/1.06 Rewrite attmepts 735
% 0.66/1.06 Rewrites 37
% 0.66/1.06
% 0.66/1.06 FPA overloads 0
% 0.66/1.06 FPA underloads 0
% 0.66/1.06
% 0.66/1.06 Usable size 0
% 0.66/1.06 Sos size 9
% 0.66/1.06 Demodulators size 8
% 0.66/1.06 Passive size 0
% 0.66/1.06 Disabled size 15
% 0.66/1.06
% 0.66/1.06 Proofs found 1
% 0.66/1.06
% 0.66/1.06 ----------- times (seconds) ----------- Mon Jun 13 22:00:52 2022
% 0.66/1.06
% 0.66/1.06 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.66/1.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.66/1.06 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.66/1.06 input time 0.00
% 0.66/1.06 paramodulation time 0.00
% 0.66/1.06 demodulation time 0.00
% 0.66/1.06 orient time 0.00
% 0.66/1.06 weigh time 0.00
% 0.66/1.06 forward subsume time 0.00
% 0.66/1.06 back demod find time 0.00
% 0.66/1.06 conflict time 0.00
% 0.66/1.06 LRPO time 0.00
% 0.66/1.06 store clause time 0.00
% 0.66/1.06 disable clause time 0.00
% 0.66/1.06 prime paramod time 0.00
% 0.66/1.06 semantics time 0.00
% 0.66/1.06
% 0.66/1.06 EQP interrupted
%------------------------------------------------------------------------------