TSTP Solution File: GRP665-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP665-10 : TPTP v8.1.0. Released v8.1.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:48:43 EDT 2022
% Result : Unsatisfiable 0.74s 1.14s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 2 RR)
% Number of literals : 13 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP665-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP665-10.p',unknown),
[] ).
cnf(8,plain,
equal(mult(mult(A,B),C),mult(mult(A,C),ld(C,mult(B,C)))),
file('GRP665-10.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(A,B),ld(B,mult(C,B))),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP665-10.p',unknown),
[] ).
cnf(11,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[10]),
[iquote('flip(10)')] ).
cnf(12,plain,
~ equal(mult(mult(op_c,x0),x1),mult(op_c,mult(x0,x1))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(32,plain,
equal(ld(op_c,mult(A,op_c)),A),
inference(para,[status(thm),theory(equality)],[10,2]),
[iquote('para(10,2)')] ).
cnf(53,plain,
equal(mult(mult(A,op_c),ld(A,mult(B,A))),mult(mult(op_c,B),A)),
inference(para,[status(thm),theory(equality)],[10,9]),
[iquote('para(10,9)')] ).
cnf(54,plain,
equal(mult(mult(op_c,A),B),mult(mult(B,op_c),ld(B,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[53]),
[iquote('flip(53)')] ).
cnf(59,plain,
equal(mult(mult(A,op_c),B),mult(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,8]),32]),1]),
[iquote('para(11,8),demod([32]),flip(1)')] ).
cnf(60,plain,
equal(mult(mult(op_c,A),B),mult(op_c,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[54]),59,1]),
[iquote('back_demod(54),demod([59,1])')] ).
cnf(61,plain,
$false,
inference(conflict,[status(thm)],[60,12]),
[iquote('conflict(60,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP665-10 : TPTP v8.1.0. Released v8.1.0.
% 0.13/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n024.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 14:42:18 EDT 2022
% 0.20/0.35 % CPUTime :
% 0.74/1.14 ----- EQP 0.9e, May 2009 -----
% 0.74/1.14 The job began on n024.cluster.edu, Mon Jun 13 14:42:19 2022
% 0.74/1.14 The command was "./eqp09e".
% 0.74/1.14
% 0.74/1.14 set(prolog_style_variables).
% 0.74/1.14 set(lrpo).
% 0.74/1.14 set(basic_paramod).
% 0.74/1.14 set(functional_subsume).
% 0.74/1.14 set(ordered_paramod).
% 0.74/1.14 set(prime_paramod).
% 0.74/1.14 set(para_pairs).
% 0.74/1.14 assign(pick_given_ratio,4).
% 0.74/1.14 clear(print_kept).
% 0.74/1.14 clear(print_new_demod).
% 0.74/1.14 clear(print_back_demod).
% 0.74/1.14 clear(print_given).
% 0.74/1.14 assign(max_mem,64000).
% 0.74/1.14 end_of_commands.
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.74/1.14 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.74/1.14 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.74/1.14 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.74/1.14 0 (wt=-1) [] mult(A,unit) = A.
% 0.74/1.14 0 (wt=-1) [] mult(unit,A) = A.
% 0.74/1.14 0 (wt=-1) [] mult(A,mult(B,C)) = mult(rd(mult(A,B),A),mult(A,C)).
% 0.74/1.14 0 (wt=-1) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 0.74/1.14 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 0.74/1.14 0 (wt=-1) [] -(mult(op_c,mult(x0,x1)) = mult(mult(op_c,x0),x1)).
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Starting to process input.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.14 1 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.14 2 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.14 3 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.14 4 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.74/1.14 5 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.74/1.14 6 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 0.74/1.14 7 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 8 (wt=15) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 9 (wt=15) [flip(8)] mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B).
% 0.74/1.14 clause forward subsumed: 0 (wt=15) [flip(9)] mult(mult(A,C),B) = mult(mult(A,B),ld(B,mult(C,B))).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 10 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 11 (wt=7) [flip(10)] mult(A,op_c) = mult(op_c,A).
% 0.74/1.14 clause forward subsumed: 0 (wt=7) [flip(11)] mult(op_c,A) = mult(A,op_c).
% 0.74/1.14
% 0.74/1.14 ** KEPT: 12 (wt=11) [flip(1)] -(mult(mult(op_c,x0),x1) = mult(op_c,mult(x0,x1))).
% 0.74/1.14 ---------------- PROOF FOUND ----------------
% 0.74/1.14 % SZS status Unsatisfiable
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 After processing input:
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 5 (wt=5) [] mult(A,unit) = A.
% 0.74/1.14 6 (wt=5) [] mult(unit,A) = A.
% 0.74/1.14 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.14 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.14 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.14 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.14 10 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 0.74/1.14 11 (wt=7) [flip(10)] mult(A,op_c) = mult(op_c,A).
% 0.74/1.14 12 (wt=11) [flip(1)] -(mult(mult(op_c,x0),x1) = mult(op_c,mult(x0,x1))).
% 0.74/1.14 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 0.74/1.14 8 (wt=15) [] mult(mult(A,B),C) = mult(mult(A,C),ld(C,mult(B,C))).
% 0.74/1.14 9 (wt=15) [flip(8)] mult(mult(A,B),ld(B,mult(C,B))) = mult(mult(A,C),B).
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.74/1.14 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.74/1.14 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.74/1.14 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.74/1.14 5 (wt=5) [] mult(A,unit) = A.
% 0.74/1.14 6 (wt=5) [] mult(unit,A) = A.
% 0.74/1.14 7 (wt=15) [flip(1)] mult(rd(mult(A,B),A),mult(A,C)) = mult(A,mult(B,C)).
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 UNIT CONFLICT from 60 and 12 at 0.01 seconds.
% 0.74/1.14
% 0.74/1.14 ---------------- PROOF ----------------
% 0.74/1.14 % SZS output start Refutation
% See solution above
% 0.74/1.14 ------------ end of proof -------------
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 ------------- memory usage ------------
% 0.74/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.14 type (bytes each) gets frees in use avail bytes
% 0.74/1.14 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.14 term ( 16) 2896 2044 852 16 16.7 K
% 0.74/1.14 gen_ptr ( 8) 3365 407 2958 12 23.2 K
% 0.74/1.14 context ( 808) 1910 1908 2 2 3.2 K
% 0.74/1.14 trail ( 12) 100 100 0 3 0.0 K
% 0.74/1.14 bt_node ( 68) 618 615 3 6 0.6 K
% 0.74/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_free_vars_pos (4020)
% 0.74/1.14 0 0 0 0 0.0 K
% 0.74/1.14 discrim ( 12) 719 32 687 13 8.2 K
% 0.74/1.14 flat ( 40) 3991 3991 0 31 1.2 K
% 0.74/1.14 discrim_pos ( 12) 63 63 0 1 0.0 K
% 0.74/1.14 fpa_head ( 12) 377 0 377 0 4.4 K
% 0.74/1.14 fpa_tree ( 28) 96 96 0 19 0.5 K
% 0.74/1.14 fpa_pos ( 36) 92 92 0 1 0.0 K
% 0.74/1.14 literal ( 12) 197 137 60 1 0.7 K
% 0.74/1.14 clause ( 24) 197 137 60 1 1.4 K
% 0.74/1.14 list ( 12) 91 34 57 2 0.7 K
% 0.74/1.14 list_pos ( 20) 230 27 203 9 4.1 K
% 0.74/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.14
% 0.74/1.14 -------------- statistics -------------
% 0.74/1.14 Clauses input 10
% 0.74/1.14 Usable input 0
% 0.74/1.14 Sos input 10
% 0.74/1.14 Demodulators input 0
% 0.74/1.14 Passive input 0
% 0.74/1.14
% 0.74/1.14 Processed BS (before search) 14
% 0.74/1.14 Forward subsumed BS 2
% 0.74/1.14 Kept BS 12
% 0.74/1.14 New demodulators BS 7
% 0.74/1.14 Back demodulated BS 0
% 0.74/1.14
% 0.74/1.14 Clauses or pairs given 145
% 0.74/1.14 Clauses generated 105
% 0.74/1.14 Forward subsumed 57
% 0.74/1.14 Deleted by weight 0
% 0.74/1.14 Deleted by variable count 0
% 0.74/1.14 Kept 48
% 0.74/1.14 New demodulators 25
% 0.74/1.14 Back demodulated 4
% 0.74/1.14 Ordered paramod prunes 0
% 0.74/1.14 Basic paramod prunes 132
% 0.74/1.14 Prime paramod prunes 2
% 0.74/1.14 Semantic prunes 0
% 0.74/1.14
% 0.74/1.14 Rewrite attmepts 843
% 0.74/1.14 Rewrites 42
% 0.74/1.14
% 0.74/1.14 FPA overloads 0
% 0.74/1.14 FPA underloads 0
% 0.74/1.14
% 0.74/1.14 Usable size 0
% 0.74/1.14 Sos size 55
% 0.74/1.14 Demodulators size 31
% 0.74/1.14 Passive size 0
% 0.74/1.14 Disabled size 4
% 0.74/1.14
% 0.74/1.14 Proofs found 1
% 0.74/1.14
% 0.74/1.14 ----------- times (seconds) ----------- Mon Jun 13 14:42:19 2022
% 0.74/1.14
% 0.74/1.14 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.74/1.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.14 input time 0.00
% 0.74/1.14 paramodulation time 0.00
% 0.74/1.14 demodulation time 0.00
% 0.74/1.14 orient time 0.00
% 0.74/1.14 weigh time 0.00
% 0.74/1.14 forward subsume time 0.00
% 0.74/1.14 back demod find time 0.00
% 0.74/1.14 conflict time 0.00
% 0.74/1.14 LRPO time 0.00
% 0.74/1.14 store clause time 0.00
% 0.74/1.14 disable clause time 0.00
% 0.74/1.14 prime paramod time 0.00
% 0.74/1.14 semantics time 0.00
% 0.74/1.14
% 0.74/1.14 EQP interrupted
%------------------------------------------------------------------------------