TSTP Solution File: SYN567-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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.94s 2.12s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 10 ( 7 unt; 2 nHn; 7 RR)
% Number of literals : 18 ( 0 equ; 6 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p2(f6(c9),f3(f4(c10))),
file('SYN567-1.p',unknown),
[] ).
cnf(2,axiom,
~ p2(f6(c9),f3(f7(f4(c10)))),
file('SYN567-1.p',unknown),
[] ).
cnf(3,axiom,
~ p2(f6(c9),f3(f7(f7(f4(c10))))),
file('SYN567-1.p',unknown),
[] ).
cnf(7,axiom,
( p2(f6(A),f6(B))
| ~ p5(A,B) ),
file('SYN567-1.p',unknown),
[] ).
cnf(9,axiom,
~ p2(f6(c9),f3(f7(f7(f7(f4(c10)))))),
file('SYN567-1.p',unknown),
[] ).
cnf(16,axiom,
( p2(A,f3(f4(c10)))
| p2(A,f3(f7(f4(c10))))
| p2(A,f3(f7(f7(f4(c10)))))
| p2(A,f3(f7(f7(f7(f4(c10))))))
| ~ p2(f6(f8(A)),A) ),
file('SYN567-1.p',unknown),
[] ).
cnf(21,axiom,
p5(f8(f6(A)),A),
file('SYN567-1.p',unknown),
[] ).
cnf(27,plain,
p2(f6(f8(f6(A))),f6(A)),
inference(hyper,[status(thm)],[21,7]),
[iquote('hyper,21,7')] ).
cnf(31,plain,
( p2(f6(A),f3(f4(c10)))
| p2(f6(A),f3(f7(f4(c10))))
| p2(f6(A),f3(f7(f7(f4(c10)))))
| p2(f6(A),f3(f7(f7(f7(f4(c10)))))) ),
inference(hyper,[status(thm)],[27,16]),
[iquote('hyper,27,16')] ).
cnf(119,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[31,1]),2,3,9]),
[iquote('hyper,31,1,unit_del,2,3,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.11 % Problem : SYN567-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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:55:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.94/2.12 ----- Otter 3.3f, August 2004 -----
% 1.94/2.12 The process was started by sandbox on n011.cluster.edu,
% 1.94/2.12 Wed Jul 27 10:55:55 2022
% 1.94/2.12 The command was "./otter". The process ID is 10390.
% 1.94/2.12
% 1.94/2.12 set(prolog_style_variables).
% 1.94/2.12 set(auto).
% 1.94/2.12 dependent: set(auto1).
% 1.94/2.12 dependent: set(process_input).
% 1.94/2.12 dependent: clear(print_kept).
% 1.94/2.12 dependent: clear(print_new_demod).
% 1.94/2.12 dependent: clear(print_back_demod).
% 1.94/2.12 dependent: clear(print_back_sub).
% 1.94/2.12 dependent: set(control_memory).
% 1.94/2.12 dependent: assign(max_mem, 12000).
% 1.94/2.12 dependent: assign(pick_given_ratio, 4).
% 1.94/2.12 dependent: assign(stats_level, 1).
% 1.94/2.12 dependent: assign(max_seconds, 10800).
% 1.94/2.12 clear(print_given).
% 1.94/2.12
% 1.94/2.12 list(usable).
% 1.94/2.12 0 [] p2(X0,X0).
% 1.94/2.12 0 [] p5(X12,X12).
% 1.94/2.12 0 [] p5(f8(f6(X17)),X17).
% 1.94/2.12 0 [] -p2(f6(c9),f3(f4(c10))).
% 1.94/2.12 0 [] -p2(f6(c9),f3(f7(f4(c10)))).
% 1.94/2.12 0 [] -p2(f6(c9),f3(f7(f7(f4(c10))))).
% 1.94/2.12 0 [] p2(f3(X4),f3(X5))| -p2(X4,X5).
% 1.94/2.12 0 [] p5(f8(X15),f8(X16))| -p2(X15,X16).
% 1.94/2.12 0 [] p2(f7(X10),f7(X11))| -p2(X10,X11).
% 1.94/2.12 0 [] p2(f6(X8),f6(X9))| -p5(X8,X9).
% 1.94/2.12 0 [] p2(f4(X6),f4(X7))| -p2(X6,X7).
% 1.94/2.12 0 [] -p2(f6(c9),f3(f7(f7(f7(f4(c10)))))).
% 1.94/2.12 0 [] p2(X1,X2)| -p2(X0,X1)| -p2(X0,X2).
% 1.94/2.12 0 [] p5(X13,X14)| -p5(X12,X13)| -p5(X12,X14).
% 1.94/2.12 0 [] p2(f6(f8(X3)),X3)| -p2(X3,f3(f4(c10))).
% 1.94/2.12 0 [] p2(f6(f8(X3)),X3)| -p2(X3,f3(f7(f4(c10)))).
% 1.94/2.12 0 [] p2(f6(f8(X3)),X3)| -p2(X3,f3(f7(f7(f4(c10))))).
% 1.94/2.12 0 [] p2(f6(f8(X3)),X3)| -p2(X3,f3(f7(f7(f7(f4(c10)))))).
% 1.94/2.12 0 [] p2(X3,f3(f4(c10)))|p2(X3,f3(f7(f4(c10))))|p2(X3,f3(f7(f7(f4(c10)))))|p2(X3,f3(f7(f7(f7(f4(c10))))))| -p2(f6(f8(X3)),X3).
% 1.94/2.12 end_of_list.
% 1.94/2.12
% 1.94/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.94/2.12
% 1.94/2.12 This is a non-Horn set without equality. The strategy will
% 1.94/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.12 satellites in sos and with nuclei in usable.
% 1.94/2.12
% 1.94/2.12 dependent: set(hyper_res).
% 1.94/2.12 dependent: set(factor).
% 1.94/2.12 dependent: set(unit_deletion).
% 1.94/2.12
% 1.94/2.12 ------------> process usable:
% 1.94/2.12 ** KEPT (pick-wt=6): 1 [] -p2(f6(c9),f3(f4(c10))).
% 1.94/2.12 ** KEPT (pick-wt=7): 2 [] -p2(f6(c9),f3(f7(f4(c10)))).
% 1.94/2.12 ** KEPT (pick-wt=8): 3 [] -p2(f6(c9),f3(f7(f7(f4(c10))))).
% 1.94/2.12 ** KEPT (pick-wt=8): 4 [] p2(f3(A),f3(B))| -p2(A,B).
% 1.94/2.12 ** KEPT (pick-wt=8): 5 [] p5(f8(A),f8(B))| -p2(A,B).
% 1.94/2.12 ** KEPT (pick-wt=8): 6 [] p2(f7(A),f7(B))| -p2(A,B).
% 1.94/2.12 ** KEPT (pick-wt=8): 7 [] p2(f6(A),f6(B))| -p5(A,B).
% 1.94/2.12 ** KEPT (pick-wt=8): 8 [] p2(f4(A),f4(B))| -p2(A,B).
% 1.94/2.12 ** KEPT (pick-wt=9): 9 [] -p2(f6(c9),f3(f7(f7(f7(f4(c10)))))).
% 1.94/2.12 ** KEPT (pick-wt=9): 10 [] p2(A,B)| -p2(C,A)| -p2(C,B).
% 1.94/2.12 ** KEPT (pick-wt=9): 11 [] p5(A,B)| -p5(C,A)| -p5(C,B).
% 1.94/2.12 ** KEPT (pick-wt=10): 12 [] p2(f6(f8(A)),A)| -p2(A,f3(f4(c10))).
% 1.94/2.12 ** KEPT (pick-wt=11): 13 [] p2(f6(f8(A)),A)| -p2(A,f3(f7(f4(c10)))).
% 1.94/2.12 ** KEPT (pick-wt=12): 14 [] p2(f6(f8(A)),A)| -p2(A,f3(f7(f7(f4(c10))))).
% 1.94/2.12 ** KEPT (pick-wt=13): 15 [] p2(f6(f8(A)),A)| -p2(A,f3(f7(f7(f7(f4(c10)))))).
% 1.94/2.12 ** KEPT (pick-wt=31): 16 [] p2(A,f3(f4(c10)))|p2(A,f3(f7(f4(c10))))|p2(A,f3(f7(f7(f4(c10)))))|p2(A,f3(f7(f7(f7(f4(c10))))))| -p2(f6(f8(A)),A).
% 1.94/2.12
% 1.94/2.12 ------------> process sos:
% 1.94/2.12 ** KEPT (pick-wt=3): 19 [] p2(A,A).
% 1.94/2.12 ** KEPT (pick-wt=3): 20 [] p5(A,A).
% 1.94/2.12 ** KEPT (pick-wt=5): 21 [] p5(f8(f6(A)),A).
% 1.94/2.12 19 back subsumes 17.
% 1.94/2.12 20 back subsumes 18.
% 1.94/2.12
% 1.94/2.12 ======= end of input processing =======
% 1.94/2.12
% 1.94/2.12 =========== start of search ===========
% 1.94/2.12
% 1.94/2.12 -------- PROOF --------
% 1.94/2.12
% 1.94/2.12 -----> EMPTY CLAUSE at 0.00 sec ----> 119 [hyper,31,1,unit_del,2,3,9] $F.
% 1.94/2.12
% 1.94/2.12 Length of proof is 2. Level of proof is 2.
% 1.94/2.12
% 1.94/2.12 ---------------- PROOF ----------------
% 1.94/2.12 % SZS status Unsatisfiable
% 1.94/2.12 % SZS output start Refutation
% See solution above
% 1.94/2.12 ------------ end of proof -------------
% 1.94/2.12
% 1.94/2.12
% 1.94/2.12 Search stopped by max_proofs option.
% 1.94/2.12
% 1.94/2.12
% 1.94/2.12 Search stopped by max_proofs option.
% 1.94/2.12
% 1.94/2.12 ============ end of search ============
% 1.94/2.12
% 1.94/2.12 -------------- statistics -------------
% 1.94/2.12 clauses given 21
% 1.94/2.12 clauses generated 243
% 1.94/2.12 clauses kept 118
% 1.94/2.12 clauses forward subsumed 143
% 1.94/2.12 clauses back subsumed 2
% 1.94/2.12 Kbytes malloced 1953
% 1.94/2.12
% 1.94/2.12 ----------- times (seconds) -----------
% 1.94/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.12
% 1.94/2.12 That finishes the proof of the theorem.
% 1.94/2.12
% 1.94/2.12 Process 10390 finished Wed Jul 27 10:55:57 2022
% 1.94/2.12 Otter interrupted
% 1.94/2.12 PROOF FOUND
%------------------------------------------------------------------------------