TSTP Solution File: CAT005-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT005-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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.67s 1.88s
% Output : Refutation 1.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 11 RR)
% Number of literals : 16 ( 6 equ; 6 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-3.p',unknown),
[] ).
cnf(6,axiom,
( ~ there_exists(compose(A,B))
| there_exists(domain(A)) ),
file('CAT005-3.p',unknown),
[] ).
cnf(7,axiom,
( ~ there_exists(compose(A,B))
| domain(A) = codomain(B) ),
file('CAT005-3.p',unknown),
[] ).
cnf(13,axiom,
( ~ there_exists(compose(A,d))
| compose(A,d) = A ),
file('CAT005-3.p',unknown),
[] ).
cnf(15,axiom,
domain(a) != d,
file('CAT005-3.p',unknown),
[] ).
cnf(24,axiom,
compose(codomain(A),A) = A,
file('CAT005-3.p',unknown),
[] ).
cnf(28,axiom,
there_exists(compose(a,d)),
file('CAT005-3.p',unknown),
[] ).
cnf(33,plain,
domain(a) = codomain(d),
inference(hyper,[status(thm)],[28,7]),
[iquote('hyper,28,7')] ).
cnf(34,plain,
there_exists(codomain(d)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[28,6]),33]),
[iquote('hyper,28,6,demod,33')] ).
cnf(37,plain,
codomain(d) != d,
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[15]),33]),
[iquote('back_demod,15,demod,33')] ).
cnf(43,plain,
there_exists(d),
inference(hyper,[status(thm)],[34,5]),
[iquote('hyper,34,5')] ).
cnf(113,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[24,13]),24]),37,43]),
[iquote('para_into,23.1.1,13.2.1,demod,24,unit_del,37,43')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : CAT005-3 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 02:02:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.67/1.88 ----- Otter 3.3f, August 2004 -----
% 1.67/1.88 The process was started by sandbox on n012.cluster.edu,
% 1.67/1.88 Wed Jul 27 02:02:35 2022
% 1.67/1.88 The command was "./otter". The process ID is 23069.
% 1.67/1.88
% 1.67/1.88 set(prolog_style_variables).
% 1.67/1.88 set(auto).
% 1.67/1.88 dependent: set(auto1).
% 1.67/1.88 dependent: set(process_input).
% 1.67/1.88 dependent: clear(print_kept).
% 1.67/1.88 dependent: clear(print_new_demod).
% 1.67/1.88 dependent: clear(print_back_demod).
% 1.67/1.88 dependent: clear(print_back_sub).
% 1.67/1.88 dependent: set(control_memory).
% 1.67/1.88 dependent: assign(max_mem, 12000).
% 1.67/1.88 dependent: assign(pick_given_ratio, 4).
% 1.67/1.88 dependent: assign(stats_level, 1).
% 1.67/1.88 dependent: assign(max_seconds, 10800).
% 1.67/1.88 clear(print_given).
% 1.67/1.88
% 1.67/1.88 list(usable).
% 1.67/1.88 0 [] A=A.
% 1.67/1.88 0 [] -e_quivalent(X,Y)|there_exists(X).
% 1.67/1.88 0 [] -e_quivalent(X,Y)|X=Y.
% 1.67/1.88 0 [] -there_exists(X)|X!=Y|e_quivalent(X,Y).
% 1.67/1.88 0 [] -there_exists(domain(X))|there_exists(X).
% 1.67/1.88 0 [] -there_exists(codomain(X))|there_exists(X).
% 1.67/1.88 0 [] -there_exists(compose(X,Y))|there_exists(domain(X)).
% 1.67/1.88 0 [] -there_exists(compose(X,Y))|domain(X)=codomain(Y).
% 1.67/1.88 0 [] -there_exists(domain(X))|domain(X)!=codomain(Y)|there_exists(compose(X,Y)).
% 1.67/1.88 0 [] compose(X,compose(Y,Z))=compose(compose(X,Y),Z).
% 1.67/1.88 0 [] compose(X,domain(X))=X.
% 1.67/1.88 0 [] compose(codomain(X),X)=X.
% 1.67/1.88 0 [] -e_quivalent(X,Y)|there_exists(Y).
% 1.67/1.88 0 [] -there_exists(X)| -there_exists(Y)|X!=Y|e_quivalent(X,Y).
% 1.67/1.88 0 [] -there_exists(compose(X,Y))|there_exists(codomain(X)).
% 1.67/1.88 0 [] there_exists(f1(X,Y))|X=Y.
% 1.67/1.88 0 [] X=f1(X,Y)|Y=f1(X,Y)|X=Y.
% 1.67/1.88 0 [] X!=f1(X,Y)|Y!=f1(X,Y)|X=Y.
% 1.67/1.88 0 [] there_exists(compose(a,d)).
% 1.67/1.88 0 [] -there_exists(compose(X,d))|compose(X,d)=X.
% 1.67/1.88 0 [] -there_exists(compose(d,Y))|compose(d,Y)=Y.
% 1.67/1.88 0 [] domain(a)!=d.
% 1.67/1.88 end_of_list.
% 1.67/1.88
% 1.67/1.88 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.67/1.88
% 1.67/1.88 This ia a non-Horn set with equality. The strategy will be
% 1.67/1.88 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.67/1.88 deletion, with positive clauses in sos and nonpositive
% 1.67/1.88 clauses in usable.
% 1.67/1.88
% 1.67/1.88 dependent: set(knuth_bendix).
% 1.67/1.88 dependent: set(anl_eq).
% 1.67/1.88 dependent: set(para_from).
% 1.67/1.88 dependent: set(para_into).
% 1.67/1.88 dependent: clear(para_from_right).
% 1.67/1.88 dependent: clear(para_into_right).
% 1.67/1.88 dependent: set(para_from_vars).
% 1.67/1.88 dependent: set(eq_units_both_ways).
% 1.67/1.88 dependent: set(dynamic_demod_all).
% 1.67/1.88 dependent: set(dynamic_demod).
% 1.67/1.88 dependent: set(order_eq).
% 1.67/1.88 dependent: set(back_demod).
% 1.67/1.88 dependent: set(lrpo).
% 1.67/1.88 dependent: set(hyper_res).
% 1.67/1.88 dependent: set(unit_deletion).
% 1.67/1.88 dependent: set(factor).
% 1.67/1.88
% 1.67/1.88 ------------> process usable:
% 1.67/1.88 ** KEPT (pick-wt=5): 1 [] -e_quivalent(A,B)|there_exists(A).
% 1.67/1.88 ** KEPT (pick-wt=6): 2 [] -e_quivalent(A,B)|A=B.
% 1.67/1.88 ** KEPT (pick-wt=8): 3 [] -there_exists(A)|A!=B|e_quivalent(A,B).
% 1.67/1.88 ** KEPT (pick-wt=5): 4 [] -there_exists(domain(A))|there_exists(A).
% 1.67/1.88 ** KEPT (pick-wt=5): 5 [] -there_exists(codomain(A))|there_exists(A).
% 1.67/1.88 ** KEPT (pick-wt=7): 6 [] -there_exists(compose(A,B))|there_exists(domain(A)).
% 1.67/1.88 ** KEPT (pick-wt=9): 7 [] -there_exists(compose(A,B))|domain(A)=codomain(B).
% 1.67/1.88 ** KEPT (pick-wt=12): 8 [] -there_exists(domain(A))|domain(A)!=codomain(B)|there_exists(compose(A,B)).
% 1.67/1.88 ** KEPT (pick-wt=5): 9 [] -e_quivalent(A,B)|there_exists(B).
% 1.67/1.88 Following clause subsumed by 3 during input processing: 0 [] -there_exists(A)| -there_exists(B)|A!=B|e_quivalent(A,B).
% 1.67/1.88 ** KEPT (pick-wt=7): 10 [] -there_exists(compose(A,B))|there_exists(codomain(A)).
% 1.67/1.88 ** KEPT (pick-wt=13): 12 [copy,11,flip.1,flip.2] f1(A,B)!=A|f1(A,B)!=B|A=B.
% 1.67/1.88 ** KEPT (pick-wt=9): 13 [] -there_exists(compose(A,d))|compose(A,d)=A.
% 1.67/1.88 ** KEPT (pick-wt=9): 14 [] -there_exists(compose(d,A))|compose(d,A)=A.
% 1.67/1.88 ** KEPT (pick-wt=4): 15 [] domain(a)!=d.
% 1.67/1.88
% 1.67/1.88 ------------> process sos:
% 1.67/1.88 ** KEPT (pick-wt=3): 17 [] A=A.
% 1.67/1.88 ** KEPT (pick-wt=11): 19 [copy,18,flip.1] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.67/1.88 ---> New Demodulator: 20 [new_demod,19] compose(compose(A,B),C)=compose(A,compose(B,C)).
% 1.67/1.88 ** KEPT (pick-wt=6): 21 [] compose(A,domain(A))=A.
% 1.67/1.88 ---> New Demodulator: 22 [new_demod,21] compose(A,domain(A))=A.
% 1.67/1.88 ** KEPT (pick-wt=6): 23 [] compose(codomain(A),A)=A.
% 1.67/1.88 ---> New Demodulator: 24 [new_demod,23] compose(codomain(A),A)=A.
% 1.67/1.88 ** KEPT (pick-wt=7): 25 [] there_exists(f1(A,B))|A=B.
% 1.67/1.88 ** KEPT (pick-wt=13): 27 [copy,26,flip.1,flip.2] f1(A,B)=A|f1(A,B)=B|A=B.
% 1.67/1.88 ** KEPT (pick-wt=4): 28 [] there_exists(compose(a,d)).
% 1.67/1.88 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.67/1.88 17 back subsumes 16.
% 1.67/1.88 >>>> Starting back demodulation with 20.
% 1.67/1.88 >>>> Starting back demodulation with 22.
% 1.67/1.88 >>>> Starting back demodulation with 24.
% 1.67/1.88
% 1.67/1.88 ======= end of input processing =======
% 1.67/1.88
% 1.67/1.88 =========== start of search ===========
% 1.67/1.88
% 1.67/1.88 -------- PROOF --------
% 1.67/1.88
% 1.67/1.88 -----> EMPTY CLAUSE at 0.00 sec ----> 113 [para_into,23.1.1,13.2.1,demod,24,unit_del,37,43] $F.
% 1.67/1.88
% 1.67/1.88 Length of proof is 4. Level of proof is 3.
% 1.67/1.88
% 1.67/1.88 ---------------- PROOF ----------------
% 1.67/1.88 % SZS status Unsatisfiable
% 1.67/1.88 % SZS output start Refutation
% See solution above
% 1.67/1.88 ------------ end of proof -------------
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88
% 1.67/1.88 Search stopped by max_proofs option.
% 1.67/1.88
% 1.67/1.88 ============ end of search ============
% 1.67/1.88
% 1.67/1.88 -------------- statistics -------------
% 1.67/1.88 clauses given 16
% 1.67/1.88 clauses generated 158
% 1.67/1.88 clauses kept 98
% 1.67/1.88 clauses forward subsumed 81
% 1.67/1.88 clauses back subsumed 3
% 1.67/1.88 Kbytes malloced 976
% 1.67/1.88
% 1.67/1.88 ----------- times (seconds) -----------
% 1.67/1.88 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.67/1.88 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.67/1.88
% 1.67/1.88 That finishes the proof of the theorem.
% 1.67/1.88
% 1.67/1.88 Process 23069 finished Wed Jul 27 02:02:37 2022
% 1.67/1.88 Otter interrupted
% 1.67/1.88 PROOF FOUND
%------------------------------------------------------------------------------