TSTP Solution File: SEU090+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n027.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 : Tue Jul 19 11:53:06 EDT 2022
% Result : Theorem 0.14s 0.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU090+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jun 19 09:00:23 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.37 % SZS status Theorem
% 0.14/0.37 % SZS output begin IncompleteProof
% 0.14/0.37 cnf(c0, axiom,
% 0.14/0.37 ~finite(cartesian_product2(cartesian_product3(sK32,sK33,sK34),sK35))).
% 0.14/0.37 cnf(c1, plain,
% 0.14/0.37 ~finite(cartesian_product2(cartesian_product3(sK32,sK33,sK34),sK35)),
% 0.14/0.37 inference(start, [], [c0])).
% 0.14/0.37
% 0.14/0.37 cnf(c2, axiom,
% 0.14/0.37 finite(cartesian_product2(X0,X1)) | ~finite(X1) | ~finite(X0)).
% 0.14/0.37 cnf(a0, assumption,
% 0.14/0.37 cartesian_product2(cartesian_product3(sK32,sK33,sK34),sK35) = cartesian_product2(X0,X1)).
% 0.14/0.37 cnf(c3, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37 cnf(c4, plain,
% 0.14/0.37 ~finite(X1) | ~finite(X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 0.14/0.37
% 0.14/0.37 cnf(c5, axiom,
% 0.14/0.37 finite(sK35)).
% 0.14/0.37 cnf(a1, assumption,
% 0.14/0.37 X1 = sK35).
% 0.14/0.37 cnf(c6, plain,
% 0.14/0.37 ~finite(X0),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.14/0.37 cnf(c7, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 0.14/0.37
% 0.14/0.37 cnf(c8, axiom,
% 0.14/0.37 finite(cartesian_product3(X2,X3,X4)) | ~finite(X4) | ~finite(X3) | ~finite(X2)).
% 0.14/0.37 cnf(a2, assumption,
% 0.14/0.37 X0 = cartesian_product3(X2,X3,X4)).
% 0.14/0.37 cnf(c9, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.14/0.37 cnf(c10, plain,
% 0.14/0.37 ~finite(X4) | ~finite(X3) | ~finite(X2),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a2])], [c6, c8])).
% 0.14/0.37
% 0.14/0.37 cnf(c11, axiom,
% 0.14/0.37 finite(sK34)).
% 0.14/0.37 cnf(a3, assumption,
% 0.14/0.37 X4 = sK34).
% 0.14/0.37 cnf(c12, plain,
% 0.14/0.37 ~finite(X3) | ~finite(X2),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.14/0.37 cnf(c13, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 0.14/0.37
% 0.14/0.37 cnf(c14, axiom,
% 0.14/0.37 finite(sK33)).
% 0.14/0.37 cnf(a4, assumption,
% 0.14/0.37 X3 = sK33).
% 0.14/0.37 cnf(c15, plain,
% 0.14/0.37 ~finite(X2),
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.14/0.37 cnf(c16, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a4])], [c12, c14])).
% 0.14/0.37
% 0.14/0.37 cnf(c17, axiom,
% 0.14/0.37 finite(sK32)).
% 0.14/0.37 cnf(a5, assumption,
% 0.14/0.37 X2 = sK32).
% 0.14/0.37 cnf(c18, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.14/0.37 cnf(c19, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(strict_predicate_extension, [assumptions([a5])], [c15, c17])).
% 0.14/0.37
% 0.14/0.37 cnf(c20, plain,
% 0.14/0.37 $false,
% 0.14/0.37 inference(constraint_solving, [
% 0.14/0.37 bind(X0, cartesian_product3(sK32,sK33,sK34)),
% 0.14/0.37 bind(X1, sK35),
% 0.14/0.37 bind(X2, sK32),
% 0.14/0.37 bind(X3, sK33),
% 0.14/0.37 bind(X4, sK34)
% 0.14/0.37 ],
% 0.14/0.37 [a0, a1, a2, a3, a4, a5])).
% 0.14/0.37
% 0.14/0.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------