TSTP Solution File: SEU160+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU160+3 : 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 : n017.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:55 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 27 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 45 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 41 ( 15 ~; 19 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 4 ( 3 >; 1 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-1 aty)
% Number of variables : 18 ( 4 sgn; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subset: ( $i * $i ) > $o ).
tff(decl_23,type,
empty_set: $i ).
tff(decl_24,type,
empty: $i > $o ).
tff(decl_25,type,
singleton: $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(t39_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t39_zfmisc_1) ).
fof(l4_zfmisc_1,axiom,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l4_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[t39_zfmisc_1]) ).
fof(c_0_4,plain,
! [X8,X9] :
( ( ~ subset(X8,singleton(X9))
| X8 = empty_set
| X8 = singleton(X9) )
& ( X8 != empty_set
| subset(X8,singleton(X9)) )
& ( X8 != singleton(X9)
| subset(X8,singleton(X9)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l4_zfmisc_1])])]) ).
fof(c_0_5,negated_conjecture,
( ( esk3_0 != empty_set
| ~ subset(esk3_0,singleton(esk4_0)) )
& ( esk3_0 != singleton(esk4_0)
| ~ subset(esk3_0,singleton(esk4_0)) )
& ( subset(esk3_0,singleton(esk4_0))
| esk3_0 = empty_set
| esk3_0 = singleton(esk4_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( X1 = empty_set
| X1 = singleton(X2)
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( subset(esk3_0,singleton(esk4_0))
| esk3_0 = empty_set
| esk3_0 = singleton(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X3] : subset(X3,X3),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_9,negated_conjecture,
( esk3_0 != singleton(esk4_0)
| ~ subset(esk3_0,singleton(esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( singleton(esk4_0) = esk3_0
| empty_set = esk3_0 ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
( esk3_0 != empty_set
| ~ subset(esk3_0,singleton(esk4_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
empty_set = esk3_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_15,plain,
subset(empty_set,singleton(X1)),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk3_0,singleton(esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_17,plain,
subset(esk3_0,singleton(X1)),
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU160+3 : 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 : n017.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 : Wed Aug 23 14:51:23 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.005000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.007000 s
%------------------------------------------------------------------------------