TSTP Solution File: SET056+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET056+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n024.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 14:32:34 EDT 2023
% Result : Theorem 0.19s 0.60s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 43
% Syntax : Number of formulae : 58 ( 4 unt; 40 typ; 0 def)
% Number of atoms : 54 ( 9 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 59 ( 23 ~; 22 |; 11 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 47 ( 31 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 35 ( 35 usr; 9 con; 0-3 aty)
% Number of variables : 32 ( 0 sgn; 18 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subclass: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
universal_class: $i ).
tff(decl_25,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_26,type,
singleton: $i > $i ).
tff(decl_27,type,
ordered_pair: ( $i * $i ) > $i ).
tff(decl_28,type,
cross_product: ( $i * $i ) > $i ).
tff(decl_29,type,
first: $i > $i ).
tff(decl_30,type,
second: $i > $i ).
tff(decl_31,type,
element_relation: $i ).
tff(decl_32,type,
intersection: ( $i * $i ) > $i ).
tff(decl_33,type,
complement: $i > $i ).
tff(decl_34,type,
restrict: ( $i * $i * $i ) > $i ).
tff(decl_35,type,
null_class: $i ).
tff(decl_36,type,
domain_of: $i > $i ).
tff(decl_37,type,
rotate: $i > $i ).
tff(decl_38,type,
flip: $i > $i ).
tff(decl_39,type,
union: ( $i * $i ) > $i ).
tff(decl_40,type,
successor: $i > $i ).
tff(decl_41,type,
successor_relation: $i ).
tff(decl_42,type,
inverse: $i > $i ).
tff(decl_43,type,
range_of: $i > $i ).
tff(decl_44,type,
image: ( $i * $i ) > $i ).
tff(decl_45,type,
inductive: $i > $o ).
tff(decl_46,type,
sum_class: $i > $i ).
tff(decl_47,type,
power_class: $i > $i ).
tff(decl_48,type,
compose: ( $i * $i ) > $i ).
tff(decl_49,type,
identity_relation: $i ).
tff(decl_50,type,
function: $i > $o ).
tff(decl_51,type,
disjoint: ( $i * $i ) > $o ).
tff(decl_52,type,
apply: ( $i * $i ) > $i ).
tff(decl_53,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk2_0: $i ).
tff(decl_55,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk4_1: $i > $i ).
tff(decl_57,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_58,type,
esk6_1: $i > $i ).
tff(decl_59,type,
esk7_0: $i ).
tff(decl_60,type,
esk8_0: $i ).
tff(decl_61,type,
esk9_0: $i ).
fof(equality1,conjecture,
! [X1,X2] :
( X1 = X2
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| ? [X7] :
( member(X7,X2)
& ~ member(X7,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equality1) ).
fof(subclass_defn,axiom,
! [X1,X2] :
( subclass(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',subclass_defn) ).
fof(extensionality,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subclass(X1,X2)
& subclass(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET005+0.ax',extensionality) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( X1 = X2
| ? [X3] :
( member(X3,X1)
& ~ member(X3,X2) )
| ? [X7] :
( member(X7,X2)
& ~ member(X7,X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[equality1])]) ).
fof(c_0_4,plain,
! [X10,X11,X12,X13,X14] :
( ( ~ subclass(X10,X11)
| ~ member(X12,X10)
| member(X12,X11) )
& ( member(esk1_2(X13,X14),X13)
| subclass(X13,X14) )
& ( ~ member(esk1_2(X13,X14),X14)
| subclass(X13,X14) ) ),
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)],[subclass_defn])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X109,X110] :
( esk8_0 != esk9_0
& ( ~ member(X109,esk8_0)
| member(X109,esk9_0) )
& ( ~ member(X110,esk9_0)
| member(X110,esk8_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( subclass(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( member(X1,esk9_0)
| ~ member(X1,esk8_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X17,X18] :
( ( subclass(X17,X18)
| X17 != X18 )
& ( subclass(X18,X17)
| X17 != X18 )
& ( ~ subclass(X17,X18)
| ~ subclass(X18,X17)
| X17 = X18 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[extensionality])])]) ).
cnf(c_0_9,negated_conjecture,
( subclass(X1,esk9_0)
| ~ member(esk1_2(X1,esk9_0),esk8_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( member(esk1_2(X1,X2),X1)
| subclass(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( member(X1,esk8_0)
| ~ member(X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ subclass(X1,X2)
| ~ subclass(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
subclass(esk8_0,esk9_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
esk8_0 != esk9_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,negated_conjecture,
( member(esk1_2(esk9_0,X1),esk8_0)
| subclass(esk9_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ subclass(esk9_0,esk8_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_15]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET056+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.35 % Computer : n024.cluster.edu
% 0.12/0.35 % Model : x86_64 x86_64
% 0.12/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35 % Memory : 8042.1875MB
% 0.12/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35 % CPULimit : 300
% 0.12/0.35 % WCLimit : 300
% 0.12/0.35 % DateTime : Sat Aug 26 14:11:53 EDT 2023
% 0.12/0.35 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.50/0.61 % Total time : 0.030000 s
% 0.50/0.61 % SZS output end Proof
% 0.50/0.61 % Total time : 0.032000 s
%------------------------------------------------------------------------------