TSTP Solution File: SET947+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET947+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 : n007.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.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 6 unt; 10 typ; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 21 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn; 23 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
powerset: $i > $i ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
union: $i > $i ).
tff(decl_26,type,
empty: $i > $o ).
tff(decl_27,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_28,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_29,type,
esk3_0: $i ).
tff(decl_30,type,
esk4_0: $i ).
tff(decl_31,type,
esk5_0: $i ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(t100_zfmisc_1,conjecture,
! [X1] : subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(c_0_4,plain,
! [X6,X7,X8,X9,X10,X11] :
( ( ~ in(X8,X7)
| subset(X8,X6)
| X7 != powerset(X6) )
& ( ~ subset(X9,X6)
| in(X9,X7)
| X7 != powerset(X6) )
& ( ~ in(esk1_2(X10,X11),X11)
| ~ subset(esk1_2(X10,X11),X10)
| X11 = powerset(X10) )
& ( in(esk1_2(X10,X11),X11)
| subset(esk1_2(X10,X11),X10)
| X11 = powerset(X10) ) ),
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_zfmisc_1])])])])])]) ).
fof(c_0_5,plain,
! [X13,X14,X15,X16,X17] :
( ( ~ subset(X13,X14)
| ~ in(X15,X13)
| in(X15,X14) )
& ( in(esk2_2(X16,X17),X16)
| subset(X16,X17) )
& ( ~ in(esk2_2(X16,X17),X17)
| subset(X16,X17) ) ),
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)],[d3_tarski])])])])])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X19,X20] :
( ~ in(X19,X20)
| subset(X19,union(X20)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : subset(X1,powerset(union(X1))),
inference(assume_negation,[status(cth)],[t100_zfmisc_1]) ).
cnf(c_0_11,plain,
( subset(X1,powerset(X2))
| ~ subset(esk2_2(X1,powerset(X2)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( subset(X1,powerset(union(X2)))
| ~ in(esk2_2(X1,powerset(union(X2))),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(X1,powerset(union(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
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.12/0.12 % Problem : SET947+1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n007.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sat Aug 26 14:33:11 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.56 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.58 % Total time : 0.008000 s
% 0.19/0.58 % SZS output end Proof
% 0.19/0.58 % Total time : 0.011000 s
%------------------------------------------------------------------------------