TSTP Solution File: SET924+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET924+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 : n020.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:17 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of formulae : 21 ( 3 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 13 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 29 ( 15 ~; 8 |; 2 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 4 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
singleton: $i > $i ).
tff(decl_25,type,
set_difference: ( $i * $i ) > $i ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_0: $i ).
tff(decl_28,type,
esk3_0: $i ).
tff(decl_29,type,
esk4_0: $i ).
fof(t67_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t67_zfmisc_1) ).
fof(l34_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l34_zfmisc_1) ).
fof(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t67_zfmisc_1])]) ).
fof(c_0_3,plain,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[l34_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
( ( set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0)
| in(esk3_0,esk4_0) )
& ( set_difference(singleton(esk3_0),esk4_0) = singleton(esk3_0)
| ~ in(esk3_0,esk4_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).
fof(c_0_5,plain,
! [X9,X10] :
( ( set_difference(singleton(X9),X10) != singleton(X9)
| ~ in(X9,X10) )
& ( in(X9,X10)
| set_difference(singleton(X9),X10) = singleton(X9) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,negated_conjecture,
( in(esk3_0,esk4_0)
| set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( set_difference(singleton(X1),X2) != singleton(X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
( set_difference(singleton(esk3_0),esk4_0) = singleton(esk3_0)
| ~ in(esk3_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
set_difference(singleton(esk3_0),esk4_0) != singleton(esk3_0),
inference(csr,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ in(esk3_0,esk4_0),
inference(sr,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET924+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n020.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 : 300
% 0.13/0.34 % DateTime : Sat Aug 26 12:49:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.004000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------