TSTP Solution File: SET694+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET694+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 : n008.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 249.18s 249.11s
% Output : CNFRefutation 249.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 49 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 73 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 70 ( 29 ~; 32 |; 5 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 64 ( 4 sgn; 22 !; 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(power_set,axiom,
! [X3,X1] :
( member(X3,power_set(X1))
<=> subset(X3,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',power_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(thI22,conjecture,
! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI22) ).
fof(union,axiom,
! [X3,X1,X2] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',union) ).
fof(c_0_4,plain,
! [X14,X15] :
( ( ~ member(X14,power_set(X15))
| subset(X14,X15) )
& ( ~ subset(X14,X15)
| member(X14,power_set(X15)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).
fof(c_0_5,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_6,negated_conjecture,
~ ! [X1,X2] : subset(union(power_set(X1),power_set(X2)),power_set(union(X1,X2))),
inference(assume_negation,[status(cth)],[thI22]) ).
cnf(c_0_7,plain,
( member(X1,power_set(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X19,X20,X21] :
( ( ~ member(X19,union(X20,X21))
| member(X19,X20)
| member(X19,X21) )
& ( ~ member(X19,X20)
| member(X19,union(X20,X21)) )
& ( ~ member(X19,X21)
| member(X19,union(X20,X21)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).
cnf(c_0_10,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(X1,power_set(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_13,negated_conjecture,
~ subset(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_14,plain,
( member(X1,power_set(X2))
| ~ member(esk1_2(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_15,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| ~ member(X3,power_set(X2))
| ~ member(X1,X3) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
( member(esk1_2(X1,X2),X1)
| member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
~ subset(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( member(esk1_2(X1,X2),X3)
| member(X1,power_set(X2))
| ~ member(X1,power_set(X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( member(X1,union(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),union(power_set(esk4_0),power_set(esk5_0))),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_24,negated_conjecture,
~ member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),power_set(union(esk4_0,esk5_0))),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_25,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(X1,power_set(X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(esk1_2(X1,union(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_27,negated_conjecture,
( member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),power_set(esk4_0))
| member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),power_set(esk5_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
~ member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),power_set(esk5_0)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( member(X1,power_set(union(X2,X3)))
| ~ member(X1,power_set(X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
member(esk1_2(union(power_set(esk4_0),power_set(esk5_0)),power_set(union(esk4_0,esk5_0))),power_set(esk4_0)),
inference(sr,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET694+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.17/0.34 % Computer : n008.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Sat Aug 26 11:39:17 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 249.18/249.11 % Version : CSE_E---1.5
% 249.18/249.11 % Problem : theBenchmark.p
% 249.18/249.11 % Proof found
% 249.18/249.11 % SZS status Theorem for theBenchmark.p
% 249.18/249.11 % SZS output start Proof
% See solution above
% 249.18/249.12 % Total time : 248.558000 s
% 249.18/249.12 % SZS output end Proof
% 249.18/249.12 % Total time : 248.572000 s
%------------------------------------------------------------------------------