TSTP Solution File: CAT007-3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CAT007-3 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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.62s 1.81s
% Output : Refutation 1.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( ~ there_exists(domain(A))
| ~ e_qualish(domain(A),codomain(B))
| there_exists(compose(A,B)) ),
file('CAT007-3.p',unknown),
[] ).
cnf(6,axiom,
~ there_exists(compose(c2,c1)),
file('CAT007-3.p',unknown),
[] ).
cnf(11,axiom,
there_exists(domain(c2)),
file('CAT007-3.p',unknown),
[] ).
cnf(13,axiom,
e_qualish(domain(c2),codomain(c1)),
file('CAT007-3.p',unknown),
[] ).
cnf(16,plain,
there_exists(compose(c2,c1)),
inference(hyper,[status(thm)],[13,4,11]),
[iquote('hyper,13,4,11')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[16,6]),
[iquote('binary,16.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : CAT007-3 : TPTP v8.1.0. Released v1.0.0.
% 0.13/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 01:56:09 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.62/1.81 ----- Otter 3.3f, August 2004 -----
% 1.62/1.81 The process was started by sandbox2 on n014.cluster.edu,
% 1.62/1.81 Wed Jul 27 01:56:09 2022
% 1.62/1.81 The command was "./otter". The process ID is 3830.
% 1.62/1.81
% 1.62/1.81 set(prolog_style_variables).
% 1.62/1.81 set(auto).
% 1.62/1.81 dependent: set(auto1).
% 1.62/1.81 dependent: set(process_input).
% 1.62/1.81 dependent: clear(print_kept).
% 1.62/1.81 dependent: clear(print_new_demod).
% 1.62/1.81 dependent: clear(print_back_demod).
% 1.62/1.81 dependent: clear(print_back_sub).
% 1.62/1.81 dependent: set(control_memory).
% 1.62/1.81 dependent: assign(max_mem, 12000).
% 1.62/1.81 dependent: assign(pick_given_ratio, 4).
% 1.62/1.81 dependent: assign(stats_level, 1).
% 1.62/1.81 dependent: assign(max_seconds, 10800).
% 1.62/1.81 clear(print_given).
% 1.62/1.81
% 1.62/1.81 list(usable).
% 1.62/1.81 0 [] e_qualish(X,X).
% 1.62/1.81 0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.62/1.81 0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.62/1.81 0 [] -there_exists(domain(X))|there_exists(X).
% 1.62/1.81 0 [] -there_exists(domain(X))| -e_qualish(domain(X),codomain(Y))|there_exists(compose(X,Y)).
% 1.62/1.81 0 [] there_exists(f1(X,Y))|e_qualish(X,Y).
% 1.62/1.81 0 [] e_qualish(X,f1(X,Y))|e_qualish(Y,f1(X,Y))|e_qualish(X,Y).
% 1.62/1.81 0 [] -e_qualish(X,f1(X,Y))| -e_qualish(Y,f1(X,Y))|e_qualish(X,Y).
% 1.62/1.81 0 [] there_exists(domain(c2)).
% 1.62/1.81 0 [] there_exists(domain(c1)).
% 1.62/1.81 0 [] e_qualish(domain(c2),codomain(c1)).
% 1.62/1.81 0 [] -there_exists(compose(c2,c1)).
% 1.62/1.81 end_of_list.
% 1.62/1.81
% 1.62/1.81 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.62/1.81
% 1.62/1.81 This is a non-Horn set without equality. The strategy will
% 1.62/1.81 be ordered hyper_res, unit deletion, and factoring, with
% 1.62/1.81 satellites in sos and with nuclei in usable.
% 1.62/1.81
% 1.62/1.81 dependent: set(hyper_res).
% 1.62/1.81 dependent: set(factor).
% 1.62/1.81 dependent: set(unit_deletion).
% 1.62/1.81
% 1.62/1.81 ------------> process usable:
% 1.62/1.81 ** KEPT (pick-wt=6): 1 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.62/1.81 ** KEPT (pick-wt=9): 2 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.62/1.81 ** KEPT (pick-wt=5): 3 [] -there_exists(domain(A))|there_exists(A).
% 1.62/1.81 ** KEPT (pick-wt=12): 4 [] -there_exists(domain(A))| -e_qualish(domain(A),codomain(B))|there_exists(compose(A,B)).
% 1.62/1.81 ** KEPT (pick-wt=13): 5 [] -e_qualish(A,f1(A,B))| -e_qualish(B,f1(A,B))|e_qualish(A,B).
% 1.62/1.81 ** KEPT (pick-wt=4): 6 [] -there_exists(compose(c2,c1)).
% 1.62/1.81
% 1.62/1.81 ------------> process sos:
% 1.62/1.81 ** KEPT (pick-wt=3): 8 [] e_qualish(A,A).
% 1.62/1.81 ** KEPT (pick-wt=7): 9 [] there_exists(f1(A,B))|e_qualish(A,B).
% 1.62/1.81 ** KEPT (pick-wt=13): 10 [] e_qualish(A,f1(A,B))|e_qualish(B,f1(A,B))|e_qualish(A,B).
% 1.62/1.81 ** KEPT (pick-wt=3): 11 [] there_exists(domain(c2)).
% 1.62/1.81 ** KEPT (pick-wt=3): 12 [] there_exists(domain(c1)).
% 1.62/1.81 ** KEPT (pick-wt=5): 13 [] e_qualish(domain(c2),codomain(c1)).
% 1.62/1.81 8 back subsumes 7.
% 1.62/1.81
% 1.62/1.81 ======= end of input processing =======
% 1.62/1.81
% 1.62/1.81 =========== start of search ===========
% 1.62/1.81
% 1.62/1.81 -------- PROOF --------
% 1.62/1.81
% 1.62/1.81 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,16.1,6.1] $F.
% 1.62/1.81
% 1.62/1.81 Length of proof is 1. Level of proof is 1.
% 1.62/1.81
% 1.62/1.81 ---------------- PROOF ----------------
% 1.62/1.81 % SZS status Unsatisfiable
% 1.62/1.81 % SZS output start Refutation
% See solution above
% 1.62/1.81 ------------ end of proof -------------
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81
% 1.62/1.81 Search stopped by max_proofs option.
% 1.62/1.81
% 1.62/1.81 ============ end of search ============
% 1.62/1.81
% 1.62/1.81 -------------- statistics -------------
% 1.62/1.81 clauses given 7
% 1.62/1.81 clauses generated 9
% 1.62/1.81 clauses kept 16
% 1.62/1.81 clauses forward subsumed 4
% 1.62/1.81 clauses back subsumed 1
% 1.62/1.81 Kbytes malloced 976
% 1.62/1.81
% 1.62/1.81 ----------- times (seconds) -----------
% 1.62/1.81 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.81 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.62/1.81 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.62/1.81
% 1.62/1.81 That finishes the proof of the theorem.
% 1.62/1.81
% 1.62/1.81 Process 3830 finished Wed Jul 27 01:56:11 2022
% 1.62/1.81 Otter interrupted
% 1.62/1.81 PROOF FOUND
%------------------------------------------------------------------------------