TSTP Solution File: GRP671-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:47 EDT 2022
% Result : Unsatisfiable 0.44s 1.07s
% Output : Refutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 7 unt; 0 nHn; 2 RR)
% Number of literals : 7 ( 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; 3 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP671-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP671-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP671-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(mult(A,mult(B,C)),A),B),mult(mult(A,B),mult(C,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
~ equal(mult(mult(a,b),a),mult(a,mult(b,a))),
file('GRP671-1.p',unknown),
[] ).
cnf(51,plain,
equal(mult(mult(A,B),A),mult(A,mult(B,A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,9]),5,5,5]),
[iquote('para(6,9),demod([5,5,5])')] ).
cnf(52,plain,
$false,
inference(conflict,[status(thm)],[51,10]),
[iquote('conflict(51,10)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP671-1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 08:07:22 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/1.07 ----- EQP 0.9e, May 2009 -----
% 0.44/1.07 The job began on n017.cluster.edu, Mon Jun 13 08:07:23 2022
% 0.44/1.07 The command was "./eqp09e".
% 0.44/1.07
% 0.44/1.07 set(prolog_style_variables).
% 0.44/1.07 set(lrpo).
% 0.44/1.07 set(basic_paramod).
% 0.44/1.07 set(functional_subsume).
% 0.44/1.07 set(ordered_paramod).
% 0.44/1.07 set(prime_paramod).
% 0.44/1.07 set(para_pairs).
% 0.44/1.07 assign(pick_given_ratio,4).
% 0.44/1.07 clear(print_kept).
% 0.44/1.07 clear(print_new_demod).
% 0.44/1.07 clear(print_back_demod).
% 0.44/1.07 clear(print_given).
% 0.44/1.07 assign(max_mem,64000).
% 0.44/1.07 end_of_commands.
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.44/1.07 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.44/1.07 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.44/1.07 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.44/1.07 0 (wt=-1) [] mult(A,unit) = A.
% 0.44/1.07 0 (wt=-1) [] mult(unit,A) = A.
% 0.44/1.07 0 (wt=-1) [] mult(i(A),mult(A,B)) = B.
% 0.44/1.07 0 (wt=-1) [] mult(mult(A,B),i(B)) = A.
% 0.44/1.07 0 (wt=-1) [] mult(mult(A,B),mult(C,mult(A,B))) = mult(mult(mult(A,mult(B,C)),A),B).
% 0.44/1.07 0 (wt=-1) [] -(mult(mult(a,b),a) = mult(a,mult(b,a))).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Starting to process input.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.44/1.07 1 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.44/1.07 2 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.44/1.07 3 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.44/1.07 4 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.44/1.07 5 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.44/1.07 6 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 7 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.44/1.07 7 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 8 (wt=8) [] mult(mult(A,B),i(B)) = A.
% 0.44/1.07 8 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 9 (wt=19) [flip(1)] mult(mult(mult(A,mult(B,C)),A),B) = mult(mult(A,B),mult(C,mult(A,B))).
% 0.44/1.07 9 is a new demodulator.
% 0.44/1.07
% 0.44/1.07 ** KEPT: 10 (wt=11) [] -(mult(mult(a,b),a) = mult(a,mult(b,a))).
% 0.44/1.07 ---------------- PROOF FOUND ----------------
% 0.44/1.07 % SZS status Unsatisfiable
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 After processing input:
% 0.44/1.07
% 0.44/1.07 Usable:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Sos:
% 0.44/1.07 5 (wt=5) [] mult(A,unit) = A.
% 0.44/1.07 6 (wt=5) [] mult(unit,A) = A.
% 0.44/1.07 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.44/1.07 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.44/1.07 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.44/1.07 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.44/1.07 7 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.44/1.07 8 (wt=8) [] mult(mult(A,B),i(B)) = A.
% 0.44/1.07 10 (wt=11) [] -(mult(mult(a,b),a) = mult(a,mult(b,a))).
% 0.44/1.07 9 (wt=19) [flip(1)] mult(mult(mult(A,mult(B,C)),A),B) = mult(mult(A,B),mult(C,mult(A,B))).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Demodulators:
% 0.44/1.07 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.44/1.07 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.44/1.07 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.44/1.07 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.44/1.07 5 (wt=5) [] mult(A,unit) = A.
% 0.44/1.07 6 (wt=5) [] mult(unit,A) = A.
% 0.44/1.07 7 (wt=8) [] mult(i(A),mult(A,B)) = B.
% 0.44/1.07 8 (wt=8) [] mult(mult(A,B),i(B)) = A.
% 0.44/1.07 9 (wt=19) [flip(1)] mult(mult(mult(A,mult(B,C)),A),B) = mult(mult(A,B),mult(C,mult(A,B))).
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 Passive:
% 0.44/1.07 end_of_list.
% 0.44/1.07
% 0.44/1.07 UNIT CONFLICT from 51 and 10 at 0.00 seconds.
% 0.44/1.07
% 0.44/1.07 ---------------- PROOF ----------------
% 0.44/1.07 % SZS output start Refutation
% See solution above
% 0.44/1.07 ------------ end of proof -------------
% 0.44/1.07
% 0.44/1.07
% 0.44/1.07 ------------- memory usage ------------
% 0.44/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.44/1.07 type (bytes each) gets frees in use avail bytes
% 0.44/1.07 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.44/1.07 term ( 16) 2077 1491 586 21 11.6 K
% 0.44/1.07 gen_ptr ( 8) 2691 709 1982 6 15.5 K
% 0.44/1.07 context ( 808) 1303 1301 2 3 3.9 K
% 0.44/1.07 trail ( 12) 165 165 0 3 0.0 K
% 0.44/1.07 bt_node ( 68) 403 400 3 3 0.4 K
% 0.44/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.44/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.44/1.07 ac_match_free_vars_pos (4020)
% 0.44/1.07 0 0 0 0 0.0 K
% 0.44/1.07 discrim ( 12) 569 228 341 49 4.6 K
% 0.44/1.07 flat ( 40) 2088 2088 0 29 1.1 K
% 0.44/1.07 discrim_pos ( 12) 74 74 0 1 0.0 K
% 0.44/1.07 fpa_head ( 12) 447 0 447 0 5.2 K
% 0.44/1.07 fpa_tree ( 28) 83 83 0 9 0.2 K
% 0.44/1.07 fpa_pos ( 36) 90 90 0 1 0.0 K
% 0.44/1.07 literal ( 12) 154 103 51 1 0.6 K
% 0.44/1.07 clause ( 24) 154 103 51 1 1.2 K
% 0.44/1.07 list ( 12) 98 42 56 3 0.7 K
% 0.44/1.07 list_pos ( 20) 253 136 117 28 2.8 K
% 0.44/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.44/1.07
% 0.44/1.07 -------------- statistics -------------
% 0.44/1.07 Clauses input 10
% 0.44/1.07 Usable input 0
% 0.44/1.07 Sos input 10
% 0.44/1.07 Demodulators input 0
% 0.44/1.07 Passive input 0
% 0.44/1.07
% 0.44/1.07 Processed BS (before search) 10
% 0.44/1.07 Forward subsumed BS 0
% 0.44/1.07 Kept BS 10
% 0.44/1.07 New demodulators BS 9
% 0.44/1.07 Back demodulated BS 0
% 0.44/1.07
% 0.44/1.07 Clauses or pairs given 115
% 0.44/1.07 Clauses generated 86
% 0.44/1.07 Forward subsumed 45
% 0.44/1.07 Deleted by weight 0
% 0.44/1.07 Deleted by variable count 0
% 0.44/1.07 Kept 41
% 0.44/1.07 New demodulators 30
% 0.44/1.07 Back demodulated 26
% 0.44/1.07 Ordered paramod prunes 0
% 0.44/1.07 Basic paramod prunes 128
% 0.44/1.07 Prime paramod prunes 5
% 0.44/1.07 Semantic prunes 0
% 0.44/1.07
% 0.44/1.07 Rewrite attmepts 563
% 0.44/1.07 Rewrites 63
% 0.44/1.07
% 0.44/1.07 FPA overloads 0
% 0.44/1.07 FPA underloads 0
% 0.44/1.07
% 0.44/1.07 Usable size 0
% 0.44/1.07 Sos size 24
% 0.44/1.07 Demodulators size 19
% 0.44/1.07 Passive size 0
% 0.44/1.07 Disabled size 26
% 0.44/1.07
% 0.44/1.07 Proofs found 1
% 0.44/1.07
% 0.44/1.07 ----------- times (seconds) ----------- Mon Jun 13 08:07:23 2022
% 0.44/1.07
% 0.44/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.07 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.44/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.44/1.07 input time 0.00
% 0.44/1.07 paramodulation time 0.00
% 0.44/1.07 demodulation time 0.00
% 0.44/1.07 orient time 0.00
% 0.44/1.07 weigh time 0.00
% 0.44/1.07 forward subsume time 0.00
% 0.44/1.07 back demod find time 0.00
% 0.44/1.07 conflict time 0.00
% 0.44/1.07 LRPO time 0.00
% 0.44/1.07 store clause time 0.00
% 0.44/1.07 disable clause time 0.00
% 0.44/1.07 prime paramod time 0.00
% 0.44/1.07 semantics time 0.00
% 0.44/1.07
% 0.44/1.07 EQP interrupted
%------------------------------------------------------------------------------