TSTP Solution File: SEU041+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU041+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 : n023.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.19s 0.57s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 28
% Syntax : Number of formulae : 42 ( 5 unt; 25 typ; 0 def)
% Number of atoms : 44 ( 18 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 12 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 13 >; 4 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 12 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty_set: $i ).
tff(decl_24,type,
empty: $i > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
relation_empty_yielding: $i > $o ).
tff(decl_27,type,
element: ( $i * $i ) > $o ).
tff(decl_28,type,
powerset: $i > $i ).
tff(decl_29,type,
function: $i > $o ).
tff(decl_30,type,
one_to_one: $i > $o ).
tff(decl_31,type,
relation_dom_restriction: ( $i * $i ) > $i ).
tff(decl_32,type,
subset: ( $i * $i ) > $o ).
tff(decl_33,type,
esk1_1: $i > $i ).
tff(decl_34,type,
esk2_0: $i ).
tff(decl_35,type,
esk3_0: $i ).
tff(decl_36,type,
esk4_0: $i ).
tff(decl_37,type,
esk5_1: $i > $i ).
tff(decl_38,type,
esk6_1: $i > $i ).
tff(decl_39,type,
esk7_0: $i ).
tff(decl_40,type,
esk8_0: $i ).
tff(decl_41,type,
esk9_0: $i ).
tff(decl_42,type,
esk10_0: $i ).
tff(decl_43,type,
esk11_0: $i ).
tff(decl_44,type,
esk12_0: $i ).
tff(decl_45,type,
esk13_0: $i ).
tff(decl_46,type,
esk14_0: $i ).
fof(t82_funct_1,conjecture,
! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1)
& relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t82_funct_1) ).
fof(t103_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t103_relat_1) ).
fof(t102_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t102_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( relation(X3)
& function(X3) )
=> ( subset(X1,X2)
=> ( relation_dom_restriction(relation_dom_restriction(X3,X1),X2) = relation_dom_restriction(X3,X1)
& relation_dom_restriction(relation_dom_restriction(X3,X2),X1) = relation_dom_restriction(X3,X1) ) ) ),
inference(assume_negation,[status(cth)],[t82_funct_1]) ).
fof(c_0_4,plain,
! [X54,X55,X56] :
( ~ relation(X56)
| ~ subset(X54,X55)
| relation_dom_restriction(relation_dom_restriction(X56,X55),X54) = relation_dom_restriction(X56,X54) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t103_relat_1])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk14_0)
& function(esk14_0)
& subset(esk12_0,esk13_0)
& ( relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0)
| relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) != relation_dom_restriction(esk14_0,esk12_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( relation_dom_restriction(relation_dom_restriction(X1,X3),X2) = relation_dom_restriction(X1,X2)
| ~ relation(X1)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X51,X52,X53] :
( ~ relation(X53)
| ~ subset(X51,X52)
| relation_dom_restriction(relation_dom_restriction(X53,X51),X52) = relation_dom_restriction(X53,X51) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t102_relat_1])]) ).
cnf(c_0_9,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(X1,esk13_0),esk12_0) = relation_dom_restriction(X1,esk12_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
relation(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
( relation_dom_restriction(relation_dom_restriction(X1,X2),X3) = relation_dom_restriction(X1,X2)
| ~ relation(X1)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0)
| relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) != relation_dom_restriction(esk14_0,esk12_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
relation_dom_restriction(relation_dom_restriction(esk14_0,esk13_0),esk12_0) = relation_dom_restriction(esk14_0,esk12_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( relation_dom_restriction(relation_dom_restriction(X1,esk12_0),esk13_0) = relation_dom_restriction(X1,esk12_0)
| ~ relation(X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
relation_dom_restriction(relation_dom_restriction(esk14_0,esk12_0),esk13_0) != relation_dom_restriction(esk14_0,esk12_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_10]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU041+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 24 00:49:12 EDT 2023
% 0.13/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.008000 s
% 0.19/0.57 % SZS output end Proof
% 0.19/0.57 % Total time : 0.011000 s
%------------------------------------------------------------------------------