TSTP Solution File: SET696+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET696+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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:35:15 EDT 2023
% Result : Theorem 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 23
% Syntax : Number of formulae : 45 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 33 ~; 24 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 14 >; 10 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 48 ( 4 sgn; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subset: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
equal_set: ( $i * $i ) > $o ).
tff(decl_25,type,
power_set: $i > $i ).
tff(decl_26,type,
intersection: ( $i * $i ) > $i ).
tff(decl_27,type,
union: ( $i * $i ) > $i ).
tff(decl_28,type,
empty_set: $i ).
tff(decl_29,type,
difference: ( $i * $i ) > $i ).
tff(decl_30,type,
singleton: $i > $i ).
tff(decl_31,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_32,type,
sum: $i > $i ).
tff(decl_33,type,
product: $i > $i ).
tff(decl_34,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk4_0: $i ).
tff(decl_38,type,
esk5_0: $i ).
fof(thI28,conjecture,
! [X1,X4] :
( subset(X1,X4)
=> equal_set(intersection(difference(X4,X1),X1),empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI28) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(difference,axiom,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',difference) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X4] :
( subset(X1,X4)
=> equal_set(intersection(difference(X4,X1),X1),empty_set) ),
inference(assume_negation,[status(cth)],[thI28]) ).
fof(c_0_7,negated_conjecture,
( subset(esk4_0,esk5_0)
& ~ equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ( subset(X12,X13)
| ~ equal_set(X12,X13) )
& ( subset(X13,X12)
| ~ equal_set(X12,X13) )
& ( ~ subset(X12,X13)
| ~ subset(X13,X12)
| equal_set(X12,X13) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_set(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ member(X8,X6)
| member(X8,X7) )
& ( member(esk1_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ member(esk1_2(X9,X10),X10)
| subset(X9,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)],[subset])])])])])]) ).
fof(c_0_12,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[empty_set]) ).
cnf(c_0_13,negated_conjecture,
( ~ subset(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0))
| ~ subset(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X22] : ~ member(X22,empty_set),
inference(variable_rename,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X2,X1,X4] :
( member(X2,difference(X4,X1))
<=> ( member(X2,X4)
& ~ member(X2,X1) ) ),
inference(fof_simplification,[status(thm)],[difference]) ).
fof(c_0_17,plain,
! [X16,X17,X18] :
( ( member(X16,X17)
| ~ member(X16,intersection(X17,X18)) )
& ( member(X16,X18)
| ~ member(X16,intersection(X17,X18)) )
& ( ~ member(X16,X17)
| ~ member(X16,X18)
| member(X16,intersection(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])]) ).
cnf(c_0_18,negated_conjecture,
( member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),intersection(difference(esk5_0,esk4_0),esk4_0))
| ~ subset(empty_set,intersection(difference(esk5_0,esk4_0),esk4_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_20,plain,
! [X23,X24,X25] :
( ( member(X23,X25)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X24)
| ~ member(X23,difference(X25,X24)) )
& ( ~ member(X23,X25)
| member(X23,X24)
| member(X23,difference(X25,X24)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),intersection(difference(esk5_0,esk4_0),esk4_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_19]) ).
cnf(c_0_23,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),difference(esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
member(esk1_2(intersection(difference(esk5_0,esk4_0),esk4_0),empty_set),esk4_0),
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SET696+4 : TPTP v8.1.2. Released v2.2.0.
% 0.12/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.35 % Computer : n027.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 09:38:19 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.57 start to proof: theBenchmark
% 0.22/0.59 % Version : CSE_E---1.5
% 0.22/0.59 % Problem : theBenchmark.p
% 0.22/0.59 % Proof found
% 0.22/0.59 % SZS status Theorem for theBenchmark.p
% 0.22/0.59 % SZS output start Proof
% See solution above
% 0.22/0.60 % Total time : 0.010000 s
% 0.22/0.60 % SZS output end Proof
% 0.22/0.60 % Total time : 0.013000 s
%------------------------------------------------------------------------------