TSTP Solution File: GRP715-11 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:02 EDT 2022
% Result : Unsatisfiable 1.94s 2.34s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 23 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(plus(plus(A,B),C),plus(A,plus(B,C))),
file('GRP715-11.p',unknown),
[] ).
cnf(6,plain,
equal(mult(mult(mult(A,B),C),B),mult(A,mult(mult(B,C),B))),
file('GRP715-11.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,B),B),mult(A,mult(B,B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(A,unit),A),
file('GRP715-11.p',unknown),
[] ).
cnf(9,plain,
equal(mult(unit,A),A),
file('GRP715-11.p',unknown),
[] ).
cnf(10,plain,
equal(mult(op_a,op_b),unit),
file('GRP715-11.p',unknown),
[] ).
cnf(11,plain,
equal(mult(op_b,op_a),unit),
file('GRP715-11.p',unknown),
[] ).
cnf(12,plain,
~ equal(mult(mult(x0,op_b),op_a),x0),
file('GRP715-11.p',unknown),
[] ).
cnf(26,plain,
equal(mult(mult(mult(A,mult(mult(B,C),B)),D),B),mult(mult(mult(A,B),C),mult(mult(B,D),B))),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(45,plain,
equal(mult(op_a,mult(op_b,op_b)),op_b),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,7]),9]),1]),
[iquote('para(10,7),demod([9]),flip(1)')] ).
cnf(48,plain,
equal(mult(op_b,mult(mult(op_a,A),op_a)),mult(A,op_a)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,6]),9]),1]),
[iquote('para(11,6),demod([9]),flip(1)')] ).
cnf(160,plain,
equal(mult(mult(mult(A,op_a),op_b),mult(mult(op_a,B),op_a)),mult(A,mult(mult(op_a,B),op_a))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,26]),9,6]),1]),
[iquote('para(10,26),demod([9,6]),flip(1)')] ).
cnf(161,plain,
equal(mult(mult(mult(A,op_b),op_a),mult(mult(op_b,B),op_b)),mult(A,mult(mult(op_b,B),op_b))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,26]),9,6]),1]),
[iquote('para(11,26),demod([9,6]),flip(1)')] ).
cnf(6447,plain,
equal(mult(mult(A,op_a),op_b),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[45,160]),11,8,45,11,8]),
[iquote('para(45,160),demod([11,8,45,11,8])')] ).
cnf(6583,plain,
equal(mult(mult(mult(A,op_b),op_a),B),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[48,161]),6447,48,6447]),
[iquote('para(48,161),demod([6447,48,6447])')] ).
cnf(6596,plain,
equal(mult(mult(A,op_b),op_a),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6583,8]),8]),1]),
[iquote('para(6583,8),demod([8]),flip(1)')] ).
cnf(6597,plain,
$false,
inference(conflict,[status(thm)],[6596,12]),
[iquote('conflict(6596,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP715-11 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n017.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 14 13:08:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.94/2.34 ----- EQP 0.9e, May 2009 -----
% 1.94/2.34 The job began on n017.cluster.edu, Tue Jun 14 13:08:54 2022
% 1.94/2.34 The command was "./eqp09e".
% 1.94/2.34
% 1.94/2.34 set(prolog_style_variables).
% 1.94/2.34 set(lrpo).
% 1.94/2.34 set(basic_paramod).
% 1.94/2.34 set(functional_subsume).
% 1.94/2.34 set(ordered_paramod).
% 1.94/2.34 set(prime_paramod).
% 1.94/2.34 set(para_pairs).
% 1.94/2.34 assign(pick_given_ratio,4).
% 1.94/2.34 clear(print_kept).
% 1.94/2.34 clear(print_new_demod).
% 1.94/2.34 clear(print_back_demod).
% 1.94/2.34 clear(print_given).
% 1.94/2.34 assign(max_mem,64000).
% 1.94/2.34 end_of_commands.
% 1.94/2.34
% 1.94/2.34 Usable:
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Sos:
% 1.94/2.34 0 (wt=-1) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.94/2.34 0 (wt=-1) [] plus(A,B) = plus(B,A).
% 1.94/2.34 0 (wt=-1) [] plus(A,op_0) = A.
% 1.94/2.34 0 (wt=-1) [] plus(A,minus(A)) = op_0.
% 1.94/2.34 0 (wt=-1) [] mult(A,plus(B,C)) = plus(mult(A,B),mult(A,C)).
% 1.94/2.34 0 (wt=-1) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.94/2.34 0 (wt=-1) [] mult(A,mult(B,B)) = mult(mult(A,B),B).
% 1.94/2.34 0 (wt=-1) [] mult(A,unit) = A.
% 1.94/2.34 0 (wt=-1) [] mult(unit,A) = A.
% 1.94/2.34 0 (wt=-1) [] mult(op_a,op_b) = unit.
% 1.94/2.34 0 (wt=-1) [] mult(op_b,op_a) = unit.
% 1.94/2.34 0 (wt=-1) [] -(mult(mult(x0,op_b),op_a) = x0).
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Demodulators:
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Passive:
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Starting to process input.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.94/2.34 1 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 2 (wt=7) [] plus(A,B) = plus(B,A).
% 1.94/2.34 clause forward subsumed: 0 (wt=7) [flip(2)] plus(B,A) = plus(A,B).
% 1.94/2.34
% 1.94/2.34 ** KEPT: 3 (wt=5) [] plus(A,op_0) = A.
% 1.94/2.34 3 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.94/2.34 4 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.94/2.34 5 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.94/2.34 6 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.94/2.34 7 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 8 (wt=5) [] mult(A,unit) = A.
% 1.94/2.34 8 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 9 (wt=5) [] mult(unit,A) = A.
% 1.94/2.34 9 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.94/2.34 10 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.94/2.34 11 is a new demodulator.
% 1.94/2.34
% 1.94/2.34 ** KEPT: 12 (wt=7) [] -(mult(mult(x0,op_b),op_a) = x0).
% 1.94/2.34 ---------------- PROOF FOUND ----------------
% 1.94/2.34 % SZS status Unsatisfiable
% 1.94/2.34
% 1.94/2.34
% 1.94/2.34 After processing input:
% 1.94/2.34
% 1.94/2.34 Usable:
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Sos:
% 1.94/2.34 3 (wt=5) [] plus(A,op_0) = A.
% 1.94/2.34 8 (wt=5) [] mult(A,unit) = A.
% 1.94/2.34 9 (wt=5) [] mult(unit,A) = A.
% 1.94/2.34 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.94/2.34 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.94/2.34 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.94/2.34 2 (wt=7) [] plus(A,B) = plus(B,A).
% 1.94/2.34 12 (wt=7) [] -(mult(mult(x0,op_b),op_a) = x0).
% 1.94/2.34 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.94/2.34 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.94/2.34 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.94/2.34 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.94/2.34 end_of_list.
% 1.94/2.34
% 1.94/2.34 Demodulators:
% 1.94/2.34 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.94/2.34 3 (wt=5) [] plus(A,op_0) = A.
% 1.94/2.34 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.94/2.34 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.94/2.34 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.94/2.34 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.94/2.34 8 (wt=5) [] mult(A,unit) = A.
% 1.94/2.34 9 (wt=5) [] mult(unit,A) = A.
% 1.94/2.35 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.94/2.35 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.94/2.35 end_of_list.
% 1.94/2.35
% 1.94/2.35 Passive:
% 1.94/2.35 end_of_list.
% 1.94/2.35
% 1.94/2.35 UNIT CONFLICT from 6596 and 12 at 0.99 seconds.
% 1.94/2.35
% 1.94/2.35 ---------------- PROOF ----------------
% 1.94/2.35 % SZS output start Refutation
% See solution above
% 1.94/2.35 ------------ end of proof -------------
% 1.94/2.35
% 1.94/2.35
% 1.94/2.35 ------------- memory usage ------------
% 1.94/2.35 Memory dynamically allocated (tp_alloc): 23437.
% 1.94/2.35 type (bytes each) gets frees in use avail bytes
% 1.94/2.35 sym_ent ( 96) 59 0 59 0 5.5 K
% 1.94/2.35 term ( 16) 826526 527590 298936 49 5813.8 K
% 1.94/2.35 gen_ptr ( 8) 1761751 104103 1657648 46 12950.7 K
% 1.94/2.35 context ( 808) 760381 760379 2 7 7.1 K
% 1.94/2.35 trail ( 12) 54300 54300 0 8 0.1 K
% 1.94/2.35 bt_node ( 68) 269113 269110 3 28 2.1 K
% 1.94/2.35 ac_position (285432) 0 0 0 0 0.0 K
% 1.94/2.35 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.94/2.35 ac_match_free_vars_pos (4020)
% 1.94/2.35 0 0 0 0 0.0 K
% 1.94/2.35 discrim ( 12) 270947 28870 242077 5276 2898.7 K
% 1.94/2.35 flat ( 40) 2506369 2506369 0 167 6.5 K
% 1.94/2.35 discrim_pos ( 12) 29441 29441 0 1 0.0 K
% 1.94/2.35 fpa_head ( 12) 15483 0 15483 0 181.4 K
% 1.94/2.35 fpa_tree ( 28) 30379 30379 0 45 1.2 K
% 1.94/2.35 fpa_pos ( 36) 9709 9709 0 1 0.0 K
% 1.94/2.35 literal ( 12) 28828 22232 6596 1 77.3 K
% 1.94/2.35 clause ( 24) 28828 22232 6596 1 154.6 K
% 1.94/2.35 list ( 12) 3172 3116 56 5 0.7 K
% 1.94/2.35 list_pos ( 20) 24824 4458 20366 468 406.9 K
% 1.94/2.35 pair_index ( 40) 2 0 2 0 0.1 K
% 1.94/2.35
% 1.94/2.35 -------------- statistics -------------
% 1.94/2.35 Clauses input 12
% 1.94/2.35 Usable input 0
% 1.94/2.35 Sos input 12
% 1.94/2.35 Demodulators input 0
% 1.94/2.35 Passive input 0
% 1.94/2.35
% 1.94/2.35 Processed BS (before search) 13
% 1.94/2.35 Forward subsumed BS 1
% 1.94/2.35 Kept BS 12
% 1.94/2.35 New demodulators BS 10
% 1.94/2.35 Back demodulated BS 0
% 1.94/2.35
% 1.94/2.35 Clauses or pairs given 33373
% 1.94/2.35 Clauses generated 15997
% 1.94/2.35 Forward subsumed 9413
% 1.94/2.35 Deleted by weight 0
% 1.94/2.35 Deleted by variable count 0
% 1.94/2.35 Kept 6584
% 1.94/2.35 New demodulators 3103
% 1.94/2.35 Back demodulated 944
% 1.94/2.35 Ordered paramod prunes 0
% 1.94/2.35 Basic paramod prunes 134527
% 1.94/2.35 Prime paramod prunes 1245
% 1.94/2.35 Semantic prunes 0
% 1.94/2.35
% 1.94/2.35 Rewrite attmepts 364215
% 1.94/2.35 Rewrites 23146
% 1.94/2.35
% 1.94/2.35 FPA overloads 0
% 1.94/2.35 FPA underloads 0
% 1.94/2.35
% 1.94/2.35 Usable size 0
% 1.94/2.35 Sos size 5651
% 1.94/2.35 Demodulators size 2469
% 1.94/2.35 Passive size 0
% 1.94/2.35 Disabled size 944
% 1.94/2.35
% 1.94/2.35 Proofs found 1
% 1.94/2.35
% 1.94/2.35 ----------- times (seconds) ----------- Tue Jun 14 13:08:56 2022
% 1.94/2.35
% 1.94/2.35 user CPU time 0.99 (0 hr, 0 min, 0 sec)
% 1.94/2.35 system CPU time 0.29 (0 hr, 0 min, 0 sec)
% 1.94/2.35 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.35 input time 0.00
% 1.94/2.35 paramodulation time 0.12
% 1.94/2.35 demodulation time 0.11
% 1.94/2.35 orient time 0.04
% 1.94/2.35 weigh time 0.01
% 1.94/2.35 forward subsume time 0.03
% 1.94/2.35 back demod find time 0.08
% 1.94/2.35 conflict time 0.01
% 1.94/2.35 LRPO time 0.02
% 1.94/2.35 store clause time 0.42
% 1.94/2.35 disable clause time 0.04
% 1.94/2.35 prime paramod time 0.02
% 1.94/2.35 semantics time 0.00
% 1.94/2.35
% 1.94/2.35 EQP interrupted
%------------------------------------------------------------------------------