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