TSTP Solution File: SET820-2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SET820-2 : 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 : n012.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 02:48:19 EDT 2022
% Result : Unsatisfiable 0.12s 0.34s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET820-2 : TPTP v8.1.0. Released v3.2.0.
% 0.10/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.12/0.33 % Computer : n012.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 : 600
% 0.12/0.33 % DateTime : Sat Jul 9 18:49:28 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34 % SZS status Unsatisfiable
% 0.12/0.34 % SZS output begin IncompleteProof
% 0.12/0.34 cnf(c0, axiom,
% 0.12/0.34 c_in(v_x(X0),X0,tc_IntDef_Oint) | ~c_in(X1,X0,tc_IntDef_Oint)).
% 0.12/0.34 cnf(c1, plain,
% 0.12/0.34 c_in(v_x(X0),X0,tc_IntDef_Oint) | ~c_in(X1,X0,tc_IntDef_Oint),
% 0.12/0.34 inference(start, [], [c0])).
% 0.12/0.34
% 0.12/0.34 cnf(c2, axiom,
% 0.12/0.34 X2 = X3 | c_in(X2,X4,X5) | ~c_in(X2,c_insert(X3,X4,X5),X5)).
% 0.12/0.34 cnf(a0, assumption,
% 0.12/0.34 v_x(X0) = X2).
% 0.12/0.34 cnf(a1, assumption,
% 0.12/0.34 X0 = c_insert(X3,X4,X5)).
% 0.12/0.34 cnf(a2, assumption,
% 0.12/0.34 tc_IntDef_Oint = X5).
% 0.12/0.34 cnf(c3, plain,
% 0.12/0.34 ~c_in(X1,X0,tc_IntDef_Oint),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34 cnf(c4, plain,
% 0.12/0.34 X2 = X3 | c_in(X2,X4,X5),
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a0, a1, a2])], [c1, c2])).
% 0.12/0.34
% 0.12/0.34 cnf(c5, axiom,
% 0.12/0.34 ~v_P(v_x(X6)) | ~c_in(X7,X6,tc_IntDef_Oint)).
% 0.12/0.34 cnf(a3, assumption,
% 0.12/0.34 v_x(X6) = X2).
% 0.12/0.34 cnf(c6, plain,
% 0.12/0.34 c_in(X2,X4,X5),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.12/0.34 cnf(c7, plain,
% 0.12/0.34 ~c_in(X7,X6,tc_IntDef_Oint),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.12/0.34 cnf(c8, plain,
% 0.12/0.34 ~v_P(X3),
% 0.12/0.34 inference(strict_subterm_extension, [assumptions([a3])], [c4, c5])).
% 0.12/0.34
% 0.12/0.34 cnf(c9, axiom,
% 0.12/0.34 v_P(v_a)).
% 0.12/0.34 cnf(a4, assumption,
% 0.12/0.34 X3 = v_a).
% 0.12/0.34 cnf(c10, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c8, c9])).
% 0.12/0.34 cnf(c11, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a4])], [c8, c9])).
% 0.12/0.34
% 0.12/0.34 cnf(c12, plain,
% 0.12/0.34 c_in(v_x(X0),X0,tc_IntDef_Oint)).
% 0.12/0.34 cnf(a5, assumption,
% 0.12/0.34 X7 = v_x(X0)).
% 0.12/0.34 cnf(a6, assumption,
% 0.12/0.34 X6 = X0).
% 0.12/0.34 cnf(a7, assumption,
% 0.12/0.34 tc_IntDef_Oint = tc_IntDef_Oint).
% 0.12/0.34 cnf(c13, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(predicate_reduction, [assumptions([a5, a6, a7])], [c7, c12])).
% 0.12/0.34
% 0.12/0.34 cnf(c14, axiom,
% 0.12/0.34 ~c_in(X8,c_emptyset,X9)).
% 0.12/0.34 cnf(a8, assumption,
% 0.12/0.34 X2 = X8).
% 0.12/0.34 cnf(a9, assumption,
% 0.12/0.34 X4 = c_emptyset).
% 0.12/0.34 cnf(a10, assumption,
% 0.12/0.34 X5 = X9).
% 0.12/0.34 cnf(c15, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c6, c14])).
% 0.12/0.34 cnf(c16, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a8, a9, a10])], [c6, c14])).
% 0.12/0.34
% 0.12/0.34 cnf(c17, axiom,
% 0.12/0.34 c_in(X10,c_insert(X10,X11,X12),X12)).
% 0.12/0.34 cnf(a11, assumption,
% 0.12/0.34 X1 = X10).
% 0.12/0.34 cnf(a12, assumption,
% 0.12/0.34 X0 = c_insert(X10,X11,X12)).
% 0.12/0.34 cnf(a13, assumption,
% 0.12/0.34 tc_IntDef_Oint = X12).
% 0.12/0.34 cnf(c18, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c3, c17])).
% 0.12/0.34 cnf(c19, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(strict_predicate_extension, [assumptions([a11, a12, a13])], [c3, c17])).
% 0.12/0.34
% 0.12/0.34 cnf(c20, plain,
% 0.12/0.34 $false,
% 0.12/0.34 inference(constraint_solving, [
% 0.12/0.34 bind(X0, c_insert(X3,X4,X5)),
% 0.12/0.34 bind(X1, v_a),
% 0.12/0.34 bind(X2, v_x(X0)),
% 0.12/0.34 bind(X3, v_a),
% 0.12/0.34 bind(X4, c_emptyset),
% 0.12/0.34 bind(X5, tc_IntDef_Oint),
% 0.12/0.34 bind(X6, c_insert(X3,X4,X5)),
% 0.12/0.34 bind(X7, v_x(X0)),
% 0.12/0.34 bind(X8, v_x(X0)),
% 0.12/0.34 bind(X9, tc_IntDef_Oint),
% 0.12/0.34 bind(X10, v_a),
% 0.12/0.34 bind(X11, c_emptyset),
% 0.12/0.34 bind(X12, tc_IntDef_Oint)
% 0.12/0.34 ],
% 0.12/0.34 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13])).
% 0.12/0.34
% 0.12/0.34 % SZS output end IncompleteProof
%------------------------------------------------------------------------------