TSTP Solution File: GRP702-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:57 EDT 2022
% Result : Unsatisfiable 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 5 RR)
% Number of literals : 11 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP702-11.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP702-11.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP702-11.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(A,B),op_c),mult(A,mult(B,op_c))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(11,plain,
equal(ld(A,mult(op_c,A)),op_d),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
~ equal(mult(mult(x0,x1),op_d),mult(x0,mult(x1,op_d))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(17,plain,
equal(ld(unit,op_c),op_d),
inference(para,[status(thm),theory(equality)],[5,11]),
[iquote('para(5,11)')] ).
cnf(19,plain,
equal(ld(unit,A),A),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(20,plain,
equal(op_d,op_c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[17]),19]),1]),
[iquote('back_demod(17),demod([19]),flip(1)')] ).
cnf(21,plain,
~ equal(mult(x0,mult(x1,op_c)),mult(x0,mult(x1,op_c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),20,9,20]),
[iquote('back_demod(14),demod([20,9,20])')] ).
cnf(22,plain,
$false,
inference(conflict,[status(thm)],[21]),
[iquote('xx_conflict(21)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : GRP702-11 : TPTP v8.1.0. Released v8.1.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n025.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 : Tue Jun 14 05:32:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.42/1.08 ----- EQP 0.9e, May 2009 -----
% 0.42/1.08 The job began on n025.cluster.edu, Tue Jun 14 05:32:40 2022
% 0.42/1.08 The command was "./eqp09e".
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(lrpo).
% 0.42/1.08 set(basic_paramod).
% 0.42/1.08 set(functional_subsume).
% 0.42/1.08 set(ordered_paramod).
% 0.42/1.08 set(prime_paramod).
% 0.42/1.08 set(para_pairs).
% 0.42/1.08 assign(pick_given_ratio,4).
% 0.42/1.08 clear(print_kept).
% 0.42/1.08 clear(print_new_demod).
% 0.42/1.08 clear(print_back_demod).
% 0.42/1.08 clear(print_given).
% 0.42/1.08 assign(max_mem,64000).
% 0.42/1.08 end_of_commands.
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.42/1.08 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.42/1.08 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.42/1.08 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.42/1.08 0 (wt=-1) [] mult(A,unit) = A.
% 0.42/1.08 0 (wt=-1) [] mult(unit,A) = A.
% 0.42/1.08 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C).
% 0.42/1.08 0 (wt=-1) [] mult(op_c,mult(A,B)) = mult(mult(op_c,A),B).
% 0.42/1.08 0 (wt=-1) [] mult(A,mult(B,op_c)) = mult(mult(A,B),op_c).
% 0.42/1.08 0 (wt=-1) [] mult(A,mult(op_c,B)) = mult(mult(A,op_c),B).
% 0.42/1.08 0 (wt=-1) [] op_d = ld(A,mult(op_c,A)).
% 0.42/1.08 0 (wt=-1) [] op_e = mult(mult(rd(op_c,mult(A,B)),B),A).
% 0.42/1.08 0 (wt=-1) [] op_f = mult(A,mult(B,ld(mult(A,B),op_c))).
% 0.42/1.08 0 (wt=-1) [] -(mult(x0,mult(x1,op_d)) = mult(mult(x0,x1),op_d)).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Starting to process input.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.42/1.08 1 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.42/1.08 2 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.42/1.08 3 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.42/1.08 4 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.42/1.08 5 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.42/1.08 6 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.42/1.08 7 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.42/1.08 8 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.42/1.08 9 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.42/1.08 10 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.42/1.08 11 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.42/1.08 12 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.42/1.08 13 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 14 (wt=11) [flip(1)] -(mult(mult(x0,x1),op_d) = mult(x0,mult(x1,op_d))).
% 0.42/1.08 ---------------- PROOF FOUND ----------------
% 0.42/1.08 % SZS status Unsatisfiable
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 After processing input:
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 5 (wt=5) [] mult(A,unit) = A.
% 0.42/1.08 6 (wt=5) [] mult(unit,A) = A.
% 0.42/1.08 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.42/1.08 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.42/1.08 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.42/1.08 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.42/1.08 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.42/1.08 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.42/1.08 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.42/1.08 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.42/1.08 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.42/1.08 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.42/1.08 14 (wt=11) [flip(1)] -(mult(mult(x0,x1),op_d) = mult(x0,mult(x1,op_d))).
% 0.42/1.08 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.42/1.08 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.42/1.08 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.42/1.08 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.42/1.08 5 (wt=5) [] mult(A,unit) = A.
% 0.42/1.08 6 (wt=5) [] mult(unit,A) = A.
% 0.42/1.08 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.42/1.08 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.42/1.08 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.42/1.08 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.42/1.08 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.42/1.08 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.42/1.08 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 UNIT CONFLICT from 21 and x=x at 0.00 seconds.
% 0.42/1.08
% 0.42/1.08 ---------------- PROOF ----------------
% 0.42/1.08 % SZS output start Refutation
% See solution above
% 0.42/1.08 ------------ end of proof -------------
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 ------------- memory usage ------------
% 0.42/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.08 type (bytes each) gets frees in use avail bytes
% 0.42/1.08 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.42/1.08 term ( 16) 1230 1059 171 12 3.5 K
% 0.42/1.08 gen_ptr ( 8) 676 180 496 10 4.0 K
% 0.42/1.08 context ( 808) 351 349 2 2 3.2 K
% 0.42/1.08 trail ( 12) 34 34 0 3 0.0 K
% 0.42/1.08 bt_node ( 68) 106 103 3 5 0.5 K
% 0.42/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_free_vars_pos (4020)
% 0.42/1.08 0 0 0 0 0.0 K
% 0.42/1.08 discrim ( 12) 178 14 164 11 2.1 K
% 0.42/1.08 flat ( 40) 386 386 0 7 0.3 K
% 0.42/1.08 discrim_pos ( 12) 5 5 0 1 0.0 K
% 0.42/1.08 fpa_head ( 12) 169 0 169 0 2.0 K
% 0.42/1.08 fpa_tree ( 28) 42 42 0 15 0.4 K
% 0.42/1.08 fpa_pos ( 36) 39 39 0 1 0.0 K
% 0.42/1.08 literal ( 12) 50 29 21 0 0.2 K
% 0.42/1.08 clause ( 24) 50 29 21 0 0.5 K
% 0.42/1.08 list ( 12) 78 20 58 1 0.7 K
% 0.42/1.08 list_pos ( 20) 98 23 75 3 1.5 K
% 0.42/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.08
% 0.42/1.08 -------------- statistics -------------
% 0.42/1.08 Clauses input 14
% 0.42/1.08 Usable input 0
% 0.42/1.08 Sos input 14
% 0.42/1.08 Demodulators input 0
% 0.42/1.08 Passive input 0
% 0.42/1.08
% 0.42/1.08 Processed BS (before search) 14
% 0.42/1.08 Forward subsumed BS 0
% 0.42/1.08 Kept BS 14
% 0.42/1.08 New demodulators BS 13
% 0.42/1.08 Back demodulated BS 0
% 0.42/1.08
% 0.42/1.08 Clauses or pairs given 26
% 0.42/1.08 Clauses generated 17
% 0.42/1.08 Forward subsumed 10
% 0.42/1.08 Deleted by weight 0
% 0.42/1.08 Deleted by variable count 0
% 0.42/1.08 Kept 7
% 0.42/1.08 New demodulators 6
% 0.42/1.08 Back demodulated 2
% 0.42/1.08 Ordered paramod prunes 0
% 0.42/1.08 Basic paramod prunes 24
% 0.42/1.08 Prime paramod prunes 0
% 0.42/1.08 Semantic prunes 0
% 0.42/1.08
% 0.42/1.08 Rewrite attmepts 136
% 0.42/1.08 Rewrites 5
% 0.42/1.08
% 0.42/1.08 FPA overloads 0
% 0.42/1.08 FPA underloads 0
% 0.42/1.08
% 0.42/1.08 Usable size 0
% 0.42/1.08 Sos size 18
% 0.42/1.08 Demodulators size 18
% 0.42/1.08 Passive size 0
% 0.42/1.08 Disabled size 2
% 0.42/1.08
% 0.42/1.08 Proofs found 1
% 0.42/1.08
% 0.42/1.08 ----------- times (seconds) ----------- Tue Jun 14 05:32:40 2022
% 0.42/1.08
% 0.42/1.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.08 input time 0.00
% 0.42/1.08 paramodulation time 0.00
% 0.42/1.08 demodulation time 0.00
% 0.42/1.08 orient time 0.00
% 0.42/1.08 weigh time 0.00
% 0.42/1.08 forward subsume time 0.00
% 0.42/1.08 back demod find time 0.00
% 0.42/1.08 conflict time 0.00
% 0.42/1.08 LRPO time 0.00
% 0.42/1.08 store clause time 0.00
% 0.42/1.08 disable clause time 0.00
% 0.42/1.08 prime paramod time 0.00
% 0.42/1.08 semantics time 0.00
% 0.42/1.08
% 0.42/1.08 EQP interrupted
%------------------------------------------------------------------------------