TSTP Solution File: SEU430+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU430+1 : TPTP v8.1.2. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:32:09 EDT 2023
% Result : Theorem 0.22s 0.53s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 48 ( 12 unt; 0 def)
% Number of atoms : 125 ( 54 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 125 ( 48 ~; 52 |; 13 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 65 ( 5 sgn; 35 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',t30_relset_2) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',t6_boole) ).
fof(rc1_relat_1,axiom,
? [X1] :
( v1_xboole_0(X1)
& v1_relat_1(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',rc1_relat_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( r2_hidden(X1,X2)
& v1_xboole_0(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',t7_boole) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = k3_tarski(X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> ? [X4] :
( r2_hidden(X3,X4)
& r2_hidden(X4,X1) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',d4_tarski) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',d1_xboole_0) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p',redefinition_k5_setfam_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_8,plain,
! [X13] :
( ~ v1_xboole_0(X13)
| X13 = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_9,plain,
( v1_xboole_0(esk8_0)
& v1_relat_1(esk8_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
fof(c_0_10,plain,
! [X26,X27] :
( ~ r2_hidden(X26,X27)
| ~ v1_xboole_0(X27) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_11,plain,
! [X44,X45,X46,X48,X49,X50,X51,X53] :
( ( r2_hidden(X46,esk10_3(X44,X45,X46))
| ~ r2_hidden(X46,X45)
| X45 != k3_tarski(X44) )
& ( r2_hidden(esk10_3(X44,X45,X46),X44)
| ~ r2_hidden(X46,X45)
| X45 != k3_tarski(X44) )
& ( ~ r2_hidden(X48,X49)
| ~ r2_hidden(X49,X44)
| r2_hidden(X48,X45)
| X45 != k3_tarski(X44) )
& ( ~ r2_hidden(esk11_2(X50,X51),X51)
| ~ r2_hidden(esk11_2(X50,X51),X53)
| ~ r2_hidden(X53,X50)
| X51 = k3_tarski(X50) )
& ( r2_hidden(esk11_2(X50,X51),esk12_2(X50,X51))
| r2_hidden(esk11_2(X50,X51),X51)
| X51 = k3_tarski(X50) )
& ( r2_hidden(esk12_2(X50,X51),X50)
| r2_hidden(esk11_2(X50,X51),X51)
| X51 = k3_tarski(X50) ) ),
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)],[d4_tarski])])])])])]) ).
fof(c_0_12,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_13,negated_conjecture,
! [X8] :
( m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0)))
& ( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| ~ r2_hidden(X8,esk2_0)
| X8 = k1_xboole_0 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
cnf(c_0_14,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
v1_xboole_0(esk8_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ r2_hidden(X1,X2)
| ~ v1_xboole_0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( r2_hidden(esk12_2(X1,X2),X1)
| r2_hidden(esk11_2(X1,X2),X2)
| X2 = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,plain,
! [X9,X10,X11] :
( ( X9 != k1_xboole_0
| ~ r2_hidden(X10,X9) )
& ( r2_hidden(esk4_1(X11),X11)
| X11 = k1_xboole_0 ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])]) ).
cnf(c_0_19,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0
| X1 = k1_xboole_0
| ~ r2_hidden(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
k1_xboole_0 = esk8_0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( X1 = k3_tarski(X2)
| r2_hidden(esk12_2(X2,X1),X2)
| ~ v1_xboole_0(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) = esk8_0
| X1 = esk8_0
| ~ r2_hidden(X1,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_20]) ).
cnf(c_0_24,plain,
( k3_tarski(X1) = esk8_0
| r2_hidden(esk12_2(X1,esk8_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_25,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(er,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X30,X31] :
( ~ m1_subset_1(X31,k1_zfmisc_1(k1_zfmisc_1(X30)))
| k5_setfam_1(X30,X31) = k3_tarski(X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])]) ).
cnf(c_0_27,plain,
( r2_hidden(esk11_2(X1,X2),esk12_2(X1,X2))
| r2_hidden(esk11_2(X1,X2),X2)
| X2 = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( esk12_2(esk2_0,esk8_0) = esk8_0
| k5_setfam_1(esk1_0,esk2_0) = esk8_0
| k3_tarski(esk2_0) = esk8_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
~ r2_hidden(X1,esk8_0),
inference(rw,[status(thm)],[c_0_25,c_0_20]) ).
cnf(c_0_30,plain,
( k5_setfam_1(X2,X1) = k3_tarski(X1)
| ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_32,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) = esk8_0
| k3_tarski(esk2_0) = esk8_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_34,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( r2_hidden(X1,X4)
| ~ r2_hidden(X1,X2)
| ~ r2_hidden(X2,X3)
| X4 != k3_tarski(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
( r2_hidden(esk3_0,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) != esk8_0 ),
inference(rw,[status(thm)],[c_0_32,c_0_20]) ).
cnf(c_0_37,negated_conjecture,
k3_tarski(esk2_0) = esk8_0,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
( X1 = k3_tarski(esk8_0)
| r2_hidden(esk11_2(esk8_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_17]) ).
cnf(c_0_39,negated_conjecture,
( esk3_0 != k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_40,plain,
( r2_hidden(X1,k3_tarski(X2))
| ~ r2_hidden(X3,X2)
| ~ r2_hidden(X1,X3) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_41,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_34]),c_0_37])]) ).
cnf(c_0_42,plain,
k3_tarski(esk8_0) = esk8_0,
inference(spm,[status(thm)],[c_0_29,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != esk8_0
| esk3_0 != esk8_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_20]),c_0_20]) ).
cnf(c_0_44,negated_conjecture,
~ r2_hidden(X1,esk3_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_37]),c_0_29]) ).
cnf(c_0_45,plain,
( X1 = esk8_0
| r2_hidden(esk11_2(esk8_0,X1),X1) ),
inference(rw,[status(thm)],[c_0_38,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
esk3_0 != esk8_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_34]),c_0_37])]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEU430+1 : TPTP v8.1.2. Released v3.4.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n007.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 09:19:24 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.22/0.50 Running first-order model finding
% 0.22/0.50 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.jmyRGiiHjs/E---3.1_15339.p
% 0.22/0.53 # Version: 3.1pre001
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # Starting sh5l with 300s (1) cores
% 0.22/0.53 # new_bool_1 with pid 15418 completed with status 0
% 0.22/0.53 # Result found by new_bool_1
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSS-FFMM31-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.22/0.53 # U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 15425 completed with status 0
% 0.22/0.53 # Result found by U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.22/0.53 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.53 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.22/0.53 # Search class: FGHSS-FFMM31-SFFFFFNN
% 0.22/0.53 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.53 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 163s (1) cores
% 0.22/0.53 # Preprocessing time : 0.001 s
% 0.22/0.53 # Presaturation interreduction done
% 0.22/0.53
% 0.22/0.53 # Proof found!
% 0.22/0.53 # SZS status Theorem
% 0.22/0.53 # SZS output start CNFRefutation
% See solution above
% 0.22/0.53 # Parsed axioms : 29
% 0.22/0.53 # Removed by relevancy pruning/SinE : 8
% 0.22/0.53 # Initial clauses : 35
% 0.22/0.53 # Removed in clause preprocessing : 0
% 0.22/0.53 # Initial clauses in saturation : 35
% 0.22/0.53 # Processed clauses : 171
% 0.22/0.53 # ...of these trivial : 3
% 0.22/0.53 # ...subsumed : 32
% 0.22/0.53 # ...remaining for further processing : 136
% 0.22/0.53 # Other redundant clauses eliminated : 4
% 0.22/0.53 # Clauses deleted for lack of memory : 0
% 0.22/0.53 # Backward-subsumed : 10
% 0.22/0.53 # Backward-rewritten : 14
% 0.22/0.53 # Generated clauses : 228
% 0.22/0.53 # ...of the previous two non-redundant : 202
% 0.22/0.53 # ...aggressively subsumed : 0
% 0.22/0.53 # Contextual simplify-reflections : 1
% 0.22/0.53 # Paramodulations : 224
% 0.22/0.53 # Factorizations : 0
% 0.22/0.53 # NegExts : 0
% 0.22/0.53 # Equation resolutions : 4
% 0.22/0.53 # Total rewrite steps : 74
% 0.22/0.53 # Propositional unsat checks : 0
% 0.22/0.53 # Propositional check models : 0
% 0.22/0.53 # Propositional check unsatisfiable : 0
% 0.22/0.53 # Propositional clauses : 0
% 0.22/0.53 # Propositional clauses after purity: 0
% 0.22/0.53 # Propositional unsat core size : 0
% 0.22/0.53 # Propositional preprocessing time : 0.000
% 0.22/0.53 # Propositional encoding time : 0.000
% 0.22/0.53 # Propositional solver time : 0.000
% 0.22/0.53 # Success case prop preproc time : 0.000
% 0.22/0.53 # Success case prop encoding time : 0.000
% 0.22/0.53 # Success case prop solver time : 0.000
% 0.22/0.53 # Current number of processed clauses : 73
% 0.22/0.53 # Positive orientable unit clauses : 20
% 0.22/0.53 # Positive unorientable unit clauses: 0
% 0.22/0.53 # Negative unit clauses : 9
% 0.22/0.53 # Non-unit-clauses : 44
% 0.22/0.53 # Current number of unprocessed clauses: 84
% 0.22/0.53 # ...number of literals in the above : 236
% 0.22/0.53 # Current number of archived formulas : 0
% 0.22/0.53 # Current number of archived clauses : 59
% 0.22/0.53 # Clause-clause subsumption calls (NU) : 205
% 0.22/0.53 # Rec. Clause-clause subsumption calls : 169
% 0.22/0.53 # Non-unit clause-clause subsumptions : 13
% 0.22/0.53 # Unit Clause-clause subsumption calls : 127
% 0.22/0.53 # Rewrite failures with RHS unbound : 0
% 0.22/0.53 # BW rewrite match attempts : 7
% 0.22/0.53 # BW rewrite match successes : 7
% 0.22/0.53 # Condensation attempts : 0
% 0.22/0.53 # Condensation successes : 0
% 0.22/0.53 # Termbank termtop insertions : 4450
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.013 s
% 0.22/0.53 # System time : 0.002 s
% 0.22/0.53 # Total time : 0.015 s
% 0.22/0.53 # Maximum resident set size: 1836 pages
% 0.22/0.53
% 0.22/0.53 # -------------------------------------------------
% 0.22/0.53 # User time : 0.013 s
% 0.22/0.53 # System time : 0.005 s
% 0.22/0.53 # Total time : 0.019 s
% 0.22/0.53 # Maximum resident set size: 1696 pages
% 0.22/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------