TSTP Solution File: GRP001-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP001-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:44:08 EDT 2022
% Result : Unsatisfiable 0.74s 1.13s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 4 RR)
% Number of literals : 12 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP001-4.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(identity,A),A),
file('GRP001-4.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(A,A),identity),
file('GRP001-4.p',unknown),
[] ).
cnf(4,plain,
equal(multiply(a,b),c),
file('GRP001-4.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(b,a),c),
file('GRP001-4.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(A,multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),2]),1]),
[iquote('para(3,1),demod([2]),flip(1)')] ).
cnf(7,plain,
equal(multiply(A,multiply(B,multiply(A,B))),identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,1]),1]),
[iquote('para(3,1),flip(1)')] ).
cnf(9,plain,
equal(multiply(A,identity),A),
inference(para,[status(thm),theory(equality)],[3,6]),
[iquote('para(3,6)')] ).
cnf(13,plain,
equal(multiply(A,multiply(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,6]),9]),1]),
[iquote('para(7,6),demod([9]),flip(1)')] ).
cnf(14,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[13,6]),
[iquote('para(13,6)')] ).
cnf(15,plain,
equal(multiply(b,a),c),
inference(para,[status(thm),theory(equality)],[14,4]),
[iquote('para(14,4)')] ).
cnf(16,plain,
$false,
inference(conflict,[status(thm)],[15,5]),
[iquote('conflict(15,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP001-4 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n026.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 06:23:51 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.74/1.13 ----- EQP 0.9e, May 2009 -----
% 0.74/1.13 The job began on n026.cluster.edu, Tue Jun 14 06:23:52 2022
% 0.74/1.13 The command was "./eqp09e".
% 0.74/1.13
% 0.74/1.13 set(prolog_style_variables).
% 0.74/1.13 set(lrpo).
% 0.74/1.13 set(basic_paramod).
% 0.74/1.13 set(functional_subsume).
% 0.74/1.13 set(ordered_paramod).
% 0.74/1.13 set(prime_paramod).
% 0.74/1.13 set(para_pairs).
% 0.74/1.13 assign(pick_given_ratio,4).
% 0.74/1.13 clear(print_kept).
% 0.74/1.13 clear(print_new_demod).
% 0.74/1.13 clear(print_back_demod).
% 0.74/1.13 clear(print_given).
% 0.74/1.13 assign(max_mem,64000).
% 0.74/1.13 end_of_commands.
% 0.74/1.13
% 0.74/1.13 Usable:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Sos:
% 0.74/1.13 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 0 (wt=-1) [] multiply(identity,A) = A.
% 0.74/1.13 0 (wt=-1) [] multiply(A,A) = identity.
% 0.74/1.13 0 (wt=-1) [] multiply(a,b) = c.
% 0.74/1.13 0 (wt=-1) [] -(multiply(b,a) = c).
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Demodulators:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Passive:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Starting to process input.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 1 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 2 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.13 2 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 3 (wt=5) [] multiply(A,A) = identity.
% 0.74/1.13 3 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 4 (wt=5) [] multiply(a,b) = c.
% 0.74/1.13 4 is a new demodulator.
% 0.74/1.13
% 0.74/1.13 ** KEPT: 5 (wt=5) [] -(multiply(b,a) = c).
% 0.74/1.13 ---------------- PROOF FOUND ----------------
% 0.74/1.13 % SZS status Unsatisfiable
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 After processing input:
% 0.74/1.13
% 0.74/1.13 Usable:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Sos:
% 0.74/1.13 2 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.13 3 (wt=5) [] multiply(A,A) = identity.
% 0.74/1.13 4 (wt=5) [] multiply(a,b) = c.
% 0.74/1.13 5 (wt=5) [] -(multiply(b,a) = c).
% 0.74/1.13 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Demodulators:
% 0.74/1.13 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.13 2 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.13 3 (wt=5) [] multiply(A,A) = identity.
% 0.74/1.13 4 (wt=5) [] multiply(a,b) = c.
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 Passive:
% 0.74/1.13 end_of_list.
% 0.74/1.13
% 0.74/1.13 UNIT CONFLICT from 15 and 5 at 0.00 seconds.
% 0.74/1.13
% 0.74/1.13 ---------------- PROOF ----------------
% 0.74/1.13 % SZS output start Refutation
% See solution above
% 0.74/1.13 ------------ end of proof -------------
% 0.74/1.13
% 0.74/1.13
% 0.74/1.13 ------------- memory usage ------------
% 0.74/1.13 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.13 type (bytes each) gets frees in use avail bytes
% 0.74/1.13 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.13 term ( 16) 956 843 113 12 2.4 K
% 0.74/1.13 gen_ptr ( 8) 542 196 346 11 2.8 K
% 0.74/1.13 context ( 808) 594 592 2 3 3.9 K
% 0.74/1.13 trail ( 12) 49 49 0 3 0.0 K
% 0.74/1.13 bt_node ( 68) 288 285 3 2 0.3 K
% 0.74/1.13 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.13 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.13 ac_match_free_vars_pos (4020)
% 0.74/1.13 0 0 0 0 0.0 K
% 0.74/1.13 discrim ( 12) 97 3 94 0 1.1 K
% 0.74/1.13 flat ( 40) 703 703 0 9 0.4 K
% 0.74/1.13 discrim_pos ( 12) 35 35 0 1 0.0 K
% 0.74/1.13 fpa_head ( 12) 73 0 73 0 0.9 K
% 0.74/1.13 fpa_tree ( 28) 29 29 0 7 0.2 K
% 0.74/1.13 fpa_pos ( 36) 27 27 0 1 0.0 K
% 0.74/1.13 literal ( 12) 57 42 15 1 0.2 K
% 0.74/1.13 clause ( 24) 57 42 15 1 0.4 K
% 0.74/1.13 list ( 12) 71 15 56 3 0.7 K
% 0.74/1.13 list_pos ( 20) 61 10 51 1 1.0 K
% 0.74/1.13 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.13
% 0.74/1.13 -------------- statistics -------------
% 0.74/1.13 Clauses input 5
% 0.74/1.13 Usable input 0
% 0.74/1.13 Sos input 5
% 0.74/1.13 Demodulators input 0
% 0.74/1.13 Passive input 0
% 0.74/1.13
% 0.74/1.13 Processed BS (before search) 5
% 0.74/1.13 Forward subsumed BS 0
% 0.74/1.13 Kept BS 5
% 0.74/1.13 New demodulators BS 4
% 0.74/1.13 Back demodulated BS 0
% 0.74/1.13
% 0.74/1.13 Clauses or pairs given 52
% 0.74/1.13 Clauses generated 37
% 0.74/1.13 Forward subsumed 27
% 0.74/1.13 Deleted by weight 0
% 0.74/1.13 Deleted by variable count 0
% 0.74/1.13 Kept 10
% 0.74/1.13 New demodulators 8
% 0.74/1.13 Back demodulated 1
% 0.74/1.13 Ordered paramod prunes 0
% 0.74/1.13 Basic paramod prunes 25
% 0.74/1.13 Prime paramod prunes 7
% 0.74/1.13 Semantic prunes 0
% 0.74/1.13
% 0.74/1.13 Rewrite attmepts 205
% 0.74/1.13 Rewrites 27
% 0.74/1.13
% 0.74/1.13 FPA overloads 0
% 0.74/1.13 FPA underloads 0
% 0.74/1.13
% 0.74/1.13 Usable size 0
% 0.74/1.13 Sos size 13
% 0.74/1.13 Demodulators size 11
% 0.74/1.13 Passive size 0
% 0.74/1.13 Disabled size 1
% 0.74/1.13
% 0.74/1.13 Proofs found 1
% 0.74/1.13
% 0.74/1.13 ----------- times (seconds) ----------- Tue Jun 14 06:23:52 2022
% 0.74/1.13
% 0.74/1.13 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.13 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.13 input time 0.00
% 0.74/1.13 paramodulation time 0.00
% 0.74/1.13 demodulation time 0.00
% 0.74/1.13 orient time 0.00
% 0.74/1.13 weigh time 0.00
% 0.74/1.13 forward subsume time 0.00
% 0.74/1.13 back demod find time 0.00
% 0.74/1.13 conflict time 0.00
% 0.74/1.13 LRPO time 0.00
% 0.74/1.13 store clause time 0.00
% 0.74/1.13 disable clause time 0.00
% 0.74/1.13 prime paramod time 0.00
% 0.74/1.13 semantics time 0.00
% 0.74/1.13
% 0.74/1.13 EQP interrupted
%------------------------------------------------------------------------------