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