TSTP Solution File: CSR113+26 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR113+26 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 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 : 600s
% DateTime : Fri Jul 15 20:37:23 EDT 2022
% Result : Theorem 0.70s 0.60s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : CSR113+26 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.35 % Computer : n018.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sat Jun 11 04:30:10 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.70/0.60 % SZS status Theorem
% 0.70/0.60 % SZS output begin IncompleteProof
% 0.70/0.60 cnf(c0, axiom,
% 0.70/0.60 ~val(X0,usa_0) | ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0)).
% 0.70/0.60 cnf(c1, plain,
% 0.70/0.60 ~val(X0,usa_0) | ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0),
% 0.70/0.60 inference(start, [], [c0])).
% 0.70/0.60
% 0.70/0.60 cnf(c2, axiom,
% 0.70/0.60 val(c33,usa_0)).
% 0.70/0.60 cnf(a0, assumption,
% 0.70/0.60 X0 = c33).
% 0.70/0.60 cnf(a1, assumption,
% 0.70/0.60 usa_0 = usa_0).
% 0.70/0.60 cnf(c3, plain,
% 0.70/0.60 ~subs(X1,stehen_1_1) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.70/0.60 cnf(c4, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 0.70/0.60
% 0.70/0.60 cnf(c5, axiom,
% 0.70/0.60 subs(sK111(X5,X6),stehen_1_1) | ~sP48(X5,X6)).
% 0.70/0.60 cnf(a2, assumption,
% 0.70/0.60 X1 = sK111(X5,X6)).
% 0.70/0.60 cnf(a3, assumption,
% 0.70/0.60 stehen_1_1 = stehen_1_1).
% 0.70/0.60 cnf(c6, plain,
% 0.70/0.60 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.70/0.60 cnf(c7, plain,
% 0.70/0.60 ~sP48(X5,X6),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 0.70/0.60
% 0.70/0.60 cnf(c8, axiom,
% 0.70/0.60 sP48(X7,X8) | ~loc(X7,X8)).
% 0.70/0.60 cnf(a4, assumption,
% 0.70/0.60 X5 = X7).
% 0.70/0.60 cnf(a5, assumption,
% 0.70/0.60 X6 = X8).
% 0.70/0.60 cnf(c9, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.70/0.60 cnf(c10, plain,
% 0.70/0.60 ~loc(X7,X8),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a4, a5])], [c7, c8])).
% 0.70/0.60
% 0.70/0.60 cnf(c11, axiom,
% 0.70/0.60 loc(c9,c35)).
% 0.70/0.60 cnf(a6, assumption,
% 0.70/0.60 X7 = c9).
% 0.70/0.60 cnf(a7, assumption,
% 0.70/0.60 X8 = c35).
% 0.70/0.60 cnf(c12, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.70/0.60 cnf(c13, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a6, a7])], [c10, c11])).
% 0.70/0.60
% 0.70/0.60 cnf(c14, axiom,
% 0.70/0.60 sub(c33,name_1_1)).
% 0.70/0.60 cnf(a8, assumption,
% 0.70/0.60 X0 = c33).
% 0.70/0.60 cnf(a9, assumption,
% 0.70/0.60 name_1_1 = name_1_1).
% 0.70/0.60 cnf(c15, plain,
% 0.70/0.60 ~scar(X1,X2) | ~loc(X1,X3) | ~attr(X4,X0),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.70/0.60 cnf(c16, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a8, a9])], [c6, c14])).
% 0.70/0.60
% 0.70/0.60 cnf(c17, axiom,
% 0.70/0.60 scar(sK111(X9,X10),X9) | ~sP48(X9,X10)).
% 0.70/0.60 cnf(a10, assumption,
% 0.70/0.60 X1 = sK111(X9,X10)).
% 0.70/0.60 cnf(a11, assumption,
% 0.70/0.60 X2 = X9).
% 0.70/0.60 cnf(c18, plain,
% 0.70/0.60 ~loc(X1,X3) | ~attr(X4,X0),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.70/0.60 cnf(c19, plain,
% 0.70/0.60 ~sP48(X9,X10),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a10, a11])], [c15, c17])).
% 0.70/0.60
% 0.70/0.60 cnf(c20, plain,
% 0.70/0.60 sP48(X5,X6)).
% 0.70/0.60 cnf(a12, assumption,
% 0.70/0.60 X9 = X5).
% 0.70/0.60 cnf(a13, assumption,
% 0.70/0.60 X10 = X6).
% 0.70/0.60 cnf(c21, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(predicate_reduction, [assumptions([a12, a13])], [c19, c20])).
% 0.70/0.60
% 0.70/0.60 cnf(c22, axiom,
% 0.70/0.60 loc(sK111(X11,X12),X12) | ~sP48(X11,X12)).
% 0.70/0.60 cnf(a14, assumption,
% 0.70/0.60 X1 = sK111(X11,X12)).
% 0.70/0.60 cnf(a15, assumption,
% 0.70/0.60 X3 = X12).
% 0.70/0.60 cnf(c23, plain,
% 0.70/0.60 ~attr(X4,X0),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])).
% 0.70/0.60 cnf(c24, plain,
% 0.70/0.60 ~sP48(X11,X12),
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a14, a15])], [c18, c22])).
% 0.70/0.60
% 0.70/0.60 cnf(c25, plain,
% 0.70/0.60 sP48(X5,X6)).
% 0.70/0.60 cnf(a16, assumption,
% 0.70/0.60 X11 = X5).
% 0.70/0.60 cnf(a17, assumption,
% 0.70/0.60 X12 = X6).
% 0.70/0.60 cnf(c26, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(predicate_reduction, [assumptions([a16, a17])], [c24, c25])).
% 0.70/0.60
% 0.70/0.60 cnf(c27, axiom,
% 0.70/0.60 attr(c32,c33)).
% 0.70/0.60 cnf(a18, assumption,
% 0.70/0.60 X4 = c32).
% 0.70/0.60 cnf(a19, assumption,
% 0.70/0.60 X0 = c33).
% 0.70/0.60 cnf(c28, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])).
% 0.70/0.60 cnf(c29, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(strict_predicate_extension, [assumptions([a18, a19])], [c23, c27])).
% 0.70/0.60
% 0.70/0.60 cnf(c30, plain,
% 0.70/0.60 $false,
% 0.70/0.60 inference(constraint_solving, [
% 0.70/0.60 bind(X0, c33),
% 0.70/0.60 bind(X1, sK111(X5,X6)),
% 0.70/0.60 bind(X2, c9),
% 0.70/0.60 bind(X3, c35),
% 0.70/0.60 bind(X4, c32),
% 0.70/0.60 bind(X5, c9),
% 0.70/0.60 bind(X6, c35),
% 0.70/0.60 bind(X7, c9),
% 0.70/0.60 bind(X8, c35),
% 0.70/0.60 bind(X9, c9),
% 0.70/0.60 bind(X10, c35),
% 0.70/0.60 bind(X11, c9),
% 0.70/0.60 bind(X12, c35)
% 0.70/0.60 ],
% 0.70/0.60 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19])).
% 0.70/0.60
% 0.70/0.60 % SZS output end IncompleteProof
%------------------------------------------------------------------------------