TSTP Solution File: GRP467-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:47:33 EDT 2022
% Result : Unsatisfiable 0.78s 1.47s
% Output : Refutation 0.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 0 equ; 5 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))),C),
file('GRP467-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP467-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(multiply(multiply(inverse(b2),b2),a2),a2),
file('GRP467-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(divide(inverse(b2),inverse(b2)),a2),a2),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(7,plain,
equal(divide(divide(A,A),divide(divide(divide(B,divide(C,D)),inverse(C)),divide(B,inverse(D)))),divide(E,E)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(45,plain,
equal(divide(A,A),divide(B,B)),
inference(para,[status(thm),theory(equality)],[7,7]),
[iquote('para(7,7)')] ).
cnf(50,plain,
~ equal(multiply(divide(A,A),a2),a2),
inference(para,[status(thm),theory(equality)],[45,5]),
[iquote('para(45,5)')] ).
cnf(54,plain,
equal(divide(divide(A,A),divide(B,divide(divide(C,C),inverse(D)))),divide(D,B)),
inference(para,[status(thm),theory(equality)],[45,1]),
[iquote('para(45,1)')] ).
cnf(55,plain,
equal(divide(A,B),divide(divide(C,C),divide(B,divide(divide(D,D),inverse(A))))),
inference(flip,[status(thm),theory(equality)],[54]),
[iquote('flip(54)')] ).
cnf(78,plain,
equal(divide(divide(A,A),divide(B,multiply(divide(C,C),D))),divide(D,B)),
inference(para,[status(thm),theory(equality)],[3,54]),
[iquote('para(3,54)')] ).
cnf(79,plain,
equal(divide(A,B),divide(divide(C,C),divide(B,multiply(divide(D,D),A)))),
inference(flip,[status(thm),theory(equality)],[78]),
[iquote('flip(78)')] ).
cnf(95,plain,
equal(divide(divide(A,A),divide(inverse(B),multiply(divide(C,C),D))),multiply(D,B)),
inference(para,[status(thm),theory(equality)],[79,3]),
[iquote('para(79,3)')] ).
cnf(96,plain,
equal(multiply(A,B),divide(divide(C,C),divide(inverse(B),multiply(divide(D,D),A)))),
inference(flip,[status(thm),theory(equality)],[95]),
[iquote('flip(95)')] ).
cnf(105,plain,
~ equal(divide(divide(A,A),divide(inverse(a2),multiply(divide(B,B),divide(C,C)))),a2),
inference(para,[status(thm),theory(equality)],[96,50]),
[iquote('para(96,50)')] ).
cnf(151,plain,
~ equal(divide(divide(A,A),divide(inverse(a2),divide(divide(B,B),inverse(divide(C,C))))),a2),
inference(para,[status(thm),theory(equality)],[2,105]),
[iquote('para(2,105)')] ).
cnf(2341,plain,
equal(divide(divide(A,A),divide(B,divide(divide(divide(C,C),divide(divide(D,B),divide(divide(E,E),inverse(F)))),inverse(D)))),F),
inference(para,[status(thm),theory(equality)],[55,1]),
[iquote('para(55,1)')] ).
cnf(2342,plain,
$false,
inference(conflict,[status(thm)],[2341,151]),
[iquote('conflict(2341,151)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : GRP467-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.15 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n019.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Tue Jun 14 02:05:56 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.78/1.47 ----- EQP 0.9e, May 2009 -----
% 0.78/1.47 The job began on n019.cluster.edu, Tue Jun 14 02:05:57 2022
% 0.78/1.47 The command was "./eqp09e".
% 0.78/1.47
% 0.78/1.47 set(prolog_style_variables).
% 0.78/1.47 set(lrpo).
% 0.78/1.47 set(basic_paramod).
% 0.78/1.47 set(functional_subsume).
% 0.78/1.47 set(ordered_paramod).
% 0.78/1.47 set(prime_paramod).
% 0.78/1.47 set(para_pairs).
% 0.78/1.47 assign(pick_given_ratio,4).
% 0.78/1.47 clear(print_kept).
% 0.78/1.47 clear(print_new_demod).
% 0.78/1.47 clear(print_back_demod).
% 0.78/1.47 clear(print_given).
% 0.78/1.47 assign(max_mem,64000).
% 0.78/1.47 end_of_commands.
% 0.78/1.47
% 0.78/1.47 Usable:
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Sos:
% 0.78/1.47 0 (wt=-1) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.78/1.47 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.78/1.47 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Demodulators:
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Passive:
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Starting to process input.
% 0.78/1.47
% 0.78/1.47 ** KEPT: 1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.78/1.47 1 is a new demodulator.
% 0.78/1.47
% 0.78/1.47 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.78/1.47
% 0.78/1.47 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.78/1.47 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.78/1.47
% 0.78/1.47 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.78/1.47 ---------------- PROOF FOUND ----------------
% 0.78/1.47 % SZS status Unsatisfiable
% 0.78/1.47
% 0.78/1.47
% 0.78/1.47 After processing input:
% 0.78/1.47
% 0.78/1.47 Usable:
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Sos:
% 0.78/1.47 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.78/1.47 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.78/1.47 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.78/1.47 1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Demodulators:
% 0.78/1.47 1 (wt=16) [] divide(divide(A,A),divide(B,divide(divide(C,divide(D,B)),inverse(D)))) = C.
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 Passive:
% 0.78/1.47 end_of_list.
% 0.78/1.47
% 0.78/1.47 UNIT CONFLICT from 2341 and 151 at 0.22 seconds.
% 0.78/1.47
% 0.78/1.47 ---------------- PROOF ----------------
% 0.78/1.47 % SZS output start Refutation
% See solution above
% 0.78/1.47 ------------ end of proof -------------
% 0.78/1.47
% 0.78/1.47
% 0.78/1.47 ------------- memory usage ------------
% 0.78/1.47 Memory dynamically allocated (tp_alloc): 6835.
% 0.78/1.47 type (bytes each) gets frees in use avail bytes
% 0.78/1.47 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.78/1.47 term ( 16) 185107 100506 84601 26 1643.7 K
% 0.78/1.47 gen_ptr ( 8) 492348 15808 476540 17 3723.1 K
% 0.78/1.47 context ( 808) 147969 147967 2 2 3.2 K
% 0.78/1.47 trail ( 12) 9942 9942 0 17 0.2 K
% 0.78/1.47 bt_node ( 68) 57341 57338 3 36 2.6 K
% 0.78/1.47 ac_position (285432) 0 0 0 0 0.0 K
% 0.78/1.47 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.78/1.47 ac_match_free_vars_pos (4020)
% 0.78/1.47 0 0 0 0 0.0 K
% 0.78/1.47 discrim ( 12) 45776 3385 42391 0 496.8 K
% 0.78/1.47 flat ( 40) 516625 516625 0 79 3.1 K
% 0.78/1.47 discrim_pos ( 12) 2741 2741 0 1 0.0 K
% 0.78/1.47 fpa_head ( 12) 4490 0 4490 0 52.6 K
% 0.78/1.47 fpa_tree ( 28) 13627 13627 0 49 1.3 K
% 0.78/1.47 fpa_pos ( 36) 2842 2842 0 1 0.0 K
% 0.78/1.47 literal ( 12) 8961 6620 2341 1 27.4 K
% 0.78/1.47 clause ( 24) 8961 6620 2341 1 54.9 K
% 0.78/1.47 list ( 12) 560 504 56 3 0.7 K
% 0.78/1.47 list_pos ( 20) 7792 553 7239 0 141.4 K
% 0.78/1.47 pair_index ( 40) 2 0 2 0 0.1 K
% 0.78/1.47
% 0.78/1.47 -------------- statistics -------------
% 0.78/1.47 Clauses input 3
% 0.78/1.47 Usable input 0
% 0.78/1.47 Sos input 3
% 0.78/1.47 Demodulators input 0
% 0.78/1.47 Passive input 0
% 0.78/1.47
% 0.78/1.47 Processed BS (before search) 5
% 0.78/1.47 Forward subsumed BS 1
% 0.78/1.47 Kept BS 4
% 0.78/1.47 New demodulators BS 1
% 0.78/1.47 Back demodulated BS 0
% 0.78/1.47
% 0.78/1.47 Clauses or pairs given 6540
% 0.78/1.47 Clauses generated 4930
% 0.78/1.47 Forward subsumed 2593
% 0.78/1.47 Deleted by weight 0
% 0.78/1.47 Deleted by variable count 0
% 0.78/1.47 Kept 2337
% 0.78/1.47 New demodulators 500
% 0.78/1.47 Back demodulated 134
% 0.78/1.47 Ordered paramod prunes 0
% 0.78/1.47 Basic paramod prunes 21043
% 0.78/1.47 Prime paramod prunes 1
% 0.78/1.47 Semantic prunes 0
% 0.78/1.47
% 0.78/1.47 Rewrite attmepts 82187
% 0.78/1.47 Rewrites 324
% 0.78/1.47
% 0.78/1.47 FPA overloads 0
% 0.78/1.47 FPA underloads 0
% 0.78/1.47
% 0.78/1.47 Usable size 0
% 0.78/1.47 Sos size 2206
% 0.78/1.47 Demodulators size 487
% 0.78/1.47 Passive size 0
% 0.78/1.47 Disabled size 134
% 0.78/1.47
% 0.78/1.47 Proofs found 1
% 0.78/1.47
% 0.78/1.47 ----------- times (seconds) ----------- Tue Jun 14 02:05:57 2022
% 0.78/1.47
% 0.78/1.47 user CPU time 0.22 (0 hr, 0 min, 0 sec)
% 0.78/1.47 system CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.78/1.47 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.78/1.47 input time 0.00
% 0.78/1.47 paramodulation time 0.03
% 0.78/1.47 demodulation time 0.03
% 0.78/1.47 orient time 0.01
% 0.78/1.47 weigh time 0.01
% 0.78/1.47 forward subsume time 0.01
% 0.78/1.47 back demod find time 0.01
% 0.78/1.47 conflict time 0.01
% 0.78/1.47 LRPO time 0.01
% 0.78/1.47 store clause time 0.08
% 0.78/1.47 disable clause time 0.00
% 0.78/1.47 prime paramod time 0.00
% 0.78/1.47 semantics time 0.00
% 0.78/1.47
% 0.78/1.47 EQP interrupted
%------------------------------------------------------------------------------