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