TSTP Solution File: SWW469+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:22:35 EDT 2022
% Result : Theorem 1.56s 1.78s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 0 nHn; 11 RR)
% Number of literals : 17 ( 6 equ; 6 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ hoare_165779456gleton
| is_state(dollar_c2) ),
file('SWW469+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ hoare_165779456gleton
| is_state(dollar_c1) ),
file('SWW469+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ hoare_165779456gleton
| dollar_c2 != dollar_c1 ),
file('SWW469+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ is_state(A)
| A = dollar_c3 ),
file('SWW469+1.p',unknown),
[] ).
cnf(8,axiom,
A = A,
file('SWW469+1.p',unknown),
[] ).
cnf(11,axiom,
hoare_165779456gleton,
file('SWW469+1.p',unknown),
[] ).
cnf(13,plain,
is_state(dollar_c1),
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(14,plain,
is_state(dollar_c2),
inference(hyper,[status(thm)],[11,1]),
[iquote('hyper,11,1')] ).
cnf(16,plain,
dollar_c3 = dollar_c1,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[13,6])]),
[iquote('hyper,13,6,flip.1')] ).
cnf(17,plain,
( ~ is_state(A)
| A = dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[6]),16]),
[iquote('back_demod,6,demod,16')] ).
cnf(19,plain,
dollar_c2 = dollar_c1,
inference(hyper,[status(thm)],[17,14]),
[iquote('hyper,17,14')] ).
cnf(22,plain,
$false,
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),19]),11,8]),
[iquote('back_demod,3,demod,19,unit_del,11,8')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW469+1 : TPTP v8.1.0. Released v5.3.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n003.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 02:50:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.56/1.78 ----- Otter 3.3f, August 2004 -----
% 1.56/1.78 The process was started by sandbox2 on n003.cluster.edu,
% 1.56/1.78 Wed Jul 27 02:50:56 2022
% 1.56/1.78 The command was "./otter". The process ID is 32736.
% 1.56/1.78
% 1.56/1.78 set(prolog_style_variables).
% 1.56/1.78 set(auto).
% 1.56/1.78 dependent: set(auto1).
% 1.56/1.78 dependent: set(process_input).
% 1.56/1.78 dependent: clear(print_kept).
% 1.56/1.78 dependent: clear(print_new_demod).
% 1.56/1.78 dependent: clear(print_back_demod).
% 1.56/1.78 dependent: clear(print_back_sub).
% 1.56/1.78 dependent: set(control_memory).
% 1.56/1.78 dependent: assign(max_mem, 12000).
% 1.56/1.78 dependent: assign(pick_given_ratio, 4).
% 1.56/1.78 dependent: assign(stats_level, 1).
% 1.56/1.78 dependent: assign(max_seconds, 10800).
% 1.56/1.78 clear(print_given).
% 1.56/1.78
% 1.56/1.78 formula_list(usable).
% 1.56/1.78 all A (A=A).
% 1.56/1.78 is_state(undefined_state(state)).
% 1.56/1.78 hoare_165779456gleton<-> (exists S T (is_state(S)&is_state(T)&S!=T)).
% 1.56/1.78 -induct_false.
% 1.56/1.78 induct_true.
% 1.56/1.78 induct_true.
% 1.56/1.78 hoare_165779456gleton.
% 1.56/1.78 -(all T (is_state(T)-> -(all S (is_state(S)->S=T)))).
% 1.56/1.78 end_of_list.
% 1.56/1.78
% 1.56/1.78 -------> usable clausifies to:
% 1.56/1.78
% 1.56/1.78 list(usable).
% 1.56/1.78 0 [] A=A.
% 1.56/1.78 0 [] is_state(undefined_state(state)).
% 1.56/1.78 0 [] -hoare_165779456gleton|is_state($c2).
% 1.56/1.78 0 [] -hoare_165779456gleton|is_state($c1).
% 1.56/1.78 0 [] -hoare_165779456gleton|$c2!=$c1.
% 1.56/1.78 0 [] hoare_165779456gleton| -is_state(S)| -is_state(T)|S=T.
% 1.56/1.78 0 [] -induct_false.
% 1.56/1.78 0 [] induct_true.
% 1.56/1.78 0 [] induct_true.
% 1.56/1.78 0 [] hoare_165779456gleton.
% 1.56/1.78 0 [] is_state($c3).
% 1.56/1.78 0 [] -is_state(S)|S=$c3.
% 1.56/1.78 end_of_list.
% 1.56/1.78
% 1.56/1.78 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.56/1.78
% 1.56/1.78 This ia a non-Horn set with equality. The strategy will be
% 1.56/1.78 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.56/1.78 deletion, with positive clauses in sos and nonpositive
% 1.56/1.78 clauses in usable.
% 1.56/1.78
% 1.56/1.78 dependent: set(knuth_bendix).
% 1.56/1.78 dependent: set(anl_eq).
% 1.56/1.78 dependent: set(para_from).
% 1.56/1.78 dependent: set(para_into).
% 1.56/1.78 dependent: clear(para_from_right).
% 1.56/1.78 dependent: clear(para_into_right).
% 1.56/1.78 dependent: set(para_from_vars).
% 1.56/1.78 dependent: set(eq_units_both_ways).
% 1.56/1.78 dependent: set(dynamic_demod_all).
% 1.56/1.78 dependent: set(dynamic_demod).
% 1.56/1.78 dependent: set(order_eq).
% 1.56/1.78 dependent: set(back_demod).
% 1.56/1.78 dependent: set(lrpo).
% 1.56/1.78 dependent: set(hyper_res).
% 1.56/1.78 dependent: set(unit_deletion).
% 1.56/1.78 dependent: set(factor).
% 1.56/1.78
% 1.56/1.78 ------------> process usable:
% 1.56/1.78 ** KEPT (pick-wt=3): 1 [] -hoare_165779456gleton|is_state($c2).
% 1.56/1.78 ** KEPT (pick-wt=3): 2 [] -hoare_165779456gleton|is_state($c1).
% 1.56/1.78 ** KEPT (pick-wt=4): 3 [] -hoare_165779456gleton|$c2!=$c1.
% 1.56/1.78 ** KEPT (pick-wt=8): 4 [] hoare_165779456gleton| -is_state(A)| -is_state(B)|A=B.
% 1.56/1.78 ** KEPT (pick-wt=1): 5 [] -induct_false.
% 1.56/1.78 ** KEPT (pick-wt=5): 6 [] -is_state(A)|A=$c3.
% 1.56/1.78
% 1.56/1.78 ------------> process sos:
% 1.56/1.78 ** KEPT (pick-wt=3): 8 [] A=A.
% 1.56/1.78 ** KEPT (pick-wt=3): 9 [] is_state(undefined_state(state)).
% 1.56/1.78 ** KEPT (pick-wt=1): 10 [] induct_true.
% 1.56/1.78 Following clause subsumed by 10 during input processing: 0 [] induct_true.
% 1.56/1.78 ** KEPT (pick-wt=1): 11 [] hoare_165779456gleton.
% 1.56/1.78 ** KEPT (pick-wt=2): 12 [] is_state($c3).
% 1.56/1.78 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] A=A.
% 1.56/1.78 8 back subsumes 7.
% 1.56/1.78 11 back subsumes 4.
% 1.56/1.78
% 1.56/1.78 ======= end of input processing =======
% 1.56/1.78
% 1.56/1.78 =========== start of search ===========
% 1.56/1.78
% 1.56/1.78 -------- PROOF --------
% 1.56/1.78
% 1.56/1.78 -----> EMPTY CLAUSE at 0.00 sec ----> 22 [back_demod,3,demod,19,unit_del,11,8] $F.
% 1.56/1.78
% 1.56/1.78 Length of proof is 5. Level of proof is 4.
% 1.56/1.78
% 1.56/1.78 ---------------- PROOF ----------------
% 1.56/1.78 % SZS status Theorem
% 1.56/1.78 % SZS output start Refutation
% See solution above
% 1.56/1.78 ------------ end of proof -------------
% 1.56/1.78
% 1.56/1.78
% 1.56/1.78 Search stopped by max_proofs option.
% 1.56/1.78
% 1.56/1.78
% 1.56/1.78 Search stopped by max_proofs option.
% 1.56/1.78
% 1.56/1.78 ============ end of search ============
% 1.56/1.78
% 1.56/1.78 -------------- statistics -------------
% 1.56/1.78 clauses given 9
% 1.56/1.78 clauses generated 11
% 1.56/1.78 clauses kept 18
% 1.56/1.78 clauses forward subsumed 9
% 1.56/1.78 clauses back subsumed 4
% 1.56/1.78 Kbytes malloced 976
% 1.56/1.78
% 1.56/1.78 ----------- times (seconds) -----------
% 1.56/1.78 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.56/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.56/1.78 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.56/1.78
% 1.56/1.78 That finishes the proof of the theorem.
% 1.56/1.78
% 1.56/1.78 Process 32736 finished Wed Jul 27 02:50:58 2022
% 1.56/1.78 Otter interrupted
% 1.56/1.78 PROOF FOUND
%------------------------------------------------------------------------------