TSTP Solution File: SYN580-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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:24:57 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of clauses : 18 ( 11 unt; 3 nHn; 12 RR)
% Number of literals : 32 ( 0 equ; 12 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 20 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p8(c12,c13,c14),
file('SYN580-1.p',unknown),
[] ).
cnf(8,axiom,
( p2(A,B)
| ~ p2(C,A)
| ~ p2(C,B) ),
file('SYN580-1.p',unknown),
[] ).
cnf(9,axiom,
( p8(c12,A,B)
| ~ p11(B,c16)
| ~ p9(c12,A) ),
file('SYN580-1.p',unknown),
[] ).
cnf(11,axiom,
( p9(c12,f6(A))
| p8(c12,B,f3(A))
| ~ p9(c12,B) ),
file('SYN580-1.p',unknown),
[] ).
cnf(15,axiom,
( p8(c12,A,f3(B))
| ~ p9(c12,A)
| ~ p8(c12,f6(B),B) ),
file('SYN580-1.p',unknown),
[] ).
cnf(16,axiom,
( p8(A,B,C)
| ~ p2(D,C)
| ~ p4(E,B)
| ~ p7(F,A)
| ~ p8(F,E,D) ),
file('SYN580-1.p',unknown),
[] ).
cnf(22,axiom,
p7(A,A),
file('SYN580-1.p',unknown),
[] ).
cnf(23,axiom,
p4(A,A),
file('SYN580-1.p',unknown),
[] ).
cnf(24,axiom,
p2(A,A),
file('SYN580-1.p',unknown),
[] ).
cnf(25,axiom,
p11(c15,c16),
file('SYN580-1.p',unknown),
[] ).
cnf(26,axiom,
p9(c12,c13),
file('SYN580-1.p',unknown),
[] ).
cnf(27,axiom,
p2(c14,f3(c15)),
file('SYN580-1.p',unknown),
[] ).
cnf(28,plain,
( p9(c12,f6(A))
| p8(c12,c13,f3(A)) ),
inference(hyper,[status(thm)],[26,11]),
[iquote('hyper,26,11')] ).
cnf(31,plain,
p2(f3(c15),c14),
inference(hyper,[status(thm)],[27,8,24]),
[iquote('hyper,27,8,24')] ).
cnf(40,plain,
( p8(c12,c13,f3(A))
| p8(c12,f6(A),c15) ),
inference(hyper,[status(thm)],[28,9,25]),
[iquote('hyper,28,9,25')] ).
cnf(98,plain,
p8(c12,c13,f3(c15)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[40,15,26])]),
[iquote('hyper,40,15,26,factor_simp')] ).
cnf(105,plain,
p8(c12,c13,c14),
inference(hyper,[status(thm)],[98,16,31,23,22]),
[iquote('hyper,98,16,31,23,22')] ).
cnf(106,plain,
$false,
inference(binary,[status(thm)],[105,1]),
[iquote('binary,105.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN580-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 11:37:06 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox on n027.cluster.edu,
% 1.69/1.90 Wed Jul 27 11:37:07 2022
% 1.69/1.90 The command was "./otter". The process ID is 9713.
% 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 [] p10(X0,X0).
% 1.69/1.90 0 [] p7(X19,X19).
% 1.69/1.90 0 [] p4(X12,X12).
% 1.69/1.90 0 [] p2(X7,X7).
% 1.69/1.90 0 [] p11(c15,c16).
% 1.69/1.90 0 [] p9(c12,c13).
% 1.69/1.90 0 [] p2(c14,f3(c15)).
% 1.69/1.90 0 [] -p8(c12,c13,c14).
% 1.69/1.90 0 [] p4(f6(X17),f6(X18))| -p2(X17,X18).
% 1.69/1.90 0 [] p2(f3(X10),f3(X11))| -p2(X10,X11).
% 1.69/1.90 0 [] p4(f5(X15),f5(X16))| -p2(X15,X16).
% 1.69/1.90 0 [] p10(X1,X2)| -p10(X0,X1)| -p10(X0,X2).
% 1.69/1.90 0 [] p7(X20,X21)| -p7(X19,X20)| -p7(X19,X21).
% 1.69/1.90 0 [] p4(X13,X14)| -p4(X12,X13)| -p4(X12,X14).
% 1.69/1.90 0 [] p2(X8,X9)| -p2(X7,X8)| -p2(X7,X9).
% 1.69/1.90 0 [] p8(c12,X28,X29)| -p11(X29,c16)| -p9(c12,X28).
% 1.69/1.90 0 [] p9(c12,f5(X31))|p8(c12,X30,X31)| -p9(c12,X30).
% 1.69/1.90 0 [] p9(c12,f6(X31))|p8(c12,X30,f3(X31))| -p9(c12,X30).
% 1.69/1.90 0 [] p9(X32,X33)| -p7(X35,X32)| -p9(X35,X34)| -p4(X34,X33).
% 1.69/1.90 0 [] p11(X3,X4)| -p11(X6,X5)| -p2(X6,X3)| -p10(X5,X4).
% 1.69/1.90 0 [] p8(c12,X30,X31)| -p9(c12,X30)| -p8(c12,f5(X31),f3(X31)).
% 1.69/1.90 0 [] p8(c12,X30,f3(X31))| -p9(c12,X30)| -p8(c12,f6(X31),X31).
% 1.69/1.90 0 [] p8(X22,X23,X24)| -p2(X25,X24)| -p4(X26,X23)| -p7(X27,X22)| -p8(X27,X26,X25).
% 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=5.
% 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=4): 1 [] -p8(c12,c13,c14).
% 1.69/1.90 ** KEPT (pick-wt=8): 2 [] p4(f6(A),f6(B))| -p2(A,B).
% 1.69/1.90 ** KEPT (pick-wt=8): 3 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.69/1.90 ** KEPT (pick-wt=8): 4 [] p4(f5(A),f5(B))| -p2(A,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 5 [] p10(A,B)| -p10(C,A)| -p10(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 6 [] p7(A,B)| -p7(C,A)| -p7(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 7 [] p4(A,B)| -p4(C,A)| -p4(C,B).
% 1.69/1.90 ** KEPT (pick-wt=9): 8 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.69/1.90 ** KEPT (pick-wt=10): 9 [] p8(c12,A,B)| -p11(B,c16)| -p9(c12,A).
% 1.69/1.90 ** KEPT (pick-wt=11): 10 [] p9(c12,f5(A))|p8(c12,B,A)| -p9(c12,B).
% 1.69/1.90 ** KEPT (pick-wt=12): 11 [] p9(c12,f6(A))|p8(c12,B,f3(A))| -p9(c12,B).
% 1.69/1.90 ** KEPT (pick-wt=12): 12 [] p9(A,B)| -p7(C,A)| -p9(C,D)| -p4(D,B).
% 1.69/1.90 ** KEPT (pick-wt=12): 13 [] p11(A,B)| -p11(C,D)| -p2(C,A)| -p10(D,B).
% 1.69/1.90 ** KEPT (pick-wt=13): 14 [] p8(c12,A,B)| -p9(c12,A)| -p8(c12,f5(B),f3(B)).
% 1.69/1.90 ** KEPT (pick-wt=13): 15 [] p8(c12,A,f3(B))| -p9(c12,A)| -p8(c12,f6(B),B).
% 1.69/1.90 ** KEPT (pick-wt=17): 16 [] p8(A,B,C)| -p2(D,C)| -p4(E,B)| -p7(F,A)| -p8(F,E,D).
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=3): 21 [] p10(A,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 22 [] p7(A,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 23 [] p4(A,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 24 [] p2(A,A).
% 1.69/1.90 ** KEPT (pick-wt=3): 25 [] p11(c15,c16).
% 1.69/1.90 ** KEPT (pick-wt=3): 26 [] p9(c12,c13).
% 1.69/1.90 ** KEPT (pick-wt=4): 27 [] p2(c14,f3(c15)).
% 1.69/1.90 21 back subsumes 17.
% 1.69/1.90 22 back subsumes 18.
% 1.69/1.90 23 back subsumes 19.
% 1.69/1.90 24 back subsumes 20.
% 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 ----> 106 [binary,105.1,1.1] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 5. Level of proof is 4.
% 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 33
% 1.69/1.90 clauses generated 189
% 1.69/1.90 clauses kept 105
% 1.69/1.90 clauses forward subsumed 107
% 1.69/1.90 clauses back subsumed 11
% 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 9713 finished Wed Jul 27 11:37:08 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------