TSTP Solution File: SYN596-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN596-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n024.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:59 EDT 2022
% Result : Unsatisfiable 1.70s 1.89s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 8 unt; 0 nHn; 8 RR)
% Number of literals : 15 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 5 con; 0-3 aty)
% Number of variables : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(7,axiom,
( p10(A,B)
| ~ p10(C,A)
| ~ p10(C,B) ),
file('SYN596-1.p',unknown),
[] ).
cnf(12,axiom,
~ p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
file('SYN596-1.p',unknown),
[] ).
cnf(14,axiom,
( p18(A,B)
| ~ p18(C,D)
| ~ p2(C,A)
| ~ p10(D,B) ),
file('SYN596-1.p',unknown),
[] ).
cnf(19,axiom,
p10(A,A),
file('SYN596-1.p',unknown),
[] ).
cnf(22,axiom,
p2(A,A),
file('SYN596-1.p',unknown),
[] ).
cnf(27,axiom,
p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
file('SYN596-1.p',unknown),
[] ).
cnf(28,axiom,
p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)),
file('SYN596-1.p',unknown),
[] ).
cnf(30,plain,
p10(f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
inference(hyper,[status(thm)],[28,7,19]),
[iquote('hyper,28,7,19')] ).
cnf(33,plain,
p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)),
inference(hyper,[status(thm)],[30,14,27,22]),
[iquote('hyper,30,14,27,22')] ).
cnf(34,plain,
$false,
inference(binary,[status(thm)],[33,12]),
[iquote('binary,33.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SYN596-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n024.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:08:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.70/1.89 ----- Otter 3.3f, August 2004 -----
% 1.70/1.89 The process was started by sandbox on n024.cluster.edu,
% 1.70/1.89 Wed Jul 27 11:08:10 2022
% 1.70/1.89 The command was "./otter". The process ID is 31483.
% 1.70/1.89
% 1.70/1.89 set(prolog_style_variables).
% 1.70/1.89 set(auto).
% 1.70/1.89 dependent: set(auto1).
% 1.70/1.89 dependent: set(process_input).
% 1.70/1.89 dependent: clear(print_kept).
% 1.70/1.89 dependent: clear(print_new_demod).
% 1.70/1.89 dependent: clear(print_back_demod).
% 1.70/1.89 dependent: clear(print_back_sub).
% 1.70/1.89 dependent: set(control_memory).
% 1.70/1.89 dependent: assign(max_mem, 12000).
% 1.70/1.89 dependent: assign(pick_given_ratio, 4).
% 1.70/1.89 dependent: assign(stats_level, 1).
% 1.70/1.89 dependent: assign(max_seconds, 10800).
% 1.70/1.89 clear(print_given).
% 1.70/1.89
% 1.70/1.89 list(usable).
% 1.70/1.89 0 [] p10(X0,X0).
% 1.70/1.89 0 [] p9(X50,X50).
% 1.70/1.89 0 [] p3(X35,X35).
% 1.70/1.89 0 [] p2(X28,X28).
% 1.70/1.89 0 [] p12(X9,X9).
% 1.70/1.89 0 [] p16(c21,c22).
% 1.70/1.89 0 [] p17(c21,f8(c20)).
% 1.70/1.89 0 [] p16(f5(f6(f7(c19))),f4(c20)).
% 1.70/1.89 0 [] p3(f8(X48),f8(X49))| -p2(X48,X49).
% 1.70/1.89 0 [] p3(f15(X38),f15(X39))| -p2(X38,X39).
% 1.70/1.89 0 [] p3(f4(X40),f4(X41))| -p2(X40,X41).
% 1.70/1.89 0 [] p3(f5(X42),f5(X43))| -p3(X42,X43).
% 1.70/1.89 0 [] p3(f6(X44),f6(X45))| -p3(X44,X45).
% 1.70/1.89 0 [] p3(f7(X46),f7(X47))| -p3(X46,X47).
% 1.70/1.89 0 [] p10(X1,X2)| -p10(X0,X1)| -p10(X0,X2).
% 1.70/1.89 0 [] p9(X51,X52)| -p9(X50,X51)| -p9(X50,X52).
% 1.70/1.89 0 [] p3(X36,X37)| -p3(X35,X36)| -p3(X35,X37).
% 1.70/1.89 0 [] p2(X29,X30)| -p2(X28,X29)| -p2(X28,X30).
% 1.70/1.89 0 [] p12(X10,X11)| -p12(X9,X10)| -p12(X9,X11).
% 1.70/1.89 0 [] p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 1.70/1.89 0 [] -p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 1.70/1.89 0 [] p16(X16,X17)| -p3(X18,X16)| -p3(X19,X17)| -p16(X18,X19).
% 1.70/1.89 0 [] p18(X24,X25)| -p18(X27,X26)| -p2(X27,X24)| -p10(X26,X25).
% 1.70/1.89 0 [] p17(X20,X21)| -p3(X22,X20)| -p3(X23,X21)| -p17(X22,X23).
% 1.70/1.89 0 [] p2(f13(X31,X32),f13(X33,X34))| -p12(X32,X34)| -p3(X31,X33).
% 1.70/1.89 0 [] p12(f14(X12,X13),f14(X14,X15))| -p3(X12,X14)| -p3(X13,X15).
% 1.70/1.89 0 [] p10(f11(X3,X4,X5),f11(X6,X7,X8))| -p2(X3,X6)| -p9(X4,X7)| -p10(X5,X8).
% 1.70/1.89 0 [] p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 1.70/1.89 end_of_list.
% 1.70/1.89
% 1.70/1.89 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.70/1.89
% 1.70/1.89 This is a Horn set without equality. The strategy will
% 1.70/1.89 be hyperresolution, with satellites in sos and nuclei
% 1.70/1.89 in usable.
% 1.70/1.89
% 1.70/1.89 dependent: set(hyper_res).
% 1.70/1.89 dependent: clear(order_hyper).
% 1.70/1.89
% 1.70/1.89 ------------> process usable:
% 1.70/1.89 ** KEPT (pick-wt=8): 1 [] p3(f8(A),f8(B))| -p2(A,B).
% 1.70/1.89 ** KEPT (pick-wt=8): 2 [] p3(f15(A),f15(B))| -p2(A,B).
% 1.70/1.89 ** KEPT (pick-wt=8): 3 [] p3(f4(A),f4(B))| -p2(A,B).
% 1.70/1.89 ** KEPT (pick-wt=8): 4 [] p3(f5(A),f5(B))| -p3(A,B).
% 1.70/1.89 ** KEPT (pick-wt=8): 5 [] p3(f6(A),f6(B))| -p3(A,B).
% 1.70/1.89 ** KEPT (pick-wt=8): 6 [] p3(f7(A),f7(B))| -p3(A,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 7 [] p10(A,B)| -p10(C,A)| -p10(C,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 8 [] p9(A,B)| -p9(C,A)| -p9(C,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 9 [] p3(A,B)| -p3(C,A)| -p3(C,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 10 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.70/1.89 ** KEPT (pick-wt=9): 11 [] p12(A,B)| -p12(C,A)| -p12(C,B).
% 1.70/1.89 ** KEPT (pick-wt=12): 12 [] -p18(c20,f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24)).
% 1.70/1.89 ** KEPT (pick-wt=12): 13 [] p16(A,B)| -p3(C,A)| -p3(D,B)| -p16(C,D).
% 1.70/1.89 ** KEPT (pick-wt=12): 14 [] p18(A,B)| -p18(C,D)| -p2(C,A)| -p10(D,B).
% 1.70/1.89 ** KEPT (pick-wt=12): 15 [] p17(A,B)| -p3(C,A)| -p3(D,B)| -p17(C,D).
% 1.70/1.89 ** KEPT (pick-wt=13): 16 [] p2(f13(A,B),f13(C,D))| -p12(B,D)| -p3(A,C).
% 1.70/1.89 ** KEPT (pick-wt=13): 17 [] p12(f14(A,B),f14(C,D))| -p3(A,C)| -p3(B,D).
% 1.70/1.89 ** KEPT (pick-wt=18): 18 [] p10(f11(A,B,C),f11(D,E,F))| -p2(A,D)| -p9(B,E)| -p10(C,F).
% 1.70/1.89
% 1.70/1.89 ------------> process sos:
% 1.70/1.89 ** KEPT (pick-wt=3): 19 [] p10(A,A).
% 1.70/1.89 ** KEPT (pick-wt=3): 20 [] p9(A,A).
% 1.70/1.89 ** KEPT (pick-wt=3): 21 [] p3(A,A).
% 1.70/1.89 ** KEPT (pick-wt=3): 22 [] p2(A,A).
% 1.70/1.89 ** KEPT (pick-wt=3): 23 [] p12(A,A).
% 1.70/1.89 ** KEPT (pick-wt=3): 24 [] p16(c21,c22).
% 1.70/1.89 ** KEPT (pick-wt=4): 25 [] p17(c21,f8(c20)).
% 1.70/1.89 ** KEPT (pick-wt=7): 26 [] p16(f5(f6(f7(c19))),f4(c20)).
% 1.70/1.89 ** KEPT (pick-wt=12): 27 [] p18(c20,f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 1.70/1.89 ** KEPT (pick-wt=21): 28 [] p10(f11(f13(f15(c20),f14(f4(c20),c22)),c23,c24),f11(f13(f15(c20),f14(f4(c20),c21)),c23,c24)).
% 1.70/1.89
% 1.70/1.89 ======= end of input processing =======
% 1.70/1.89
% 1.70/1.89 =========== start of search ===========
% 1.70/1.89
% 1.70/1.89 -------- PROOF --------
% 1.70/1.89
% 1.70/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 34 [binary,33.1,12.1] $F.
% 1.70/1.89
% 1.70/1.89 Length of proof is 2. Level of proof is 2.
% 1.70/1.89
% 1.70/1.89 ---------------- PROOF ----------------
% 1.70/1.89 % SZS status Unsatisfiable
% 1.70/1.89 % SZS output start Refutation
% See solution above
% 1.70/1.89 ------------ end of proof -------------
% 1.70/1.89
% 1.70/1.89
% 1.70/1.89 Search stopped by max_proofs option.
% 1.70/1.89
% 1.70/1.89
% 1.70/1.89 Search stopped by max_proofs option.
% 1.70/1.89
% 1.70/1.89 ============ end of search ============
% 1.70/1.89
% 1.70/1.89 -------------- statistics -------------
% 1.70/1.89 clauses given 12
% 1.70/1.89 clauses generated 36
% 1.70/1.89 clauses kept 33
% 1.70/1.89 clauses forward subsumed 31
% 1.70/1.89 clauses back subsumed 0
% 1.70/1.89 Kbytes malloced 976
% 1.70/1.89
% 1.70/1.89 ----------- times (seconds) -----------
% 1.70/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.89
% 1.70/1.89 That finishes the proof of the theorem.
% 1.70/1.89
% 1.70/1.89 Process 31483 finished Wed Jul 27 11:08:11 2022
% 1.70/1.89 Otter interrupted
% 1.70/1.89 PROOF FOUND
%------------------------------------------------------------------------------