TSTP Solution File: SEU189+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU189+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 : 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 16:23:11 EDT 2023
% Result : Theorem 0.21s 0.58s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 29 ( 5 unt; 13 typ; 0 def)
% Number of atoms : 40 ( 30 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 37 ( 13 ~; 14 |; 4 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 7 >; 2 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 6 ( 0 sgn; 4 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
element: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
in: ( $i * $i ) > $o ).
tff(decl_25,type,
relation: $i > $o ).
tff(decl_26,type,
relation_dom: $i > $i ).
tff(decl_27,type,
relation_rng: $i > $i ).
tff(decl_28,type,
empty_set: $i ).
tff(decl_29,type,
esk1_1: $i > $i ).
tff(decl_30,type,
esk2_0: $i ).
tff(decl_31,type,
esk3_0: $i ).
tff(decl_32,type,
esk4_0: $i ).
tff(decl_33,type,
esk5_0: $i ).
tff(decl_34,type,
esk6_0: $i ).
fof(t65_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t65_relat_1) ).
fof(t64_relat_1,axiom,
! [X1] :
( relation(X1)
=> ( ( relation_dom(X1) = empty_set
| relation_rng(X1) = empty_set )
=> X1 = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t64_relat_1) ).
fof(t60_relat_1,axiom,
( relation_dom(empty_set) = empty_set
& relation_rng(empty_set) = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( relation_dom(X1) = empty_set
<=> relation_rng(X1) = empty_set ) ),
inference(assume_negation,[status(cth)],[t65_relat_1]) ).
fof(c_0_4,plain,
! [X26] :
( ( relation_dom(X26) != empty_set
| X26 = empty_set
| ~ relation(X26) )
& ( relation_rng(X26) != empty_set
| X26 = empty_set
| ~ relation(X26) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t64_relat_1])])]) ).
fof(c_0_5,negated_conjecture,
( relation(esk6_0)
& ( relation_dom(esk6_0) != empty_set
| relation_rng(esk6_0) != empty_set )
& ( relation_dom(esk6_0) = empty_set
| relation_rng(esk6_0) = empty_set ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( X1 = empty_set
| relation_rng(X1) != empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( relation_dom(esk6_0) = empty_set
| relation_rng(esk6_0) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
relation(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X1 = empty_set
| relation_dom(X1) != empty_set
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( relation_dom(esk6_0) = empty_set
| esk6_0 = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_11,negated_conjecture,
( relation_dom(esk6_0) != empty_set
| relation_rng(esk6_0) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
esk6_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8])]) ).
cnf(c_0_13,plain,
relation_dom(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[t60_relat_1]) ).
cnf(c_0_14,plain,
relation_rng(empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[t60_relat_1]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_12]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n031.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 01:07:35 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.21/0.56 start to proof: theBenchmark
% 0.21/0.58 % Version : CSE_E---1.5
% 0.21/0.58 % Problem : theBenchmark.p
% 0.21/0.58 % Proof found
% 0.21/0.58 % SZS status Theorem for theBenchmark.p
% 0.21/0.58 % SZS output start Proof
% See solution above
% 0.21/0.58 % Total time : 0.006000 s
% 0.21/0.58 % SZS output end Proof
% 0.21/0.58 % Total time : 0.009000 s
%------------------------------------------------------------------------------