TSTP Solution File: SYN014-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n017.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 13:23:19 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ e_qualish(A,B)
| e_qualish(B,A) ),
file('SYN014-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ e_qualish(A,B)
| ~ e_qualish(B,C)
| e_qualish(A,C) ),
file('SYN014-2.p',unknown),
[] ).
cnf(19,axiom,
~ e_qualish(m,n),
file('SYN014-2.p',unknown),
[] ).
cnf(30,axiom,
e_qualish(n,k),
file('SYN014-2.p',unknown),
[] ).
cnf(31,axiom,
e_qualish(m,k),
file('SYN014-2.p',unknown),
[] ).
cnf(34,plain,
e_qualish(k,n),
inference(hyper,[status(thm)],[30,1]),
[iquote('hyper,30,1')] ).
cnf(42,plain,
e_qualish(m,n),
inference(hyper,[status(thm)],[34,2,31]),
[iquote('hyper,34,2,31')] ).
cnf(43,plain,
$false,
inference(binary,[status(thm)],[42,19]),
[iquote('binary,42.1,19.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN014-2 : TPTP v8.1.0. Released v1.0.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n017.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 10:37:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n017.cluster.edu,
% 1.69/1.90 Wed Jul 27 10:37:33 2022
% 1.69/1.90 The command was "./otter". The process ID is 16801.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] e_qualish(X,X).
% 1.69/1.90 0 [] -e_qualish(X,Y)|e_qualish(Y,X).
% 1.69/1.90 0 [] -e_qualish(X,Y)| -e_qualish(Y,Z)|e_qualish(X,Z).
% 1.69/1.90 0 [] -e_qualish(A,B)| -element(C,A)|element(C,B).
% 1.69/1.90 0 [] -element(A,B)| -e_qualish(A,C)|element(C,B).
% 1.69/1.90 0 [] -element(A,a)|e_qualish(A,k)|e_qualish(A,a).
% 1.69/1.90 0 [] -e_qualish(A,k)|element(A,a)|e_qualish(A,a).
% 1.69/1.90 0 [] -e_qualish(f(A),m)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 0 [] -e_qualish(f(A),A)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 0 [] element(A,f(A))| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 0 [] element(f(A),A)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 0 [] -element(A,B)| -element(B,A)|e_qualish(A,B)|e_qualish(A,m)|element(B,m)|e_qualish(B,m).
% 1.69/1.90 0 [] -e_qualish(g(A),n)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 0 [] -e_qualish(g(A),A)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 0 [] element(A,g(A))|element(A,n)|e_qualish(A,n).
% 1.69/1.90 0 [] element(g(A),A)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 0 [] -element(A,B)| -element(B,A)|e_qualish(A,B)|e_qualish(A,n)| -element(B,n)|e_qualish(B,n).
% 1.69/1.90 0 [] -e_qualish(A,m)|element(A,k)|e_qualish(A,k).
% 1.69/1.90 0 [] -e_qualish(A,n)|element(A,k)|e_qualish(A,k).
% 1.69/1.90 0 [] -element(A,k)|e_qualish(A,n)|e_qualish(A,m)|e_qualish(A,k).
% 1.69/1.90 0 [] -e_qualish(n,a).
% 1.69/1.90 0 [] -e_qualish(m,n).
% 1.69/1.90 0 [] e_qualish(n,k).
% 1.69/1.90 0 [] -e_qualish(m,a).
% 1.69/1.90 0 [] -e_qualish(k,a).
% 1.69/1.90 0 [] e_qualish(m,k).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.69/1.90
% 1.69/1.90 This is a non-Horn set without equality. The strategy will
% 1.69/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.69/1.90 satellites in sos and with nuclei in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: set(factor).
% 1.69/1.90 dependent: set(unit_deletion).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=6): 1 [] -e_qualish(A,B)|e_qualish(B,A).
% 1.69/1.90 ** KEPT (pick-wt=9): 2 [] -e_qualish(A,B)| -e_qualish(B,C)|e_qualish(A,C).
% 1.69/1.90 ** KEPT (pick-wt=9): 3 [] -e_qualish(A,B)| -element(C,A)|element(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 4 [] -element(A,B)| -e_qualish(A,C)|element(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 5 [] -element(A,a)|e_qualish(A,k)|e_qualish(A,a).
% 1.69/1.90 ** KEPT (pick-wt=9): 6 [] -e_qualish(A,k)|element(A,a)|e_qualish(A,a).
% 1.69/1.90 ** KEPT (pick-wt=10): 7 [] -e_qualish(f(A),m)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 ** KEPT (pick-wt=10): 8 [] -e_qualish(f(A),A)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 ** KEPT (pick-wt=10): 9 [] element(A,f(A))| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 ** KEPT (pick-wt=10): 10 [] element(f(A),A)| -element(A,m)|e_qualish(A,m).
% 1.69/1.90 ** KEPT (pick-wt=18): 11 [] -element(A,B)| -element(B,A)|e_qualish(A,B)|e_qualish(A,m)|element(B,m)|e_qualish(B,m).
% 1.69/1.90 ** KEPT (pick-wt=10): 12 [] -e_qualish(g(A),n)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 ** KEPT (pick-wt=10): 13 [] -e_qualish(g(A),A)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 ** KEPT (pick-wt=18): 14 [] -element(A,B)| -element(B,A)|e_qualish(A,B)|e_qualish(A,n)| -element(B,n)|e_qualish(B,n).
% 1.69/1.90 ** KEPT (pick-wt=9): 15 [] -e_qualish(A,m)|element(A,k)|e_qualish(A,k).
% 1.69/1.90 ** KEPT (pick-wt=9): 16 [] -e_qualish(A,n)|element(A,k)|e_qualish(A,k).
% 1.69/1.90 ** KEPT (pick-wt=12): 17 [] -element(A,k)|e_qualish(A,n)|e_qualish(A,m)|e_qualish(A,k).
% 1.69/1.90 ** KEPT (pick-wt=3): 18 [] -e_qualish(n,a).
% 1.69/1.90 ** KEPT (pick-wt=3): 19 [] -e_qualish(m,n).
% 1.69/1.90 ** KEPT (pick-wt=3): 20 [] -e_qualish(m,a).
% 1.69/1.90 ** KEPT (pick-wt=3): 21 [] -e_qualish(k,a).
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=3): 27 [] e_qualish(A,A).
% 1.69/1.90 ** KEPT (pick-wt=10): 28 [] element(A,g(A))|element(A,n)|e_qualish(A,n).
% 1.69/1.90 ** KEPT (pick-wt=10): 29 [] element(g(A),A)|element(A,n)|e_qualish(A,n).
% 1.69/1.90 ** KEPT (pick-wt=3): 30 [] e_qualish(n,k).
% 1.69/1.90 ** KEPT (pick-wt=3): 31 [] e_qualish(m,k).
% 1.69/1.90 27 back subsumes 26.
% 1.69/1.90 27 back subsumes 25.
% 1.69/1.90 27 back subsumes 24.
% 1.69/1.90 27 back subsumes 23.
% 1.69/1.90 27 back subsumes 22.
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 43 [binary,42.1,19.1] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 2. Level of proof is 2.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Unsatisfiable
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 7
% 1.69/1.90 clauses generated 76
% 1.69/1.90 clauses kept 42
% 1.69/1.90 clauses forward subsumed 55
% 1.69/1.90 clauses back subsumed 5
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 16801 finished Wed Jul 27 10:37:34 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------