TSTP Solution File: GRP700-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP700-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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:56 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 3 RR)
% Number of literals : 18 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP700-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP700-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP700-10.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP700-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP700-10.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP700-10.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(mult(A,B),A),mult(A,C)),mult(A,mult(mult(mult(B,A),A),C))),
file('GRP700-10.p',unknown),
[] ).
cnf(10,plain,
~ equal(tuple(mult(A,x0),mult(x0,A)),tuple(unit,unit)),
file('GRP700-10.p',unknown),
[] ).
cnf(15,plain,
equal(rd(A,A),unit),
inference(para,[status(thm),theory(equality)],[6,4]),
[iquote('para(6,4)')] ).
cnf(26,plain,
equal(mult(mult(mult(A,B),A),A),mult(A,mult(mult(B,A),A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,7]),5]),
[iquote('para(5,7),demod([5])')] ).
cnf(95,plain,
equal(rd(mult(A,mult(mult(B,A),A)),A),mult(mult(A,B),A)),
inference(para,[status(thm),theory(equality)],[26,4]),
[iquote('para(26,4)')] ).
cnf(128,plain,
equal(rd(mult(A,mult(B,A)),A),mult(mult(A,rd(B,A)),A)),
inference(para,[status(thm),theory(equality)],[3,95]),
[iquote('para(3,95)')] ).
cnf(129,plain,
equal(mult(mult(A,rd(unit,A)),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,128]),4]),1]),
[iquote('para(6,128),demod([4]),flip(1)')] ).
cnf(134,plain,
equal(mult(A,rd(unit,A)),unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[129,4]),15]),1]),
[iquote('para(129,4),demod([15]),flip(1)')] ).
cnf(135,plain,
equal(rd(unit,A),ld(A,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[134,2]),1]),
[iquote('para(134,2),flip(1)')] ).
cnf(139,plain,
equal(mult(ld(A,unit),A),unit),
inference(para,[status(thm),theory(equality)],[135,3]),
[iquote('para(135,3)')] ).
cnf(147,plain,
~ equal(tuple(unit,unit),tuple(unit,unit)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[139,10]),1]),
[iquote('para(139,10),demod([1])')] ).
cnf(148,plain,
$false,
inference(conflict,[status(thm)],[147]),
[iquote('xx_conflict(147)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP700-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n009.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 02:16:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/1.09 ----- EQP 0.9e, May 2009 -----
% 0.72/1.09 The job began on n009.cluster.edu, Tue Jun 14 02:16:08 2022
% 0.72/1.09 The command was "./eqp09e".
% 0.72/1.09
% 0.72/1.09 set(prolog_style_variables).
% 0.72/1.09 set(lrpo).
% 0.72/1.09 set(basic_paramod).
% 0.72/1.09 set(functional_subsume).
% 0.72/1.09 set(ordered_paramod).
% 0.72/1.09 set(prime_paramod).
% 0.72/1.09 set(para_pairs).
% 0.72/1.09 assign(pick_given_ratio,4).
% 0.72/1.09 clear(print_kept).
% 0.72/1.09 clear(print_new_demod).
% 0.72/1.09 clear(print_back_demod).
% 0.72/1.09 clear(print_given).
% 0.72/1.09 assign(max_mem,64000).
% 0.72/1.09 end_of_commands.
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.72/1.09 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.72/1.09 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.72/1.09 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.72/1.09 0 (wt=-1) [] mult(A,unit) = A.
% 0.72/1.09 0 (wt=-1) [] mult(unit,A) = A.
% 0.72/1.09 0 (wt=-1) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.72/1.09 0 (wt=-1) [] mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B).
% 0.72/1.09 0 (wt=-1) [] -(tuple(mult(A,x0),mult(x0,A)) = tuple(unit,unit)).
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Starting to process input.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.09 1 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.09 2 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.09 3 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.09 4 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.72/1.09 5 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.09 6 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 7 (wt=19) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 8 (wt=19) [flip(7)] mult(A,mult(mult(mult(B,A),A),C)) = mult(mult(mult(A,B),A),mult(A,C)).
% 0.72/1.09 clause forward subsumed: 0 (wt=19) [flip(8)] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.72/1.09 9 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 10 (wt=11) [] -(tuple(mult(A,x0),mult(x0,A)) = tuple(unit,unit)).
% 0.72/1.09 ---------------- PROOF FOUND ----------------
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 After processing input:
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 5 (wt=5) [] mult(A,unit) = A.
% 0.72/1.09 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.09 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.09 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.09 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.09 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.09 10 (wt=11) [] -(tuple(mult(A,x0),mult(x0,A)) = tuple(unit,unit)).
% 0.72/1.09 7 (wt=19) [] mult(mult(mult(A,B),A),mult(A,C)) = mult(A,mult(mult(mult(B,A),A),C)).
% 0.72/1.09 8 (wt=19) [flip(7)] mult(A,mult(mult(mult(B,A),A),C)) = mult(mult(mult(A,B),A),mult(A,C)).
% 0.72/1.09 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.72/1.09 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.72/1.09 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.72/1.09 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.72/1.09 5 (wt=5) [] mult(A,unit) = A.
% 0.72/1.09 6 (wt=5) [] mult(unit,A) = A.
% 0.72/1.09 9 (wt=19) [flip(1)] mult(mult(A,mult(B,mult(B,C))),B) = mult(mult(A,B),mult(B,mult(C,B))).
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 UNIT CONFLICT from 147 and x=x at 0.01 seconds.
% 0.72/1.09
% 0.72/1.09 ---------------- PROOF ----------------
% 0.72/1.09 % SZS output start Refutation
% See solution above
% 0.72/1.09 ------------ end of proof -------------
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 ------------- memory usage ------------
% 0.72/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.09 type (bytes each) gets frees in use avail bytes
% 0.72/1.09 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.09 term ( 16) 10901 7164 3737 22 72.8 K
% 0.72/1.09 gen_ptr ( 8) 18499 1763 16736 17 130.9 K
% 0.72/1.09 context ( 808) 8143 8141 2 3 3.9 K
% 0.72/1.09 trail ( 12) 838 838 0 4 0.0 K
% 0.72/1.09 bt_node ( 68) 2709 2706 3 12 1.0 K
% 0.72/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_free_vars_pos (4020)
% 0.72/1.09 0 0 0 0 0.0 K
% 0.72/1.09 discrim ( 12) 3271 429 2842 0 33.3 K
% 0.72/1.09 flat ( 40) 25517 25517 0 47 1.8 K
% 0.72/1.09 discrim_pos ( 12) 359 359 0 1 0.0 K
% 0.72/1.09 fpa_head ( 12) 1376 0 1376 0 16.1 K
% 0.72/1.09 fpa_tree ( 28) 239 239 0 17 0.5 K
% 0.72/1.09 fpa_pos ( 36) 227 227 0 1 0.0 K
% 0.72/1.09 literal ( 12) 482 335 147 1 1.7 K
% 0.72/1.09 clause ( 24) 482 335 147 1 3.5 K
% 0.72/1.09 list ( 12) 140 84 56 3 0.7 K
% 0.72/1.09 list_pos ( 20) 572 119 453 0 8.8 K
% 0.72/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.09
% 0.72/1.09 -------------- statistics -------------
% 0.72/1.09 Clauses input 9
% 0.72/1.09 Usable input 0
% 0.72/1.09 Sos input 9
% 0.72/1.09 Demodulators input 0
% 0.72/1.09 Passive input 0
% 0.72/1.09
% 0.72/1.09 Processed BS (before search) 11
% 0.72/1.09 Forward subsumed BS 1
% 0.72/1.09 Kept BS 10
% 0.72/1.09 New demodulators BS 7
% 0.72/1.09 Back demodulated BS 0
% 0.72/1.09
% 0.72/1.09 Clauses or pairs given 519
% 0.72/1.09 Clauses generated 298
% 0.72/1.09 Forward subsumed 161
% 0.72/1.09 Deleted by weight 0
% 0.72/1.09 Deleted by variable count 0
% 0.72/1.09 Kept 137
% 0.72/1.09 New demodulators 74
% 0.72/1.09 Back demodulated 22
% 0.72/1.09 Ordered paramod prunes 0
% 0.72/1.09 Basic paramod prunes 805
% 0.72/1.09 Prime paramod prunes 33
% 0.72/1.09 Semantic prunes 0
% 0.72/1.09
% 0.72/1.09 Rewrite attmepts 3934
% 0.72/1.09 Rewrites 290
% 0.72/1.09
% 0.72/1.09 FPA overloads 0
% 0.72/1.09 FPA underloads 0
% 0.72/1.09
% 0.72/1.09 Usable size 0
% 0.72/1.09 Sos size 124
% 0.72/1.09 Demodulators size 59
% 0.72/1.09 Passive size 0
% 0.72/1.09 Disabled size 22
% 0.72/1.09
% 0.72/1.09 Proofs found 1
% 0.72/1.09
% 0.72/1.09 ----------- times (seconds) ----------- Tue Jun 14 02:16:08 2022
% 0.72/1.09
% 0.72/1.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.09 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.09 input time 0.00
% 0.72/1.09 paramodulation time 0.00
% 0.72/1.09 demodulation time 0.00
% 0.72/1.09 orient time 0.00
% 0.72/1.09 weigh time 0.00
% 0.72/1.09 forward subsume time 0.00
% 0.72/1.09 back demod find time 0.00
% 0.72/1.09 conflict time 0.00
% 0.72/1.09 LRPO time 0.00
% 0.72/1.09 store clause time 0.00
% 0.72/1.09 disable clause time 0.00
% 0.72/1.09 prime paramod time 0.00
% 0.72/1.09 semantics time 0.00
% 0.72/1.09
% 0.72/1.09 EQP interrupted
%------------------------------------------------------------------------------