TSTP Solution File: CSR113+29 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : CSR113+29 : 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 : n029.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 3.09s 0.90s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CSR113+29 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 10 17:49:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 3.09/0.90 % SZS status Theorem
% 3.09/0.90 % SZS output begin IncompleteProof
% 3.09/0.90 cnf(c0, axiom,
% 3.09/0.90 ~val(X0,usa_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0)).
% 3.09/0.90 cnf(c1, plain,
% 3.09/0.90 ~val(X0,usa_0) | ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0),
% 3.09/0.90 inference(start, [], [c0])).
% 3.09/0.90
% 3.09/0.90 cnf(c2, axiom,
% 3.09/0.90 val(c629,usa_0)).
% 3.09/0.90 cnf(a0, assumption,
% 3.09/0.90 X0 = c629).
% 3.09/0.90 cnf(a1, assumption,
% 3.09/0.90 usa_0 = usa_0).
% 3.09/0.90 cnf(c3, plain,
% 3.09/0.90 ~sub(X0,name_1_1) | ~scar(X1,X2) | ~attr(X3,X0),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.09/0.90 cnf(c4, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a0, a1])], [c1, c2])).
% 3.09/0.90
% 3.09/0.90 cnf(c5, axiom,
% 3.09/0.90 sub(c629,name_1_1)).
% 3.09/0.90 cnf(a2, assumption,
% 3.09/0.90 X0 = c629).
% 3.09/0.90 cnf(a3, assumption,
% 3.09/0.90 name_1_1 = name_1_1).
% 3.09/0.90 cnf(c6, plain,
% 3.09/0.90 ~scar(X1,X2) | ~attr(X3,X0),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 3.09/0.90 cnf(c7, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a2, a3])], [c3, c5])).
% 3.09/0.90
% 3.09/0.90 cnf(c8, axiom,
% 3.09/0.90 scar(sK100(X4),X4) | ~sP36(X4)).
% 3.09/0.90 cnf(a4, assumption,
% 3.09/0.90 X1 = sK100(X4)).
% 3.09/0.90 cnf(a5, assumption,
% 3.09/0.90 X2 = X4).
% 3.09/0.90 cnf(c9, plain,
% 3.09/0.90 ~attr(X3,X0),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 3.09/0.90 cnf(c10, plain,
% 3.09/0.90 ~sP36(X4),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a4, a5])], [c6, c8])).
% 3.09/0.90
% 3.09/0.90 cnf(c11, axiom,
% 3.09/0.90 sP36(X5) | ~sub(X6,X7) | ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6)).
% 3.09/0.90 cnf(a6, assumption,
% 3.09/0.90 X4 = X5).
% 3.09/0.90 cnf(c12, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 3.09/0.90 cnf(c13, plain,
% 3.09/0.90 ~sub(X6,X7) | ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 3.09/0.90
% 3.09/0.90 cnf(c14, plain,
% 3.09/0.90 sub(X0,name_1_1)).
% 3.09/0.90 cnf(a7, assumption,
% 3.09/0.90 X6 = X0).
% 3.09/0.90 cnf(a8, assumption,
% 3.09/0.90 X7 = name_1_1).
% 3.09/0.90 cnf(c15, plain,
% 3.09/0.90 ~member(X7,cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil)))) | ~attr(X5,X6),
% 3.09/0.90 inference(predicate_reduction, [assumptions([a7, a8])], [c13, c14])).
% 3.09/0.90
% 3.09/0.90 cnf(c16, axiom,
% 3.09/0.90 member(X8,cons(X9,X10)) | ~member(X8,X10)).
% 3.09/0.90 cnf(a9, assumption,
% 3.09/0.90 X7 = X8).
% 3.09/0.90 cnf(a10, assumption,
% 3.09/0.90 cons(eigenname_1_1,cons(familiename_1_1,cons(name_1_1,nil))) = cons(X9,X10)).
% 3.09/0.90 cnf(c17, plain,
% 3.09/0.90 ~attr(X5,X6),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 3.09/0.90 cnf(c18, plain,
% 3.09/0.90 ~member(X8,X10),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a9, a10])], [c15, c16])).
% 3.09/0.90
% 3.09/0.90 cnf(c19, axiom,
% 3.09/0.90 member(X11,cons(X12,X13)) | ~member(X11,X13)).
% 3.09/0.90 cnf(a11, assumption,
% 3.09/0.90 X8 = X11).
% 3.09/0.90 cnf(a12, assumption,
% 3.09/0.90 X10 = cons(X12,X13)).
% 3.09/0.90 cnf(c20, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 3.09/0.90 cnf(c21, plain,
% 3.09/0.90 ~member(X11,X13),
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a11, a12])], [c18, c19])).
% 3.09/0.90
% 3.09/0.90 cnf(c22, axiom,
% 3.09/0.90 member(X14,cons(X14,X15))).
% 3.09/0.90 cnf(a13, assumption,
% 3.09/0.90 X11 = X14).
% 3.09/0.90 cnf(a14, assumption,
% 3.09/0.90 X13 = cons(X14,X15)).
% 3.09/0.90 cnf(c23, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])).
% 3.09/0.90 cnf(c24, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a13, a14])], [c21, c22])).
% 3.09/0.90
% 3.09/0.90 cnf(c25, axiom,
% 3.09/0.90 attr(c628,c629)).
% 3.09/0.90 cnf(a15, assumption,
% 3.09/0.90 X5 = c628).
% 3.09/0.90 cnf(a16, assumption,
% 3.09/0.90 X6 = c629).
% 3.09/0.90 cnf(c26, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])).
% 3.09/0.90 cnf(c27, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(strict_predicate_extension, [assumptions([a15, a16])], [c17, c25])).
% 3.09/0.90
% 3.09/0.90 cnf(c28, plain,
% 3.09/0.90 attr(X5,X6)).
% 3.09/0.90 cnf(a17, assumption,
% 3.09/0.90 X3 = X5).
% 3.09/0.90 cnf(a18, assumption,
% 3.09/0.90 X0 = X6).
% 3.09/0.90 cnf(c29, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(predicate_reduction, [assumptions([a17, a18])], [c9, c28])).
% 3.09/0.90
% 3.09/0.90 cnf(c30, plain,
% 3.09/0.90 $false,
% 3.09/0.90 inference(constraint_solving, [
% 3.09/0.90 bind(X0, c629),
% 3.09/0.90 bind(X1, sK100(X4)),
% 3.09/0.90 bind(X2, c628),
% 3.09/0.90 bind(X3, c628),
% 3.09/0.90 bind(X4, c628),
% 3.09/0.90 bind(X5, c628),
% 3.09/0.90 bind(X6, c629),
% 3.09/0.90 bind(X7, name_1_1),
% 3.09/0.90 bind(X8, name_1_1),
% 3.09/0.90 bind(X9, eigenname_1_1),
% 3.09/0.90 bind(X10, cons(familiename_1_1,cons(name_1_1,nil))),
% 3.09/0.90 bind(X11, name_1_1),
% 3.09/0.90 bind(X12, familiename_1_1),
% 3.09/0.90 bind(X13, cons(name_1_1,nil)),
% 3.09/0.90 bind(X14, name_1_1),
% 3.09/0.90 bind(X15, nil)
% 3.09/0.90 ],
% 3.09/0.90 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18])).
% 3.09/0.90
% 3.09/0.90 % SZS output end IncompleteProof
%------------------------------------------------------------------------------