TSTP Solution File: SEU037+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU037+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 : 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 16:22:13 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 34
% Syntax : Number of formulae : 55 ( 10 unt; 29 typ; 0 def)
% Number of atoms : 99 ( 26 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 125 ( 52 ~; 49 |; 14 &)
% ( 1 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 25 ( 17 >; 8 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 12 con; 0-3 aty)
% Number of variables : 46 ( 3 sgn; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
function: $i > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
one_to_one: $i > $o ).
tff(decl_27,type,
set_intersection2: ( $i * $i ) > $i ).
tff(decl_28,type,
relation_dom_restriction: ( $i * $i ) > $i ).
tff(decl_29,type,
element: ( $i * $i ) > $o ).
tff(decl_30,type,
empty_set: $i ).
tff(decl_31,type,
relation_empty_yielding: $i > $o ).
tff(decl_32,type,
powerset: $i > $i ).
tff(decl_33,type,
relation_dom: $i > $i ).
tff(decl_34,type,
subset: ( $i * $i ) > $o ).
tff(decl_35,type,
apply: ( $i * $i ) > $i ).
tff(decl_36,type,
esk1_1: $i > $i ).
tff(decl_37,type,
esk2_0: $i ).
tff(decl_38,type,
esk3_0: $i ).
tff(decl_39,type,
esk4_1: $i > $i ).
tff(decl_40,type,
esk5_0: $i ).
tff(decl_41,type,
esk6_0: $i ).
tff(decl_42,type,
esk7_0: $i ).
tff(decl_43,type,
esk8_1: $i > $i ).
tff(decl_44,type,
esk9_0: $i ).
tff(decl_45,type,
esk10_0: $i ).
tff(decl_46,type,
esk11_0: $i ).
tff(decl_47,type,
esk12_3: ( $i * $i * $i ) > $i ).
tff(decl_48,type,
esk13_0: $i ).
tff(decl_49,type,
esk14_0: $i ).
tff(decl_50,type,
esk15_0: $i ).
fof(t71_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,set_intersection2(relation_dom(X3),X1))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t71_funct_1) ).
fof(t68_funct_1,axiom,
! [X1,X2] :
( ( relation(X2)
& function(X2) )
=> ! [X3] :
( ( relation(X3)
& function(X3) )
=> ( X2 = relation_dom_restriction(X3,X1)
<=> ( relation_dom(X2) = set_intersection2(relation_dom(X3),X1)
& ! [X4] :
( in(X4,relation_dom(X2))
=> apply(X2,X4) = apply(X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t68_funct_1) ).
fof(fc4_funct_1,axiom,
! [X1,X2] :
( ( relation(X1)
& function(X1) )
=> ( relation(relation_dom_restriction(X1,X2))
& function(relation_dom_restriction(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc4_funct_1) ).
fof(dt_k7_relat_1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_dom_restriction(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k7_relat_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(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( in(X2,set_intersection2(relation_dom(X3),X1))
=> apply(relation_dom_restriction(X3,X1),X2) = apply(X3,X2) ) ),
inference(assume_negation,[status(cth)],[t71_funct_1]) ).
fof(c_0_6,plain,
! [X52,X53,X54,X55] :
( ( relation_dom(X53) = set_intersection2(relation_dom(X54),X52)
| X53 != relation_dom_restriction(X54,X52)
| ~ relation(X54)
| ~ function(X54)
| ~ relation(X53)
| ~ function(X53) )
& ( ~ in(X55,relation_dom(X53))
| apply(X53,X55) = apply(X54,X55)
| X53 != relation_dom_restriction(X54,X52)
| ~ relation(X54)
| ~ function(X54)
| ~ relation(X53)
| ~ function(X53) )
& ( in(esk12_3(X52,X53,X54),relation_dom(X53))
| relation_dom(X53) != set_intersection2(relation_dom(X54),X52)
| X53 = relation_dom_restriction(X54,X52)
| ~ relation(X54)
| ~ function(X54)
| ~ relation(X53)
| ~ function(X53) )
& ( apply(X53,esk12_3(X52,X53,X54)) != apply(X54,esk12_3(X52,X53,X54))
| relation_dom(X53) != set_intersection2(relation_dom(X54),X52)
| X53 = relation_dom_restriction(X54,X52)
| ~ relation(X54)
| ~ function(X54)
| ~ relation(X53)
| ~ function(X53) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t68_funct_1])])])])]) ).
fof(c_0_7,plain,
! [X21,X22] :
( ( relation(relation_dom_restriction(X21,X22))
| ~ relation(X21)
| ~ function(X21) )
& ( function(relation_dom_restriction(X21,X22))
| ~ relation(X21)
| ~ function(X21) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc4_funct_1])])]) ).
fof(c_0_8,plain,
! [X12,X13] :
( ~ relation(X12)
| relation(relation_dom_restriction(X12,X13)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_relat_1])]) ).
fof(c_0_9,negated_conjecture,
( relation(esk15_0)
& function(esk15_0)
& in(esk14_0,set_intersection2(relation_dom(esk15_0),esk13_0))
& apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_10,plain,
! [X10,X11] : set_intersection2(X10,X11) = set_intersection2(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_11,plain,
( relation_dom(X1) = set_intersection2(relation_dom(X2),X3)
| X1 != relation_dom_restriction(X2,X3)
| ~ relation(X2)
| ~ function(X2)
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( function(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( relation(relation_dom_restriction(X1,X2))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( apply(X2,X1) = apply(X3,X1)
| ~ in(X1,relation_dom(X2))
| X2 != relation_dom_restriction(X3,X4)
| ~ relation(X3)
| ~ function(X3)
| ~ relation(X2)
| ~ function(X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
in(esk14_0,set_intersection2(relation_dom(esk15_0),esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( set_intersection2(relation_dom(X1),X2) = relation_dom(relation_dom_restriction(X1,X2))
| ~ relation(X1)
| ~ function(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),c_0_13]) ).
cnf(c_0_18,negated_conjecture,
apply(relation_dom_restriction(esk15_0,esk13_0),esk14_0) != apply(esk15_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( apply(relation_dom_restriction(X1,X2),X3) = apply(X1,X3)
| ~ relation(X1)
| ~ function(X1)
| ~ in(X3,relation_dom(relation_dom_restriction(X1,X2))) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_14]),c_0_12]),c_0_13]) ).
cnf(c_0_20,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
in(esk14_0,set_intersection2(esk13_0,relation_dom(esk15_0))),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( set_intersection2(X1,relation_dom(X2)) = relation_dom(relation_dom_restriction(X2,X1))
| ~ relation(X2)
| ~ function(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
~ in(esk14_0,relation_dom(relation_dom_restriction(esk15_0,esk13_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]),c_0_21])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU037+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.13/0.35 % Computer : n008.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Aug 23 13:19:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.61 % Total time : 0.015000 s
% 0.20/0.61 % SZS output end Proof
% 0.20/0.61 % Total time : 0.018000 s
%------------------------------------------------------------------------------