TSTP Solution File: SET912+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n031.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:14 EDT 2023
% Result : Theorem 0.21s 0.59s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 39 ( 12 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 34 ( 14 ~; 9 |; 7 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 29 ( 0 sgn; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_24,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_25,type,
empty: $i > $o ).
tff(decl_26,type,
subset: ( $i * $i ) > $o ).
tff(decl_27,type,
esk1_0: $i ).
tff(decl_28,type,
esk2_0: $i ).
tff(decl_29,type,
esk3_0: $i ).
tff(decl_30,type,
esk4_0: $i ).
tff(decl_31,type,
esk5_0: $i ).
fof(t53_zfmisc_1,conjecture,
! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t53_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t28_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(t38_zfmisc_1,axiom,
! [X1,X2,X3] :
( subset(unordered_pair(X1,X2),X3)
<=> ( in(X1,X3)
& in(X2,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t38_zfmisc_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( in(X1,X2)
& in(X3,X2) )
=> set_intersection2(unordered_pair(X1,X3),X2) = unordered_pair(X1,X3) ),
inference(assume_negation,[status(cth)],[t53_zfmisc_1]) ).
fof(c_0_5,negated_conjecture,
( in(esk3_0,esk4_0)
& in(esk5_0,esk4_0)
& set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X8,X9] : set_intersection2(X8,X9) = set_intersection2(X9,X8),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_7,plain,
! [X14,X15] :
( ~ subset(X14,X15)
| set_intersection2(X14,X15) = X14 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
cnf(c_0_8,negated_conjecture,
set_intersection2(unordered_pair(esk3_0,esk5_0),esk4_0) != unordered_pair(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
set_intersection2(esk4_0,unordered_pair(esk3_0,esk5_0)) != unordered_pair(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
fof(c_0_13,plain,
! [X16,X17,X18] :
( ( in(X16,X18)
| ~ subset(unordered_pair(X16,X17),X18) )
& ( in(X17,X18)
| ~ subset(unordered_pair(X16,X17),X18) )
& ( ~ in(X16,X18)
| ~ in(X17,X18)
| subset(unordered_pair(X16,X17),X18) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_zfmisc_1])])]) ).
cnf(c_0_14,negated_conjecture,
~ subset(unordered_pair(esk3_0,esk5_0),esk4_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( subset(unordered_pair(X1,X3),X2)
| ~ in(X1,X2)
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
in(esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
in(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET912+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sat Aug 26 11:13:23 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.59 % Version : CSE_E---1.5
% 0.21/0.59 % Problem : theBenchmark.p
% 0.21/0.59 % Proof found
% 0.21/0.59 % SZS status Theorem for theBenchmark.p
% 0.21/0.59 % SZS output start Proof
% See solution above
% 0.21/0.59 % Total time : 0.006000 s
% 0.21/0.59 % SZS output end Proof
% 0.21/0.59 % Total time : 0.008000 s
%------------------------------------------------------------------------------