TSTP Solution File: SEU198+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU198+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n005.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:15 EDT 2023
% Result : Theorem 0.22s 0.62s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 35 ( 4 unt; 19 typ; 0 def)
% Number of atoms : 46 ( 0 equ)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 47 ( 17 ~; 18 |; 6 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 12 >; 5 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
relation: $i > $o ).
tff(decl_25,type,
subset: ( $i * $i ) > $o ).
tff(decl_26,type,
relation_rng_restriction: ( $i * $i ) > $i ).
tff(decl_27,type,
element: ( $i * $i ) > $o ).
tff(decl_28,type,
powerset: $i > $i ).
tff(decl_29,type,
empty_set: $i ).
tff(decl_30,type,
relation_rng: $i > $i ).
tff(decl_31,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk2_1: $i > $i ).
tff(decl_33,type,
esk3_0: $i ).
tff(decl_34,type,
esk4_1: $i > $i ).
tff(decl_35,type,
esk5_0: $i ).
tff(decl_36,type,
esk6_0: $i ).
tff(decl_37,type,
esk7_1: $i > $i ).
tff(decl_38,type,
esk8_0: $i ).
tff(decl_39,type,
esk9_0: $i ).
tff(decl_40,type,
esk10_0: $i ).
fof(t115_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_rng(relation_rng_restriction(X2,X3)))
<=> ( in(X1,X2)
& in(X1,relation_rng(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t115_relat_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t116_relat_1,conjecture,
! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t116_relat_1) ).
fof(c_0_3,plain,
! [X29,X30,X31] :
( ( in(X29,X30)
| ~ in(X29,relation_rng(relation_rng_restriction(X30,X31)))
| ~ relation(X31) )
& ( in(X29,relation_rng(X31))
| ~ in(X29,relation_rng(relation_rng_restriction(X30,X31)))
| ~ relation(X31) )
& ( ~ in(X29,X30)
| ~ in(X29,relation_rng(X31))
| in(X29,relation_rng(relation_rng_restriction(X30,X31)))
| ~ relation(X31) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t115_relat_1])])]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X11] :
( ( ~ subset(X7,X8)
| ~ in(X9,X7)
| in(X9,X8) )
& ( in(esk1_2(X10,X11),X10)
| subset(X10,X11) )
& ( ~ in(esk1_2(X10,X11),X11)
| subset(X10,X11) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> subset(relation_rng(relation_rng_restriction(X1,X2)),X1) ),
inference(assume_negation,[status(cth)],[t116_relat_1]) ).
cnf(c_0_6,plain,
( in(X1,X2)
| ~ in(X1,relation_rng(relation_rng_restriction(X2,X3)))
| ~ relation(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( relation(esk10_0)
& ~ subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
( subset(relation_rng(relation_rng_restriction(X1,X2)),X3)
| in(esk1_2(relation_rng(relation_rng_restriction(X1,X2)),X3),X1)
| ~ relation(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
relation(esk10_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X2)
| in(esk1_2(relation_rng(relation_rng_restriction(X1,esk10_0)),X2),X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ subset(relation_rng(relation_rng_restriction(esk9_0,esk10_0)),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
subset(relation_rng(relation_rng_restriction(X1,esk10_0)),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU198+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.15/0.36 % Computer : n005.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Wed Aug 23 18:44:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.22/0.60 start to proof: theBenchmark
% 0.22/0.62 % Version : CSE_E---1.5
% 0.22/0.62 % Problem : theBenchmark.p
% 0.22/0.62 % Proof found
% 0.22/0.62 % SZS status Theorem for theBenchmark.p
% 0.22/0.62 % SZS output start Proof
% See solution above
% 0.22/0.63 % Total time : 0.012000 s
% 0.22/0.63 % SZS output end Proof
% 0.22/0.63 % Total time : 0.015000 s
%------------------------------------------------------------------------------