TSTP Solution File: GRP603-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP603-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:48:10 EDT 2022
% Result : Unsatisfiable 0.80s 1.19s
% Output : Refutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 2
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 2 RR)
% Number of literals : 18 ( 0 equ; 1 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)),B),
file('GRP603-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(multiply(A,multiply(multiply(double_divide(B,A),C),B)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2,2]),
[iquote('back_demod(1),demod([2,2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP603-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),D),A),multiply(C,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,3]),1]),
[iquote('para(3,3),flip(1)')] ).
cnf(6,plain,
equal(multiply(double_divide(A,B),multiply(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(8,plain,
equal(multiply(double_divide(multiply(A,multiply(B,C)),D),multiply(D,B)),double_divide(C,A)),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(9,plain,
equal(multiply(double_divide(multiply(A,B),double_divide(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(10,plain,
equal(multiply(double_divide(A,B),multiply(B,C)),double_divide(multiply(A,D),double_divide(D,C))),
inference(para,[status(thm),theory(equality)],[9,6]),
[iquote('para(9,6)')] ).
cnf(51,plain,
equal(double_divide(multiply(A,B),double_divide(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[10,6]),
[iquote('para(10,6)')] ).
cnf(54,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[51,2]),
[iquote('para(51,2)')] ).
cnf(55,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[54]),
[iquote('flip(54)')] ).
cnf(63,plain,
equal(double_divide(multiply(multiply(A,multiply(B,C)),D),double_divide(D,B)),double_divide(C,A)),
inference(para,[status(thm),theory(equality)],[10,8]),
[iquote('para(10,8)')] ).
cnf(71,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[55,3]),
[iquote('para(55,3)')] ).
cnf(85,plain,
equal(multiply(double_divide(A,B),multiply(multiply(C,multiply(B,D)),A)),multiply(C,D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,2]),2]),1]),
[iquote('para(63,2),demod([2]),flip(1)')] ).
cnf(201,plain,
equal(multiply(multiply(A,multiply(B,C)),D),multiply(B,multiply(multiply(A,C),D))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[85,3]),1]),
[iquote('para(85,3),flip(1)')] ).
cnf(1250,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[201,71]),71]),1]),
[iquote('para(201,71),demod([71]),flip(1)')] ).
cnf(1251,plain,
$false,
inference(conflict,[status(thm)],[1250,4]),
[iquote('conflict(1250,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP603-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 13:06:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.80/1.19 ----- EQP 0.9e, May 2009 -----
% 0.80/1.19 The job began on n022.cluster.edu, Tue Jun 14 13:06:18 2022
% 0.80/1.19 The command was "./eqp09e".
% 0.80/1.19
% 0.80/1.19 set(prolog_style_variables).
% 0.80/1.19 set(lrpo).
% 0.80/1.19 set(basic_paramod).
% 0.80/1.19 set(functional_subsume).
% 0.80/1.19 set(ordered_paramod).
% 0.80/1.19 set(prime_paramod).
% 0.80/1.19 set(para_pairs).
% 0.80/1.19 assign(pick_given_ratio,4).
% 0.80/1.19 clear(print_kept).
% 0.80/1.19 clear(print_new_demod).
% 0.80/1.19 clear(print_back_demod).
% 0.80/1.19 clear(print_given).
% 0.80/1.19 assign(max_mem,64000).
% 0.80/1.19 end_of_commands.
% 0.80/1.19
% 0.80/1.19 Usable:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Sos:
% 0.80/1.19 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.80/1.19 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.80/1.19 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Demodulators:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Passive:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Starting to process input.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.80/1.19 1 is a new demodulator.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.80/1.19 2 is a new demodulator.
% 0.80/1.19 -> 2 back demodulating 1.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.80/1.19 3 is a new demodulator.
% 0.80/1.19
% 0.80/1.19 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.80/1.19 ---------------- PROOF FOUND ----------------
% 0.80/1.19 % SZS status Unsatisfiable
% 0.80/1.19
% 0.80/1.19
% 0.80/1.19 After processing input:
% 0.80/1.19
% 0.80/1.19 Usable:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Sos:
% 0.80/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.80/1.19 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.80/1.19 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Demodulators:
% 0.80/1.19 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.80/1.19 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 Passive:
% 0.80/1.19 end_of_list.
% 0.80/1.19
% 0.80/1.19 UNIT CONFLICT from 1250 and 4 at 0.08 seconds.
% 0.80/1.19
% 0.80/1.19 ---------------- PROOF ----------------
% 0.80/1.19 % SZS output start Refutation
% See solution above
% 0.80/1.19 ------------ end of proof -------------
% 0.80/1.19
% 0.80/1.19
% 0.80/1.19 ------------- memory usage ------------
% 0.80/1.19 Memory dynamically allocated (tp_alloc): 1953.
% 0.80/1.19 type (bytes each) gets frees in use avail bytes
% 0.80/1.19 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.80/1.19 term ( 16) 70401 46230 24171 19 467.6 K
% 0.80/1.19 gen_ptr ( 8) 112731 15734 96997 17 757.9 K
% 0.80/1.19 context ( 808) 44007 44005 2 4 4.7 K
% 0.80/1.19 trail ( 12) 7169 7169 0 8 0.1 K
% 0.80/1.19 bt_node ( 68) 11126 11121 5 12 1.1 K
% 0.80/1.19 ac_position (285432) 0 0 0 0 0.0 K
% 0.80/1.19 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.80/1.19 ac_match_free_vars_pos (4020)
% 0.80/1.19 0 0 0 0 0.0 K
% 0.80/1.19 discrim ( 12) 16012 5089 10923 0 128.0 K
% 0.80/1.19 flat ( 40) 167042 167042 0 31 1.2 K
% 0.80/1.19 discrim_pos ( 12) 2522 2522 0 1 0.0 K
% 0.80/1.19 fpa_head ( 12) 3718 0 3718 0 43.6 K
% 0.80/1.19 fpa_tree ( 28) 1646 1646 0 23 0.6 K
% 0.80/1.19 fpa_pos ( 36) 1636 1636 0 1 0.0 K
% 0.80/1.19 literal ( 12) 4671 3421 1250 1 14.7 K
% 0.80/1.19 clause ( 24) 4671 3421 1250 1 29.3 K
% 0.80/1.19 list ( 12) 445 389 56 9 0.8 K
% 0.80/1.19 list_pos ( 20) 4907 1655 3252 0 63.5 K
% 0.80/1.19 pair_index ( 40) 2 0 2 0 0.1 K
% 0.80/1.19
% 0.80/1.19 -------------- statistics -------------
% 0.80/1.19 Clauses input 3
% 0.80/1.19 Usable input 0
% 0.80/1.19 Sos input 3
% 0.80/1.19 Demodulators input 0
% 0.80/1.19 Passive input 0
% 0.80/1.19
% 0.80/1.19 Processed BS (before search) 4
% 0.80/1.19 Forward subsumed BS 0
% 0.80/1.19 Kept BS 4
% 0.80/1.19 New demodulators BS 3
% 0.80/1.19 Back demodulated BS 1
% 0.80/1.19
% 0.80/1.19 Clauses or pairs given 2525
% 0.80/1.19 Clauses generated 2557
% 0.80/1.19 Forward subsumed 1311
% 0.80/1.19 Deleted by weight 0
% 0.80/1.19 Deleted by variable count 0
% 0.80/1.19 Kept 1246
% 0.80/1.19 New demodulators 383
% 0.80/1.19 Back demodulated 364
% 0.80/1.19 Ordered paramod prunes 0
% 0.80/1.19 Basic paramod prunes 6927
% 0.80/1.19 Prime paramod prunes 113
% 0.80/1.19 Semantic prunes 0
% 0.80/1.19
% 0.80/1.19 Rewrite attmepts 24883
% 0.80/1.19 Rewrites 1593
% 0.80/1.19
% 0.80/1.19 FPA overloads 0
% 0.80/1.19 FPA underloads 0
% 0.80/1.19
% 0.80/1.19 Usable size 0
% 0.80/1.19 Sos size 884
% 0.80/1.19 Demodulators size 235
% 0.80/1.19 Passive size 0
% 0.80/1.19 Disabled size 365
% 0.80/1.19
% 0.80/1.19 Proofs found 1
% 0.80/1.19
% 0.80/1.19 ----------- times (seconds) ----------- Tue Jun 14 13:06:19 2022
% 0.80/1.19
% 0.80/1.19 user CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.80/1.19 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.80/1.19 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.80/1.19 input time 0.00
% 0.80/1.19 paramodulation time 0.01
% 0.80/1.19 demodulation time 0.01
% 0.80/1.19 orient time 0.01
% 0.80/1.19 weigh time 0.00
% 0.80/1.19 forward subsume time 0.00
% 0.80/1.19 back demod find time 0.00
% 0.80/1.19 conflict time 0.00
% 0.80/1.19 LRPO time 0.00
% 0.80/1.19 store clause time 0.01
% 0.80/1.19 disable clause time 0.01
% 0.80/1.19 prime paramod time 0.00
% 0.80/1.19 semantics time 0.00
% 0.80/1.19
% 0.80/1.19 EQP interrupted
%------------------------------------------------------------------------------