%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.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:01:24 EDT 2022
% Result : Theorem 1.72s 1.93s
% Output : Refutation 1.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 7 unt; 3 nHn; 12 RR)
% Number of literals : 39 ( 0 equ; 24 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ cowlNothing(A),
file('KRS139+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ xsd_string(A)
| ~ xsd_integer(A) ),
file('KRS139+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ rpath(A,B)
| rpath(B,A) ),
file('KRS139+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iGhent) ),
file('KRS139+1.p',unknown),
[] ).
cnf(5,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iGhent) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[4]),1]),
[iquote('copy,4,unit_del,1')] ).
cnf(6,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iGhent) ),
file('KRS139+1.p',unknown),
[] ).
cnf(7,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cowlThing(iAntwerp)
| ~ rpath(iAntwerp,iGhent)
| ~ cowlThing(iGhent) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[6]),1]),
[iquote('copy,6,unit_del,1')] ).
cnf(8,axiom,
cowlThing(A),
file('KRS139+1.p',unknown),
[] ).
cnf(9,axiom,
( xsd_string(A)
| xsd_integer(A) ),
file('KRS139+1.p',unknown),
[] ).
cnf(10,axiom,
rpath(iGhent,iAntwerp),
file('KRS139+1.p',unknown),
[] ).
cnf(11,plain,
rpath(iAntwerp,iGhent),
inference(hyper,[status(thm)],[10,3]),
[iquote('hyper,10,3')] ).
cnf(12,plain,
xsd_integer(dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,7,8,8,11,8])]),
[iquote('hyper,9,7,8,8,11,8,factor_simp')] ).
cnf(13,plain,
xsd_string(dollar_c2),
inference(hyper,[status(thm)],[12,5,8,8,11,8]),
[iquote('hyper,12,5,8,8,11,8')] ).
cnf(14,plain,
$false,
inference(hyper,[status(thm)],[13,2,12]),
[iquote('hyper,13,2,12')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS139+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/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 03:29:41 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.72/1.93 ----- Otter 3.3f, August 2004 -----
% 1.72/1.93 The process was started by sandbox on n003.cluster.edu,
% 1.72/1.93 Wed Jul 27 03:29:41 2022
% 1.72/1.93 The command was "./otter". The process ID is 5403.
% 1.72/1.93
% 1.72/1.93 set(prolog_style_variables).
% 1.72/1.93 set(auto).
% 1.72/1.93 dependent: set(auto1).
% 1.72/1.93 dependent: set(process_input).
% 1.72/1.93 dependent: clear(print_kept).
% 1.72/1.93 dependent: clear(print_new_demod).
% 1.72/1.93 dependent: clear(print_back_demod).
% 1.72/1.93 dependent: clear(print_back_sub).
% 1.72/1.93 dependent: set(control_memory).
% 1.72/1.93 dependent: assign(max_mem, 12000).
% 1.72/1.93 dependent: assign(pick_given_ratio, 4).
% 1.72/1.93 dependent: assign(stats_level, 1).
% 1.72/1.93 dependent: assign(max_seconds, 10800).
% 1.72/1.93 clear(print_given).
% 1.72/1.93
% 1.72/1.93 formula_list(usable).
% 1.72/1.93 all X (cowlThing(X)& -cowlNothing(X)).
% 1.72/1.93 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.72/1.93 all X Y (rpath(X,Y)->rpath(Y,X)).
% 1.72/1.93 cowlThing(iAntwerp).
% 1.72/1.93 cowlThing(iGhent).
% 1.72/1.93 rpath(iGhent,iAntwerp).
% 1.72/1.93 -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))&cowlThing(iAntwerp)&rpath(iAntwerp,iGhent)&cowlThing(iGhent)).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 -------> usable clausifies to:
% 1.72/1.93
% 1.72/1.93 list(usable).
% 1.72/1.93 0 [] cowlThing(X).
% 1.72/1.93 0 [] -cowlNothing(X).
% 1.72/1.93 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.72/1.93 0 [] xsd_string(X)|xsd_integer(X).
% 1.72/1.93 0 [] -rpath(X,Y)|rpath(Y,X).
% 1.72/1.93 0 [] cowlThing(iAntwerp).
% 1.72/1.93 0 [] cowlThing(iGhent).
% 1.72/1.93 0 [] rpath(iGhent,iAntwerp).
% 1.72/1.93 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 1.72/1.93 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 1.72/1.93 end_of_list.
% 1.72/1.93
% 1.72/1.93 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 1.72/1.93
% 1.72/1.93 This is a non-Horn set without equality. The strategy will
% 1.72/1.93 be ordered hyper_res, unit deletion, and factoring, with
% 1.72/1.93 satellites in sos and with nuclei in usable.
% 1.72/1.93
% 1.72/1.93 dependent: set(hyper_res).
% 1.72/1.93 dependent: set(factor).
% 1.72/1.93 dependent: set(unit_deletion).
% 1.72/1.93
% 1.72/1.93 ------------> process usable:
% 1.72/1.93 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.72/1.93 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.72/1.93 ** KEPT (pick-wt=6): 3 [] -rpath(A,B)|rpath(B,A).
% 1.72/1.93 ** KEPT (pick-wt=13): 5 [copy,4,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 1.72/1.93 ** KEPT (pick-wt=13): 7 [copy,6,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cowlThing(iAntwerp)| -rpath(iAntwerp,iGhent)| -cowlThing(iGhent).
% 1.72/1.93
% 1.72/1.93 ------------> process sos:
% 1.72/1.93 ** KEPT (pick-wt=2): 8 [] cowlThing(A).
% 1.72/1.93 ** KEPT (pick-wt=4): 9 [] xsd_string(A)|xsd_integer(A).
% 1.72/1.93 Following clause subsumed by 8 during input processing: 0 [] cowlThing(iAntwerp).
% 1.72/1.93 Following clause subsumed by 8 during input processing: 0 [] cowlThing(iGhent).
% 1.72/1.93 ** KEPT (pick-wt=3): 10 [] rpath(iGhent,iAntwerp).
% 1.72/1.93
% 1.72/1.93 ======= end of input processing =======
% 1.72/1.93
% 1.72/1.93 =========== start of search ===========
% 1.72/1.93
% 1.72/1.93 -------- PROOF --------
% 1.72/1.93
% 1.72/1.93 -----> EMPTY CLAUSE at 0.00 sec ----> 14 [hyper,13,2,12] $F.
% 1.72/1.93
% 1.72/1.93 Length of proof is 5. Level of proof is 3.
% 1.72/1.93
% 1.72/1.93 ---------------- PROOF ----------------
% 1.72/1.93 % SZS status Theorem
% 1.72/1.93 % SZS output start Refutation
% See solution above
% 1.72/1.93 ------------ end of proof -------------
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93
% 1.72/1.93 Search stopped by max_proofs option.
% 1.72/1.93
% 1.72/1.93 ============ end of search ============
% 1.72/1.93
% 1.72/1.93 -------------- statistics -------------
% 1.72/1.93 clauses given 6
% 1.72/1.93 clauses generated 6
% 1.72/1.93 clauses kept 11
% 1.72/1.93 clauses forward subsumed 4
% 1.72/1.93 clauses back subsumed 2
% 1.72/1.93 Kbytes malloced 976
% 1.72/1.93
% 1.72/1.93 ----------- times (seconds) -----------
% 1.72/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.72/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.72/1.93
% 1.72/1.93 That finishes the proof of the theorem.
% 1.72/1.93
% 1.72/1.93 Process 5403 finished Wed Jul 27 03:29:43 2022
% 1.72/1.93 Otter interrupted
% 1.72/1.93 PROOF FOUND
%------------------------------------------------------------------------------