TSTP Solution File: SYN591-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.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 13:24:58 EDT 2022
% Result : Unsatisfiable 1.99s 2.14s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 18 ( 12 unt; 2 nHn; 14 RR)
% Number of literals : 29 ( 0 equ; 11 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
~ p11(c13,f4(c17,f6(c18))),
file('SYN591-1.p',unknown),
[] ).
cnf(3,axiom,
~ p11(c13,f4(f6(c18),c17)),
file('SYN591-1.p',unknown),
[] ).
cnf(10,axiom,
( p2(A,B)
| ~ p2(C,A)
| ~ p2(C,B) ),
file('SYN591-1.p',unknown),
[] ).
cnf(12,axiom,
( p2(f6(A),f5(A))
| ~ p12(c14,f4(A,c17)) ),
file('SYN591-1.p',unknown),
[] ).
cnf(15,axiom,
( p11(A,B)
| ~ p3(C,B)
| ~ p7(D,A)
| ~ p11(D,C) ),
file('SYN591-1.p',unknown),
[] ).
cnf(16,axiom,
( p3(f4(A,B),f4(C,D))
| ~ p2(A,C)
| ~ p2(B,D) ),
file('SYN591-1.p',unknown),
[] ).
cnf(17,axiom,
( p11(c13,f4(c17,f5(A)))
| p11(c13,f4(f5(A),c17))
| ~ p12(c14,f4(A,c17)) ),
file('SYN591-1.p',unknown),
[] ).
cnf(24,axiom,
p7(A,A),
file('SYN591-1.p',unknown),
[] ).
cnf(25,axiom,
p2(A,A),
file('SYN591-1.p',unknown),
[] ).
cnf(31,axiom,
p12(c14,f4(c18,c17)),
file('SYN591-1.p',unknown),
[] ).
cnf(35,plain,
( p11(c13,f4(c17,f5(c18)))
| p11(c13,f4(f5(c18),c17)) ),
inference(hyper,[status(thm)],[31,17]),
[iquote('hyper,31,17')] ).
cnf(36,plain,
p2(f6(c18),f5(c18)),
inference(hyper,[status(thm)],[31,12]),
[iquote('hyper,31,12')] ).
cnf(40,plain,
p2(f5(c18),f6(c18)),
inference(hyper,[status(thm)],[36,10,25]),
[iquote('hyper,36,10,25')] ).
cnf(45,plain,
p3(f4(A,f5(c18)),f4(A,f6(c18))),
inference(hyper,[status(thm)],[40,16,25]),
[iquote('hyper,40,16,25')] ).
cnf(47,plain,
p3(f4(f5(c18),A),f4(f6(c18),A)),
inference(hyper,[status(thm)],[40,16,25]),
[iquote('hyper,40,16,25')] ).
cnf(98,plain,
p11(c13,f4(f5(c18),c17)),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[45,15,24,35]),2]),
[iquote('hyper,45,15,24,35,unit_del,2')] ).
cnf(99,plain,
p11(c13,f4(f6(c18),c17)),
inference(hyper,[status(thm)],[47,15,24,98]),
[iquote('hyper,47,15,24,98')] ).
cnf(100,plain,
$false,
inference(binary,[status(thm)],[99,3]),
[iquote('binary,99.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN591-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/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 11:38:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.14 ----- Otter 3.3f, August 2004 -----
% 1.99/2.14 The process was started by sandbox2 on n023.cluster.edu,
% 1.99/2.14 Wed Jul 27 11:38:33 2022
% 1.99/2.14 The command was "./otter". The process ID is 18737.
% 1.99/2.14
% 1.99/2.14 set(prolog_style_variables).
% 1.99/2.14 set(auto).
% 1.99/2.14 dependent: set(auto1).
% 1.99/2.14 dependent: set(process_input).
% 1.99/2.14 dependent: clear(print_kept).
% 1.99/2.14 dependent: clear(print_new_demod).
% 1.99/2.14 dependent: clear(print_back_demod).
% 1.99/2.14 dependent: clear(print_back_sub).
% 1.99/2.14 dependent: set(control_memory).
% 1.99/2.14 dependent: assign(max_mem, 12000).
% 1.99/2.14 dependent: assign(pick_given_ratio, 4).
% 1.99/2.14 dependent: assign(stats_level, 1).
% 1.99/2.14 dependent: assign(max_seconds, 10800).
% 1.99/2.14 clear(print_given).
% 1.99/2.14
% 1.99/2.14 list(usable).
% 1.99/2.14 0 [] p9(c14).
% 1.99/2.14 0 [] p8(c13).
% 1.99/2.14 0 [] p7(X30,X30).
% 1.99/2.14 0 [] p2(X15,X15).
% 1.99/2.14 0 [] p3(X23,X23).
% 1.99/2.14 0 [] p10(c14,X4).
% 1.99/2.14 0 [] p10(c13,c15).
% 1.99/2.14 0 [] p10(c13,c17).
% 1.99/2.14 0 [] p10(c13,c16).
% 1.99/2.14 0 [] -p2(c15,c17).
% 1.99/2.14 0 [] p12(c14,f4(c18,c17)).
% 1.99/2.14 0 [] -p11(c13,f4(c17,f6(c18))).
% 1.99/2.14 0 [] -p11(c13,f4(f6(c18),c17)).
% 1.99/2.14 0 [] p8(X33)| -p8(X34)| -p7(X34,X33).
% 1.99/2.14 0 [] p9(X35)| -p9(X36)| -p7(X36,X35).
% 1.99/2.14 0 [] p11(c14,f4(c15,X10))| -p10(c13,X10).
% 1.99/2.14 0 [] p2(f5(X18),f5(X19))| -p2(X18,X19).
% 1.99/2.14 0 [] p2(f6(X21),f6(X22))| -p2(X21,X22).
% 1.99/2.14 0 [] p7(X31,X32)| -p7(X30,X31)| -p7(X30,X32).
% 1.99/2.14 0 [] p2(X16,X17)| -p2(X15,X16)| -p2(X15,X17).
% 1.99/2.14 0 [] p3(X24,X25)| -p3(X23,X24)| -p3(X23,X25).
% 1.99/2.14 0 [] p2(f6(X20),f5(X20))| -p12(c14,f4(X20,c17)).
% 1.99/2.14 0 [] p10(X0,X1)| -p2(X3,X1)| -p7(X2,X0)| -p10(X2,X3).
% 1.99/2.14 0 [] p12(X11,X12)| -p3(X14,X12)| -p7(X13,X11)| -p12(X13,X14).
% 1.99/2.14 0 [] p11(X5,X6)| -p3(X8,X6)| -p7(X7,X5)| -p11(X7,X8).
% 1.99/2.14 0 [] p3(f4(X26,X27),f4(X28,X29))| -p2(X26,X28)| -p2(X27,X29).
% 1.99/2.14 0 [] p11(c13,f4(c17,f5(X9)))|p11(c13,f4(f5(X9),c17))| -p12(c14,f4(X9,c17)).
% 1.99/2.14 end_of_list.
% 1.99/2.14
% 1.99/2.14 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.99/2.14
% 1.99/2.14 This is a non-Horn set without equality. The strategy will
% 1.99/2.14 be ordered hyper_res, unit deletion, and factoring, with
% 1.99/2.14 satellites in sos and with nuclei in usable.
% 1.99/2.14
% 1.99/2.14 dependent: set(hyper_res).
% 1.99/2.14 dependent: set(factor).
% 1.99/2.14 dependent: set(unit_deletion).
% 1.99/2.14
% 1.99/2.14 ------------> process usable:
% 1.99/2.14 ** KEPT (pick-wt=3): 1 [] -p2(c15,c17).
% 1.99/2.14 ** KEPT (pick-wt=6): 2 [] -p11(c13,f4(c17,f6(c18))).
% 1.99/2.14 ** KEPT (pick-wt=6): 3 [] -p11(c13,f4(f6(c18),c17)).
% 1.99/2.14 ** KEPT (pick-wt=7): 4 [] p8(A)| -p8(B)| -p7(B,A).
% 1.99/2.14 ** KEPT (pick-wt=7): 5 [] p9(A)| -p9(B)| -p7(B,A).
% 1.99/2.14 ** KEPT (pick-wt=8): 6 [] p11(c14,f4(c15,A))| -p10(c13,A).
% 1.99/2.14 ** KEPT (pick-wt=8): 7 [] p2(f5(A),f5(B))| -p2(A,B).
% 1.99/2.14 ** KEPT (pick-wt=8): 8 [] p2(f6(A),f6(B))| -p2(A,B).
% 1.99/2.14 ** KEPT (pick-wt=9): 9 [] p7(A,B)| -p7(C,A)| -p7(C,B).
% 1.99/2.14 ** KEPT (pick-wt=9): 10 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.99/2.14 ** KEPT (pick-wt=9): 11 [] p3(A,B)| -p3(C,A)| -p3(C,B).
% 1.99/2.14 ** KEPT (pick-wt=10): 12 [] p2(f6(A),f5(A))| -p12(c14,f4(A,c17)).
% 1.99/2.14 ** KEPT (pick-wt=12): 13 [] p10(A,B)| -p2(C,B)| -p7(D,A)| -p10(D,C).
% 1.99/2.14 ** KEPT (pick-wt=12): 14 [] p12(A,B)| -p3(C,B)| -p7(D,A)| -p12(D,C).
% 1.99/2.14 ** KEPT (pick-wt=12): 15 [] p11(A,B)| -p3(C,B)| -p7(D,A)| -p11(D,C).
% 1.99/2.14 ** KEPT (pick-wt=13): 16 [] p3(f4(A,B),f4(C,D))| -p2(A,C)| -p2(B,D).
% 1.99/2.14 ** KEPT (pick-wt=17): 17 [] p11(c13,f4(c17,f5(A)))|p11(c13,f4(f5(A),c17))| -p12(c14,f4(A,c17)).
% 1.99/2.14
% 1.99/2.14 ------------> process sos:
% 1.99/2.14 ** KEPT (pick-wt=2): 22 [] p9(c14).
% 1.99/2.14 ** KEPT (pick-wt=2): 23 [] p8(c13).
% 1.99/2.14 ** KEPT (pick-wt=3): 24 [] p7(A,A).
% 1.99/2.14 ** KEPT (pick-wt=3): 25 [] p2(A,A).
% 1.99/2.14 ** KEPT (pick-wt=3): 26 [] p3(A,A).
% 1.99/2.14 ** KEPT (pick-wt=3): 27 [] p10(c14,A).
% 1.99/2.14 ** KEPT (pick-wt=3): 28 [] p10(c13,c15).
% 1.99/2.14 ** KEPT (pick-wt=3): 29 [] p10(c13,c17).
% 1.99/2.14 ** KEPT (pick-wt=3): 30 [] p10(c13,c16).
% 1.99/2.14 ** KEPT (pick-wt=5): 31 [] p12(c14,f4(c18,c17)).
% 1.99/2.14 24 back subsumes 18.
% 1.99/2.14 25 back subsumes 19.
% 1.99/2.14 26 back subsumes 20.
% 1.99/2.14
% 1.99/2.14 ======= end of input processing =======
% 1.99/2.14
% 1.99/2.14 =========== start of search ===========
% 1.99/2.14
% 1.99/2.14 -------- PROOF --------
% 1.99/2.14
% 1.99/2.14 ----> UNIT CONFLICT at 0.00 sec ----> 100 [binary,99.1,3.1] $F.
% 1.99/2.14
% 1.99/2.14 Length of proof is 7. Level of proof is 5.
% 1.99/2.14
% 1.99/2.14 ---------------- PROOF ----------------
% 1.99/2.14 % SZS status Unsatisfiable
% 1.99/2.14 % SZS output start Refutation
% See solution above
% 1.99/2.14 ------------ end of proof -------------
% 1.99/2.14
% 1.99/2.14
% 1.99/2.14 Search stopped by max_proofs option.
% 1.99/2.14
% 1.99/2.14
% 1.99/2.14 Search stopped by max_proofs option.
% 1.99/2.14
% 1.99/2.14 ============ end of search ============
% 1.99/2.14
% 1.99/2.14 -------------- statistics -------------
% 1.99/2.14 clauses given 27
% 1.99/2.14 clauses generated 167
% 1.99/2.14 clauses kept 99
% 1.99/2.14 clauses forward subsumed 95
% 1.99/2.14 clauses back subsumed 4
% 1.99/2.14 Kbytes malloced 976
% 1.99/2.14
% 1.99/2.14 ----------- times (seconds) -----------
% 1.99/2.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.14 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.99/2.14
% 1.99/2.14 That finishes the proof of the theorem.
% 1.99/2.14
% 1.99/2.14 Process 18737 finished Wed Jul 27 11:38:35 2022
% 1.99/2.14 Otter interrupted
% 1.99/2.14 PROOF FOUND
%------------------------------------------------------------------------------