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