TSTP Solution File: SET688+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET688+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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:14 EDT 2023
% Result : Theorem 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 10 unt; 18 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 65 ( 28 ~; 17 |; 15 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 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 : 15 ( 15 usr; 4 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 18 !; 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 ).
tff(decl_39,type,
esk6_0: $i ).
fof(thI04,conjecture,
! [X1,X2,X6] :
( ( subset(X1,X2)
& ~ equal_set(X1,X2)
& subset(X2,X6)
& ~ equal_set(X2,X6) )
=> ~ equal_set(X1,X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI04) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X6] :
( ( subset(X1,X2)
& ~ equal_set(X1,X2)
& subset(X2,X6)
& ~ equal_set(X2,X6) )
=> ~ equal_set(X1,X6) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thI04])]) ).
fof(c_0_4,negated_conjecture,
( subset(esk4_0,esk5_0)
& ~ equal_set(esk4_0,esk5_0)
& subset(esk5_0,esk6_0)
& ~ equal_set(esk5_0,esk6_0)
& equal_set(esk4_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,plain,
! [X13,X14] :
( ( subset(X13,X14)
| ~ equal_set(X13,X14) )
& ( subset(X14,X13)
| ~ equal_set(X13,X14) )
& ( ~ subset(X13,X14)
| ~ subset(X14,X13)
| equal_set(X13,X14) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_6,negated_conjecture,
~ equal_set(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ member(X9,X7)
| member(X9,X8) )
& ( member(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ member(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
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])])])])])]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| ~ equal_set(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
equal_set(esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
~ subset(esk5_0,esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
subset(esk6_0,esk4_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,negated_conjecture,
~ member(esk1_2(esk5_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
~ member(esk1_2(esk5_0,esk4_0),esk6_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( member(X1,esk6_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
member(esk1_2(esk5_0,esk4_0),esk5_0),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET688+4 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n006.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 : Sat Aug 26 13:53:52 EDT 2023
% 0.13/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.59 % Total time : 0.012000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.015000 s
%------------------------------------------------------------------------------