TSTP Solution File: SYN728+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN728+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:25:12 EDT 2022
% Result : Theorem 1.65s 1.86s
% Output : Refutation 1.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 2 unt; 4 nHn; 3 RR)
% Number of literals : 16 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-2 aty)
% Number of variables : 11 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p(A,B)
| p(C,C) ),
file('SYN728+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ q(A)
| ~ m(g(A)) ),
file('SYN728+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ p(g(dollar_c1),A)
| ~ p(dollar_c1,dollar_c1) ),
file('SYN728+1.p',unknown),
[] ).
cnf(4,axiom,
( p(A,dollar_f1(A))
| m(A) ),
file('SYN728+1.p',unknown),
[] ).
cnf(5,axiom,
( p(A,dollar_f1(A))
| q(f(A,dollar_f1(A))) ),
file('SYN728+1.p',unknown),
[] ).
cnf(6,plain,
( p(A,dollar_f1(A))
| p(g(f(A,dollar_f1(A))),dollar_f1(g(f(A,dollar_f1(A))))) ),
inference(hyper,[status(thm)],[5,2,4]),
[iquote('hyper,5,2,4')] ).
cnf(8,plain,
( p(A,dollar_f1(A))
| p(B,B) ),
inference(hyper,[status(thm)],[6,1]),
[iquote('hyper,6,1')] ).
cnf(9,plain,
p(A,A),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[8,1])]),
[iquote('hyper,8,1,factor_simp')] ).
cnf(11,plain,
$false,
inference(hyper,[status(thm)],[9,3,9]),
[iquote('hyper,9,3,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN728+1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/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:24:35 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.65/1.86 ----- Otter 3.3f, August 2004 -----
% 1.65/1.86 The process was started by sandbox on n005.cluster.edu,
% 1.65/1.86 Wed Jul 27 11:24:35 2022
% 1.65/1.86 The command was "./otter". The process ID is 22543.
% 1.65/1.86
% 1.65/1.86 set(prolog_style_variables).
% 1.65/1.86 set(auto).
% 1.65/1.86 dependent: set(auto1).
% 1.65/1.86 dependent: set(process_input).
% 1.65/1.86 dependent: clear(print_kept).
% 1.65/1.86 dependent: clear(print_new_demod).
% 1.65/1.86 dependent: clear(print_back_demod).
% 1.65/1.86 dependent: clear(print_back_sub).
% 1.65/1.86 dependent: set(control_memory).
% 1.65/1.86 dependent: assign(max_mem, 12000).
% 1.65/1.86 dependent: assign(pick_given_ratio, 4).
% 1.65/1.86 dependent: assign(stats_level, 1).
% 1.65/1.86 dependent: assign(max_seconds, 10800).
% 1.65/1.86 clear(print_given).
% 1.65/1.86
% 1.65/1.86 formula_list(usable).
% 1.65/1.86 -((all X ((exists Y p(X,Y))-> (all Z p(Z,Z))))& (all R exists S (p(R,S)|m(R)&q(f(R,S))))& (all W (q(W)-> -m(g(W))))-> (all U exists V (p(g(U),V)&p(U,U)))).
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 -------> usable clausifies to:
% 1.65/1.86
% 1.65/1.86 list(usable).
% 1.65/1.86 0 [] -p(X,Y)|p(Z,Z).
% 1.65/1.86 0 [] p(R,$f1(R))|m(R).
% 1.65/1.86 0 [] p(R,$f1(R))|q(f(R,$f1(R))).
% 1.65/1.86 0 [] -q(W)| -m(g(W)).
% 1.65/1.86 0 [] -p(g($c1),V)| -p($c1,$c1).
% 1.65/1.86 end_of_list.
% 1.65/1.86
% 1.65/1.86 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=2.
% 1.65/1.86
% 1.65/1.86 This is a non-Horn set without equality. The strategy will
% 1.65/1.86 be ordered hyper_res, unit deletion, and factoring, with
% 1.65/1.86 satellites in sos and with nuclei in usable.
% 1.65/1.86
% 1.65/1.86 dependent: set(hyper_res).
% 1.65/1.86 dependent: set(factor).
% 1.65/1.86 dependent: set(unit_deletion).
% 1.65/1.86
% 1.65/1.86 ------------> process usable:
% 1.65/1.86 ** KEPT (pick-wt=6): 1 [] -p(A,B)|p(C,C).
% 1.65/1.86 ** KEPT (pick-wt=5): 2 [] -q(A)| -m(g(A)).
% 1.65/1.86 ** KEPT (pick-wt=7): 3 [] -p(g($c1),A)| -p($c1,$c1).
% 1.65/1.86
% 1.65/1.86 ------------> process sos:
% 1.65/1.86 ** KEPT (pick-wt=6): 4 [] p(A,$f1(A))|m(A).
% 1.65/1.86 ** KEPT (pick-wt=9): 5 [] p(A,$f1(A))|q(f(A,$f1(A))).
% 1.65/1.86
% 1.65/1.86 ======= end of input processing =======
% 1.65/1.86
% 1.65/1.86 =========== start of search ===========
% 1.65/1.86
% 1.65/1.86 -------- PROOF --------
% 1.65/1.86
% 1.65/1.86 -----> EMPTY CLAUSE at 0.00 sec ----> 11 [hyper,9,3,9] $F.
% 1.65/1.86
% 1.65/1.86 Length of proof is 3. Level of proof is 3.
% 1.65/1.86
% 1.65/1.86 ---------------- PROOF ----------------
% 1.65/1.86 % SZS status Theorem
% 1.65/1.86 % SZS output start Refutation
% See solution above
% 1.65/1.86 ------------ end of proof -------------
% 1.65/1.86
% 1.65/1.86
% 1.65/1.86 Search stopped by max_proofs option.
% 1.65/1.86
% 1.65/1.86
% 1.65/1.86 Search stopped by max_proofs option.
% 1.65/1.86
% 1.65/1.86 ============ end of search ============
% 1.65/1.86
% 1.65/1.86 -------------- statistics -------------
% 1.65/1.86 clauses given 5
% 1.65/1.86 clauses generated 11
% 1.65/1.86 clauses kept 10
% 1.65/1.86 clauses forward subsumed 5
% 1.65/1.86 clauses back subsumed 6
% 1.65/1.86 Kbytes malloced 976
% 1.65/1.86
% 1.65/1.86 ----------- times (seconds) -----------
% 1.65/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.65/1.86 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.65/1.86
% 1.65/1.86 That finishes the proof of the theorem.
% 1.65/1.86
% 1.65/1.86 Process 22543 finished Wed Jul 27 11:24:37 2022
% 1.65/1.86 Otter interrupted
% 1.65/1.86 PROOF FOUND
%------------------------------------------------------------------------------