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