TSTP Solution File: SET949+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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 : Thu Aug 31 14:36:24 EDT 2023
% Result : Theorem 0.21s 0.65s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 20
% Syntax : Number of formulae : 36 ( 12 unt; 16 typ; 0 def)
% Number of atoms : 59 ( 31 equ)
% Maximal formula atoms : 28 ( 2 avg)
% Number of connectives : 68 ( 29 ~; 25 |; 12 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 27 ( 11 >; 16 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-4 aty)
% Number of variables : 61 ( 6 sgn; 36 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_24,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_25,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_26,type,
singleton: $i > $i ).
tff(decl_27,type,
empty: $i > $o ).
tff(decl_28,type,
esk1_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_29,type,
esk2_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_30,type,
esk3_3: ( $i * $i * $i ) > $i ).
tff(decl_31,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_32,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_33,type,
esk6_0: $i ).
tff(decl_34,type,
esk7_0: $i ).
tff(decl_35,type,
esk8_0: $i ).
tff(decl_36,type,
esk9_0: $i ).
tff(decl_37,type,
esk10_0: $i ).
fof(t102_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( in(X1,cartesian_product2(X2,X3))
& ! [X4,X5] : ordered_pair(X4,X5) != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t102_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( in(X1,cartesian_product2(X2,X3))
& ! [X4,X5] : ordered_pair(X4,X5) != X1 ),
inference(assume_negation,[status(cth)],[t102_zfmisc_1]) ).
fof(c_0_5,negated_conjecture,
! [X37,X38] :
( in(esk8_0,cartesian_product2(esk9_0,esk10_0))
& ordered_pair(X37,X38) != esk8_0 ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,plain,
! [X28,X29] : ordered_pair(X28,X29) = unordered_pair(unordered_pair(X28,X29),singleton(X28)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_7,plain,
! [X11,X12,X13,X14,X17,X18,X19,X20,X21,X22,X24,X25] :
( ( in(esk1_4(X11,X12,X13,X14),X11)
| ~ in(X14,X13)
| X13 != cartesian_product2(X11,X12) )
& ( in(esk2_4(X11,X12,X13,X14),X12)
| ~ in(X14,X13)
| X13 != cartesian_product2(X11,X12) )
& ( X14 = ordered_pair(esk1_4(X11,X12,X13,X14),esk2_4(X11,X12,X13,X14))
| ~ in(X14,X13)
| X13 != cartesian_product2(X11,X12) )
& ( ~ in(X18,X11)
| ~ in(X19,X12)
| X17 != ordered_pair(X18,X19)
| in(X17,X13)
| X13 != cartesian_product2(X11,X12) )
& ( ~ in(esk3_3(X20,X21,X22),X22)
| ~ in(X24,X20)
| ~ in(X25,X21)
| esk3_3(X20,X21,X22) != ordered_pair(X24,X25)
| X22 = cartesian_product2(X20,X21) )
& ( in(esk4_3(X20,X21,X22),X20)
| in(esk3_3(X20,X21,X22),X22)
| X22 = cartesian_product2(X20,X21) )
& ( in(esk5_3(X20,X21,X22),X21)
| in(esk3_3(X20,X21,X22),X22)
| X22 = cartesian_product2(X20,X21) )
& ( esk3_3(X20,X21,X22) = ordered_pair(esk4_3(X20,X21,X22),esk5_3(X20,X21,X22))
| in(esk3_3(X20,X21,X22),X22)
| X22 = cartesian_product2(X20,X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_zfmisc_1])])])])])]) ).
cnf(c_0_8,negated_conjecture,
ordered_pair(X1,X2) != esk8_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X9,X10] : unordered_pair(X9,X10) = unordered_pair(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_11,plain,
( X1 = ordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
unordered_pair(unordered_pair(X1,X2),singleton(X1)) != esk8_0,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( X1 = unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1)))
| X4 != cartesian_product2(X2,X3)
| ~ in(X1,X4) ),
inference(rw,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_15,negated_conjecture,
unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk8_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),esk2_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
in(esk8_0,cartesian_product2(esk9_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
~ in(esk8_0,cartesian_product2(X1,X2)),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_17,c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SET949+1 : TPTP v8.1.2. Released v3.2.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat Aug 26 12:49:38 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.63 start to proof: theBenchmark
% 0.21/0.65 % Version : CSE_E---1.5
% 0.21/0.65 % Problem : theBenchmark.p
% 0.21/0.65 % Proof found
% 0.21/0.65 % SZS status Theorem for theBenchmark.p
% 0.21/0.65 % SZS output start Proof
% See solution above
% 0.21/0.65 % Total time : 0.008000 s
% 0.21/0.65 % SZS output end Proof
% 0.21/0.65 % Total time : 0.011000 s
%------------------------------------------------------------------------------