TSTP Solution File: SYN573-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.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:24:56 EDT 2022
% Result : Unsatisfiable 2.38s 2.56s
% Output : Refutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 7 unt; 4 nHn; 9 RR)
% Number of literals : 25 ( 0 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 16 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(10,axiom,
( p2(A,B)
| ~ p2(C,A)
| ~ p2(C,B) ),
file('SYN573-1.p',unknown),
[] ).
cnf(11,axiom,
( p11(A,c16)
| p2(A,f9(c17))
| ~ p12(A) ),
file('SYN573-1.p',unknown),
[] ).
cnf(13,axiom,
( p11(A,B)
| ~ p2(C,A)
| ~ p2(D,B)
| ~ p11(C,D) ),
file('SYN573-1.p',unknown),
[] ).
cnf(15,axiom,
~ p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))),
file('SYN573-1.p',unknown),
[] ).
cnf(17,axiom,
( p11(A,f3(f8(B),f3(f8(C),f5(f6(f7(c14))))))
| ~ p11(A,B) ),
file('SYN573-1.p',unknown),
[] ).
cnf(23,axiom,
p12(c15),
file('SYN573-1.p',unknown),
[] ).
cnf(25,axiom,
p2(A,A),
file('SYN573-1.p',unknown),
[] ).
cnf(26,axiom,
p11(A,f3(f8(B),f3(f8(A),f5(f6(f7(c14)))))),
file('SYN573-1.p',unknown),
[] ).
cnf(28,plain,
( p11(c15,c16)
| p2(c15,f9(c17)) ),
inference(hyper,[status(thm)],[23,11]),
[iquote('hyper,23,11')] ).
cnf(60,plain,
( p11(c15,c16)
| p2(f9(c17),c15) ),
inference(hyper,[status(thm)],[28,10,25]),
[iquote('hyper,28,10,25')] ).
cnf(119,plain,
( p11(c15,c16)
| p11(c15,f3(f8(A),f3(f8(f9(c17)),f5(f6(f7(c14)))))) ),
inference(hyper,[status(thm)],[60,13,25,26]),
[iquote('hyper,60,13,25,26')] ).
cnf(4763,plain,
p11(c15,c16),
inference(hyper,[status(thm)],[119,15]),
[iquote('hyper,119,15')] ).
cnf(4764,plain,
p11(c15,f3(f8(c16),f3(f8(A),f5(f6(f7(c14)))))),
inference(hyper,[status(thm)],[4763,17]),
[iquote('hyper,4763,17')] ).
cnf(4765,plain,
$false,
inference(binary,[status(thm)],[4764,15]),
[iquote('binary,4764.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYN573-1 : TPTP v8.1.0. Released v2.5.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:42:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.38/2.56 ----- Otter 3.3f, August 2004 -----
% 2.38/2.56 The process was started by sandbox on n017.cluster.edu,
% 2.38/2.56 Wed Jul 27 10:42:03 2022
% 2.38/2.56 The command was "./otter". The process ID is 29732.
% 2.38/2.56
% 2.38/2.56 set(prolog_style_variables).
% 2.38/2.56 set(auto).
% 2.38/2.56 dependent: set(auto1).
% 2.38/2.56 dependent: set(process_input).
% 2.38/2.56 dependent: clear(print_kept).
% 2.38/2.56 dependent: clear(print_new_demod).
% 2.38/2.56 dependent: clear(print_back_demod).
% 2.38/2.56 dependent: clear(print_back_sub).
% 2.38/2.56 dependent: set(control_memory).
% 2.38/2.56 dependent: assign(max_mem, 12000).
% 2.38/2.56 dependent: assign(pick_given_ratio, 4).
% 2.38/2.56 dependent: assign(stats_level, 1).
% 2.38/2.56 dependent: assign(max_seconds, 10800).
% 2.38/2.56 clear(print_given).
% 2.38/2.56
% 2.38/2.56 list(usable).
% 2.38/2.56 0 [] p12(c15).
% 2.38/2.56 0 [] p4(X30,X30).
% 2.38/2.56 0 [] p2(X17,X17).
% 2.38/2.56 0 [] p2(X16,f9(f10(X16)))| -p12(X16).
% 2.38/2.56 0 [] p12(X10)| -p12(X11)| -p2(X11,X10).
% 2.38/2.56 0 [] p4(f7(X37),f7(X38))| -p4(X37,X38).
% 2.38/2.56 0 [] p2(f5(X24),f5(X25))| -p4(X24,X25).
% 2.38/2.56 0 [] p2(f8(X26),f8(X27))| -p2(X26,X27).
% 2.38/2.56 0 [] p2(f9(X28),f9(X29))| -p4(X28,X29).
% 2.38/2.56 0 [] p4(f10(X33),f10(X34))| -p2(X33,X34).
% 2.38/2.56 0 [] p4(f6(X35),f6(X36))| -p4(X35,X36).
% 2.38/2.56 0 [] p4(X31,X32)| -p4(X30,X31)| -p4(X30,X32).
% 2.38/2.56 0 [] p2(X18,X19)| -p2(X17,X18)| -p2(X17,X19).
% 2.38/2.56 0 [] p11(X9,c16)|p2(X9,f9(c17))| -p12(X9).
% 2.38/2.56 0 [] p13(f10(X16),c17)|p4(f10(X16),c17)| -p12(X16).
% 2.38/2.56 0 [] p11(X7,f3(f8(X8),f3(f8(X7),f5(f6(f7(c14)))))).
% 2.38/2.56 0 [] p11(X0,X1)| -p2(X2,X0)| -p2(X3,X1)| -p11(X2,X3).
% 2.38/2.56 0 [] p13(X12,X13)| -p4(X14,X12)| -p4(X15,X13)| -p13(X14,X15).
% 2.38/2.56 0 [] -p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))).
% 2.38/2.56 0 [] p2(f3(X20,X21),f3(X22,X23))| -p2(X20,X22)| -p2(X21,X23).
% 2.38/2.56 0 [] p11(X4,f3(f8(X5),f3(f8(X6),f5(f6(f7(c14))))))| -p11(X4,X5).
% 2.38/2.56 end_of_list.
% 2.38/2.56
% 2.38/2.56 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 2.38/2.56
% 2.38/2.56 This is a non-Horn set without equality. The strategy will
% 2.38/2.56 be ordered hyper_res, unit deletion, and factoring, with
% 2.38/2.56 satellites in sos and with nuclei in usable.
% 2.38/2.56
% 2.38/2.56 dependent: set(hyper_res).
% 2.38/2.56 dependent: set(factor).
% 2.38/2.56 dependent: set(unit_deletion).
% 2.38/2.56
% 2.38/2.56 ------------> process usable:
% 2.38/2.56 ** KEPT (pick-wt=7): 1 [] p2(A,f9(f10(A)))| -p12(A).
% 2.38/2.56 ** KEPT (pick-wt=7): 2 [] p12(A)| -p12(B)| -p2(B,A).
% 2.38/2.56 ** KEPT (pick-wt=8): 3 [] p4(f7(A),f7(B))| -p4(A,B).
% 2.38/2.56 ** KEPT (pick-wt=8): 4 [] p2(f5(A),f5(B))| -p4(A,B).
% 2.38/2.56 ** KEPT (pick-wt=8): 5 [] p2(f8(A),f8(B))| -p2(A,B).
% 2.38/2.56 ** KEPT (pick-wt=8): 6 [] p2(f9(A),f9(B))| -p4(A,B).
% 2.38/2.56 ** KEPT (pick-wt=8): 7 [] p4(f10(A),f10(B))| -p2(A,B).
% 2.38/2.56 ** KEPT (pick-wt=8): 8 [] p4(f6(A),f6(B))| -p4(A,B).
% 2.38/2.56 ** KEPT (pick-wt=9): 9 [] p4(A,B)| -p4(C,A)| -p4(C,B).
% 2.38/2.56 ** KEPT (pick-wt=9): 10 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 2.38/2.56 ** KEPT (pick-wt=9): 11 [] p11(A,c16)|p2(A,f9(c17))| -p12(A).
% 2.38/2.56 ** KEPT (pick-wt=10): 12 [] p13(f10(A),c17)|p4(f10(A),c17)| -p12(A).
% 2.38/2.56 ** KEPT (pick-wt=12): 13 [] p11(A,B)| -p2(C,A)| -p2(D,B)| -p11(C,D).
% 2.38/2.56 ** KEPT (pick-wt=12): 14 [] p13(A,B)| -p4(C,A)| -p4(D,B)| -p13(C,D).
% 2.38/2.56 ** KEPT (pick-wt=13): 15 [] -p11(c15,f3(f8(c16),f3(f8(f9(c17)),f5(f6(f7(c14)))))).
% 2.38/2.56 ** KEPT (pick-wt=13): 16 [] p2(f3(A,B),f3(C,D))| -p2(A,C)| -p2(B,D).
% 2.38/2.56 ** KEPT (pick-wt=15): 17 [] p11(A,f3(f8(B),f3(f8(C),f5(f6(f7(c14))))))| -p11(A,B).
% 2.38/2.56
% 2.38/2.56 ------------> process sos:
% 2.38/2.56 ** KEPT (pick-wt=2): 23 [] p12(c15).
% 2.38/2.56 ** KEPT (pick-wt=3): 24 [] p4(A,A).
% 2.38/2.56 ** KEPT (pick-wt=3): 25 [] p2(A,A).
% 2.38/2.56 ** KEPT (pick-wt=12): 26 [] p11(A,f3(f8(B),f3(f8(A),f5(f6(f7(c14)))))).
% 2.38/2.56 24 back subsumes 18.
% 2.38/2.56 25 back subsumes 19.
% 2.38/2.56
% 2.38/2.56 ======= end of input processing =======
% 2.38/2.56
% 2.38/2.56 =========== start of search ===========
% 2.38/2.56
% 2.38/2.56
% 2.38/2.56 Resetting weight limit to 13.
% 2.38/2.56
% 2.38/2.56
% 2.38/2.56 Resetting weight limit to 13.
% 2.38/2.56
% 2.38/2.56 sos_size=4140
% 2.38/2.56
% 2.38/2.56 -------- PROOF --------
% 2.38/2.56
% 2.38/2.56 ----> UNIT CONFLICT at 0.67 sec ----> 4765 [binary,4764.1,15.1] $F.
% 2.38/2.56
% 2.38/2.56 Length of proof is 5. Level of proof is 5.
% 2.38/2.56
% 2.38/2.56 ---------------- PROOF ----------------
% 2.38/2.56 % SZS status Unsatisfiable
% 2.38/2.56 % SZS output start Refutation
% See solution above
% 2.38/2.56 ------------ end of proof -------------
% 2.38/2.56
% 2.38/2.56
% 2.38/2.56 Search stopped by max_proofs option.
% 2.38/2.56
% 2.38/2.56
% 2.38/2.56 Search stopped by max_proofs option.
% 2.38/2.56
% 2.38/2.56 ============ end of search ============
% 2.38/2.56
% 2.38/2.56 -------------- statistics -------------
% 2.38/2.56 clauses given 242
% 2.38/2.56 clauses generated 24351
% 2.38/2.56 clauses kept 4764
% 2.38/2.56 clauses forward subsumed 2049
% 2.38/2.56 clauses back subsumed 2202
% 2.38/2.56 Kbytes malloced 5859
% 2.38/2.56
% 2.38/2.56 ----------- times (seconds) -----------
% 2.38/2.56 user CPU time 0.67 (0 hr, 0 min, 0 sec)
% 2.38/2.56 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.38/2.56 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.38/2.56
% 2.38/2.56 That finishes the proof of the theorem.
% 2.38/2.56
% 2.38/2.56 Process 29732 finished Wed Jul 27 10:42:05 2022
% 2.38/2.56 Otter interrupted
% 2.38/2.56 PROOF FOUND
%------------------------------------------------------------------------------