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