TSTP Solution File: GRP464-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP464-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n018.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:32 EDT 2022
% Result : Unsatisfiable 0.74s 1.10s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 2 RR)
% Number of literals : 10 ( 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 : 15 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C))),B),
file('GRP464-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP464-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(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),4]),
[iquote('back_demod(1),demod([4])')] ).
cnf(6,plain,
~ equal(divide(identity,divide(identity,a2)),a2),
inference(demod,[status(thm),theory(equality)],[2]),
[iquote('demod([2])')] ).
cnf(10,plain,
equal(divide(A,divide(divide(divide(identity,B),divide(identity,A)),identity)),B),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(11,plain,
equal(divide(A,identity),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(12,plain,
equal(divide(A,divide(divide(identity,B),divide(identity,A))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),11]),
[iquote('back_demod(10),demod([11])')] ).
cnf(14,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,12]),11]),
[iquote('para(4,12),demod([11])')] ).
cnf(15,plain,
$false,
inference(conflict,[status(thm)],[14,6]),
[iquote('conflict(14,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : GRP464-1 : TPTP v8.1.0. Released v2.6.0.
% 0.04/0.14 % Command : tptp2X_and_run_eqp %s
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 07:13:13 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.74/1.10 ----- EQP 0.9e, May 2009 -----
% 0.74/1.10 The job began on n018.cluster.edu, Tue Jun 14 07:13:14 2022
% 0.74/1.10 The command was "./eqp09e".
% 0.74/1.10
% 0.74/1.10 set(prolog_style_variables).
% 0.74/1.10 set(lrpo).
% 0.74/1.10 set(basic_paramod).
% 0.74/1.10 set(functional_subsume).
% 0.74/1.10 set(ordered_paramod).
% 0.74/1.10 set(prime_paramod).
% 0.74/1.10 set(para_pairs).
% 0.74/1.10 assign(pick_given_ratio,4).
% 0.74/1.10 clear(print_kept).
% 0.74/1.10 clear(print_new_demod).
% 0.74/1.10 clear(print_back_demod).
% 0.74/1.10 clear(print_given).
% 0.74/1.10 assign(max_mem,64000).
% 0.74/1.10 end_of_commands.
% 0.74/1.10
% 0.74/1.10 Usable:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Sos:
% 0.74/1.10 0 (wt=-1) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C))) = B.
% 0.74/1.10 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.10 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.74/1.10 0 (wt=-1) [] identity = divide(A,A).
% 0.74/1.10 0 (wt=-1) [] -(multiply(identity,a2) = a2).
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Demodulators:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Passive:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Starting to process input.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 1 (wt=17) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(identity,A),C))) = B.
% 0.74/1.10 1 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.10 2 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.10 3 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.10 4 is a new demodulator.
% 0.74/1.10 -> 4 back demodulating 1.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 5 (wt=15) [back_demod(1),demod([4])] divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B.
% 0.74/1.10 5 is a new demodulator.
% 0.74/1.10
% 0.74/1.10 ** KEPT: 6 (wt=7) [demod([2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.10 ---------------- PROOF FOUND ----------------
% 0.74/1.10 % SZS status Unsatisfiable
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 After processing input:
% 0.74/1.10
% 0.74/1.10 Usable:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Sos:
% 0.74/1.10 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.10 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.10 6 (wt=7) [demod([2])] -(divide(identity,divide(identity,a2)) = a2).
% 0.74/1.10 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.10 5 (wt=15) [back_demod(1),demod([4])] divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B.
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Demodulators:
% 0.74/1.10 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.10 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.10 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.10 5 (wt=15) [back_demod(1),demod([4])] divide(A,divide(divide(divide(identity,B),C),divide(divide(identity,A),C))) = B.
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 Passive:
% 0.74/1.10 end_of_list.
% 0.74/1.10
% 0.74/1.10 UNIT CONFLICT from 14 and 6 at 0.00 seconds.
% 0.74/1.10
% 0.74/1.10 ---------------- PROOF ----------------
% 0.74/1.10 % SZS output start Refutation
% See solution above
% 0.74/1.10 ------------ end of proof -------------
% 0.74/1.10
% 0.74/1.10
% 0.74/1.10 ------------- memory usage ------------
% 0.74/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.10 type (bytes each) gets frees in use avail bytes
% 0.74/1.10 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.74/1.10 term ( 16) 720 573 147 18 3.2 K
% 0.74/1.10 gen_ptr ( 8) 657 133 524 9 4.2 K
% 0.74/1.10 context ( 808) 323 321 2 2 3.2 K
% 0.74/1.10 trail ( 12) 36 36 0 3 0.0 K
% 0.74/1.10 bt_node ( 68) 101 98 3 4 0.5 K
% 0.74/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.10 ac_match_free_vars_pos (4020)
% 0.74/1.10 0 0 0 0 0.0 K
% 0.74/1.10 discrim ( 12) 161 36 125 0 1.5 K
% 0.74/1.10 flat ( 40) 396 396 0 13 0.5 K
% 0.74/1.10 discrim_pos ( 12) 4 4 0 1 0.0 K
% 0.74/1.10 fpa_head ( 12) 104 0 104 0 1.2 K
% 0.74/1.10 fpa_tree ( 28) 45 45 0 5 0.1 K
% 0.74/1.10 fpa_pos ( 36) 26 26 0 1 0.0 K
% 0.74/1.10 literal ( 12) 32 18 14 1 0.2 K
% 0.74/1.10 clause ( 24) 32 18 14 1 0.4 K
% 0.74/1.10 list ( 12) 71 15 56 4 0.7 K
% 0.74/1.10 list_pos ( 20) 60 15 45 0 0.9 K
% 0.74/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.10
% 0.74/1.10 -------------- statistics -------------
% 0.74/1.10 Clauses input 5
% 0.74/1.10 Usable input 0
% 0.74/1.10 Sos input 5
% 0.74/1.10 Demodulators input 0
% 0.74/1.10 Passive input 0
% 0.74/1.10
% 0.74/1.10 Processed BS (before search) 6
% 0.74/1.10 Forward subsumed BS 0
% 0.74/1.10 Kept BS 6
% 0.74/1.10 New demodulators BS 5
% 0.74/1.10 Back demodulated BS 1
% 0.74/1.10
% 0.74/1.10 Clauses or pairs given 19
% 0.74/1.10 Clauses generated 13
% 0.74/1.10 Forward subsumed 5
% 0.74/1.10 Deleted by weight 0
% 0.74/1.10 Deleted by variable count 0
% 0.74/1.10 Kept 8
% 0.74/1.10 New demodulators 7
% 0.74/1.10 Back demodulated 1
% 0.74/1.10 Ordered paramod prunes 0
% 0.74/1.10 Basic paramod prunes 0
% 0.74/1.10 Prime paramod prunes 0
% 0.74/1.10 Semantic prunes 0
% 0.74/1.10
% 0.74/1.10 Rewrite attmepts 120
% 0.74/1.10 Rewrites 4
% 0.74/1.10
% 0.74/1.10 FPA overloads 0
% 0.74/1.10 FPA underloads 0
% 0.74/1.10
% 0.74/1.10 Usable size 0
% 0.74/1.10 Sos size 11
% 0.74/1.10 Demodulators size 10
% 0.74/1.10 Passive size 0
% 0.74/1.10 Disabled size 2
% 0.74/1.10
% 0.74/1.10 Proofs found 1
% 0.74/1.10
% 0.74/1.10 ----------- times (seconds) ----------- Tue Jun 14 07:13:14 2022
% 0.74/1.10
% 0.74/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.10 input time 0.00
% 0.74/1.10 paramodulation time 0.00
% 0.74/1.10 demodulation time 0.00
% 0.74/1.10 orient time 0.00
% 0.74/1.10 weigh time 0.00
% 0.74/1.10 forward subsume time 0.00
% 0.74/1.10 back demod find time 0.00
% 0.74/1.10 conflict time 0.00
% 0.74/1.10 LRPO time 0.00
% 0.74/1.10 store clause time 0.00
% 0.74/1.10 disable clause time 0.00
% 0.74/1.10 prime paramod time 0.00
% 0.74/1.10 semantics time 0.00
% 0.74/1.10
% 0.74/1.10 EQP interrupted
%------------------------------------------------------------------------------