TSTP Solution File: SYN585-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN585-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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.99s 2.23s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 8 unt; 2 nHn; 5 RR)
% Number of literals : 18 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
~ p2(c12,f3(c13)),
file('SYN585-1.p',unknown),
[] ).
cnf(4,axiom,
~ p11(c18,f9(c12,f8(c16,c14))),
file('SYN585-1.p',unknown),
[] ).
cnf(5,axiom,
( p11(A,f8(B,C))
| ~ p11(A,C) ),
file('SYN585-1.p',unknown),
[] ).
cnf(8,axiom,
( p11(A,B)
| ~ p11(A,C)
| ~ p11(C,B) ),
file('SYN585-1.p',unknown),
[] ).
cnf(18,axiom,
( p2(A,f3(c13))
| p11(f9(A,B),f9(A,C))
| ~ p11(B,C) ),
file('SYN585-1.p',unknown),
[] ).
cnf(28,axiom,
p11(A,A),
file('SYN585-1.p',unknown),
[] ).
cnf(31,axiom,
p11(c18,f9(c12,c14)),
file('SYN585-1.p',unknown),
[] ).
cnf(35,plain,
p11(A,f8(B,A)),
inference(hyper,[status(thm)],[28,5]),
[iquote('hyper,28,5')] ).
cnf(88,plain,
( p2(A,f3(c13))
| p11(f9(A,B),f9(A,f8(C,B))) ),
inference(hyper,[status(thm)],[35,18]),
[iquote('hyper,35,18')] ).
cnf(2351,plain,
p11(f9(c12,A),f9(c12,f8(B,A))),
inference(hyper,[status(thm)],[88,2]),
[iquote('hyper,88,2')] ).
cnf(2412,plain,
p11(c18,f9(c12,f8(A,c14))),
inference(hyper,[status(thm)],[2351,8,31]),
[iquote('hyper,2351,8,31')] ).
cnf(2413,plain,
$false,
inference(binary,[status(thm)],[2412,4]),
[iquote('binary,2412.1,4.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN585-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n005.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:05:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.23 ----- Otter 3.3f, August 2004 -----
% 1.99/2.23 The process was started by sandbox2 on n005.cluster.edu,
% 1.99/2.23 Wed Jul 27 11:05:20 2022
% 1.99/2.23 The command was "./otter". The process ID is 17660.
% 1.99/2.23
% 1.99/2.23 set(prolog_style_variables).
% 1.99/2.23 set(auto).
% 1.99/2.23 dependent: set(auto1).
% 1.99/2.23 dependent: set(process_input).
% 1.99/2.23 dependent: clear(print_kept).
% 1.99/2.23 dependent: clear(print_new_demod).
% 1.99/2.23 dependent: clear(print_back_demod).
% 1.99/2.23 dependent: clear(print_back_sub).
% 1.99/2.23 dependent: set(control_memory).
% 1.99/2.23 dependent: assign(max_mem, 12000).
% 1.99/2.23 dependent: assign(pick_given_ratio, 4).
% 1.99/2.23 dependent: assign(stats_level, 1).
% 1.99/2.23 dependent: assign(max_seconds, 10800).
% 1.99/2.23 clear(print_given).
% 1.99/2.23
% 1.99/2.23 list(usable).
% 1.99/2.23 0 [] p2(X18,X18).
% 1.99/2.23 0 [] p11(X8,X8).
% 1.99/2.23 0 [] p10(c14,c15).
% 1.99/2.23 0 [] p10(c17,c14).
% 1.99/2.23 0 [] -p2(c14,f3(c13)).
% 1.99/2.23 0 [] -p2(c12,f3(c13)).
% 1.99/2.23 0 [] p11(c18,f9(c12,c14)).
% 1.99/2.23 0 [] p2(f6(c15,c14),c17).
% 1.99/2.23 0 [] p2(f5(c15,c14),c16).
% 1.99/2.23 0 [] -p2(c12,f3(f4(c13))).
% 1.99/2.23 0 [] p2(f7(f8(c16,c14),c17),c15).
% 1.99/2.23 0 [] -p11(c18,f9(c12,f8(c16,c14))).
% 1.99/2.23 0 [] p11(X9,f8(X10,X11))| -p11(X9,X11).
% 1.99/2.23 0 [] p2(f4(X23),f4(X24))| -p2(X23,X24).
% 1.99/2.23 0 [] p2(f3(X21),f3(X22))| -p2(X21,X22).
% 1.99/2.23 0 [] p11(X12,X13)| -p11(X12,X14)| -p11(X14,X13).
% 1.99/2.23 0 [] p2(X19,X20)| -p2(X18,X19)| -p2(X18,X20).
% 1.99/2.23 0 [] p10(X0,X1)| -p2(X2,X0)| -p2(X3,X1)| -p10(X2,X3).
% 1.99/2.23 0 [] p11(X4,X5)| -p2(X6,X4)| -p2(X7,X5)| -p11(X6,X7).
% 1.99/2.23 0 [] p2(f9(X41,X42),f9(X43,X44))| -p2(X41,X43)| -p2(X42,X44).
% 1.99/2.23 0 [] p2(f5(X25,X26),f5(X27,X28))| -p2(X25,X27)| -p2(X26,X28).
% 1.99/2.23 0 [] p2(f6(X29,X30),f6(X31,X32))| -p2(X30,X32)| -p2(X29,X31).
% 1.99/2.23 0 [] p2(f7(X33,X34),f7(X35,X36))| -p2(X33,X35)| -p2(X34,X36).
% 1.99/2.23 0 [] p2(f8(X37,X38),f8(X39,X40))| -p2(X37,X39)| -p2(X38,X40).
% 1.99/2.23 0 [] p11(X15,X16)|p2(X17,f3(c13))| -p11(f9(X17,X15),f9(X17,X16)).
% 1.99/2.23 0 [] p2(X17,f3(c13))|p11(f9(X17,X15),f9(X17,X16))| -p11(X15,X16).
% 1.99/2.23 end_of_list.
% 1.99/2.23
% 1.99/2.23 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.99/2.23
% 1.99/2.23 This is a non-Horn set without equality. The strategy will
% 1.99/2.23 be ordered hyper_res, unit deletion, and factoring, with
% 1.99/2.23 satellites in sos and with nuclei in usable.
% 1.99/2.23
% 1.99/2.23 dependent: set(hyper_res).
% 1.99/2.23 dependent: set(factor).
% 1.99/2.23 dependent: set(unit_deletion).
% 1.99/2.23
% 1.99/2.23 ------------> process usable:
% 1.99/2.23 ** KEPT (pick-wt=4): 1 [] -p2(c14,f3(c13)).
% 1.99/2.23 ** KEPT (pick-wt=4): 2 [] -p2(c12,f3(c13)).
% 1.99/2.23 ** KEPT (pick-wt=5): 3 [] -p2(c12,f3(f4(c13))).
% 1.99/2.23 ** KEPT (pick-wt=7): 4 [] -p11(c18,f9(c12,f8(c16,c14))).
% 1.99/2.23 ** KEPT (pick-wt=8): 5 [] p11(A,f8(B,C))| -p11(A,C).
% 1.99/2.23 ** KEPT (pick-wt=8): 6 [] p2(f4(A),f4(B))| -p2(A,B).
% 1.99/2.23 ** KEPT (pick-wt=8): 7 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.99/2.23 ** KEPT (pick-wt=9): 8 [] p11(A,B)| -p11(A,C)| -p11(C,B).
% 1.99/2.23 ** KEPT (pick-wt=9): 9 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.99/2.23 ** KEPT (pick-wt=12): 10 [] p10(A,B)| -p2(C,A)| -p2(D,B)| -p10(C,D).
% 1.99/2.23 ** KEPT (pick-wt=12): 11 [] p11(A,B)| -p2(C,A)| -p2(D,B)| -p11(C,D).
% 1.99/2.23 ** KEPT (pick-wt=13): 12 [] p2(f9(A,B),f9(C,D))| -p2(A,C)| -p2(B,D).
% 1.99/2.23 ** KEPT (pick-wt=13): 13 [] p2(f5(A,B),f5(C,D))| -p2(A,C)| -p2(B,D).
% 1.99/2.23 ** KEPT (pick-wt=13): 14 [] p2(f6(A,B),f6(C,D))| -p2(B,D)| -p2(A,C).
% 1.99/2.23 ** KEPT (pick-wt=13): 15 [] p2(f7(A,B),f7(C,D))| -p2(A,C)| -p2(B,D).
% 1.99/2.23 ** KEPT (pick-wt=13): 16 [] p2(f8(A,B),f8(C,D))| -p2(A,C)| -p2(B,D).
% 1.99/2.23 ** KEPT (pick-wt=14): 17 [] p11(A,B)|p2(C,f3(c13))| -p11(f9(C,A),f9(C,B)).
% 1.99/2.23 ** KEPT (pick-wt=14): 18 [] p2(A,f3(c13))|p11(f9(A,B),f9(A,C))| -p11(B,C).
% 1.99/2.23
% 1.99/2.23 ------------> process sos:
% 1.99/2.23 ** KEPT (pick-wt=3): 27 [] p2(A,A).
% 1.99/2.23 ** KEPT (pick-wt=3): 28 [] p11(A,A).
% 1.99/2.23 ** KEPT (pick-wt=3): 29 [] p10(c14,c15).
% 1.99/2.23 ** KEPT (pick-wt=3): 30 [] p10(c17,c14).
% 1.99/2.23 ** KEPT (pick-wt=5): 31 [] p11(c18,f9(c12,c14)).
% 1.99/2.23 ** KEPT (pick-wt=5): 32 [] p2(f6(c15,c14),c17).
% 1.99/2.23 ** KEPT (pick-wt=5): 33 [] p2(f5(c15,c14),c16).
% 1.99/2.23 ** KEPT (pick-wt=7): 34 [] p2(f7(f8(c16,c14),c17),c15).
% 1.99/2.23 27 back subsumes 19.
% 1.99/2.23 28 back subsumes 21.
% 1.99/2.23
% 1.99/2.23 ======= end of input processing =======
% 1.99/2.23
% 1.99/2.23 =========== start of search ===========
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 Resetting weight limit to 11.
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 Resetting weight limit to 11.
% 1.99/2.23
% 1.99/2.23 sos_size=1825
% 1.99/2.23
% 1.99/2.23 -------- PROOF --------
% 1.99/2.23
% 1.99/2.23 ----> UNIT CONFLICT at 0.30 sec ----> 2413 [binary,2412.1,4.1] $F.
% 1.99/2.23
% 1.99/2.23 Length of proof is 4. Level of proof is 4.
% 1.99/2.23
% 1.99/2.23 ---------------- PROOF ----------------
% 1.99/2.23 % SZS status Unsatisfiable
% 1.99/2.23 % SZS output start Refutation
% See solution above
% 1.99/2.23 ------------ end of proof -------------
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 Search stopped by max_proofs option.
% 1.99/2.23
% 1.99/2.23
% 1.99/2.23 Search stopped by max_proofs option.
% 1.99/2.23
% 1.99/2.23 ============ end of search ============
% 1.99/2.23
% 1.99/2.23 -------------- statistics -------------
% 1.99/2.23 clauses given 225
% 1.99/2.23 clauses generated 79336
% 1.99/2.23 clauses kept 2412
% 1.99/2.23 clauses forward subsumed 3973
% 1.99/2.23 clauses back subsumed 160
% 1.99/2.23 Kbytes malloced 6835
% 1.99/2.23
% 1.99/2.23 ----------- times (seconds) -----------
% 1.99/2.23 user CPU time 0.30 (0 hr, 0 min, 0 sec)
% 1.99/2.23 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.23 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.99/2.23
% 1.99/2.23 That finishes the proof of the theorem.
% 1.99/2.23
% 1.99/2.23 Process 17660 finished Wed Jul 27 11:05:22 2022
% 1.99/2.23 Otter interrupted
% 1.99/2.23 PROOF FOUND
%------------------------------------------------------------------------------