%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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.59s 1.80s
% Output : Refutation 1.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of clauses : 25 ( 6 unt; 14 nHn; 23 RR)
% Number of literals : 80 ( 0 equ; 35 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-1 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 4 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ cowlNothing(A),
file('KRS168+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ xsd_string(A)
| ~ xsd_integer(A) ),
file('KRS168+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cB(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(4,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cB(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[3]),1]),
[iquote('copy,3,unit_del,1')] ).
cnf(5,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(6,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[5]),1]),
[iquote('copy,5,unit_del,1')] ).
cnf(7,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| cB(dollar_c3)
| cA(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(8,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| cB(dollar_c3)
| cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[7]),1]),
[iquote('copy,7,unit_del,1')] ).
cnf(9,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cB(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(10,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cB(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[9]),1]),
[iquote('copy,9,unit_del,1')] ).
cnf(11,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(12,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[11]),1]),
[iquote('copy,11,unit_del,1')] ).
cnf(13,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| cB(dollar_c3)
| cA(dollar_c3) ),
file('KRS168+1.p',unknown),
[] ).
cnf(14,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| cB(dollar_c3)
| cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[13]),1]),
[iquote('copy,13,unit_del,1')] ).
cnf(15,axiom,
cowlThing(A),
file('KRS168+1.p',unknown),
[] ).
cnf(16,axiom,
( xsd_string(A)
| xsd_integer(A) ),
file('KRS168+1.p',unknown),
[] ).
cnf(17,plain,
( xsd_integer(dollar_c2)
| cB(dollar_c3)
| cA(dollar_c3) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[16,14,15])]),
[iquote('hyper,16,14,15,factor_simp')] ).
cnf(18,plain,
( cB(dollar_c3)
| cA(dollar_c3)
| xsd_string(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,8,15])])]),
[iquote('hyper,17,8,15,factor_simp,factor_simp')] ).
cnf(19,plain,
( cB(dollar_c3)
| cA(dollar_c3) ),
inference(factor_simp,[status(thm)],[inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[18,2,17])])]),
[iquote('hyper,18,2,17,factor_simp,factor_simp')] ).
cnf(20,plain,
( cA(dollar_c3)
| xsd_integer(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[19,10,15,16])]),
[iquote('hyper,19,10,15,16,factor_simp')] ).
cnf(21,plain,
( cA(dollar_c3)
| xsd_string(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[20,4,15,19])]),
[iquote('hyper,20,4,15,19,factor_simp')] ).
cnf(22,plain,
cA(dollar_c3),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,2,20])]),
[iquote('hyper,21,2,20,factor_simp')] ).
cnf(23,plain,
xsd_integer(dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[22,12,15,16])]),
[iquote('hyper,22,12,15,16,factor_simp')] ).
cnf(24,plain,
xsd_string(dollar_c2),
inference(hyper,[status(thm)],[23,6,15,22]),
[iquote('hyper,23,6,15,22')] ).
cnf(25,plain,
$false,
inference(hyper,[status(thm)],[24,2,23]),
[iquote('hyper,24,2,23')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS168+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 03:46:36 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.59/1.80 ----- Otter 3.3f, August 2004 -----
% 1.59/1.80 The process was started by sandbox on n027.cluster.edu,
% 1.59/1.80 Wed Jul 27 03:46:36 2022
% 1.59/1.80 The command was "./otter". The process ID is 2043.
% 1.59/1.80
% 1.59/1.80 set(prolog_style_variables).
% 1.59/1.80 set(auto).
% 1.59/1.80 dependent: set(auto1).
% 1.59/1.80 dependent: set(process_input).
% 1.59/1.80 dependent: clear(print_kept).
% 1.59/1.80 dependent: clear(print_new_demod).
% 1.59/1.80 dependent: clear(print_back_demod).
% 1.59/1.80 dependent: clear(print_back_sub).
% 1.59/1.80 dependent: set(control_memory).
% 1.59/1.80 dependent: assign(max_mem, 12000).
% 1.59/1.80 dependent: assign(pick_given_ratio, 4).
% 1.59/1.80 dependent: assign(stats_level, 1).
% 1.59/1.80 dependent: assign(max_seconds, 10800).
% 1.59/1.80 clear(print_given).
% 1.59/1.80
% 1.59/1.80 formula_list(usable).
% 1.59/1.80 all X (cowlThing(X)& -cowlNothing(X)).
% 1.59/1.80 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.59/1.80 -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))& (all X (-cB(X)& -cA(X)<-> -(cA(X)|cB(X))))).
% 1.59/1.80 end_of_list.
% 1.59/1.80
% 1.59/1.80 -------> usable clausifies to:
% 1.59/1.80
% 1.59/1.80 list(usable).
% 1.59/1.80 0 [] cowlThing(X).
% 1.59/1.80 0 [] -cowlNothing(X).
% 1.59/1.80 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.59/1.80 0 [] xsd_string(X)|xsd_integer(X).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cB($c3).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|cB($c3)|cA($c3).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cB($c3).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 1.59/1.80 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|cB($c3)|cA($c3).
% 1.59/1.80 end_of_list.
% 1.59/1.80
% 1.59/1.80 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=6.
% 1.59/1.80
% 1.59/1.80 This is a non-Horn set without equality. The strategy will
% 1.59/1.80 be ordered hyper_res, unit deletion, and factoring, with
% 1.59/1.80 satellites in sos and with nuclei in usable.
% 1.59/1.80
% 1.59/1.80 dependent: set(hyper_res).
% 1.59/1.80 dependent: set(factor).
% 1.59/1.80 dependent: set(unit_deletion).
% 1.59/1.80
% 1.59/1.80 ------------> process usable:
% 1.59/1.80 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.59/1.80 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.59/1.80 ** KEPT (pick-wt=8): 4 [copy,3,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cB($c3).
% 1.59/1.80 ** KEPT (pick-wt=8): 6 [copy,5,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 1.59/1.80 ** KEPT (pick-wt=10): 8 [copy,7,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|cB($c3)|cA($c3).
% 1.59/1.80 ** KEPT (pick-wt=8): 10 [copy,9,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cB($c3).
% 1.59/1.80 ** KEPT (pick-wt=8): 12 [copy,11,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 1.59/1.80 ** KEPT (pick-wt=10): 14 [copy,13,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|cB($c3)|cA($c3).
% 1.59/1.80
% 1.59/1.80 ------------> process sos:
% 1.59/1.80 ** KEPT (pick-wt=2): 15 [] cowlThing(A).
% 1.59/1.80 ** KEPT (pick-wt=4): 16 [] xsd_string(A)|xsd_integer(A).
% 1.59/1.80
% 1.59/1.80 ======= end of input processing =======
% 1.59/1.80
% 1.59/1.80 =========== start of search ===========
% 1.59/1.80
% 1.59/1.80 -------- PROOF --------
% 1.59/1.80
% 1.59/1.80 -----> EMPTY CLAUSE at 0.00 sec ----> 25 [hyper,24,2,23] $F.
% 1.59/1.80
% 1.59/1.80 Length of proof is 14. Level of proof is 9.
% 1.59/1.80
% 1.59/1.80 ---------------- PROOF ----------------
% 1.59/1.80 % SZS status Theorem
% 1.59/1.80 % SZS output start Refutation
% See solution above
% 1.59/1.80 ------------ end of proof -------------
% 1.59/1.80
% 1.59/1.80
% 1.59/1.80 Search stopped by max_proofs option.
% 1.59/1.80
% 1.59/1.80
% 1.59/1.80 Search stopped by max_proofs option.
% 1.59/1.80
% 1.59/1.80 ============ end of search ============
% 1.59/1.80
% 1.59/1.80 -------------- statistics -------------
% 1.59/1.80 clauses given 10
% 1.59/1.80 clauses generated 13
% 1.59/1.80 clauses kept 18
% 1.59/1.80 clauses forward subsumed 4
% 1.59/1.80 clauses back subsumed 11
% 1.59/1.80 Kbytes malloced 976
% 1.59/1.80
% 1.59/1.80 ----------- times (seconds) -----------
% 1.59/1.80 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.80 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.59/1.80 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.59/1.80
% 1.59/1.80 That finishes the proof of the theorem.
% 1.59/1.80
% 1.59/1.80 Process 2043 finished Wed Jul 27 03:46:38 2022
% 1.59/1.80 Otter interrupted
% 1.59/1.80 PROOF FOUND
%------------------------------------------------------------------------------