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