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