TSTP Solution File: GRP195-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:45:54 EDT 2022
% Result : Unsatisfiable 0.48s 0.88s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP195-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,multiply(B,B)),multiply(B,multiply(B,A))),
file('GRP195-1.p',unknown),
[] ).
cnf(4,plain,
~ equal(multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))),multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))))),
file('GRP195-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(A,multiply(A,multiply(B,C))),multiply(B,multiply(A,multiply(A,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,1]),1,1,1]),
[iquote('para(2,1),demod([1,1,1])')] ).
cnf(9,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(B,C)))),multiply(B,multiply(C,multiply(B,multiply(C,A))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1,1]),
[iquote('para(1,2),demod([1,1])')] ).
cnf(11,plain,
equal(multiply(A,multiply(A,multiply(B,multiply(C,D)))),multiply(B,multiply(C,multiply(A,multiply(A,D))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,5]),1]),
[iquote('para(1,5),demod([1])')] ).
cnf(83,plain,
~ equal(multiply(a,multiply(b,multiply(a,multiply(a,multiply(b,multiply(a,multiply(b,b))))))),multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))))),
inference(para,[status(thm),theory(equality)],[9,4]),
[iquote('para(9,4)')] ).
cnf(232,plain,
equal(multiply(A,multiply(A,multiply(B,multiply(C,multiply(D,multiply(D,E)))))),multiply(B,multiply(D,multiply(A,multiply(A,multiply(D,multiply(C,E))))))),
inference(para,[status(thm),theory(equality)],[5,11]),
[iquote('para(5,11)')] ).
cnf(233,plain,
equal(multiply(A,multiply(B,multiply(C,multiply(C,multiply(B,multiply(D,E)))))),multiply(C,multiply(C,multiply(A,multiply(D,multiply(B,multiply(B,E))))))),
inference(flip,[status(thm),theory(equality)],[232]),
[iquote('flip(232)')] ).
cnf(234,plain,
$false,
inference(conflict,[status(thm)],[233,83]),
[iquote('conflict(233,83)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP195-1 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.09 % Command : tptp2X_and_run_eqp %s
% 0.08/0.27 % Computer : n032.cluster.edu
% 0.08/0.27 % Model : x86_64 x86_64
% 0.08/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.27 % Memory : 8042.1875MB
% 0.08/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.27 % CPULimit : 300
% 0.08/0.27 % WCLimit : 600
% 0.08/0.27 % DateTime : Mon Jun 13 10:07:41 EDT 2022
% 0.08/0.27 % CPUTime :
% 0.48/0.88 ----- EQP 0.9e, May 2009 -----
% 0.48/0.88 The job began on n032.cluster.edu, Mon Jun 13 10:07:42 2022
% 0.48/0.88 The command was "./eqp09e".
% 0.48/0.88
% 0.48/0.88 set(prolog_style_variables).
% 0.48/0.88 set(lrpo).
% 0.48/0.88 set(basic_paramod).
% 0.48/0.88 set(functional_subsume).
% 0.48/0.88 set(ordered_paramod).
% 0.48/0.88 set(prime_paramod).
% 0.48/0.88 set(para_pairs).
% 0.48/0.88 assign(pick_given_ratio,4).
% 0.48/0.88 clear(print_kept).
% 0.48/0.88 clear(print_new_demod).
% 0.48/0.88 clear(print_back_demod).
% 0.48/0.88 clear(print_given).
% 0.48/0.88 assign(max_mem,64000).
% 0.48/0.88 end_of_commands.
% 0.48/0.88
% 0.48/0.88 Usable:
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Sos:
% 0.48/0.88 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.88 0 (wt=-1) [] multiply(A,multiply(B,B)) = multiply(B,multiply(B,A)).
% 0.48/0.88 0 (wt=-1) [] -(multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) = multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))))).
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Demodulators:
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Passive:
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Starting to process input.
% 0.48/0.88
% 0.48/0.88 ** KEPT: 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.88 1 is a new demodulator.
% 0.48/0.88
% 0.48/0.88 ** KEPT: 2 (wt=11) [] multiply(A,multiply(B,B)) = multiply(B,multiply(B,A)).
% 0.48/0.88
% 0.48/0.88 ** KEPT: 3 (wt=11) [flip(2)] multiply(A,multiply(A,B)) = multiply(B,multiply(A,A)).
% 0.48/0.88 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(B,multiply(A,A)) = multiply(A,multiply(A,B)).
% 0.48/0.88
% 0.48/0.88 ** KEPT: 4 (wt=31) [] -(multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) = multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))))).
% 0.48/0.88 ---------------- PROOF FOUND ----------------
% 0.48/0.88 % SZS status Unsatisfiable
% 0.48/0.88
% 0.48/0.88
% 0.48/0.88 After processing input:
% 0.48/0.88
% 0.48/0.88 Usable:
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Sos:
% 0.48/0.88 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.88 2 (wt=11) [] multiply(A,multiply(B,B)) = multiply(B,multiply(B,A)).
% 0.48/0.88 3 (wt=11) [flip(2)] multiply(A,multiply(A,B)) = multiply(B,multiply(A,A)).
% 0.48/0.88 4 (wt=31) [] -(multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,multiply(b,multiply(a,b))))))) = multiply(a,multiply(a,multiply(a,multiply(a,multiply(b,multiply(b,multiply(b,b)))))))).
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Demodulators:
% 0.48/0.88 1 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 Passive:
% 0.48/0.88 end_of_list.
% 0.48/0.88
% 0.48/0.88 UNIT CONFLICT from 233 and 83 at 0.01 seconds.
% 0.48/0.88
% 0.48/0.88 ---------------- PROOF ----------------
% 0.48/0.88 % SZS output start Refutation
% See solution above
% 0.48/0.88 ------------ end of proof -------------
% 0.48/0.88
% 0.48/0.88
% 0.48/0.88 ------------- memory usage ------------
% 0.48/0.88 Memory dynamically allocated (tp_alloc): 488.
% 0.48/0.88 type (bytes each) gets frees in use avail bytes
% 0.48/0.88 sym_ent ( 96) 54 0 54 0 5.1 K
% 0.48/0.88 term ( 16) 26302 20455 5847 32 113.9 K
% 0.48/0.88 gen_ptr ( 8) 29240 2002 27238 9 212.9 K
% 0.48/0.88 context ( 808) 11743 11741 2 5 5.5 K
% 0.48/0.88 trail ( 12) 1449 1449 0 5 0.1 K
% 0.48/0.88 bt_node ( 68) 2429 2426 3 11 0.9 K
% 0.48/0.88 ac_position (285432) 0 0 0 0 0.0 K
% 0.48/0.88 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.48/0.88 ac_match_free_vars_pos (4020)
% 0.48/0.88 0 0 0 0 0.0 K
% 0.48/0.88 discrim ( 12) 2934 0 2934 0 34.4 K
% 0.48/0.88 flat ( 40) 40531 40531 0 35 1.4 K
% 0.48/0.88 discrim_pos ( 12) 1161 1161 0 1 0.0 K
% 0.48/0.88 fpa_head ( 12) 140 0 140 0 1.6 K
% 0.48/0.88 fpa_tree ( 28) 729 729 0 53 1.4 K
% 0.48/0.88 fpa_pos ( 36) 234 234 0 1 0.0 K
% 0.48/0.88 literal ( 12) 1235 1002 233 1 2.7 K
% 0.48/0.88 clause ( 24) 1235 1002 233 1 5.5 K
% 0.48/0.88 list ( 12) 60 4 56 3 0.7 K
% 0.48/0.88 list_pos ( 20) 700 3 697 0 13.6 K
% 0.48/0.88 pair_index ( 40) 2 0 2 0 0.1 K
% 0.48/0.88
% 0.48/0.88 -------------- statistics -------------
% 0.48/0.88 Clauses input 3
% 0.48/0.88 Usable input 0
% 0.48/0.88 Sos input 3
% 0.48/0.88 Demodulators input 0
% 0.48/0.88 Passive input 0
% 0.48/0.88
% 0.48/0.88 Processed BS (before search) 5
% 0.48/0.88 Forward subsumed BS 1
% 0.48/0.88 Kept BS 4
% 0.48/0.88 New demodulators BS 1
% 0.48/0.88 Back demodulated BS 0
% 0.48/0.88
% 0.48/0.88 Clauses or pairs given 120
% 0.48/0.88 Clauses generated 620
% 0.48/0.88 Forward subsumed 391
% 0.48/0.88 Deleted by weight 0
% 0.48/0.88 Deleted by variable count 0
% 0.48/0.88 Kept 229
% 0.48/0.88 New demodulators 0
% 0.48/0.88 Back demodulated 0
% 0.48/0.88 Ordered paramod prunes 0
% 0.48/0.88 Basic paramod prunes 60
% 0.48/0.88 Prime paramod prunes 34
% 0.48/0.88 Semantic prunes 0
% 0.48/0.88
% 0.48/0.88 Rewrite attmepts 8605
% 0.48/0.88 Rewrites 783
% 0.48/0.88
% 0.48/0.88 FPA overloads 0
% 0.48/0.88 FPA underloads 0
% 0.48/0.88
% 0.48/0.88 Usable size 0
% 0.48/0.88 Sos size 232
% 0.48/0.88 Demodulators size 1
% 0.48/0.88 Passive size 0
% 0.48/0.88 Disabled size 0
% 0.48/0.88
% 0.48/0.88 Proofs found 1
% 0.48/0.88
% 0.48/0.88 ----------- times (seconds) ----------- Mon Jun 13 10:07:42 2022
% 0.48/0.88
% 0.48/0.88 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.48/0.88 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.48/0.88 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.48/0.88 input time 0.00
% 0.48/0.88 paramodulation time 0.00
% 0.48/0.88 demodulation time 0.00
% 0.48/0.88 orient time 0.00
% 0.48/0.88 weigh time 0.00
% 0.48/0.88 forward subsume time 0.00
% 0.48/0.88 back demod find time 0.00
% 0.48/0.88 conflict time 0.00
% 0.48/0.88 LRPO time 0.00
% 0.48/0.88 store clause time 0.00
% 0.48/0.88 disable clause time 0.00
% 0.48/0.88 prime paramod time 0.00
% 0.48/0.88 semantics time 0.00
% 0.48/0.88
% 0.48/0.88 EQP interrupted
%------------------------------------------------------------------------------