TSTP Solution File: SYN722+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYN722+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:25:11 EDT 2022
% Result : Theorem 1.73s 1.95s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 3 RR)
% Number of literals : 10 ( 0 equ; 6 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 3 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( p(A)
| ~ q(A)
| ~ q(dollar_f1(A))
| ~ q(c)
| ~ q(d) ),
file('SYN722+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ p(a)
| ~ p(b) ),
file('SYN722+1.p',unknown),
[] ).
cnf(6,axiom,
q(A),
file('SYN722+1.p',unknown),
[] ).
cnf(9,plain,
p(A),
inference(hyper,[status(thm)],[6,1,6,6,6]),
[iquote('hyper,6,1,6,6,6')] ).
cnf(10,plain,
$false,
inference(hyper,[status(thm)],[9,2,9]),
[iquote('hyper,9,2,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : SYN722+1 : TPTP v8.1.0. Released v2.5.0.
% 0.09/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n012.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Wed Jul 27 11:00:05 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.73/1.95 ----- Otter 3.3f, August 2004 -----
% 1.73/1.95 The process was started by sandbox on n012.cluster.edu,
% 1.73/1.95 Wed Jul 27 11:00:05 2022
% 1.73/1.95 The command was "./otter". The process ID is 24802.
% 1.73/1.95
% 1.73/1.95 set(prolog_style_variables).
% 1.73/1.95 set(auto).
% 1.73/1.95 dependent: set(auto1).
% 1.73/1.95 dependent: set(process_input).
% 1.73/1.95 dependent: clear(print_kept).
% 1.73/1.95 dependent: clear(print_new_demod).
% 1.73/1.95 dependent: clear(print_back_demod).
% 1.73/1.95 dependent: clear(print_back_sub).
% 1.73/1.95 dependent: set(control_memory).
% 1.73/1.95 dependent: assign(max_mem, 12000).
% 1.73/1.95 dependent: assign(pick_given_ratio, 4).
% 1.73/1.95 dependent: assign(stats_level, 1).
% 1.73/1.95 dependent: assign(max_seconds, 10800).
% 1.73/1.95 clear(print_given).
% 1.73/1.95
% 1.73/1.95 formula_list(usable).
% 1.73/1.95 -(-((all Z ((p(Z)|r(Z))&q(Z)))& (all X exists Y (p(X)| -q(X)| -q(Y)| -q(c)| -q(d)))& (-p(a)| -p(b)))).
% 1.73/1.95 end_of_list.
% 1.73/1.95
% 1.73/1.95 -------> usable clausifies to:
% 1.73/1.95
% 1.73/1.95 list(usable).
% 1.73/1.95 0 [] p(Z)|r(Z).
% 1.73/1.95 0 [] q(Z).
% 1.73/1.95 0 [] p(X)| -q(X)| -q($f1(X))| -q(c)| -q(d).
% 1.73/1.95 0 [] -p(a)| -p(b).
% 1.73/1.95 end_of_list.
% 1.73/1.95
% 1.73/1.95 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.73/1.95
% 1.73/1.95 This is a non-Horn set without equality. The strategy will
% 1.73/1.95 be ordered hyper_res, unit deletion, and factoring, with
% 1.73/1.95 satellites in sos and with nuclei in usable.
% 1.73/1.95
% 1.73/1.95 dependent: set(hyper_res).
% 1.73/1.95 dependent: set(factor).
% 1.73/1.95 dependent: set(unit_deletion).
% 1.73/1.95
% 1.73/1.95 ------------> process usable:
% 1.73/1.95 ** KEPT (pick-wt=11): 1 [] p(A)| -q(A)| -q($f1(A))| -q(c)| -q(d).
% 1.73/1.95 ** KEPT (pick-wt=4): 2 [] -p(a)| -p(b).
% 1.73/1.95
% 1.73/1.95 ------------> process sos:
% 1.73/1.95 ** KEPT (pick-wt=4): 5 [] p(A)|r(A).
% 1.73/1.95 ** KEPT (pick-wt=2): 6 [] q(A).
% 1.73/1.95
% 1.73/1.95 ======= end of input processing =======
% 1.73/1.95
% 1.73/1.95 =========== start of search ===========
% 1.73/1.95
% 1.73/1.95 -------- PROOF --------
% 1.73/1.95
% 1.73/1.95 -----> EMPTY CLAUSE at 0.00 sec ----> 10 [hyper,9,2,9] $F.
% 1.73/1.95
% 1.73/1.95 Length of proof is 1. Level of proof is 1.
% 1.73/1.95
% 1.73/1.95 ---------------- PROOF ----------------
% 1.73/1.95 % SZS status Theorem
% 1.73/1.95 % SZS output start Refutation
% See solution above
% 1.73/1.95 ------------ end of proof -------------
% 1.73/1.95
% 1.73/1.95
% 1.73/1.95 Search stopped by max_proofs option.
% 1.73/1.95
% 1.73/1.95
% 1.73/1.95 Search stopped by max_proofs option.
% 1.73/1.95
% 1.73/1.95 ============ end of search ============
% 1.73/1.95
% 1.73/1.95 -------------- statistics -------------
% 1.73/1.95 clauses given 3
% 1.73/1.95 clauses generated 13
% 1.73/1.95 clauses kept 9
% 1.73/1.95 clauses forward subsumed 7
% 1.73/1.95 clauses back subsumed 6
% 1.73/1.95 Kbytes malloced 976
% 1.73/1.95
% 1.73/1.95 ----------- times (seconds) -----------
% 1.73/1.95 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.95 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.95 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.95
% 1.73/1.95 That finishes the proof of the theorem.
% 1.73/1.95
% 1.73/1.95 Process 24802 finished Wed Jul 27 11:00:07 2022
% 1.73/1.95 Otter interrupted
% 1.73/1.95 PROOF FOUND
%------------------------------------------------------------------------------