TSTP Solution File: GRP710-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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:49:00 EDT 2022
% Result : Unsatisfiable 0.67s 1.07s
% Output : Refutation 0.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 3 RR)
% Number of literals : 20 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 32 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,unit),A),
file('GRP710-10.p',unknown),
[] ).
cnf(2,plain,
equal(mult(unit,A),A),
file('GRP710-10.p',unknown),
[] ).
cnf(3,plain,
equal(mult(mult(mult(A,B),B),C),mult(A,mult(B,mult(B,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(4,plain,
equal(mult(A,i(A)),unit),
file('GRP710-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(i(A),A),unit),
file('GRP710-10.p',unknown),
[] ).
cnf(6,plain,
~ equal(mult(x0,A),x1),
file('GRP710-10.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,B),B),mult(A,mult(B,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),1]),1]),
[iquote('para(3,1),demod([1]),flip(1)')] ).
cnf(8,plain,
equal(mult(mult(A,mult(B,B)),C),mult(A,mult(B,mult(B,C)))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),7]),
[iquote('back_demod(3),demod([7])')] ).
cnf(11,plain,
equal(mult(A,mult(B,mult(B,i(mult(A,mult(B,B)))))),unit),
inference(para,[status(thm),theory(equality)],[8,4]),
[iquote('para(8,4)')] ).
cnf(13,plain,
equal(mult(i(mult(A,A)),mult(A,mult(A,B))),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,8]),2]),1]),
[iquote('para(5,8),demod([2]),flip(1)')] ).
cnf(15,plain,
equal(mult(i(mult(A,A)),A),i(A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,13]),1]),
[iquote('para(4,13),demod([1])')] ).
cnf(18,plain,
equal(i(i(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,13]),1,15]),
[iquote('para(5,13),demod([1,15])')] ).
cnf(26,plain,
equal(mult(A,mult(A,i(mult(B,mult(A,A))))),i(B)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,13]),1,15]),1]),
[iquote('para(11,13),demod([1,15]),flip(1)')] ).
cnf(38,plain,
equal(mult(A,i(mult(B,mult(A,A)))),mult(i(mult(A,A)),mult(A,i(B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,13]),1]),
[iquote('para(26,13),flip(1)')] ).
cnf(39,plain,
equal(mult(A,mult(i(mult(A,A)),mult(A,i(B)))),i(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[26]),38]),
[iquote('back_demod(26),demod([38])')] ).
cnf(40,plain,
equal(i(mult(A,mult(B,B))),mult(i(mult(B,B)),i(A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,13]),1]),
[iquote('para(26,13),flip(1)')] ).
cnf(41,plain,
equal(mult(i(mult(A,A)),mult(A,i(B))),mult(A,mult(i(mult(A,A)),i(B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[38]),40]),1]),
[iquote('back_demod(38),demod([40]),flip(1)')] ).
cnf(42,plain,
equal(mult(A,mult(A,mult(i(mult(A,A)),i(B)))),i(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[39]),41]),
[iquote('back_demod(39),demod([41])')] ).
cnf(47,plain,
~ equal(i(A),x1),
inference(para,[status(thm),theory(equality)],[42,6]),
[iquote('para(42,6)')] ).
cnf(48,plain,
$false,
inference(conflict,[status(thm)],[47,18]),
[iquote('conflict(47,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP710-10 : TPTP v8.1.0. Released v8.1.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n018.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 12:57:28 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.67/1.07 ----- EQP 0.9e, May 2009 -----
% 0.67/1.07 The job began on n018.cluster.edu, Tue Jun 14 12:57:29 2022
% 0.67/1.07 The command was "./eqp09e".
% 0.67/1.07
% 0.67/1.07 set(prolog_style_variables).
% 0.67/1.07 set(lrpo).
% 0.67/1.07 set(basic_paramod).
% 0.67/1.07 set(functional_subsume).
% 0.67/1.07 set(ordered_paramod).
% 0.67/1.07 set(prime_paramod).
% 0.67/1.07 set(para_pairs).
% 0.67/1.07 assign(pick_given_ratio,4).
% 0.67/1.07 clear(print_kept).
% 0.67/1.07 clear(print_new_demod).
% 0.67/1.07 clear(print_back_demod).
% 0.67/1.07 clear(print_given).
% 0.67/1.07 assign(max_mem,64000).
% 0.67/1.07 end_of_commands.
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 0 (wt=-1) [] mult(A,unit) = A.
% 0.67/1.07 0 (wt=-1) [] mult(unit,A) = A.
% 0.67/1.07 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C).
% 0.67/1.07 0 (wt=-1) [] mult(A,i(A)) = unit.
% 0.67/1.07 0 (wt=-1) [] mult(i(A),A) = unit.
% 0.67/1.07 0 (wt=-1) [] -(mult(x0,A) = x1).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Starting to process input.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 1 (wt=5) [] mult(A,unit) = A.
% 0.67/1.07 1 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 2 (wt=5) [] mult(unit,A) = A.
% 0.67/1.07 2 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.67/1.07 3 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.67/1.07 4 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 5 (wt=6) [] mult(i(A),A) = unit.
% 0.67/1.07 5 is a new demodulator.
% 0.67/1.07
% 0.67/1.07 ** KEPT: 6 (wt=5) [] -(mult(x0,A) = x1).
% 0.67/1.07 ---------------- PROOF FOUND ----------------
% 0.67/1.07 % SZS status Unsatisfiable
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 After processing input:
% 0.67/1.07
% 0.67/1.07 Usable:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Sos:
% 0.67/1.07 1 (wt=5) [] mult(A,unit) = A.
% 0.67/1.07 2 (wt=5) [] mult(unit,A) = A.
% 0.67/1.07 6 (wt=5) [] -(mult(x0,A) = x1).
% 0.67/1.07 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.67/1.07 5 (wt=6) [] mult(i(A),A) = unit.
% 0.67/1.07 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Demodulators:
% 0.67/1.07 1 (wt=5) [] mult(A,unit) = A.
% 0.67/1.07 2 (wt=5) [] mult(unit,A) = A.
% 0.67/1.07 3 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.67/1.07 4 (wt=6) [] mult(A,i(A)) = unit.
% 0.67/1.07 5 (wt=6) [] mult(i(A),A) = unit.
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 Passive:
% 0.67/1.07 end_of_list.
% 0.67/1.07
% 0.67/1.07 UNIT CONFLICT from 47 and 18 at 0.00 seconds.
% 0.67/1.07
% 0.67/1.07 ---------------- PROOF ----------------
% 0.67/1.07 % SZS output start Refutation
% See solution above
% 0.67/1.07 ------------ end of proof -------------
% 0.67/1.07
% 0.67/1.07
% 0.67/1.07 ------------- memory usage ------------
% 0.67/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.67/1.07 type (bytes each) gets frees in use avail bytes
% 0.67/1.07 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.67/1.07 term ( 16) 4682 3751 931 32 18.6 K
% 0.67/1.07 gen_ptr ( 8) 5571 762 4809 19 37.7 K
% 0.67/1.07 context ( 808) 2850 2848 2 3 3.9 K
% 0.67/1.07 trail ( 12) 197 197 0 6 0.1 K
% 0.67/1.07 bt_node ( 68) 1081 1078 3 12 1.0 K
% 0.67/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.67/1.07 ac_match_free_vars_pos (4020)
% 0.67/1.07 0 0 0 0 0.0 K
% 0.67/1.07 discrim ( 12) 1035 212 823 11 9.8 K
% 0.67/1.07 flat ( 40) 9824 9824 0 27 1.1 K
% 0.67/1.07 discrim_pos ( 12) 172 172 0 1 0.0 K
% 0.67/1.07 fpa_head ( 12) 396 0 396 0 4.6 K
% 0.67/1.07 fpa_tree ( 28) 92 92 0 7 0.2 K
% 0.67/1.07 fpa_pos ( 36) 90 90 0 1 0.0 K
% 0.67/1.07 literal ( 12) 146 99 47 0 0.6 K
% 0.67/1.07 clause ( 24) 146 99 47 0 1.1 K
% 0.67/1.07 list ( 12) 102 46 56 3 0.7 K
% 0.67/1.07 list_pos ( 20) 209 61 148 0 2.9 K
% 0.67/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.67/1.07
% 0.67/1.07 -------------- statistics -------------
% 0.67/1.07 Clauses input 6
% 0.67/1.07 Usable input 0
% 0.67/1.07 Sos input 6
% 0.67/1.07 Demodulators input 0
% 0.67/1.07 Passive input 0
% 0.67/1.07
% 0.67/1.07 Processed BS (before search) 6
% 0.67/1.07 Forward subsumed BS 0
% 0.67/1.07 Kept BS 6
% 0.67/1.07 New demodulators BS 5
% 0.67/1.07 Back demodulated BS 0
% 0.67/1.07
% 0.67/1.07 Clauses or pairs given 211
% 0.67/1.07 Clauses generated 95
% 0.67/1.07 Forward subsumed 54
% 0.67/1.07 Deleted by weight 0
% 0.67/1.07 Deleted by variable count 0
% 0.67/1.07 Kept 41
% 0.67/1.07 New demodulators 38
% 0.67/1.07 Back demodulated 11
% 0.67/1.07 Ordered paramod prunes 0
% 0.67/1.07 Basic paramod prunes 473
% 0.67/1.07 Prime paramod prunes 48
% 0.67/1.07 Semantic prunes 0
% 0.67/1.07
% 0.67/1.07 Rewrite attmepts 1221
% 0.67/1.07 Rewrites 124
% 0.67/1.07
% 0.67/1.07 FPA overloads 0
% 0.67/1.07 FPA underloads 0
% 0.67/1.07
% 0.67/1.07 Usable size 0
% 0.67/1.07 Sos size 35
% 0.67/1.07 Demodulators size 32
% 0.67/1.07 Passive size 0
% 0.67/1.07 Disabled size 11
% 0.67/1.07
% 0.67/1.07 Proofs found 1
% 0.67/1.07
% 0.67/1.07 ----------- times (seconds) ----------- Tue Jun 14 12:57:29 2022
% 0.67/1.07
% 0.67/1.07 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.67/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.67/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.67/1.07 input time 0.00
% 0.67/1.07 paramodulation time 0.00
% 0.67/1.07 demodulation time 0.00
% 0.67/1.07 orient time 0.00
% 0.67/1.07 weigh time 0.00
% 0.67/1.07 forward subsume time 0.00
% 0.67/1.07 back demod find time 0.00
% 0.67/1.07 conflict time 0.00
% 0.67/1.07 LRPO time 0.00
% 0.67/1.07 store clause time 0.00
% 0.67/1.07 disable clause time 0.00
% 0.67/1.07 prime paramod time 0.00
% 0.67/1.07 semantics time 0.00
% 0.67/1.07
% 0.67/1.07 EQP interrupted
%------------------------------------------------------------------------------