TSTP Solution File: NUM605+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM605+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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 18:56:35 EDT 2023
% Result : Theorem 0.21s 0.56s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 95 ( 36 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 120 ( 50 ~; 50 |; 14 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn; 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',mDefEmp) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aSet0(X1)
& aElementOf0(X2,szNzAzT0) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( aSet0(X3)
& ! [X4] :
( aElementOf0(X4,X3)
<=> ( aSubsetOf0(X4,X1)
& sbrdtbr0(X4) = X2 ) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',mDefSel) ).
fof(m__,conjecture,
xQ != slcrc0,
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',m__) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',mCardEmpty) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',m__5078) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',m__3418) ).
fof(m__4891,hypothesis,
( aSet0(xO)
& xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',m__4891) ).
fof(m__3462,hypothesis,
xK != sz00,
file('/export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p',m__3462) ).
fof(c_0_8,plain,
! [X9,X10,X11] :
( ( aSet0(X9)
| X9 != slcrc0 )
& ( ~ aElementOf0(X10,X9)
| X9 != slcrc0 )
& ( ~ aSet0(X11)
| aElementOf0(esk1_1(X11),X11)
| X11 = slcrc0 ) ),
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)],[mDefEmp])])])])])]) ).
fof(c_0_9,plain,
! [X112,X113,X114,X115,X116,X117] :
( ( aSet0(X114)
| X114 != slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( aSubsetOf0(X115,X112)
| ~ aElementOf0(X115,X114)
| X114 != slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( sbrdtbr0(X115) = X113
| ~ aElementOf0(X115,X114)
| X114 != slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( ~ aSubsetOf0(X116,X112)
| sbrdtbr0(X116) != X113
| aElementOf0(X116,X114)
| X114 != slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( ~ aElementOf0(esk11_3(X112,X113,X117),X117)
| ~ aSubsetOf0(esk11_3(X112,X113,X117),X112)
| sbrdtbr0(esk11_3(X112,X113,X117)) != X113
| ~ aSet0(X117)
| X117 = slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( aSubsetOf0(esk11_3(X112,X113,X117),X112)
| aElementOf0(esk11_3(X112,X113,X117),X117)
| ~ aSet0(X117)
| X117 = slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) )
& ( sbrdtbr0(esk11_3(X112,X113,X117)) = X113
| aElementOf0(esk11_3(X112,X113,X117),X117)
| ~ aSet0(X117)
| X117 = slbdtsldtrb0(X112,X113)
| ~ aSet0(X112)
| ~ aElementOf0(X113,szNzAzT0) ) ),
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)],[mDefSel])])])])])]) ).
fof(c_0_10,negated_conjecture,
xQ = slcrc0,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_11,plain,
! [X76] :
( ( sbrdtbr0(X76) != sz00
| X76 = slcrc0
| ~ aSet0(X76) )
& ( X76 != slcrc0
| sbrdtbr0(X76) = sz00
| ~ aSet0(X76) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])]) ).
cnf(c_0_12,plain,
( aSet0(X1)
| X1 != slcrc0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_15,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( sbrdtbr0(X1) = sz00
| X1 != slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xO,xK)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
sbrdtbr0(slcrc0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17])]) ).
cnf(c_0_21,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_22,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_23,hypothesis,
xK != sz00,
inference(split_conjunct,[status(thm)],[m__3462]) ).
cnf(c_0_24,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM605+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n025.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 : 2400
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon Oct 2 13:38:36 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.6xjODWjOFH/E---3.1_8361.p
% 0.21/0.56 # Version: 3.1pre001
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.56 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.56 # Starting sh5l with 300s (1) cores
% 0.21/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8490 completed with status 0
% 0.21/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # No SInE strategy applied
% 0.21/0.56 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.56 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.56 # Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.21/0.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.21/0.56 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S2S with 136s (1) cores
% 0.21/0.56 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 8500 completed with status 0
% 0.21/0.56 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.21/0.56 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.21/0.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.21/0.56 # No SInE strategy applied
% 0.21/0.56 # Search class: FGHSF-FSLM31-MFFFFFNN
% 0.21/0.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.56 # Starting G-E--_110_C45_F1_PI_AE_Q4_CS_SP_PS_S4S with 811s (1) cores
% 0.21/0.56 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.21/0.56 # Preprocessing time : 0.004 s
% 0.21/0.56 # Presaturation interreduction done
% 0.21/0.56
% 0.21/0.56 # Proof found!
% 0.21/0.56 # SZS status Theorem
% 0.21/0.56 # SZS output start CNFRefutation
% See solution above
% 0.21/0.56 # Parsed axioms : 100
% 0.21/0.56 # Removed by relevancy pruning/SinE : 0
% 0.21/0.56 # Initial clauses : 202
% 0.21/0.56 # Removed in clause preprocessing : 7
% 0.21/0.56 # Initial clauses in saturation : 195
% 0.21/0.56 # Processed clauses : 415
% 0.21/0.56 # ...of these trivial : 1
% 0.21/0.56 # ...subsumed : 8
% 0.21/0.56 # ...remaining for further processing : 406
% 0.21/0.56 # Other redundant clauses eliminated : 49
% 0.21/0.56 # Clauses deleted for lack of memory : 0
% 0.21/0.56 # Backward-subsumed : 3
% 0.21/0.56 # Backward-rewritten : 3
% 0.21/0.56 # Generated clauses : 269
% 0.21/0.56 # ...of the previous two non-redundant : 225
% 0.21/0.56 # ...aggressively subsumed : 0
% 0.21/0.56 # Contextual simplify-reflections : 18
% 0.21/0.56 # Paramodulations : 224
% 0.21/0.56 # Factorizations : 0
% 0.21/0.56 # NegExts : 0
% 0.21/0.56 # Equation resolutions : 50
% 0.21/0.56 # Total rewrite steps : 182
% 0.21/0.56 # Propositional unsat checks : 0
% 0.21/0.56 # Propositional check models : 0
% 0.21/0.56 # Propositional check unsatisfiable : 0
% 0.21/0.56 # Propositional clauses : 0
% 0.21/0.56 # Propositional clauses after purity: 0
% 0.21/0.56 # Propositional unsat core size : 0
% 0.21/0.56 # Propositional preprocessing time : 0.000
% 0.21/0.56 # Propositional encoding time : 0.000
% 0.21/0.56 # Propositional solver time : 0.000
% 0.21/0.56 # Success case prop preproc time : 0.000
% 0.21/0.56 # Success case prop encoding time : 0.000
% 0.21/0.56 # Success case prop solver time : 0.000
% 0.21/0.56 # Current number of processed clauses : 167
% 0.21/0.56 # Positive orientable unit clauses : 52
% 0.21/0.56 # Positive unorientable unit clauses: 0
% 0.21/0.56 # Negative unit clauses : 11
% 0.21/0.56 # Non-unit-clauses : 104
% 0.21/0.56 # Current number of unprocessed clauses: 192
% 0.21/0.56 # ...number of literals in the above : 860
% 0.21/0.56 # Current number of archived formulas : 0
% 0.21/0.56 # Current number of archived clauses : 199
% 0.21/0.56 # Clause-clause subsumption calls (NU) : 8646
% 0.21/0.56 # Rec. Clause-clause subsumption calls : 2581
% 0.21/0.56 # Non-unit clause-clause subsumptions : 19
% 0.21/0.56 # Unit Clause-clause subsumption calls : 350
% 0.21/0.56 # Rewrite failures with RHS unbound : 0
% 0.21/0.56 # BW rewrite match attempts : 3
% 0.21/0.56 # BW rewrite match successes : 3
% 0.21/0.56 # Condensation attempts : 0
% 0.21/0.56 # Condensation successes : 0
% 0.21/0.56 # Termbank termtop insertions : 19332
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.042 s
% 0.21/0.56 # System time : 0.007 s
% 0.21/0.56 # Total time : 0.049 s
% 0.21/0.56 # Maximum resident set size: 2448 pages
% 0.21/0.56
% 0.21/0.56 # -------------------------------------------------
% 0.21/0.56 # User time : 0.177 s
% 0.21/0.56 # System time : 0.025 s
% 0.21/0.56 # Total time : 0.202 s
% 0.21/0.56 # Maximum resident set size: 1808 pages
% 0.21/0.56 % E---3.1 exiting
% 0.21/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------