TSTP Solution File: GRP656-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP656-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:39 EDT 2022
% Result : Unsatisfiable 0.74s 1.14s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 3 RR)
% Number of literals : 13 ( 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; 0 con; 1-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP656-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP656-10.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP656-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(mult(A,mult(B,C)),A),mult(mult(A,B),mult(C,A))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(6,plain,
~ equal(tuple(mult(A,x1(A)),mult(x1_2(A),A)),tuple(x1(A),x1_2(A))),
file('GRP656-10.p',unknown),
[] ).
cnf(9,plain,
equal(mult(mult(A,B),A),mult(mult(A,C),mult(ld(C,B),A))),
inference(para,[status(thm),theory(equality)],[1,5]),
[iquote('para(1,5)')] ).
cnf(19,plain,
equal(ld(mult(A,B),mult(mult(A,C),mult(ld(C,B),A))),A),
inference(para,[status(thm),theory(equality)],[9,2]),
[iquote('para(9,2)')] ).
cnf(61,plain,
equal(mult(ld(A,A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,2]),1]),
[iquote('para(19,2),flip(1)')] ).
cnf(65,plain,
equal(rd(A,A),ld(B,B)),
inference(para,[status(thm),theory(equality)],[61,4]),
[iquote('para(61,4)')] ).
cnf(73,plain,
equal(ld(A,A),ld(B,B)),
inference(para,[status(thm),theory(equality)],[65,65]),
[iquote('para(65,65)')] ).
cnf(78,plain,
equal(mult(A,ld(B,B)),A),
inference(para,[status(thm),theory(equality)],[73,1]),
[iquote('para(73,1)')] ).
cnf(430,plain,
~ equal(tuple(x1(ld(A,A)),x1_2(ld(A,A))),tuple(x1(ld(A,A)),x1_2(ld(A,A)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,6]),78]),
[iquote('para(61,6),demod([78])')] ).
cnf(431,plain,
$false,
inference(conflict,[status(thm)],[430]),
[iquote('xx_conflict(430)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP656-10 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n019.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:31:25 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.14 ----- EQP 0.9e, May 2009 -----
% 0.74/1.14 The job began on n019.cluster.edu, Mon Jun 13 08:31:25 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(mult(A,B),mult(C,A)) = mult(mult(A,mult(B,C)),A).
% 0.74/1.14 0 (wt=-1) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 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=15) [flip(1)] mult(mult(A,mult(B,C)),A) = mult(mult(A,B),mult(C,A)).
% 0.74/1.14 5 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 6 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 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 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=15) [flip(1)] mult(mult(A,mult(B,C)),A) = mult(mult(A,B),mult(C,A)).
% 0.74/1.14 6 (wt=15) [] -(tuple(mult(A,x1(A)),mult(x1_2(A),A)) = tuple(x1(A),x1_2(A))).
% 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=15) [flip(1)] mult(mult(A,mult(B,C)),A) = mult(mult(A,B),mult(C,A)).
% 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 430 and x=x at 0.03 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): 976.
% 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) 27413 14567 12846 20 249.6 K
% 0.74/1.14 gen_ptr ( 8) 60212 4536 55676 12 435.1 K
% 0.74/1.14 context ( 808) 16735 16733 2 3 3.9 K
% 0.74/1.14 trail ( 12) 1997 1997 0 5 0.1 K
% 0.74/1.14 bt_node ( 68) 3896 3893 3 14 1.1 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) 11509 1861 9648 0 113.1 K
% 0.74/1.14 flat ( 40) 68250 68250 0 63 2.5 K
% 0.74/1.14 discrim_pos ( 12) 559 559 0 1 0.0 K
% 0.74/1.14 fpa_head ( 12) 2677 0 2677 0 31.4 K
% 0.74/1.14 fpa_tree ( 28) 880 880 0 13 0.4 K
% 0.74/1.14 fpa_pos ( 36) 623 623 0 1 0.0 K
% 0.74/1.14 literal ( 12) 1387 957 430 1 5.1 K
% 0.74/1.14 clause ( 24) 1387 957 430 1 10.1 K
% 0.74/1.14 list ( 12) 253 197 56 4 0.7 K
% 0.74/1.14 list_pos ( 20) 1674 437 1237 0 24.2 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 6
% 0.74/1.14 Usable input 0
% 0.74/1.14 Sos input 6
% 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) 6
% 0.74/1.14 Forward subsumed BS 0
% 0.74/1.14 Kept BS 6
% 0.74/1.14 New demodulators BS 5
% 0.74/1.14 Back demodulated BS 0
% 0.74/1.14
% 0.74/1.14 Clauses or pairs given 840
% 0.74/1.14 Clauses generated 764
% 0.74/1.14 Forward subsumed 340
% 0.74/1.14 Deleted by weight 0
% 0.74/1.14 Deleted by variable count 0
% 0.74/1.14 Kept 424
% 0.74/1.14 New demodulators 189
% 0.74/1.14 Back demodulated 91
% 0.74/1.14 Ordered paramod prunes 0
% 0.74/1.14 Basic paramod prunes 2077
% 0.74/1.14 Prime paramod prunes 19
% 0.74/1.14 Semantic prunes 0
% 0.74/1.14
% 0.74/1.14 Rewrite attmepts 10258
% 0.74/1.14 Rewrites 353
% 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 338
% 0.74/1.14 Demodulators size 132
% 0.74/1.14 Passive size 0
% 0.74/1.14 Disabled size 91
% 0.74/1.14
% 0.74/1.14 Proofs found 1
% 0.74/1.14
% 0.74/1.14 ----------- times (seconds) ----------- Mon Jun 13 08:31:25 2022
% 0.74/1.14
% 0.74/1.14 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.74/1.14 system CPU time 0.02 (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.01
% 0.74/1.14 demodulation time 0.01
% 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.01
% 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
%------------------------------------------------------------------------------