TSTP Solution File: SEU152+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n018.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:50 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 10
% Syntax : Number of formulae : 24 ( 7 unt; 6 typ; 0 def)
% Number of atoms : 31 ( 13 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 11 ~; 7 |; 2 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
set_union2: ( $i * $i ) > $i ).
tff(decl_24,type,
singleton: $i > $i ).
tff(decl_25,type,
subset: ( $i * $i ) > $o ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_0: $i ).
fof(l23_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l23_zfmisc_1) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(l2_zfmisc_1,axiom,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2_zfmisc_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> set_union2(singleton(X1),X2) = X2 ),
inference(assume_negation,[status(cth)],[l23_zfmisc_1]) ).
fof(c_0_5,plain,
! [X13,X14] :
( ~ subset(X13,X14)
| set_union2(X13,X14) = X14 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])]) ).
fof(c_0_6,plain,
! [X10,X11] :
( ( ~ subset(singleton(X10),X11)
| in(X10,X11) )
& ( ~ in(X10,X11)
| subset(singleton(X10),X11) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).
fof(c_0_7,negated_conjecture,
( in(esk1_0,esk2_0)
& set_union2(singleton(esk1_0),esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,plain,
! [X5,X6] : set_union2(X5,X6) = set_union2(X6,X5),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
cnf(c_0_9,plain,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
set_union2(singleton(esk1_0),esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( set_union2(singleton(X1),X2) = X2
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
set_union2(esk2_0,singleton(esk1_0)) != esk2_0,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( set_union2(X1,singleton(X2)) = X1
| ~ in(X2,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU152+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34 % Computer : n018.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Wed Aug 23 20:26:12 EDT 2023
% 0.16/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
%------------------------------------------------------------------------------