TSTP Solution File: SEU149+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU149+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n032.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 16:22:47 EDT 2023
% Result : Theorem 0.13s 0.46s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 23 ( 4 unt; 8 typ; 0 def)
% Number of atoms : 59 ( 41 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 69 ( 25 ~; 29 |; 9 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 39 ( 2 sgn; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_24,type,
singleton: $i > $i ).
tff(decl_25,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_26,type,
esk2_3: ( $i * $i * $i ) > $i ).
tff(decl_27,type,
esk3_0: $i ).
tff(decl_28,type,
esk4_0: $i ).
tff(decl_29,type,
esk5_0: $i ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(t8_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(c_0_3,plain,
! [X9,X10,X11,X12,X13,X14] :
( ( ~ in(X11,X10)
| X11 = X9
| X10 != singleton(X9) )
& ( X12 != X9
| in(X12,X10)
| X10 != singleton(X9) )
& ( ~ in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) != X13
| X14 = singleton(X13) )
& ( in(esk1_2(X13,X14),X14)
| esk1_2(X13,X14) = X13
| X14 = singleton(X13) ) ),
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)],[d1_tarski])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t8_zfmisc_1]) ).
cnf(c_0_5,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk3_0 != esk4_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X16,X17,X18,X19,X20,X21,X22,X23] :
( ( ~ in(X19,X18)
| X19 = X16
| X19 = X17
| X18 != unordered_pair(X16,X17) )
& ( X20 != X16
| in(X20,X18)
| X18 != unordered_pair(X16,X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != unordered_pair(X16,X17) )
& ( esk2_3(X21,X22,X23) != X21
| ~ in(esk2_3(X21,X22,X23),X23)
| X23 = unordered_pair(X21,X22) )
& ( esk2_3(X21,X22,X23) != X22
| ~ in(esk2_3(X21,X22,X23),X23)
| X23 = unordered_pair(X21,X22) )
& ( in(esk2_3(X21,X22,X23),X23)
| esk2_3(X21,X22,X23) = X21
| esk2_3(X21,X22,X23) = X22
| X23 = unordered_pair(X21,X22) ) ),
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_tarski])])])])])]) ).
cnf(c_0_8,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk3_0
| ~ in(X1,unordered_pair(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_13,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : SEU149+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.09 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Wed Aug 23 20:06:26 EDT 2023
% 0.08/0.28 % CPUTime :
% 0.13/0.45 start to proof: theBenchmark
% 0.13/0.46 % Version : CSE_E---1.5
% 0.13/0.46 % Problem : theBenchmark.p
% 0.13/0.46 % Proof found
% 0.13/0.46 % SZS status Theorem for theBenchmark.p
% 0.13/0.46 % SZS output start Proof
% See solution above
% 0.13/0.46 % Total time : 0.005000 s
% 0.13/0.46 % SZS output end Proof
% 0.13/0.46 % Total time : 0.006000 s
%------------------------------------------------------------------------------