TSTP Solution File: SET583+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:44 EDT 2022
% Result : Theorem 1.93s 2.09s
% Output : Refutation 1.93s
% 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 ( 3 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( A = B
| ~ subset(A,B)
| ~ subset(B,A) ),
file('SET583+3.p',unknown),
[] ).
cnf(6,axiom,
dollar_c2 != dollar_c1,
file('SET583+3.p',unknown),
[] ).
cnf(11,axiom,
subset(dollar_c2,dollar_c1),
file('SET583+3.p',unknown),
[] ).
cnf(12,axiom,
subset(dollar_c1,dollar_c2),
file('SET583+3.p',unknown),
[] ).
cnf(15,plain,
dollar_c2 = dollar_c1,
inference(hyper,[status(thm)],[12,3,11]),
[iquote('hyper,12,3,11')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[15,6]),
[iquote('binary,15.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SET583+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.11/0.33 % Computer : n006.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Jul 27 10:25:01 EDT 2022
% 0.11/0.33 % CPUTime :
% 1.93/2.09 ----- Otter 3.3f, August 2004 -----
% 1.93/2.09 The process was started by sandbox2 on n006.cluster.edu,
% 1.93/2.09 Wed Jul 27 10:25:02 2022
% 1.93/2.09 The command was "./otter". The process ID is 3921.
% 1.93/2.09
% 1.93/2.09 set(prolog_style_variables).
% 1.93/2.09 set(auto).
% 1.93/2.09 dependent: set(auto1).
% 1.93/2.09 dependent: set(process_input).
% 1.93/2.09 dependent: clear(print_kept).
% 1.93/2.09 dependent: clear(print_new_demod).
% 1.93/2.09 dependent: clear(print_back_demod).
% 1.93/2.09 dependent: clear(print_back_sub).
% 1.93/2.09 dependent: set(control_memory).
% 1.93/2.09 dependent: assign(max_mem, 12000).
% 1.93/2.09 dependent: assign(pick_given_ratio, 4).
% 1.93/2.09 dependent: assign(stats_level, 1).
% 1.93/2.09 dependent: assign(max_seconds, 10800).
% 1.93/2.09 clear(print_given).
% 1.93/2.09
% 1.93/2.09 formula_list(usable).
% 1.93/2.09 all A (A=A).
% 1.93/2.09 all B C (B=C<->subset(B,C)&subset(C,B)).
% 1.93/2.09 all B C (subset(B,C)<-> (all D (member(D,B)->member(D,C)))).
% 1.93/2.09 all B subset(B,B).
% 1.93/2.09 -(all B C (subset(B,C)&subset(C,B)->B=C)).
% 1.93/2.09 end_of_list.
% 1.93/2.09
% 1.93/2.09 -------> usable clausifies to:
% 1.93/2.09
% 1.93/2.09 list(usable).
% 1.93/2.09 0 [] A=A.
% 1.93/2.09 0 [] B!=C|subset(B,C).
% 1.93/2.09 0 [] B!=C|subset(C,B).
% 1.93/2.09 0 [] B=C| -subset(B,C)| -subset(C,B).
% 1.93/2.09 0 [] -subset(B,C)| -member(D,B)|member(D,C).
% 1.93/2.09 0 [] subset(B,C)|member($f1(B,C),B).
% 1.93/2.09 0 [] subset(B,C)| -member($f1(B,C),C).
% 1.93/2.09 0 [] subset(B,B).
% 1.93/2.09 0 [] subset($c2,$c1).
% 1.93/2.09 0 [] subset($c1,$c2).
% 1.93/2.09 0 [] $c2!=$c1.
% 1.93/2.09 end_of_list.
% 1.93/2.09
% 1.93/2.09 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.93/2.09
% 1.93/2.09 This ia a non-Horn set with equality. The strategy will be
% 1.93/2.09 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.93/2.09 deletion, with positive clauses in sos and nonpositive
% 1.93/2.09 clauses in usable.
% 1.93/2.09
% 1.93/2.09 dependent: set(knuth_bendix).
% 1.93/2.09 dependent: set(anl_eq).
% 1.93/2.09 dependent: set(para_from).
% 1.93/2.09 dependent: set(para_into).
% 1.93/2.09 dependent: clear(para_from_right).
% 1.93/2.09 dependent: clear(para_into_right).
% 1.93/2.09 dependent: set(para_from_vars).
% 1.93/2.09 dependent: set(eq_units_both_ways).
% 1.93/2.09 dependent: set(dynamic_demod_all).
% 1.93/2.09 dependent: set(dynamic_demod).
% 1.93/2.09 dependent: set(order_eq).
% 1.93/2.09 dependent: set(back_demod).
% 1.93/2.09 dependent: set(lrpo).
% 1.93/2.09 dependent: set(hyper_res).
% 1.93/2.09 dependent: set(unit_deletion).
% 1.93/2.09 dependent: set(factor).
% 1.93/2.09
% 1.93/2.09 ------------> process usable:
% 1.93/2.09 ** KEPT (pick-wt=6): 1 [] A!=B|subset(A,B).
% 1.93/2.09 ** KEPT (pick-wt=6): 2 [] A!=B|subset(B,A).
% 1.93/2.09 ** KEPT (pick-wt=9): 3 [] A=B| -subset(A,B)| -subset(B,A).
% 1.93/2.09 ** KEPT (pick-wt=9): 4 [] -subset(A,B)| -member(C,A)|member(C,B).
% 1.93/2.09 ** KEPT (pick-wt=8): 5 [] subset(A,B)| -member($f1(A,B),B).
% 1.93/2.09 ** KEPT (pick-wt=3): 6 [] $c2!=$c1.
% 1.93/2.09
% 1.93/2.09 ------------> process sos:
% 1.93/2.09 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.93/2.09 ** KEPT (pick-wt=8): 9 [] subset(A,B)|member($f1(A,B),A).
% 1.93/2.09 ** KEPT (pick-wt=3): 10 [] subset(A,A).
% 1.93/2.09 ** KEPT (pick-wt=3): 11 [] subset($c2,$c1).
% 1.93/2.09 ** KEPT (pick-wt=3): 12 [] subset($c1,$c2).
% 1.93/2.09 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.93/2.09 8 back subsumes 7.
% 1.93/2.09
% 1.93/2.09 ======= end of input processing =======
% 1.93/2.09
% 1.93/2.09 =========== start of search ===========
% 1.93/2.09
% 1.93/2.09 -------- PROOF --------
% 1.93/2.09
% 1.93/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,15.1,6.1] $F.
% 1.93/2.09
% 1.93/2.09 Length of proof is 1. Level of proof is 1.
% 1.93/2.09
% 1.93/2.09 ---------------- PROOF ----------------
% 1.93/2.09 % SZS status Theorem
% 1.93/2.09 % SZS output start Refutation
% See solution above
% 1.93/2.09 ------------ end of proof -------------
% 1.93/2.09
% 1.93/2.09
% 1.93/2.09 Search stopped by max_proofs option.
% 1.93/2.09
% 1.93/2.09
% 1.93/2.09 Search stopped by max_proofs option.
% 1.93/2.09
% 1.93/2.09 ============ end of search ============
% 1.93/2.09
% 1.93/2.09 -------------- statistics -------------
% 1.93/2.09 clauses given 4
% 1.93/2.09 clauses generated 10
% 1.93/2.09 clauses kept 15
% 1.93/2.09 clauses forward subsumed 7
% 1.93/2.09 clauses back subsumed 1
% 1.93/2.09 Kbytes malloced 976
% 1.93/2.09
% 1.93/2.09 ----------- times (seconds) -----------
% 1.93/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.93/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.93/2.09
% 1.93/2.09 That finishes the proof of the theorem.
% 1.93/2.09
% 1.93/2.09 Process 3921 finished Wed Jul 27 10:25:03 2022
% 1.93/2.09 Otter interrupted
% 1.93/2.09 PROOF FOUND
%------------------------------------------------------------------------------