TSTP Solution File: SEU177+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU177+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n007.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:23:05 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of formulae : 46 ( 9 unt; 23 typ; 0 def)
% Number of atoms : 85 ( 17 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 104 ( 42 ~; 42 |; 10 &)
% ( 4 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 16 >; 12 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-3 aty)
% Number of variables : 56 ( 4 sgn; 30 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
empty_set: $i ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_25,type,
element: ( $i * $i ) > $o ).
tff(decl_26,type,
relation: $i > $o ).
tff(decl_27,type,
singleton: $i > $i ).
tff(decl_28,type,
in: ( $i * $i ) > $o ).
tff(decl_29,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_30,type,
relation_dom: $i > $i ).
tff(decl_31,type,
relation_rng: $i > $i ).
tff(decl_32,type,
esk1_1: $i > $i ).
tff(decl_33,type,
esk2_0: $i ).
tff(decl_34,type,
esk3_0: $i ).
tff(decl_35,type,
esk4_0: $i ).
tff(decl_36,type,
esk5_0: $i ).
tff(decl_37,type,
esk6_0: $i ).
tff(decl_38,type,
esk7_0: $i ).
tff(decl_39,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_40,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_41,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_42,type,
esk11_3: ( $i * $i * $i ) > $i ).
tff(decl_43,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_44,type,
esk13_2: ( $i * $i ) > $i ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(t20_relat_1,conjecture,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_relat_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(c_0_4,plain,
! [X43,X44,X45,X47,X48,X49,X51] :
( ( ~ in(X45,X44)
| in(ordered_pair(esk11_3(X43,X44,X45),X45),X43)
| X44 != relation_rng(X43)
| ~ relation(X43) )
& ( ~ in(ordered_pair(X48,X47),X43)
| in(X47,X44)
| X44 != relation_rng(X43)
| ~ relation(X43) )
& ( ~ in(esk12_2(X43,X49),X49)
| ~ in(ordered_pair(X51,esk12_2(X43,X49)),X43)
| X49 = relation_rng(X43)
| ~ relation(X43) )
& ( in(esk12_2(X43,X49),X49)
| in(ordered_pair(esk13_2(X43,X49),esk12_2(X43,X49)),X43)
| X49 = relation_rng(X43)
| ~ relation(X43) ) ),
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)],[d5_relat_1])])])])])]) ).
fof(c_0_5,plain,
! [X28,X29] : ordered_pair(X28,X29) = unordered_pair(unordered_pair(X28,X29),singleton(X28)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_dom(X3))
& in(X2,relation_rng(X3)) ) ) ),
inference(assume_negation,[status(cth)],[t20_relat_1]) ).
cnf(c_0_7,plain,
( in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_rng(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
( relation(esk7_0)
& in(ordered_pair(esk5_0,esk6_0),esk7_0)
& ( ~ in(esk5_0,relation_dom(esk7_0))
| ~ in(esk6_0,relation_rng(esk7_0)) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,plain,
! [X33,X34,X35,X37,X38,X39,X41] :
( ( ~ in(X35,X34)
| in(ordered_pair(X35,esk8_3(X33,X34,X35)),X33)
| X34 != relation_dom(X33)
| ~ relation(X33) )
& ( ~ in(ordered_pair(X37,X38),X33)
| in(X37,X34)
| X34 != relation_dom(X33)
| ~ relation(X33) )
& ( ~ in(esk9_2(X33,X39),X39)
| ~ in(ordered_pair(esk9_2(X33,X39),X41),X33)
| X39 = relation_dom(X33)
| ~ relation(X33) )
& ( in(esk9_2(X33,X39),X39)
| in(ordered_pair(esk9_2(X33,X39),esk10_2(X33,X39)),X33)
| X39 = relation_dom(X33)
| ~ relation(X33) ) ),
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)],[d4_relat_1])])])])])]) ).
cnf(c_0_11,plain,
( in(X2,X4)
| X4 != relation_rng(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
in(ordered_pair(esk5_0,esk6_0),esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(X1,X4)
| ~ in(ordered_pair(X1,X2),X3)
| X4 != relation_dom(X3)
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( in(X1,relation_rng(X2))
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)
| ~ relation(X2) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
in(unordered_pair(unordered_pair(esk5_0,esk6_0),singleton(esk5_0)),esk7_0),
inference(rw,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,negated_conjecture,
relation(esk7_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( in(X1,X4)
| X4 != relation_dom(X3)
| ~ relation(X3)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(esk5_0,relation_dom(esk7_0))
| ~ in(esk6_0,relation_rng(esk7_0)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
in(esk6_0,relation_rng(esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_20,plain,
( in(X1,relation_dom(X2))
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2)
| ~ relation(X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk5_0,relation_dom(esk7_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_16])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU177+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n007.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 : Wed Aug 23 14:58:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.61 % Total time : 0.014000 s
% 0.21/0.61 % SZS output end Proof
% 0.21/0.61 % Total time : 0.017000 s
%------------------------------------------------------------------------------