TSTP Solution File: SET971+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n016.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:29 EDT 2023
% Result : Theorem 0.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 29 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 7 ~; 2 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
subset: ( $i * $i ) > $o ).
tff(decl_25,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_0: $i ).
tff(decl_28,type,
esk3_0: $i ).
tff(decl_29,type,
esk4_0: $i ).
tff(decl_30,type,
esk5_0: $i ).
tff(decl_31,type,
esk6_0: $i ).
fof(t124_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3)) = cartesian_product2(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t124_zfmisc_1) ).
fof(t123_zfmisc_1,axiom,
! [X1,X2,X3,X4] : cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t123_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',t28_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X1,X2)
& subset(X3,X4) )
=> set_intersection2(cartesian_product2(X1,X4),cartesian_product2(X2,X3)) = cartesian_product2(X1,X3) ),
inference(assume_negation,[status(cth)],[t124_zfmisc_1]) ).
fof(c_0_5,negated_conjecture,
( subset(esk3_0,esk4_0)
& subset(esk5_0,esk6_0)
& set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0)) != cartesian_product2(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,
! [X11,X12,X13,X14] : cartesian_product2(set_intersection2(X11,X12),set_intersection2(X13,X14)) = set_intersection2(cartesian_product2(X11,X13),cartesian_product2(X12,X14)),
inference(variable_rename,[status(thm)],[t123_zfmisc_1]) ).
fof(c_0_7,plain,
! [X5,X6] : set_intersection2(X5,X6) = set_intersection2(X6,X5),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_8,plain,
! [X19,X20] :
( ~ subset(X19,X20)
| set_intersection2(X19,X20) = X19 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
cnf(c_0_9,negated_conjecture,
set_intersection2(cartesian_product2(esk3_0,esk6_0),cartesian_product2(esk4_0,esk5_0)) != cartesian_product2(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
cartesian_product2(set_intersection2(X1,X2),set_intersection2(X3,X4)) = set_intersection2(cartesian_product2(X1,X3),cartesian_product2(X2,X4)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
cartesian_product2(set_intersection2(esk3_0,esk4_0),set_intersection2(esk5_0,esk6_0)) != cartesian_product2(esk3_0,esk5_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,negated_conjecture,
set_intersection2(esk5_0,esk6_0) = esk5_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
cartesian_product2(set_intersection2(esk3_0,esk4_0),esk5_0) != cartesian_product2(esk3_0,esk5_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
set_intersection2(esk3_0,esk4_0) = esk3_0,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET971+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n016.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:58:27 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.55 start to proof: theBenchmark
% 0.19/0.57 % Version : CSE_E---1.5
% 0.19/0.57 % Problem : theBenchmark.p
% 0.19/0.57 % Proof found
% 0.19/0.57 % SZS status Theorem for theBenchmark.p
% 0.19/0.57 % SZS output start Proof
% See solution above
% 0.19/0.57 % Total time : 0.006000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.009000 s
%------------------------------------------------------------------------------