TSTP Solution File: KRS135+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n018.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.36s 1.78s
% Output : Refutation 1.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of clauses : 20 ( 7 unt; 9 nHn; 18 RR)
% Number of literals : 54 ( 0 equ; 25 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 7 ( 6 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('KRS135+1.p',unknown),
[] ).
cnf(2,axiom,
( ~ xsd_string(A)
| ~ xsd_integer(A) ),
file('KRS135+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ cowlThing(A)
| ~ rprop(A,B)
| cA(B) ),
file('KRS135+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| rprop(dollar_c4,dollar_c3) ),
file('KRS135+1.p',unknown),
[] ).
cnf(5,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| rprop(dollar_c4,dollar_c3) ),
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)
| ~ cA(dollar_c3) ),
file('KRS135+1.p',unknown),
[] ).
cnf(7,plain,
( ~ cowlThing(dollar_c1)
| xsd_string(dollar_c2)
| ~ xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[6]),1]),
[iquote('copy,6,unit_del,1')] ).
cnf(8,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| rprop(dollar_c4,dollar_c3) ),
file('KRS135+1.p',unknown),
[] ).
cnf(9,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| rprop(dollar_c4,dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[8]),1]),
[iquote('copy,8,unit_del,1')] ).
cnf(10,axiom,
( ~ cowlThing(dollar_c1)
| cowlNothing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
file('KRS135+1.p',unknown),
[] ).
cnf(11,plain,
( ~ cowlThing(dollar_c1)
| ~ xsd_string(dollar_c2)
| xsd_integer(dollar_c2)
| ~ cA(dollar_c3) ),
inference(unit_del,[status(thm)],[inference(copy,[status(thm)],[10]),1]),
[iquote('copy,10,unit_del,1')] ).
cnf(12,axiom,
cowlThing(A),
file('KRS135+1.p',unknown),
[] ).
cnf(13,axiom,
( xsd_string(A)
| xsd_integer(A) ),
file('KRS135+1.p',unknown),
[] ).
cnf(14,plain,
( xsd_integer(dollar_c2)
| rprop(dollar_c4,dollar_c3) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[13,9,12])]),
[iquote('hyper,13,9,12,factor_simp')] ).
cnf(15,plain,
( rprop(dollar_c4,dollar_c3)
| xsd_string(dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[14,5,12])]),
[iquote('hyper,14,5,12,factor_simp')] ).
cnf(16,plain,
rprop(dollar_c4,dollar_c3),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[15,2,14])]),
[iquote('hyper,15,2,14,factor_simp')] ).
cnf(17,plain,
cA(dollar_c3),
inference(hyper,[status(thm)],[16,3,12]),
[iquote('hyper,16,3,12')] ).
cnf(18,plain,
xsd_integer(dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[17,11,12,13])]),
[iquote('hyper,17,11,12,13,factor_simp')] ).
cnf(19,plain,
xsd_string(dollar_c2),
inference(hyper,[status(thm)],[18,7,12,17]),
[iquote('hyper,18,7,12,17')] ).
cnf(20,plain,
$false,
inference(hyper,[status(thm)],[19,2,18]),
[iquote('hyper,19,2,18')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS135+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n018.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:36:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.36/1.78 ----- Otter 3.3f, August 2004 -----
% 1.36/1.78 The process was started by sandbox on n018.cluster.edu,
% 1.36/1.78 Wed Jul 27 03:36:31 2022
% 1.36/1.78 The command was "./otter". The process ID is 18687.
% 1.36/1.78
% 1.36/1.78 set(prolog_style_variables).
% 1.36/1.78 set(auto).
% 1.36/1.78 dependent: set(auto1).
% 1.36/1.78 dependent: set(process_input).
% 1.36/1.78 dependent: clear(print_kept).
% 1.36/1.78 dependent: clear(print_new_demod).
% 1.36/1.78 dependent: clear(print_back_demod).
% 1.36/1.78 dependent: clear(print_back_sub).
% 1.36/1.78 dependent: set(control_memory).
% 1.36/1.78 dependent: assign(max_mem, 12000).
% 1.36/1.78 dependent: assign(pick_given_ratio, 4).
% 1.36/1.78 dependent: assign(stats_level, 1).
% 1.36/1.78 dependent: assign(max_seconds, 10800).
% 1.36/1.78 clear(print_given).
% 1.36/1.78
% 1.36/1.78 formula_list(usable).
% 1.36/1.78 all X (cowlThing(X)& -cowlNothing(X)).
% 1.36/1.78 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.36/1.78 all X (cowlThing(X)-> (all Y (rprop(X,Y)->cA(Y)))).
% 1.36/1.78 -((all X (cowlThing(X)& -cowlNothing(X)))& (all X (xsd_string(X)<-> -xsd_integer(X)))& (all X Y (rprop(X,Y)->cA(Y)))).
% 1.36/1.78 end_of_list.
% 1.36/1.78
% 1.36/1.78 -------> usable clausifies to:
% 1.36/1.78
% 1.36/1.78 list(usable).
% 1.36/1.78 0 [] cowlThing(X).
% 1.36/1.78 0 [] -cowlNothing(X).
% 1.36/1.78 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.36/1.78 0 [] xsd_string(X)|xsd_integer(X).
% 1.36/1.78 0 [] -cowlThing(X)| -rprop(X,Y)|cA(Y).
% 1.36/1.78 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)|rprop($c4,$c3).
% 1.36/1.78 0 [] -cowlThing($c1)|cowlNothing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 1.36/1.78 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)|rprop($c4,$c3).
% 1.36/1.78 0 [] -cowlThing($c1)|cowlNothing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 1.36/1.78 end_of_list.
% 1.36/1.78
% 1.36/1.78 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=5.
% 1.36/1.78
% 1.36/1.78 This is a non-Horn set without equality. The strategy will
% 1.36/1.78 be ordered hyper_res, unit deletion, and factoring, with
% 1.36/1.78 satellites in sos and with nuclei in usable.
% 1.36/1.78
% 1.36/1.78 dependent: set(hyper_res).
% 1.36/1.78 dependent: set(factor).
% 1.36/1.78 dependent: set(unit_deletion).
% 1.36/1.78
% 1.36/1.78 ------------> process usable:
% 1.36/1.78 ** KEPT (pick-wt=2): 1 [] -cowlNothing(A).
% 1.36/1.78 ** KEPT (pick-wt=4): 2 [] -xsd_string(A)| -xsd_integer(A).
% 1.36/1.78 ** KEPT (pick-wt=7): 3 [] -cowlThing(A)| -rprop(A,B)|cA(B).
% 1.36/1.78 ** KEPT (pick-wt=9): 5 [copy,4,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)|rprop($c4,$c3).
% 1.36/1.78 ** KEPT (pick-wt=8): 7 [copy,6,unit_del,1] -cowlThing($c1)|xsd_string($c2)| -xsd_integer($c2)| -cA($c3).
% 1.36/1.78 ** KEPT (pick-wt=9): 9 [copy,8,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)|rprop($c4,$c3).
% 1.36/1.78 ** KEPT (pick-wt=8): 11 [copy,10,unit_del,1] -cowlThing($c1)| -xsd_string($c2)|xsd_integer($c2)| -cA($c3).
% 1.36/1.78
% 1.36/1.78 ------------> process sos:
% 1.36/1.78 ** KEPT (pick-wt=2): 12 [] cowlThing(A).
% 1.36/1.78 ** KEPT (pick-wt=4): 13 [] xsd_string(A)|xsd_integer(A).
% 1.36/1.78
% 1.36/1.78 ======= end of input processing =======
% 1.36/1.78
% 1.36/1.78 =========== start of search ===========
% 1.36/1.78
% 1.36/1.78 -------- PROOF --------
% 1.36/1.78
% 1.36/1.78 -----> EMPTY CLAUSE at 0.00 sec ----> 20 [hyper,19,2,18] $F.
% 1.36/1.78
% 1.36/1.78 Length of proof is 10. Level of proof is 7.
% 1.36/1.78
% 1.36/1.78 ---------------- PROOF ----------------
% 1.36/1.78 % SZS status Theorem
% 1.36/1.78 % SZS output start Refutation
% See solution above
% 1.36/1.78 ------------ end of proof -------------
% 1.36/1.78
% 1.36/1.78
% 1.36/1.78 Search stopped by max_proofs option.
% 1.36/1.78
% 1.36/1.78
% 1.36/1.78 Search stopped by max_proofs option.
% 1.36/1.78
% 1.36/1.78 ============ end of search ============
% 1.36/1.78
% 1.36/1.78 -------------- statistics -------------
% 1.36/1.78 clauses given 8
% 1.36/1.78 clauses generated 9
% 1.36/1.78 clauses kept 15
% 1.36/1.78 clauses forward subsumed 2
% 1.36/1.78 clauses back subsumed 6
% 1.36/1.78 Kbytes malloced 976
% 1.36/1.78
% 1.36/1.78 ----------- times (seconds) -----------
% 1.36/1.78 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.36/1.78 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.36/1.78 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.36/1.78
% 1.36/1.78 That finishes the proof of the theorem.
% 1.36/1.78
% 1.36/1.78 Process 18687 finished Wed Jul 27 03:36:32 2022
% 1.36/1.78 Otter interrupted
% 1.36/1.78 PROOF FOUND
%------------------------------------------------------------------------------