TSTP Solution File: GRP550-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP550-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:47:56 EDT 2022
% Result : Unsatisfiable 0.74s 1.12s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 2 RR)
% Number of literals : 14 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,A),divide(divide(divide(B,A),C),B)),C),
file('GRP550-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP550-1.p',unknown),
[] ).
cnf(3,plain,
equal(inverse(A),divide(identity,A)),
file('GRP550-1.p',unknown),
[] ).
cnf(4,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(identity,divide(identity,a2)),a2),
inference(demod,[status(thm),theory(equality)],[3,2,4,2]),
[iquote('demod([3,2,4,2])')] ).
cnf(7,plain,
equal(divide(divide(divide(A,B),C),A),divide(divide(identity,B),divide(C,identity))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(9,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),divide(B,identity))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),7]),
[iquote('back_demod(1),demod([7])')] ).
cnf(10,plain,
equal(divide(identity,divide(identity,divide(A,identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),4]),
[iquote('para(4,9),demod([4])')] ).
cnf(11,plain,
equal(divide(divide(identity,A),divide(divide(identity,A),identity)),identity),
inference(para,[status(thm),theory(equality)],[4,9]),
[iquote('para(4,9)')] ).
cnf(12,plain,
equal(divide(A,divide(A,identity)),identity),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,11]),10]),
[iquote('para(10,11),demod([10])')] ).
cnf(13,plain,
equal(divide(divide(identity,A),identity),divide(identity,A)),
inference(para,[status(thm),theory(equality)],[12,9]),
[iquote('para(12,9)')] ).
cnf(15,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[10,13]),10]),
[iquote('para(10,13),demod([10])')] ).
cnf(16,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),15]),
[iquote('back_demod(10),demod([15])')] ).
cnf(17,plain,
$false,
inference(conflict,[status(thm)],[16,5]),
[iquote('conflict(16,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GRP550-1 : TPTP v8.1.0. Released v2.6.0.
% 0.12/0.14 % Command : tptp2X_and_run_eqp %s
% 0.15/0.36 % Computer : n022.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 : Mon Jun 13 20:15:18 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.74/1.12 ----- EQP 0.9e, May 2009 -----
% 0.74/1.12 The job began on n022.cluster.edu, Mon Jun 13 20:15:19 2022
% 0.74/1.12 The command was "./eqp09e".
% 0.74/1.12
% 0.74/1.12 set(prolog_style_variables).
% 0.74/1.12 set(lrpo).
% 0.74/1.12 set(basic_paramod).
% 0.74/1.12 set(functional_subsume).
% 0.74/1.12 set(ordered_paramod).
% 0.74/1.12 set(prime_paramod).
% 0.74/1.12 set(para_pairs).
% 0.74/1.12 assign(pick_given_ratio,4).
% 0.74/1.12 clear(print_kept).
% 0.74/1.12 clear(print_new_demod).
% 0.74/1.12 clear(print_back_demod).
% 0.74/1.12 clear(print_given).
% 0.74/1.12 assign(max_mem,64000).
% 0.74/1.12 end_of_commands.
% 0.74/1.12
% 0.74/1.12 Usable:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Sos:
% 0.74/1.12 0 (wt=-1) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.74/1.12 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.12 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.74/1.12 0 (wt=-1) [] identity = divide(A,A).
% 0.74/1.12 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Demodulators:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Passive:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Starting to process input.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.74/1.12 1 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.12 2 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.12 3 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.12 4 is a new demodulator.
% 0.74/1.12
% 0.74/1.12 ** KEPT: 5 (wt=7) [demod([3,2,4,2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.12 ---------------- PROOF FOUND ----------------
% 0.74/1.12 % SZS status Unsatisfiable
% 0.74/1.12
% 0.74/1.12
% 0.74/1.12 After processing input:
% 0.74/1.12
% 0.74/1.12 Usable:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Sos:
% 0.74/1.12 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.12 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.12 5 (wt=7) [demod([3,2,4,2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.12 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.12 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Demodulators:
% 0.74/1.12 1 (wt=13) [] divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C.
% 0.74/1.12 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.12 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.12 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 Passive:
% 0.74/1.12 end_of_list.
% 0.74/1.12
% 0.74/1.12 UNIT CONFLICT from 16 and 5 at 0.00 seconds.
% 0.74/1.12
% 0.74/1.12 ---------------- PROOF ----------------
% 0.74/1.12 % SZS output start Refutation
% See solution above
% 0.74/1.12 ------------ end of proof -------------
% 0.74/1.12
% 0.74/1.12
% 0.74/1.12 ------------- memory usage ------------
% 0.74/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.12 type (bytes each) gets frees in use avail bytes
% 0.74/1.12 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.74/1.12 term ( 16) 997 828 169 18 3.6 K
% 0.74/1.12 gen_ptr ( 8) 868 291 577 13 4.6 K
% 0.74/1.12 context ( 808) 817 815 2 2 3.2 K
% 0.74/1.12 trail ( 12) 51 51 0 4 0.0 K
% 0.74/1.12 bt_node ( 68) 395 392 3 8 0.7 K
% 0.74/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.12 ac_match_free_vars_pos (4020)
% 0.74/1.12 0 0 0 0 0.0 K
% 0.74/1.12 discrim ( 12) 187 66 121 17 1.6 K
% 0.74/1.12 flat ( 40) 835 835 0 11 0.4 K
% 0.74/1.12 discrim_pos ( 12) 37 37 0 1 0.0 K
% 0.74/1.12 fpa_head ( 12) 115 0 115 0 1.3 K
% 0.74/1.12 fpa_tree ( 28) 60 60 0 9 0.2 K
% 0.74/1.12 fpa_pos ( 36) 30 30 0 1 0.0 K
% 0.74/1.12 literal ( 12) 50 34 16 1 0.2 K
% 0.74/1.12 clause ( 24) 50 34 16 1 0.4 K
% 0.74/1.12 list ( 12) 73 16 57 2 0.7 K
% 0.74/1.12 list_pos ( 20) 79 35 44 12 1.1 K
% 0.74/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.12
% 0.74/1.12 -------------- statistics -------------
% 0.74/1.12 Clauses input 5
% 0.74/1.12 Usable input 0
% 0.74/1.12 Sos input 5
% 0.74/1.12 Demodulators input 0
% 0.74/1.12 Passive input 0
% 0.74/1.12
% 0.74/1.12 Processed BS (before search) 5
% 0.74/1.12 Forward subsumed BS 0
% 0.74/1.12 Kept BS 5
% 0.74/1.12 New demodulators BS 4
% 0.74/1.12 Back demodulated BS 0
% 0.74/1.12
% 0.74/1.12 Clauses or pairs given 43
% 0.74/1.12 Clauses generated 29
% 0.74/1.12 Forward subsumed 18
% 0.74/1.12 Deleted by weight 0
% 0.74/1.12 Deleted by variable count 0
% 0.74/1.12 Kept 11
% 0.74/1.12 New demodulators 10
% 0.74/1.12 Back demodulated 6
% 0.74/1.12 Ordered paramod prunes 0
% 0.74/1.12 Basic paramod prunes 21
% 0.74/1.12 Prime paramod prunes 6
% 0.74/1.12 Semantic prunes 0
% 0.74/1.12
% 0.74/1.12 Rewrite attmepts 273
% 0.74/1.12 Rewrites 31
% 0.74/1.12
% 0.74/1.12 FPA overloads 0
% 0.74/1.12 FPA underloads 0
% 0.74/1.12
% 0.74/1.12 Usable size 0
% 0.74/1.12 Sos size 9
% 0.74/1.12 Demodulators size 8
% 0.74/1.12 Passive size 0
% 0.74/1.12 Disabled size 6
% 0.74/1.12
% 0.74/1.12 Proofs found 1
% 0.74/1.12
% 0.74/1.12 ----------- times (seconds) ----------- Mon Jun 13 20:15:19 2022
% 0.74/1.12
% 0.74/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.12 input time 0.00
% 0.74/1.12 paramodulation time 0.00
% 0.74/1.12 demodulation time 0.00
% 0.74/1.12 orient time 0.00
% 0.74/1.12 weigh time 0.00
% 0.74/1.12 forward subsume time 0.00
% 0.74/1.12 back demod find time 0.00
% 0.74/1.12 conflict time 0.00
% 0.74/1.12 LRPO time 0.00
% 0.74/1.12 store clause time 0.00
% 0.74/1.12 disable clause time 0.00
% 0.74/1.12 prime paramod time 0.00
% 0.74/1.12 semantics time 0.00
% 0.74/1.12
% 0.74/1.12 EQP interrupted
%------------------------------------------------------------------------------