TSTP Solution File: SET811+4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SET811+4 : 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 : n012.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:35:39 EDT 2023
% Result : Theorem 274.28s 274.78s
% Output : CNFRefutation 274.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 42
% Syntax : Number of formulae : 77 ( 7 unt; 36 typ; 0 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 130 ( 52 ~; 50 |; 17 &)
% ( 5 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 31 >; 29 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 28 ( 28 usr; 5 con; 0-3 aty)
% Number of variables : 61 ( 1 sgn; 33 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
subset: ( $i * $i ) > $o ).
tff(decl_23,type,
member: ( $i * $i ) > $o ).
tff(decl_24,type,
equal_set: ( $i * $i ) > $o ).
tff(decl_25,type,
power_set: $i > $i ).
tff(decl_26,type,
intersection: ( $i * $i ) > $i ).
tff(decl_27,type,
union: ( $i * $i ) > $i ).
tff(decl_28,type,
empty_set: $i ).
tff(decl_29,type,
difference: ( $i * $i ) > $i ).
tff(decl_30,type,
singleton: $i > $i ).
tff(decl_31,type,
unordered_pair: ( $i * $i ) > $i ).
tff(decl_32,type,
sum: $i > $i ).
tff(decl_33,type,
product: $i > $i ).
tff(decl_34,type,
on: $i ).
tff(decl_35,type,
set: $i > $o ).
tff(decl_36,type,
member_predicate: $i ).
tff(decl_37,type,
strict_well_order: ( $i * $i ) > $o ).
tff(decl_38,type,
strict_order: ( $i * $i ) > $o ).
tff(decl_39,type,
least: ( $i * $i * $i ) > $o ).
tff(decl_40,type,
apply: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
initial_segment: ( $i * $i * $i ) > $i ).
tff(decl_42,type,
suc: $i > $i ).
tff(decl_43,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_44,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_45,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_46,type,
esk4_1: $i > $i ).
tff(decl_47,type,
esk5_3: ( $i * $i * $i ) > $i ).
tff(decl_48,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_49,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_50,type,
esk8_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_52,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_53,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_54,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk13_2: ( $i * $i ) > $i ).
tff(decl_56,type,
esk14_0: $i ).
tff(decl_57,type,
esk15_0: $i ).
fof(thV5,conjecture,
! [X1] :
( member(X1,on)
=> ! [X3] :
( member(X3,X1)
=> equal_set(X3,initial_segment(X3,member_predicate,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thV5) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(initial_segment,axiom,
! [X3,X6,X1,X5] :
( member(X5,initial_segment(X3,X6,X1))
<=> ( member(X5,X1)
& apply(X6,X5,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',initial_segment) ).
fof(rel_member,axiom,
! [X3,X5] :
( apply(member_predicate,X3,X5)
<=> member(X3,X5) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',rel_member) ).
fof(ordinal_number,axiom,
! [X1] :
( member(X1,on)
<=> ( set(X1)
& strict_well_order(member_predicate,X1)
& ! [X3] :
( member(X3,X1)
=> subset(X3,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+4.ax',ordinal_number) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( member(X1,on)
=> ! [X3] :
( member(X3,X1)
=> equal_set(X3,initial_segment(X3,member_predicate,X1)) ) ),
inference(assume_negation,[status(cth)],[thV5]) ).
fof(c_0_7,negated_conjecture,
( member(esk14_0,on)
& member(esk15_0,esk14_0)
& ~ equal_set(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X15,X16] :
( ( subset(X15,X16)
| ~ equal_set(X15,X16) )
& ( subset(X16,X15)
| ~ equal_set(X15,X16) )
& ( ~ subset(X15,X16)
| ~ subset(X16,X15)
| equal_set(X15,X16) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_set(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( equal_set(X1,X2)
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X9,X10,X11,X12,X13] :
( ( ~ subset(X9,X10)
| ~ member(X11,X9)
| member(X11,X10) )
& ( member(esk1_2(X12,X13),X12)
| subset(X12,X13) )
& ( ~ member(esk1_2(X12,X13),X13)
| subset(X12,X13) ) ),
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)],[subset])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ subset(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0)
| ~ subset(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X86,X87,X88,X89] :
( ( member(X89,X88)
| ~ member(X89,initial_segment(X86,X87,X88)) )
& ( apply(X87,X89,X86)
| ~ member(X89,initial_segment(X86,X87,X88)) )
& ( ~ member(X89,X88)
| ~ apply(X87,X89,X86)
| member(X89,initial_segment(X86,X87,X88)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[initial_segment])])]) ).
cnf(c_0_15,negated_conjecture,
( member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),initial_segment(esk15_0,member_predicate,esk14_0))
| ~ subset(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X68,X69] :
( ( ~ apply(member_predicate,X68,X69)
| member(X68,X69) )
& ( ~ member(X68,X69)
| apply(member_predicate,X68,X69) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rel_member])]) ).
cnf(c_0_18,plain,
( apply(X1,X2,X3)
| ~ member(X2,initial_segment(X3,X1,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
( member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),initial_segment(esk15_0,member_predicate,esk14_0))
| member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),esk15_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),esk15_0)
| ~ subset(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_21,plain,
( member(X1,X2)
| ~ apply(member_predicate,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( apply(member_predicate,esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),esk15_0)
| member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),esk15_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),esk15_0)
| ~ member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),esk15_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
fof(c_0_24,plain,
! [X46,X47,X48] :
( ( set(X46)
| ~ member(X46,on) )
& ( strict_well_order(member_predicate,X46)
| ~ member(X46,on) )
& ( ~ member(X47,X46)
| subset(X47,X46)
| ~ member(X46,on) )
& ( member(esk4_1(X48),X48)
| ~ set(X48)
| ~ strict_well_order(member_predicate,X48)
| member(X48,on) )
& ( ~ subset(esk4_1(X48),X48)
| ~ set(X48)
| ~ strict_well_order(member_predicate,X48)
| member(X48,on) ) ),
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)],[ordinal_number])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),initial_segment(esk15_0,member_predicate,esk14_0))
| ~ member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,negated_conjecture,
member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),esk15_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
( subset(X1,X2)
| ~ member(X1,X2)
| ~ member(X2,on) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
member(esk14_0,on),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_30,negated_conjecture,
( apply(member_predicate,esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),esk15_0)
| ~ member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),initial_segment(esk15_0,member_predicate,esk14_0)) ),
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),initial_segment(esk15_0,member_predicate,esk14_0))
| ~ member(esk1_2(initial_segment(esk15_0,member_predicate,esk14_0),esk15_0),esk15_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_32,plain,
( member(X1,initial_segment(X4,X3,X2))
| ~ member(X1,X2)
| ~ apply(X3,X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,plain,
( apply(member_predicate,X1,X2)
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),X1)
| ~ subset(esk15_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
( subset(X1,esk14_0)
| ~ member(X1,esk14_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
member(esk15_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,negated_conjecture,
~ member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),initial_segment(esk15_0,member_predicate,esk14_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_30]),c_0_31]) ).
cnf(c_0_38,plain,
( member(X1,initial_segment(X2,member_predicate,X3))
| ~ member(X1,X3)
| ~ member(X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,negated_conjecture,
member(esk1_2(esk15_0,initial_segment(esk15_0,member_predicate,esk14_0)),esk14_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SET811+4 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.11/0.34 % Computer : n012.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sat Aug 26 12:23:40 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.17/0.54 start to proof: theBenchmark
% 274.28/274.78 % Version : CSE_E---1.5
% 274.28/274.78 % Problem : theBenchmark.p
% 274.28/274.78 % Proof found
% 274.28/274.78 % SZS status Theorem for theBenchmark.p
% 274.28/274.78 % SZS output start Proof
% See solution above
% 274.28/274.79 % Total time : 273.741000 s
% 274.28/274.79 % SZS output end Proof
% 274.28/274.79 % Total time : 273.754000 s
%------------------------------------------------------------------------------