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