TSTP Solution File: CAT005-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 : 300s
% DateTime : Wed Jul 27 12:47:46 EDT 2022
% Result : Unsatisfiable 1.94s 2.13s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 19 ( 8 equ; 7 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ there_exists(codomain(A))
| there_exists(A) ),
file('CAT005-4.p',unknown),
[] ).
cnf(6,axiom,
( ~ there_exists(compose(A,B))
| there_exists(domain(A)) ),
file('CAT005-4.p',unknown),
[] ).
cnf(7,axiom,
( ~ there_exists(compose(A,B))
| domain(A) = codomain(B) ),
file('CAT005-4.p',unknown),
[] ).
cnf(9,axiom,
( ~ there_exists(compose(A,d))
| compose(A,d) = A ),
file('CAT005-4.p',unknown),
[] ).
cnf(11,axiom,
domain(a) != d,
file('CAT005-4.p',unknown),
[] ).
cnf(19,axiom,
compose(codomain(A),A) = A,
file('CAT005-4.p',unknown),
[] ).
cnf(20,axiom,
there_exists(compose(a,d)),
file('CAT005-4.p',unknown),
[] ).
cnf(24,plain,
domain(a) = codomain(d),
inference(hyper,[status(thm)],[20,7]),
[iquote('hyper,20,7')] ).
cnf(25,plain,
there_exists(codomain(d)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[20,6]),24]),
[iquote('hyper,20,6,demod,24')] ).
cnf(28,plain,
codomain(d) != d,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[11]),24]),
[iquote('back_demod,11,demod,24')] ).
cnf(30,plain,
there_exists(d),
inference(hyper,[status(thm)],[25,5]),
[iquote('hyper,25,5')] ).
cnf(75,plain,
( codomain(d) = d
| ~ there_exists(d) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[19,9]),19]),
[iquote('para_into,18.1.1,9.2.1,demod,19')] ).
cnf(237,plain,
codomain(d) = d,
inference(hyper,[status(thm)],[75,30]),
[iquote('hyper,75,30')] ).
cnf(239,plain,
$false,
inference(binary,[status(thm)],[237,28]),
[iquote('binary,237.1,28.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : CAT005-4 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 02:15:18 EDT 2022
% 0.18/0.33 % CPUTime :
% 1.94/2.13 ----- Otter 3.3f, August 2004 -----
% 1.94/2.13 The process was started by sandbox on n023.cluster.edu,
% 1.94/2.13 Wed Jul 27 02:15:18 2022
% 1.94/2.13 The command was "./otter". The process ID is 31484.
% 1.94/2.13
% 1.94/2.13 set(prolog_style_variables).
% 1.94/2.13 set(auto).
% 1.94/2.13 dependent: set(auto1).
% 1.94/2.13 dependent: set(process_input).
% 1.94/2.13 dependent: clear(print_kept).
% 1.94/2.13 dependent: clear(print_new_demod).
% 1.94/2.13 dependent: clear(print_back_demod).
% 1.94/2.13 dependent: clear(print_back_sub).
% 1.94/2.13 dependent: set(control_memory).
% 1.94/2.13 dependent: assign(max_mem, 12000).
% 1.94/2.13 dependent: assign(pick_given_ratio, 4).
% 1.94/2.13 dependent: assign(stats_level, 1).
% 1.94/2.13 dependent: assign(max_seconds, 10800).
% 1.94/2.13 clear(print_given).
% 1.94/2.13
% 1.94/2.13 list(usable).
% 1.94/2.13 0 [] A=A.
% 1.94/2.13 0 [] -e_quivalent(X,Y)|there_exists(X).
% 1.94/2.13 0 [] -e_quivalent(X,Y)|X=Y.
% 1.94/2.13 0 [] -there_exists(X)|X!=Y|e_quivalent(X,Y).
% 1.94/2.13 0 [] -there_exists(domain(X))|there_exists(X).
% 1.94/2.13 0 [] -there_exists(codomain(X))|there_exists(X).
% 1.94/2.13 0 [] -there_exists(compose(X,Y))|there_exists(domain(X)).
% 1.94/2.13 0 [] -there_exists(compose(X,Y))|domain(X)=codomain(Y).
% 1.94/2.13 0 [] -there_exists(domain(X))|domain(X)!=codomain(Y)|there_exists(compose(X,Y)).
% 1.94/2.13 0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.94/2.13 0 [] compose(X,domain(X))=X.
% 1.94/2.13 0 [] compose(codomain(X),X)=X.
% 1.94/2.13 0 [] there_exists(compose(a,d)).
% 1.94/2.13 0 [] -there_exists(compose(X,d))|compose(X,d)=X.
% 1.94/2.13 0 [] -there_exists(compose(d,Y))|compose(d,Y)=Y.
% 1.94/2.13 0 [] domain(a)!=d.
% 1.94/2.13 end_of_list.
% 1.94/2.13
% 1.94/2.13 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.94/2.13
% 1.94/2.13 This is a Horn set with equality. The strategy will be
% 1.94/2.13 Knuth-Bendix and hyper_res, with positive clauses in
% 1.94/2.13 sos and nonpositive clauses in usable.
% 1.94/2.13
% 1.94/2.13 dependent: set(knuth_bendix).
% 1.94/2.13 dependent: set(anl_eq).
% 1.94/2.13 dependent: set(para_from).
% 1.94/2.13 dependent: set(para_into).
% 1.94/2.13 dependent: clear(para_from_right).
% 1.94/2.13 dependent: clear(para_into_right).
% 1.94/2.13 dependent: set(para_from_vars).
% 1.94/2.13 dependent: set(eq_units_both_ways).
% 1.94/2.13 dependent: set(dynamic_demod_all).
% 1.94/2.13 dependent: set(dynamic_demod).
% 1.94/2.13 dependent: set(order_eq).
% 1.94/2.13 dependent: set(back_demod).
% 1.94/2.13 dependent: set(lrpo).
% 1.94/2.13 dependent: set(hyper_res).
% 1.94/2.13 dependent: clear(order_hyper).
% 1.94/2.13
% 1.94/2.13 ------------> process usable:
% 1.94/2.13 ** KEPT (pick-wt=5): 1 [] -e_quivalent(A,B)|there_exists(A).
% 1.94/2.13 ** KEPT (pick-wt=6): 2 [] -e_quivalent(A,B)|A=B.
% 1.94/2.13 ** KEPT (pick-wt=8): 3 [] -there_exists(A)|A!=B|e_quivalent(A,B).
% 1.94/2.13 ** KEPT (pick-wt=5): 4 [] -there_exists(domain(A))|there_exists(A).
% 1.94/2.13 ** KEPT (pick-wt=5): 5 [] -there_exists(codomain(A))|there_exists(A).
% 1.94/2.13 ** KEPT (pick-wt=7): 6 [] -there_exists(compose(A,B))|there_exists(domain(A)).
% 1.94/2.13 ** KEPT (pick-wt=9): 7 [] -there_exists(compose(A,B))|domain(A)=codomain(B).
% 1.94/2.13 ** KEPT (pick-wt=12): 8 [] -there_exists(domain(A))|domain(A)!=codomain(B)|there_exists(compose(A,B)).
% 1.94/2.13 ** KEPT (pick-wt=9): 9 [] -there_exists(compose(A,d))|compose(A,d)=A.
% 1.94/2.13 ** KEPT (pick-wt=9): 10 [] -there_exists(compose(d,A))|compose(d,A)=A.
% 1.94/2.13 ** KEPT (pick-wt=4): 11 [] domain(a)!=d.
% 1.94/2.13
% 1.94/2.13 ------------> process sos:
% 1.94/2.13 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.94/2.13 ** KEPT (pick-wt=11): 14 [copy,13,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.94/2.13 ---> New Demodulator: 15 [new_demod,14] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.94/2.13 ** KEPT (pick-wt=6): 16 [] compose(A,domain(A))=A.
% 1.94/2.13 ---> New Demodulator: 17 [new_demod,16] compose(A,domain(A))=A.
% 1.94/2.13 ** KEPT (pick-wt=6): 18 [] compose(codomain(A),A)=A.
% 1.94/2.13 ---> New Demodulator: 19 [new_demod,18] compose(codomain(A),A)=A.
% 1.94/2.13 ** KEPT (pick-wt=4): 20 [] there_exists(compose(a,d)).
% 1.94/2.13 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.94/2.13 >>>> Starting back demodulation with 15.
% 1.94/2.13 >>>> Starting back demodulation with 17.
% 1.94/2.13 >>>> Starting back demodulation with 19.
% 1.94/2.13
% 1.94/2.13 ======= end of input processing =======
% 1.94/2.13
% 1.94/2.13 =========== start of search ===========
% 1.94/2.13
% 1.94/2.13 -------- PROOF --------
% 1.94/2.13
% 1.94/2.13 ----> UNIT CONFLICT at 0.01 sec ----> 239 [binary,237.1,28.1] $F.
% 1.94/2.13
% 1.94/2.13 Length of proof is 6. Level of proof is 4.
% 1.94/2.13
% 1.94/2.13 ---------------- PROOF ----------------
% 1.94/2.13 % SZS status Unsatisfiable
% 1.94/2.13 % SZS output start Refutation
% See solution above
% 1.94/2.13 ------------ end of proof -------------
% 1.94/2.13
% 1.94/2.13
% 1.94/2.13 Search stopped by max_proofs option.
% 1.94/2.13
% 1.94/2.13
% 1.94/2.13 Search stopped by max_proofs option.
% 1.94/2.13
% 1.94/2.13 ============ end of search ============
% 1.94/2.13
% 1.94/2.13 -------------- statistics -------------
% 1.94/2.13 clauses given 35
% 1.94/2.13 clauses generated 346
% 1.94/2.13 clauses kept 222
% 1.94/2.13 clauses forward subsumed 158
% 1.94/2.13 clauses back subsumed 2
% 1.94/2.13 Kbytes malloced 1953
% 1.94/2.13
% 1.94/2.13 ----------- times (seconds) -----------
% 1.94/2.13 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.94/2.13 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.13 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.13
% 1.94/2.13 That finishes the proof of the theorem.
% 1.94/2.13
% 1.94/2.13 Process 31484 finished Wed Jul 27 02:15:20 2022
% 1.94/2.13 Otter interrupted
% 1.94/2.14 PROOF FOUND
%------------------------------------------------------------------------------