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