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