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