TSTP Solution File: SYN386+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:25 EDT 2022
% Result : Theorem 1.85s 2.03s
% Output : Refutation 1.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 7 unt; 0 nHn; 4 RR)
% Number of literals : 13 ( 0 equ; 5 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 1 con; 0-2 aty)
% Number of variables : 18 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ big_s(dollar_f2(A),B)
| big_d(B,dollar_c1,A) ),
file('SYN386+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ big_d(A,B,dollar_f3(C))
| ~ big_f(A,D)
| ~ big_f(B,E)
| big_d(D,E,C) ),
file('SYN386+1.p',unknown),
[] ).
cnf(3,axiom,
~ big_d(dollar_f4(A,B),A,dollar_f6(A)),
file('SYN386+1.p',unknown),
[] ).
cnf(4,axiom,
big_f(A,dollar_f1(A)),
file('SYN386+1.p',unknown),
[] ).
cnf(5,axiom,
big_s(A,dollar_f5(B,A)),
file('SYN386+1.p',unknown),
[] ).
cnf(6,axiom,
big_f(dollar_f5(A,B),dollar_f4(A,B)),
file('SYN386+1.p',unknown),
[] ).
cnf(7,plain,
big_d(dollar_f5(A,dollar_f2(B)),dollar_c1,B),
inference(hyper,[status(thm)],[5,1]),
[iquote('hyper,5,1')] ).
cnf(8,plain,
big_d(dollar_f4(A,dollar_f2(dollar_f3(B))),dollar_f1(dollar_c1),B),
inference(hyper,[status(thm)],[7,2,6,4]),
[iquote('hyper,7,2,6,4')] ).
cnf(9,plain,
$false,
inference(binary,[status(thm)],[8,3]),
[iquote('binary,8.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN386+1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 10:56:21 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.85/2.03 ----- Otter 3.3f, August 2004 -----
% 1.85/2.03 The process was started by sandbox2 on n009.cluster.edu,
% 1.85/2.03 Wed Jul 27 10:56:21 2022
% 1.85/2.03 The command was "./otter". The process ID is 30457.
% 1.85/2.03
% 1.85/2.03 set(prolog_style_variables).
% 1.85/2.03 set(auto).
% 1.85/2.03 dependent: set(auto1).
% 1.85/2.03 dependent: set(process_input).
% 1.85/2.03 dependent: clear(print_kept).
% 1.85/2.03 dependent: clear(print_new_demod).
% 1.85/2.03 dependent: clear(print_back_demod).
% 1.85/2.03 dependent: clear(print_back_sub).
% 1.85/2.03 dependent: set(control_memory).
% 1.85/2.03 dependent: assign(max_mem, 12000).
% 1.85/2.03 dependent: assign(pick_given_ratio, 4).
% 1.85/2.03 dependent: assign(stats_level, 1).
% 1.85/2.03 dependent: assign(max_seconds, 10800).
% 1.85/2.03 clear(print_given).
% 1.85/2.03
% 1.85/2.03 formula_list(usable).
% 1.85/2.03 -((all X exists Y big_f(X,Y))& (exists X all E exists N all W (big_s(N,W)->big_d(W,X,E)))& (all E exists D all A B (big_d(A,B,D)-> (all Y Z (big_f(A,Y)&big_f(B,Z)->big_d(Y,Z,E)))))-> (exists Y all E exists M all W (big_s(M,W)-> (all Z (big_f(W,Z)->big_d(Z,Y,E)))))).
% 1.85/2.03 end_of_list.
% 1.85/2.03
% 1.85/2.03 -------> usable clausifies to:
% 1.85/2.03
% 1.85/2.03 list(usable).
% 1.85/2.03 0 [] big_f(X,$f1(X)).
% 1.85/2.03 0 [] -big_s($f2(E),W)|big_d(W,$c1,E).
% 1.85/2.03 0 [] -big_d(A,B,$f3(X1))| -big_f(A,Y)| -big_f(B,Z)|big_d(Y,Z,X1).
% 1.85/2.03 0 [] big_s(M,$f5(X2,M)).
% 1.85/2.03 0 [] big_f($f5(X2,M),$f4(X2,M)).
% 1.85/2.03 0 [] -big_d($f4(X2,M),X2,$f6(X2)).
% 1.85/2.03 end_of_list.
% 1.85/2.03
% 1.85/2.03 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=4.
% 1.85/2.03
% 1.85/2.03 This is a Horn set without equality. The strategy will
% 1.85/2.03 be hyperresolution, with satellites in sos and nuclei
% 1.85/2.03 in usable.
% 1.85/2.03
% 1.85/2.03 dependent: set(hyper_res).
% 1.85/2.03 dependent: clear(order_hyper).
% 1.85/2.03
% 1.85/2.03 ------------> process usable:
% 1.85/2.03 ** KEPT (pick-wt=8): 1 [] -big_s($f2(A),B)|big_d(B,$c1,A).
% 1.85/2.03 ** KEPT (pick-wt=15): 2 [] -big_d(A,B,$f3(C))| -big_f(A,D)| -big_f(B,E)|big_d(D,E,C).
% 1.85/2.03 ** KEPT (pick-wt=7): 3 [] -big_d($f4(A,B),A,$f6(A)).
% 1.85/2.03
% 1.85/2.03 ------------> process sos:
% 1.85/2.03 ** KEPT (pick-wt=4): 4 [] big_f(A,$f1(A)).
% 1.85/2.03 ** KEPT (pick-wt=5): 5 [] big_s(A,$f5(B,A)).
% 1.85/2.03 ** KEPT (pick-wt=7): 6 [] big_f($f5(A,B),$f4(A,B)).
% 1.85/2.03
% 1.85/2.03 ======= end of input processing =======
% 1.85/2.03
% 1.85/2.03 =========== start of search ===========
% 1.85/2.03
% 1.85/2.03 -------- PROOF --------
% 1.85/2.03
% 1.85/2.03 ----> UNIT CONFLICT at 0.00 sec ----> 9 [binary,8.1,3.1] $F.
% 1.85/2.03
% 1.85/2.03 Length of proof is 2. Level of proof is 2.
% 1.85/2.03
% 1.85/2.03 ---------------- PROOF ----------------
% 1.85/2.03 % SZS status Theorem
% 1.85/2.03 % SZS output start Refutation
% See solution above
% 1.85/2.03 ------------ end of proof -------------
% 1.85/2.03
% 1.85/2.03
% 1.85/2.03 Search stopped by max_proofs option.
% 1.85/2.03
% 1.85/2.03
% 1.85/2.03 Search stopped by max_proofs option.
% 1.85/2.03
% 1.85/2.03 ============ end of search ============
% 1.85/2.03
% 1.85/2.03 -------------- statistics -------------
% 1.85/2.03 clauses given 4
% 1.85/2.03 clauses generated 2
% 1.85/2.03 clauses kept 8
% 1.85/2.03 clauses forward subsumed 0
% 1.85/2.03 clauses back subsumed 0
% 1.85/2.03 Kbytes malloced 976
% 1.85/2.03
% 1.85/2.03 ----------- times (seconds) -----------
% 1.85/2.03 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.85/2.03 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.85/2.03 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.85/2.03
% 1.85/2.03 That finishes the proof of the theorem.
% 1.85/2.03
% 1.85/2.03 Process 30457 finished Wed Jul 27 10:56:23 2022
% 1.85/2.03 Otter interrupted
% 1.85/2.03 PROOF FOUND
%------------------------------------------------------------------------------