TSTP Solution File: GRP715-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n004.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.90s 2.28s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 13 ( 13 unt; 0 nHn; 5 RR)
% Number of literals : 13 ( 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 : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(plus(plus(A,B),C),plus(A,plus(B,C))),
file('GRP715-10.p',unknown),
[] ).
cnf(6,plain,
equal(mult(mult(mult(A,B),C),B),mult(A,mult(mult(B,C),B))),
file('GRP715-10.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-10.p',unknown),
[] ).
cnf(9,plain,
equal(mult(unit,A),A),
file('GRP715-10.p',unknown),
[] ).
cnf(10,plain,
equal(mult(op_a,op_b),unit),
file('GRP715-10.p',unknown),
[] ).
cnf(11,plain,
equal(mult(op_b,op_a),unit),
file('GRP715-10.p',unknown),
[] ).
cnf(12,plain,
~ equal(mult(mult(x0,op_a),op_b),x0),
file('GRP715-10.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(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(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(6448,plain,
$false,
inference(conflict,[status(thm)],[6447,12]),
[iquote('conflict(6447,12)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP715-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 08:14:24 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.90/2.28 ----- EQP 0.9e, May 2009 -----
% 1.90/2.28 The job began on n004.cluster.edu, Tue Jun 14 08:14:24 2022
% 1.90/2.28 The command was "./eqp09e".
% 1.90/2.28
% 1.90/2.28 set(prolog_style_variables).
% 1.90/2.28 set(lrpo).
% 1.90/2.28 set(basic_paramod).
% 1.90/2.28 set(functional_subsume).
% 1.90/2.28 set(ordered_paramod).
% 1.90/2.28 set(prime_paramod).
% 1.90/2.28 set(para_pairs).
% 1.90/2.28 assign(pick_given_ratio,4).
% 1.90/2.28 clear(print_kept).
% 1.90/2.28 clear(print_new_demod).
% 1.90/2.28 clear(print_back_demod).
% 1.90/2.28 clear(print_given).
% 1.90/2.28 assign(max_mem,64000).
% 1.90/2.28 end_of_commands.
% 1.90/2.28
% 1.90/2.28 Usable:
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Sos:
% 1.90/2.28 0 (wt=-1) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.90/2.28 0 (wt=-1) [] plus(A,B) = plus(B,A).
% 1.90/2.28 0 (wt=-1) [] plus(A,op_0) = A.
% 1.90/2.28 0 (wt=-1) [] plus(A,minus(A)) = op_0.
% 1.90/2.28 0 (wt=-1) [] mult(A,plus(B,C)) = plus(mult(A,B),mult(A,C)).
% 1.90/2.28 0 (wt=-1) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.90/2.28 0 (wt=-1) [] mult(A,mult(B,B)) = mult(mult(A,B),B).
% 1.90/2.28 0 (wt=-1) [] mult(A,unit) = A.
% 1.90/2.28 0 (wt=-1) [] mult(unit,A) = A.
% 1.90/2.28 0 (wt=-1) [] mult(op_a,op_b) = unit.
% 1.90/2.28 0 (wt=-1) [] mult(op_b,op_a) = unit.
% 1.90/2.28 0 (wt=-1) [] -(mult(mult(x0,op_a),op_b) = x0).
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Demodulators:
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Passive:
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Starting to process input.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.90/2.28 1 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 2 (wt=7) [] plus(A,B) = plus(B,A).
% 1.90/2.28 clause forward subsumed: 0 (wt=7) [flip(2)] plus(B,A) = plus(A,B).
% 1.90/2.28
% 1.90/2.28 ** KEPT: 3 (wt=5) [] plus(A,op_0) = A.
% 1.90/2.28 3 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.90/2.28 4 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.90/2.28 5 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.90/2.28 6 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.90/2.28 7 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 8 (wt=5) [] mult(A,unit) = A.
% 1.90/2.28 8 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 9 (wt=5) [] mult(unit,A) = A.
% 1.90/2.28 9 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.90/2.28 10 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.90/2.28 11 is a new demodulator.
% 1.90/2.28
% 1.90/2.28 ** KEPT: 12 (wt=7) [] -(mult(mult(x0,op_a),op_b) = x0).
% 1.90/2.28 ---------------- PROOF FOUND ----------------
% 1.90/2.28 % SZS status Unsatisfiable
% 1.90/2.28
% 1.90/2.28
% 1.90/2.28 After processing input:
% 1.90/2.28
% 1.90/2.28 Usable:
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Sos:
% 1.90/2.28 3 (wt=5) [] plus(A,op_0) = A.
% 1.90/2.28 8 (wt=5) [] mult(A,unit) = A.
% 1.90/2.28 9 (wt=5) [] mult(unit,A) = A.
% 1.90/2.28 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.90/2.28 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.90/2.28 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.90/2.28 2 (wt=7) [] plus(A,B) = plus(B,A).
% 1.90/2.28 12 (wt=7) [] -(mult(mult(x0,op_a),op_b) = x0).
% 1.90/2.28 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.90/2.28 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.90/2.28 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.90/2.28 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Demodulators:
% 1.90/2.28 1 (wt=11) [] plus(plus(A,B),C) = plus(A,plus(B,C)).
% 1.90/2.28 3 (wt=5) [] plus(A,op_0) = A.
% 1.90/2.28 4 (wt=6) [] plus(A,minus(A)) = op_0.
% 1.90/2.28 5 (wt=13) [flip(1)] plus(mult(A,B),mult(A,C)) = mult(A,plus(B,C)).
% 1.90/2.28 6 (wt=15) [] mult(mult(mult(A,B),C),B) = mult(A,mult(mult(B,C),B)).
% 1.90/2.28 7 (wt=11) [flip(1)] mult(mult(A,B),B) = mult(A,mult(B,B)).
% 1.90/2.28 8 (wt=5) [] mult(A,unit) = A.
% 1.90/2.28 9 (wt=5) [] mult(unit,A) = A.
% 1.90/2.28 10 (wt=5) [] mult(op_a,op_b) = unit.
% 1.90/2.28 11 (wt=5) [] mult(op_b,op_a) = unit.
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 Passive:
% 1.90/2.28 end_of_list.
% 1.90/2.28
% 1.90/2.28 UNIT CONFLICT from 6447 and 12 at 0.89 seconds.
% 1.90/2.28
% 1.90/2.28 ---------------- PROOF ----------------
% 1.90/2.28 % SZS output start Refutation
% See solution above
% 1.90/2.28 ------------ end of proof -------------
% 1.90/2.28
% 1.90/2.28
% 1.90/2.28 ------------- memory usage ------------
% 1.90/2.28 Memory dynamically allocated (tp_alloc): 22949.
% 1.90/2.28 type (bytes each) gets frees in use avail bytes
% 1.90/2.28 sym_ent ( 96) 59 0 59 0 5.5 K
% 1.90/2.28 term ( 16) 807712 513161 294551 29 5728.3 K
% 1.90/2.28 gen_ptr ( 8) 1724215 87031 1637184 12 12790.6 K
% 1.90/2.28 context ( 808) 744971 744969 2 7 7.1 K
% 1.90/2.28 trail ( 12) 53099 53099 0 8 0.1 K
% 1.90/2.28 bt_node ( 68) 267174 267171 3 28 2.1 K
% 1.90/2.28 ac_position (285432) 0 0 0 0 0.0 K
% 1.90/2.28 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.90/2.28 ac_match_free_vars_pos (4020)
% 1.90/2.28 0 0 0 0 0.0 K
% 1.90/2.28 discrim ( 12) 267052 19702 247350 0 2898.6 K
% 1.90/2.28 flat ( 40) 2450866 2450866 0 167 6.5 K
% 1.90/2.28 discrim_pos ( 12) 28443 28443 0 1 0.0 K
% 1.90/2.28 fpa_head ( 12) 15436 0 15436 0 180.9 K
% 1.90/2.28 fpa_tree ( 28) 29439 29439 0 45 1.2 K
% 1.90/2.28 fpa_pos ( 36) 9463 9463 0 1 0.0 K
% 1.90/2.28 literal ( 12) 28018 21571 6447 1 75.6 K
% 1.90/2.28 clause ( 24) 28018 21571 6447 1 151.1 K
% 1.90/2.28 list ( 12) 3075 3019 56 5 0.7 K
% 1.90/2.28 list_pos ( 20) 23596 2914 20682 0 403.9 K
% 1.90/2.28 pair_index ( 40) 2 0 2 0 0.1 K
% 1.90/2.28
% 1.90/2.28 -------------- statistics -------------
% 1.90/2.28 Clauses input 12
% 1.90/2.28 Usable input 0
% 1.90/2.28 Sos input 12
% 1.90/2.28 Demodulators input 0
% 1.90/2.28 Passive input 0
% 1.90/2.28
% 1.90/2.28 Processed BS (before search) 13
% 1.90/2.28 Forward subsumed BS 1
% 1.90/2.28 Kept BS 12
% 1.90/2.28 New demodulators BS 10
% 1.90/2.28 Back demodulated BS 0
% 1.90/2.28
% 1.90/2.28 Clauses or pairs given 33150
% 1.90/2.28 Clauses generated 15548
% 1.90/2.28 Forward subsumed 9113
% 1.90/2.28 Deleted by weight 0
% 1.90/2.28 Deleted by variable count 0
% 1.90/2.28 Kept 6435
% 1.90/2.28 New demodulators 3006
% 1.90/2.28 Back demodulated 604
% 1.90/2.28 Ordered paramod prunes 0
% 1.90/2.28 Basic paramod prunes 133766
% 1.90/2.28 Prime paramod prunes 1245
% 1.90/2.28 Semantic prunes 0
% 1.90/2.28
% 1.90/2.28 Rewrite attmepts 351912
% 1.90/2.28 Rewrites 22318
% 1.90/2.28
% 1.90/2.28 FPA overloads 0
% 1.90/2.28 FPA underloads 0
% 1.90/2.28
% 1.90/2.28 Usable size 0
% 1.90/2.28 Sos size 5842
% 1.90/2.28 Demodulators size 2552
% 1.90/2.28 Passive size 0
% 1.90/2.28 Disabled size 604
% 1.90/2.28
% 1.90/2.28 Proofs found 1
% 1.90/2.28
% 1.90/2.28 ----------- times (seconds) ----------- Tue Jun 14 08:14:25 2022
% 1.90/2.28
% 1.90/2.28 user CPU time 0.89 (0 hr, 0 min, 0 sec)
% 1.90/2.28 system CPU time 0.30 (0 hr, 0 min, 0 sec)
% 1.90/2.28 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.90/2.28 input time 0.00
% 1.90/2.28 paramodulation time 0.09
% 1.90/2.28 demodulation time 0.10
% 1.90/2.28 orient time 0.05
% 1.90/2.28 weigh time 0.01
% 1.90/2.28 forward subsume time 0.03
% 1.90/2.28 back demod find time 0.09
% 1.90/2.28 conflict time 0.00
% 1.90/2.28 LRPO time 0.03
% 1.90/2.28 store clause time 0.41
% 1.90/2.28 disable clause time 0.02
% 1.90/2.28 prime paramod time 0.02
% 1.90/2.28 semantics time 0.00
% 1.90/2.28
% 1.90/2.28 EQP interrupted
%------------------------------------------------------------------------------