TSTP Solution File: CAT010-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : CAT010-10 : TPTP v8.1.0. Released v7.3.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 : Thu Jul 14 23:59:13 EDT 2022
% Result : Unsatisfiable 0.68s 1.16s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 9 RR)
% Number of literals : 20 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 23 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq3(A,A,B,C),B),
file('CAT010-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq2(A,A,B,C),B),
file('CAT010-10.p',unknown),
[] ).
cnf(3,plain,
equal(ifeq(A,A,B,C),B),
file('CAT010-10.p',unknown),
[] ).
cnf(7,plain,
equal(ifeq(there_exists(domain(A)),true,there_exists(A),true),true),
file('CAT010-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true),true),
file('CAT010-10.p',unknown),
[] ).
cnf(10,plain,
equal(ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)),codomain(B)),
file('CAT010-10.p',unknown),
[] ).
cnf(12,plain,
equal(compose(compose(A,B),C),compose(A,compose(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
equal(compose(codomain(A),A),A),
file('CAT010-10.p',unknown),
[] ).
cnf(15,plain,
equal(there_exists(compose(a,b)),true),
file('CAT010-10.p',unknown),
[] ).
cnf(16,plain,
~ equal(codomain(compose(a,b)),codomain(a)),
file('CAT010-10.p',unknown),
[] ).
cnf(25,plain,
equal(compose(codomain(A),compose(A,B)),compose(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,12]),1]),
[iquote('para(14,12),flip(1)')] ).
cnf(46,plain,
equal(ifeq2(there_exists(A),true,domain(codomain(A)),codomain(A)),codomain(A)),
inference(para,[status(thm),theory(equality)],[14,10]),
[iquote('para(14,10)')] ).
cnf(48,plain,
equal(there_exists(domain(a)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,9]),3]),
[iquote('para(15,9),demod([3])')] ).
cnf(49,plain,
equal(domain(a),codomain(b)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,10]),2]),
[iquote('para(15,10),demod([2])')] ).
cnf(50,plain,
equal(there_exists(codomain(b)),true),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),49]),
[iquote('back_demod(48),demod([49])')] ).
cnf(52,plain,
equal(there_exists(a),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[49,7]),50,3]),
[iquote('para(49,7),demod([50,3])')] ).
cnf(83,plain,
equal(ifeq2(there_exists(compose(A,B)),true,domain(codomain(A)),codomain(compose(A,B))),codomain(compose(A,B))),
inference(para,[status(thm),theory(equality)],[25,10]),
[iquote('para(25,10)')] ).
cnf(156,plain,
equal(domain(codomain(a)),codomain(a)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[52,46]),2]),
[iquote('para(52,46),demod([2])')] ).
cnf(441,plain,
equal(codomain(compose(a,b)),codomain(a)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,83]),156,2]),1]),
[iquote('para(15,83),demod([156,2]),flip(1)')] ).
cnf(442,plain,
$false,
inference(conflict,[status(thm)],[441,16]),
[iquote('conflict(441,16)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : CAT010-10 : TPTP v8.1.0. Released v7.3.0.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun May 29 22:19:56 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.68/1.16 ----- EQP 0.9e, May 2009 -----
% 0.68/1.16 The job began on n018.cluster.edu, Sun May 29 22:19:57 2022
% 0.68/1.16 The command was "./eqp09e".
% 0.68/1.16
% 0.68/1.16 set(prolog_style_variables).
% 0.68/1.16 set(lrpo).
% 0.68/1.16 set(basic_paramod).
% 0.68/1.16 set(functional_subsume).
% 0.68/1.16 set(ordered_paramod).
% 0.68/1.16 set(prime_paramod).
% 0.68/1.16 set(para_pairs).
% 0.68/1.16 assign(pick_given_ratio,4).
% 0.68/1.16 clear(print_kept).
% 0.68/1.16 clear(print_new_demod).
% 0.68/1.16 clear(print_back_demod).
% 0.68/1.16 clear(print_given).
% 0.68/1.16 assign(max_mem,64000).
% 0.68/1.16 end_of_commands.
% 0.68/1.16
% 0.68/1.16 Usable:
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Sos:
% 0.68/1.16 0 (wt=-1) [] ifeq3(A,A,B,C) = B.
% 0.68/1.16 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.68/1.16 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.68/1.16 0 (wt=-1) [] ifeq(equivalent(A,B),true,there_exists(A),true) = true.
% 0.68/1.16 0 (wt=-1) [] ifeq2(equivalent(A,B),true,A,B) = B.
% 0.68/1.16 0 (wt=-1) [] ifeq(there_exists(A),true,equivalent(A,A),true) = true.
% 0.68/1.16 0 (wt=-1) [] ifeq(there_exists(domain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 0 (wt=-1) [] ifeq(there_exists(codomain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 0 (wt=-1) [] ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true) = true.
% 0.68/1.16 0 (wt=-1) [] ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)) = codomain(B).
% 0.68/1.16 0 (wt=-1) [] ifeq(there_exists(domain(A)),true,ifeq3(domain(A),codomain(B),there_exists(compose(A,B)),true),true) = true.
% 0.68/1.16 0 (wt=-1) [] compose(A,compose(B,C)) = compose(compose(A,B),C).
% 0.68/1.16 0 (wt=-1) [] compose(A,domain(A)) = A.
% 0.68/1.16 0 (wt=-1) [] compose(codomain(A),A) = A.
% 0.68/1.16 0 (wt=-1) [] there_exists(compose(a,b)) = true.
% 0.68/1.16 0 (wt=-1) [] -(codomain(compose(a,b)) = codomain(a)).
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Demodulators:
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Passive:
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Starting to process input.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.68/1.16 1 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.68/1.16 2 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.68/1.16 3 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 4 (wt=10) [] ifeq(equivalent(A,B),true,there_exists(A),true) = true.
% 0.68/1.16 4 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 5 (wt=9) [] ifeq2(equivalent(A,B),true,A,B) = B.
% 0.68/1.16 5 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 6 (wt=10) [] ifeq(there_exists(A),true,equivalent(A,A),true) = true.
% 0.68/1.16 6 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 7 (wt=10) [] ifeq(there_exists(domain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 7 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 8 (wt=10) [] ifeq(there_exists(codomain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 8 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 9 (wt=12) [] ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true) = true.
% 0.68/1.16 9 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 10 (wt=13) [] ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)) = codomain(B).
% 0.68/1.16 10 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 11 (wt=18) [] ifeq(there_exists(domain(A)),true,ifeq3(domain(A),codomain(B),there_exists(compose(A,B)),true),true) = true.
% 0.68/1.16 11 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 12 (wt=11) [flip(1)] compose(compose(A,B),C) = compose(A,compose(B,C)).
% 0.68/1.16 12 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 13 (wt=6) [] compose(A,domain(A)) = A.
% 0.68/1.16 13 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 14 (wt=6) [] compose(codomain(A),A) = A.
% 0.68/1.16 14 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 15 (wt=6) [] there_exists(compose(a,b)) = true.
% 0.68/1.16 15 is a new demodulator.
% 0.68/1.16
% 0.68/1.16 ** KEPT: 16 (wt=7) [] -(codomain(compose(a,b)) = codomain(a)).
% 0.68/1.16 ---------------- PROOF FOUND ----------------
% 0.68/1.16 % SZS status Unsatisfiable
% 0.68/1.16
% 0.68/1.16
% 0.68/1.16 After processing input:
% 0.68/1.16
% 0.68/1.16 Usable:
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Sos:
% 0.68/1.16 13 (wt=6) [] compose(A,domain(A)) = A.
% 0.68/1.16 14 (wt=6) [] compose(codomain(A),A) = A.
% 0.68/1.16 15 (wt=6) [] there_exists(compose(a,b)) = true.
% 0.68/1.16 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.68/1.16 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.68/1.16 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.68/1.16 16 (wt=7) [] -(codomain(compose(a,b)) = codomain(a)).
% 0.68/1.16 5 (wt=9) [] ifeq2(equivalent(A,B),true,A,B) = B.
% 0.68/1.16 4 (wt=10) [] ifeq(equivalent(A,B),true,there_exists(A),true) = true.
% 0.68/1.16 6 (wt=10) [] ifeq(there_exists(A),true,equivalent(A,A),true) = true.
% 0.68/1.16 7 (wt=10) [] ifeq(there_exists(domain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 8 (wt=10) [] ifeq(there_exists(codomain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 12 (wt=11) [flip(1)] compose(compose(A,B),C) = compose(A,compose(B,C)).
% 0.68/1.16 9 (wt=12) [] ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true) = true.
% 0.68/1.16 10 (wt=13) [] ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)) = codomain(B).
% 0.68/1.16 11 (wt=18) [] ifeq(there_exists(domain(A)),true,ifeq3(domain(A),codomain(B),there_exists(compose(A,B)),true),true) = true.
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Demodulators:
% 0.68/1.16 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.68/1.16 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.68/1.16 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.68/1.16 4 (wt=10) [] ifeq(equivalent(A,B),true,there_exists(A),true) = true.
% 0.68/1.16 5 (wt=9) [] ifeq2(equivalent(A,B),true,A,B) = B.
% 0.68/1.16 6 (wt=10) [] ifeq(there_exists(A),true,equivalent(A,A),true) = true.
% 0.68/1.16 7 (wt=10) [] ifeq(there_exists(domain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 8 (wt=10) [] ifeq(there_exists(codomain(A)),true,there_exists(A),true) = true.
% 0.68/1.16 9 (wt=12) [] ifeq(there_exists(compose(A,B)),true,there_exists(domain(A)),true) = true.
% 0.68/1.16 10 (wt=13) [] ifeq2(there_exists(compose(A,B)),true,domain(A),codomain(B)) = codomain(B).
% 0.68/1.16 11 (wt=18) [] ifeq(there_exists(domain(A)),true,ifeq3(domain(A),codomain(B),there_exists(compose(A,B)),true),true) = true.
% 0.68/1.16 12 (wt=11) [flip(1)] compose(compose(A,B),C) = compose(A,compose(B,C)).
% 0.68/1.16 13 (wt=6) [] compose(A,domain(A)) = A.
% 0.68/1.16 14 (wt=6) [] compose(codomain(A),A) = A.
% 0.68/1.16 15 (wt=6) [] there_exists(compose(a,b)) = true.
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 Passive:
% 0.68/1.16 end_of_list.
% 0.68/1.16
% 0.68/1.16 UNIT CONFLICT from 441 and 16 at 0.04 seconds.
% 0.68/1.16
% 0.68/1.16 ---------------- PROOF ----------------
% 0.68/1.16 % SZS output start Refutation
% See solution above
% 0.68/1.16 ------------ end of proof -------------
% 0.68/1.16
% 0.68/1.16
% 0.68/1.16 ------------- memory usage ------------
% 0.68/1.16 Memory dynamically allocated (tp_alloc): 976.
% 0.68/1.16 type (bytes each) gets frees in use avail bytes
% 0.68/1.16 sym_ent ( 96) 65 0 65 0 6.1 K
% 0.68/1.16 term ( 16) 32351 25432 6919 20 133.8 K
% 0.68/1.16 gen_ptr ( 8) 38280 7598 30682 19 239.9 K
% 0.68/1.16 context ( 808) 148096 148094 2 3 3.9 K
% 0.68/1.16 trail ( 12) 562 562 0 4 0.0 K
% 0.68/1.16 bt_node ( 68) 74635 74631 4 18 1.5 K
% 0.68/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.16 ac_match_free_vars_pos (4020)
% 0.68/1.16 0 0 0 0 0.0 K
% 0.68/1.16 discrim ( 12) 6425 1119 5306 0 62.2 K
% 0.68/1.16 flat ( 40) 58362 58362 0 31 1.2 K
% 0.68/1.16 discrim_pos ( 12) 2282 2282 0 1 0.0 K
% 0.68/1.16 fpa_head ( 12) 3226 0 3226 0 37.8 K
% 0.68/1.16 fpa_tree ( 28) 2734 2734 0 15 0.4 K
% 0.68/1.16 fpa_pos ( 36) 880 880 0 1 0.0 K
% 0.68/1.16 literal ( 12) 1727 1286 441 1 5.2 K
% 0.68/1.16 clause ( 24) 1727 1286 441 1 10.4 K
% 0.68/1.16 list ( 12) 498 442 56 3 0.7 K
% 0.68/1.16 list_pos ( 20) 1975 516 1459 0 28.5 K
% 0.68/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.16
% 0.68/1.16 -------------- statistics -------------
% 0.68/1.16 Clauses input 16
% 0.68/1.16 Usable input 0
% 0.68/1.16 Sos input 16
% 0.68/1.16 Demodulators input 0
% 0.68/1.16 Passive input 0
% 0.68/1.16
% 0.68/1.16 Processed BS (before search) 16
% 0.68/1.16 Forward subsumed BS 0
% 0.68/1.16 Kept BS 16
% 0.68/1.16 New demodulators BS 15
% 0.68/1.16 Back demodulated BS 0
% 0.68/1.16
% 0.68/1.16 Clauses or pairs given 8805
% 0.68/1.16 Clauses generated 1181
% 0.68/1.16 Forward subsumed 756
% 0.68/1.16 Deleted by weight 0
% 0.68/1.16 Deleted by variable count 0
% 0.68/1.16 Kept 425
% 0.68/1.16 New demodulators 424
% 0.68/1.16 Back demodulated 100
% 0.68/1.16 Ordered paramod prunes 0
% 0.68/1.16 Basic paramod prunes 22934
% 0.68/1.16 Prime paramod prunes 129
% 0.68/1.16 Semantic prunes 0
% 0.68/1.16
% 0.68/1.16 Rewrite attmepts 16843
% 0.68/1.16 Rewrites 2153
% 0.68/1.16
% 0.68/1.16 FPA overloads 0
% 0.68/1.16 FPA underloads 0
% 0.68/1.16
% 0.68/1.16 Usable size 0
% 0.68/1.16 Sos size 340
% 0.68/1.16 Demodulators size 339
% 0.68/1.16 Passive size 0
% 0.68/1.16 Disabled size 100
% 0.68/1.16
% 0.68/1.16 Proofs found 1
% 0.68/1.16
% 0.68/1.16 ----------- times (seconds) ----------- Sun May 29 22:19:57 2022
% 0.68/1.16
% 0.68/1.16 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.68/1.16 system CPU time 0.08 (0 hr, 0 min, 0 sec)
% 0.68/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.16 input time 0.00
% 0.68/1.16 paramodulation time 0.02
% 0.68/1.16 demodulation time 0.00
% 0.68/1.16 orient time 0.00
% 0.68/1.16 weigh time 0.00
% 0.68/1.16 forward subsume time 0.00
% 0.68/1.16 back demod find time 0.00
% 0.68/1.16 conflict time 0.00
% 0.68/1.16 LRPO time 0.00
% 0.68/1.16 store clause time 0.00
% 0.68/1.16 disable clause time 0.00
% 0.68/1.16 prime paramod time 0.00
% 0.68/1.16 semantics time 0.00
% 0.68/1.16
% 0.68/1.16 EQP interrupted
%------------------------------------------------------------------------------