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