TSTP Solution File: SET185+3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET185+3 : 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 : n011.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:33:31 EDT 2023
% Result : Theorem 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 45 ( 14 unt; 7 typ; 0 def)
% Number of atoms : 84 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 72 ( 26 ~; 32 |; 8 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 68 ( 6 sgn; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
union: ( $i * $i ) > $i ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_26,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_27,type,
esk3_0: $i ).
tff(decl_28,type,
esk4_0: $i ).
fof(prove_subset_union,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> union(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_subset_union) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X1)
| member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> union(X1,X2) = X2 ),
inference(assume_negation,[status(cth)],[prove_subset_union]) ).
fof(c_0_6,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_defn])])])])])]) ).
fof(c_0_7,negated_conjecture,
( subset(esk3_0,esk4_0)
& union(esk3_0,esk4_0) != esk4_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X4,X5,X6] :
( ( ~ member(X6,union(X4,X5))
| member(X6,X4)
| member(X6,X5) )
& ( ~ member(X6,X4)
| member(X6,union(X4,X5)) )
& ( ~ member(X6,X5)
| member(X6,union(X4,X5)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])]) ).
cnf(c_0_9,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(X1,union(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( member(X1,esk4_0)
| ~ member(X1,esk3_0) ),
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_6]) ).
cnf(c_0_15,plain,
( subset(X1,union(X2,X3))
| ~ member(esk1_2(X1,union(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( subset(esk3_0,X1)
| member(esk1_2(esk3_0,X1),esk4_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
fof(c_0_17,plain,
! [X15,X16] : union(X15,X16) = union(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_18,plain,
( member(X1,X2)
| member(X1,X3)
| ~ member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,negated_conjecture,
subset(esk3_0,union(X1,esk4_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( subset(union(X1,X2),X3)
| member(esk1_2(union(X1,X2),X3),X1)
| member(esk1_2(union(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
subset(esk3_0,union(esk4_0,X1)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X13,X14] :
( ( subset(X13,X14)
| X13 != X14 )
& ( subset(X14,X13)
| X13 != X14 )
& ( ~ subset(X13,X14)
| ~ subset(X14,X13)
| X13 = X14 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_24,plain,
( subset(union(X1,X1),X2)
| member(esk1_2(union(X1,X1),X2),X1) ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_26,negated_conjecture,
( member(X1,union(esk4_0,X2))
| ~ member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_22]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,plain,
subset(union(X1,X1),X1),
inference(spm,[status(thm)],[c_0_11,c_0_24]) ).
cnf(c_0_29,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_30,negated_conjecture,
( subset(X1,union(esk4_0,X2))
| ~ member(esk1_2(X1,union(esk4_0,X2)),esk3_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_26]) ).
cnf(c_0_31,plain,
union(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_32,negated_conjecture,
( subset(X1,esk4_0)
| ~ member(esk1_2(X1,esk4_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_33,plain,
( subset(union(X1,X2),X2)
| member(esk1_2(union(X1,X2),X2),X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_34,negated_conjecture,
union(esk3_0,esk4_0) != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_35,negated_conjecture,
subset(union(esk4_0,esk3_0),esk4_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_20]) ).
cnf(c_0_36,negated_conjecture,
union(esk4_0,esk3_0) != esk4_0,
inference(rw,[status(thm)],[c_0_34,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_29])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET185+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n011.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 11:56:09 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.013000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.016000 s
%------------------------------------------------------------------------------