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