TSTP Solution File: GRP528-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP528-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:50 EDT 2022
% Result : Unsatisfiable 0.40s 1.07s
% Output : Refutation 0.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% 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 : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(A,B),divide(C,B))),C),
file('GRP528-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP528-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(6,plain,
~ equal(multiply(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(divide(A,divide(B,divide(C,divide(divide(A,D),divide(B,D))))),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(21,plain,
equal(divide(A,divide(multiply(A,B),divide(C,divide(divide(D,D),B)))),C),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(23,plain,
equal(divide(A,multiply(divide(A,B),B)),divide(C,C)),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(24,plain,
equal(divide(A,A),divide(B,multiply(divide(B,C),C))),
inference(flip,[status(thm),theory(equality)],[23]),
[iquote('flip(23)')] ).
cnf(73,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[1,8]),
[iquote('para(1,8)')] ).
cnf(163,plain,
equal(divide(multiply(A,B),B),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,21]),73]),1]),
[iquote('para(1,21),demod([73]),flip(1)')] ).
cnf(193,plain,
equal(divide(A,divide(A,multiply(divide(B,C),C))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,1]),73]),
[iquote('para(23,1),demod([73])')] ).
cnf(206,plain,
equal(divide(A,divide(divide(A,B),divide(C,multiply(divide(C,D),D)))),B),
inference(para,[status(thm),theory(equality)],[24,1]),
[iquote('para(24,1)')] ).
cnf(207,plain,
equal(divide(A,divide(B,multiply(divide(B,C),C))),A),
inference(para,[status(thm),theory(equality)],[24,1]),
[iquote('para(24,1)')] ).
cnf(208,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[206]),207]),
[iquote('back_demod(206),demod([207])')] ).
cnf(209,plain,
equal(multiply(divide(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[193]),208]),
[iquote('back_demod(193),demod([208])')] ).
cnf(210,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[163,208]),
[iquote('para(163,208)')] ).
cnf(213,plain,
equal(multiply(A,B),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[210,209]),
[iquote('para(210,209)')] ).
cnf(214,plain,
$false,
inference(conflict,[status(thm)],[213,6]),
[iquote('conflict(213,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRP528-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n010.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 06:03:09 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.40/1.07 ----- EQP 0.9e, May 2009 -----
% 0.40/1.07 The job began on n010.cluster.edu, Tue Jun 14 06:03:10 2022
% 0.40/1.07 The command was "./eqp09e".
% 0.40/1.07
% 0.40/1.07 set(prolog_style_variables).
% 0.40/1.07 set(lrpo).
% 0.40/1.07 set(basic_paramod).
% 0.40/1.07 set(functional_subsume).
% 0.40/1.07 set(ordered_paramod).
% 0.40/1.07 set(prime_paramod).
% 0.40/1.07 set(para_pairs).
% 0.40/1.07 assign(pick_given_ratio,4).
% 0.40/1.07 clear(print_kept).
% 0.40/1.07 clear(print_new_demod).
% 0.40/1.07 clear(print_back_demod).
% 0.40/1.07 clear(print_given).
% 0.40/1.07 assign(max_mem,64000).
% 0.40/1.07 end_of_commands.
% 0.40/1.07
% 0.40/1.07 Usable:
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Sos:
% 0.40/1.07 0 (wt=-1) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.40/1.07 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.40/1.07 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.40/1.07 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Demodulators:
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Passive:
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Starting to process input.
% 0.40/1.07
% 0.40/1.07 ** KEPT: 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.40/1.07 1 is a new demodulator.
% 0.40/1.07
% 0.40/1.07 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.40/1.07
% 0.40/1.07 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.40/1.07 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.40/1.07
% 0.40/1.07 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.40/1.07
% 0.40/1.07 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.40/1.07 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.40/1.07
% 0.40/1.07 ** KEPT: 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.40/1.07 ---------------- PROOF FOUND ----------------
% 0.40/1.07 % SZS status Unsatisfiable
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 After processing input:
% 0.40/1.07
% 0.40/1.07 Usable:
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Sos:
% 0.40/1.07 6 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.40/1.07 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.40/1.07 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.40/1.07 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.40/1.07 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.40/1.07 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Demodulators:
% 0.40/1.07 1 (wt=11) [] divide(A,divide(divide(A,B),divide(C,B))) = C.
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 Passive:
% 0.40/1.07 end_of_list.
% 0.40/1.07
% 0.40/1.07 UNIT CONFLICT from 213 and 6 at 0.01 seconds.
% 0.40/1.07
% 0.40/1.07 ---------------- PROOF ----------------
% 0.40/1.07 % SZS output start Refutation
% See solution above
% 0.40/1.07 ------------ end of proof -------------
% 0.40/1.07
% 0.40/1.07
% 0.40/1.07 ------------- memory usage ------------
% 0.40/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.40/1.07 type (bytes each) gets frees in use avail bytes
% 0.40/1.07 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.40/1.07 term ( 16) 11303 8524 2779 18 53.8 K
% 0.40/1.07 gen_ptr ( 8) 12980 2393 10587 17 82.8 K
% 0.40/1.07 context ( 808) 8104 8102 2 2 3.2 K
% 0.40/1.07 trail ( 12) 1219 1219 0 5 0.1 K
% 0.40/1.07 bt_node ( 68) 3085 3082 3 10 0.9 K
% 0.40/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.40/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.40/1.07 ac_match_free_vars_pos (4020)
% 0.40/1.07 0 0 0 0 0.0 K
% 0.40/1.07 discrim ( 12) 2165 460 1705 202 22.3 K
% 0.40/1.07 flat ( 40) 20545 20545 0 19 0.7 K
% 0.40/1.07 discrim_pos ( 12) 438 438 0 1 0.0 K
% 0.40/1.07 fpa_head ( 12) 1098 0 1098 0 12.9 K
% 0.40/1.07 fpa_tree ( 28) 471 471 0 15 0.4 K
% 0.40/1.07 fpa_pos ( 36) 319 319 0 1 0.0 K
% 0.40/1.07 literal ( 12) 940 727 213 1 2.5 K
% 0.40/1.07 clause ( 24) 940 727 213 1 5.0 K
% 0.40/1.07 list ( 12) 165 109 56 3 0.7 K
% 0.40/1.07 list_pos ( 20) 859 239 620 67 13.4 K
% 0.40/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.40/1.07
% 0.40/1.07 -------------- statistics -------------
% 0.40/1.07 Clauses input 4
% 0.40/1.07 Usable input 0
% 0.40/1.07 Sos input 4
% 0.40/1.07 Demodulators input 0
% 0.40/1.07 Passive input 0
% 0.40/1.07
% 0.40/1.07 Processed BS (before search) 8
% 0.40/1.07 Forward subsumed BS 2
% 0.40/1.07 Kept BS 6
% 0.40/1.07 New demodulators BS 1
% 0.40/1.07 Back demodulated BS 0
% 0.40/1.07
% 0.40/1.07 Clauses or pairs given 701
% 0.40/1.07 Clauses generated 523
% 0.40/1.07 Forward subsumed 316
% 0.40/1.07 Deleted by weight 0
% 0.40/1.07 Deleted by variable count 0
% 0.40/1.07 Kept 207
% 0.40/1.07 New demodulators 105
% 0.40/1.07 Back demodulated 55
% 0.40/1.07 Ordered paramod prunes 0
% 0.40/1.07 Basic paramod prunes 1206
% 0.40/1.07 Prime paramod prunes 33
% 0.40/1.07 Semantic prunes 0
% 0.40/1.07
% 0.40/1.07 Rewrite attmepts 3125
% 0.40/1.07 Rewrites 217
% 0.40/1.07
% 0.40/1.07 FPA overloads 0
% 0.40/1.07 FPA underloads 0
% 0.40/1.07
% 0.40/1.07 Usable size 0
% 0.40/1.07 Sos size 157
% 0.40/1.07 Demodulators size 94
% 0.40/1.07 Passive size 0
% 0.40/1.07 Disabled size 55
% 0.40/1.07
% 0.40/1.07 Proofs found 1
% 0.40/1.07
% 0.40/1.07 ----------- times (seconds) ----------- Tue Jun 14 06:03:10 2022
% 0.40/1.07
% 0.40/1.07 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.40/1.07 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.40/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.40/1.07 input time 0.00
% 0.40/1.07 paramodulation time 0.00
% 0.40/1.07 demodulation time 0.00
% 0.40/1.07 orient time 0.00
% 0.40/1.07 weigh time 0.00
% 0.40/1.07 forward subsume time 0.00
% 0.40/1.07 back demod find time 0.00
% 0.40/1.07 conflict time 0.00
% 0.40/1.07 LRPO time 0.00
% 0.40/1.07 store clause time 0.00
% 0.40/1.07 disable clause time 0.00
% 0.40/1.07 prime paramod time 0.00
% 0.40/1.07 semantics time 0.00
% 0.40/1.07
% 0.40/1.07 EQP interrupted
%------------------------------------------------------------------------------