TSTP Solution File: GRP703-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP703-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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.72s 1.12s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 4 RR)
% Number of literals : 9 ( 0 equ; 2 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP703-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP703-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP703-10.p',unknown),
[] ).
cnf(8,plain,
equal(mult(mult(op_c,A),B),mult(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(12,plain,
equal(mult(mult(rd(op_c,mult(A,B)),B),A),op_e),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
~ equal(mult(mult(op_e,x2),x3),mult(op_e,mult(x2,x3))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(61,plain,
equal(op_e,op_c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,12]),5,3]),1]),
[iquote('para(5,12),demod([5,3]),flip(1)')] ).
cnf(65,plain,
~ equal(mult(op_c,mult(x2,x3)),mult(op_c,mult(x2,x3))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),61,8,61]),
[iquote('back_demod(14),demod([61,8,61])')] ).
cnf(66,plain,
$false,
inference(conflict,[status(thm)],[65]),
[iquote('xx_conflict(65)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP703-10 : TPTP v8.1.0. Released v8.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n006.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 10:55:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.12 ----- EQP 0.9e, May 2009 -----
% 0.72/1.12 The job began on n006.cluster.edu, Tue Jun 14 10:55:27 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) [] mult(A,ld(A,B)) = B.
% 0.72/1.12 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.72/1.12 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.72/1.12 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.72/1.12 0 (wt=-1) [] mult(A,unit) = A.
% 0.72/1.12 0 (wt=-1) [] mult(unit,A) = A.
% 0.72/1.12 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C).
% 0.72/1.12 0 (wt=-1) [] mult(op_c,mult(A,B)) = mult(mult(op_c,A),B).
% 0.72/1.12 0 (wt=-1) [] mult(A,mult(B,op_c)) = mult(mult(A,B),op_c).
% 0.72/1.12 0 (wt=-1) [] mult(A,mult(op_c,B)) = mult(mult(A,op_c),B).
% 0.72/1.12 0 (wt=-1) [] op_d = ld(A,mult(op_c,A)).
% 0.72/1.12 0 (wt=-1) [] op_e = mult(mult(rd(op_c,mult(A,B)),B),A).
% 0.72/1.12 0 (wt=-1) [] op_f = mult(A,mult(B,ld(mult(A,B),op_c))).
% 0.72/1.12 0 (wt=-1) [] -(mult(op_e,mult(x2,x3)) = mult(mult(op_e,x2),x3)).
% 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=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.12 1 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.12 2 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.12 3 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.12 4 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.72/1.12 5 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.12 6 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.72/1.12 7 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.72/1.12 8 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.72/1.12 9 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.72/1.12 10 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.72/1.12 11 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.72/1.12 12 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.72/1.12 13 is a new demodulator.
% 0.72/1.12
% 0.72/1.12 ** KEPT: 14 (wt=11) [flip(1)] -(mult(mult(op_e,x2),x3) = mult(op_e,mult(x2,x3))).
% 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) [] mult(A,unit) = A.
% 0.72/1.12 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.12 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.12 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.12 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.12 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.12 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.72/1.12 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.72/1.12 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.72/1.12 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.72/1.12 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.72/1.12 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.72/1.12 14 (wt=11) [flip(1)] -(mult(mult(op_e,x2),x3) = mult(op_e,mult(x2,x3))).
% 0.72/1.12 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.72/1.12 end_of_list.
% 0.72/1.12
% 0.72/1.12 Demodulators:
% 0.72/1.12 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.12 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.12 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.12 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.12 5 (wt=5) [] mult(A,unit) = A.
% 0.72/1.12 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.12 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.72/1.12 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.72/1.12 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.72/1.12 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.72/1.12 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.72/1.12 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.72/1.12 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 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 65 and x=x 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) 61 0 61 0 5.7 K
% 0.72/1.12 term ( 16) 2828 2179 649 12 12.6 K
% 0.72/1.12 gen_ptr ( 8) 2882 681 2201 8 17.3 K
% 0.72/1.12 context ( 808) 2258 2256 2 3 3.9 K
% 0.72/1.12 trail ( 12) 152 152 0 3 0.0 K
% 0.72/1.12 bt_node ( 68) 862 859 3 5 0.5 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) 671 158 513 46 6.6 K
% 0.72/1.12 flat ( 40) 2861 2861 0 11 0.4 K
% 0.72/1.12 discrim_pos ( 12) 73 73 0 1 0.0 K
% 0.72/1.12 fpa_head ( 12) 378 0 378 0 4.4 K
% 0.72/1.12 fpa_tree ( 28) 142 142 0 15 0.4 K
% 0.72/1.12 fpa_pos ( 36) 123 123 0 1 0.0 K
% 0.72/1.12 literal ( 12) 193 128 65 0 0.8 K
% 0.72/1.12 clause ( 24) 193 128 65 0 1.5 K
% 0.72/1.12 list ( 12) 118 61 57 2 0.7 K
% 0.72/1.12 list_pos ( 20) 294 78 216 16 4.5 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 14
% 0.72/1.12 Usable input 0
% 0.72/1.12 Sos input 14
% 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) 14
% 0.72/1.12 Forward subsumed BS 0
% 0.72/1.12 Kept BS 14
% 0.72/1.12 New demodulators BS 13
% 0.72/1.12 Back demodulated BS 0
% 0.72/1.12
% 0.72/1.12 Clauses or pairs given 220
% 0.72/1.12 Clauses generated 114
% 0.72/1.12 Forward subsumed 63
% 0.72/1.12 Deleted by weight 0
% 0.72/1.12 Deleted by variable count 0
% 0.72/1.12 Kept 51
% 0.72/1.12 New demodulators 46
% 0.72/1.12 Back demodulated 13
% 0.72/1.12 Ordered paramod prunes 0
% 0.72/1.12 Basic paramod prunes 262
% 0.72/1.12 Prime paramod prunes 4
% 0.72/1.12 Semantic prunes 0
% 0.72/1.12
% 0.72/1.12 Rewrite attmepts 806
% 0.72/1.12 Rewrites 67
% 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 51
% 0.72/1.12 Demodulators size 49
% 0.72/1.12 Passive size 0
% 0.72/1.12 Disabled size 13
% 0.72/1.12
% 0.72/1.12 Proofs found 1
% 0.72/1.12
% 0.72/1.12 ----------- times (seconds) ----------- Tue Jun 14 10:55:27 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
%------------------------------------------------------------------------------