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