TSTP Solution File: NUM548+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM548+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : Sat May 4 08:55:17 EDT 2024
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 13 unt; 0 def)
% Number of atoms : 121 ( 21 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 159 ( 66 ~; 65 |; 20 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-3 aty)
% Number of variables : 36 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',mDefSel) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',m__2202_02) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( aSet0(X2)
& ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',mDefSub) ).
fof(m__2270,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',m__2270) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',m__2202) ).
fof(m__,conjecture,
isFinite0(xQ),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',m__) ).
fof(mCardNum,axiom,
! [X1] :
( aSet0(X1)
=> ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
<=> isFinite0(X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p',mCardNum) ).
fof(c_0_7,plain,
! [X73,X74,X75,X76,X77,X78] :
( ( aSet0(X75)
| X75 != slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( aSubsetOf0(X76,X73)
| ~ aElementOf0(X76,X75)
| X75 != slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( sbrdtbr0(X76) = X74
| ~ aElementOf0(X76,X75)
| X75 != slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( ~ aSubsetOf0(X77,X73)
| sbrdtbr0(X77) != X74
| aElementOf0(X77,X75)
| X75 != slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( ~ aElementOf0(esk7_3(X73,X74,X78),X78)
| ~ aSubsetOf0(esk7_3(X73,X74,X78),X73)
| sbrdtbr0(esk7_3(X73,X74,X78)) != X74
| ~ aSet0(X78)
| X78 = slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( aSubsetOf0(esk7_3(X73,X74,X78),X73)
| aElementOf0(esk7_3(X73,X74,X78),X78)
| ~ aSet0(X78)
| X78 = slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) )
& ( sbrdtbr0(esk7_3(X73,X74,X78)) = X74
| aElementOf0(esk7_3(X73,X74,X78),X78)
| ~ aSet0(X78)
| X78 = slbdtsldtrb0(X73,X74)
| ~ aSet0(X73)
| ~ aElementOf0(X74,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_8,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_9,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X2,X4)
| ~ aSet0(X2)
| ~ aElementOf0(X4,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,X3)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aSet0(X4)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X39,X40,X41,X42] :
( ( aSet0(X40)
| ~ aSubsetOf0(X40,X39)
| ~ aSet0(X39) )
& ( ~ aElementOf0(X41,X40)
| aElementOf0(X41,X39)
| ~ aSubsetOf0(X40,X39)
| ~ aSet0(X39) )
& ( aElementOf0(esk4_2(X39,X42),X42)
| ~ aSet0(X42)
| aSubsetOf0(X42,X39)
| ~ aSet0(X39) )
& ( ~ aElementOf0(esk4_2(X39,X42),X39)
| ~ aSet0(X42)
| aSubsetOf0(X42,X39)
| ~ aSet0(X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[mDefSub])])])])])])]) ).
cnf(c_0_13,plain,
( aSubsetOf0(X1,X2)
| ~ aElementOf0(X1,slbdtsldtrb0(X2,X3))
| ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[m__2270]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_16,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
~ isFinite0(xQ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[m__])]) ).
fof(c_0_18,plain,
! [X13] :
( ( ~ aElementOf0(sbrdtbr0(X13),szNzAzT0)
| isFinite0(X13)
| ~ aSet0(X13) )
& ( ~ isFinite0(X13)
| aElementOf0(sbrdtbr0(X13),szNzAzT0)
| ~ aSet0(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardNum])])])]) ).
cnf(c_0_19,plain,
( sbrdtbr0(X1) = X2
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X3) ),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,hypothesis,
aSubsetOf0(xQ,xS),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).
fof(c_0_22,negated_conjecture,
~ isFinite0(xQ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_23,plain,
( isFinite0(X1)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
sbrdtbr0(xQ) = xk,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_25,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_16])]) ).
cnf(c_0_26,negated_conjecture,
~ isFinite0(xQ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : NUM548+1 : TPTP v8.1.2. Released v4.0.0.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.30 % Computer : n006.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Fri May 3 09:14:04 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.boxwRXO5WJ/E---3.1_24445.p
% 0.15/0.43 # Version: 3.1.0
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # sh5l with pid 24527 completed with status 0
% 0.15/0.43 # Result found by sh5l
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 24530 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.43 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.002 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 66
% 0.15/0.43 # Removed by relevancy pruning/SinE : 3
% 0.15/0.43 # Initial clauses : 113
% 0.15/0.43 # Removed in clause preprocessing : 5
% 0.15/0.43 # Initial clauses in saturation : 108
% 0.15/0.43 # Processed clauses : 255
% 0.15/0.43 # ...of these trivial : 0
% 0.15/0.43 # ...subsumed : 11
% 0.15/0.43 # ...remaining for further processing : 244
% 0.15/0.43 # Other redundant clauses eliminated : 31
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 2
% 0.15/0.43 # Generated clauses : 168
% 0.15/0.43 # ...of the previous two non-redundant : 133
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 19
% 0.15/0.43 # Paramodulations : 139
% 0.15/0.43 # Factorizations : 0
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 32
% 0.15/0.43 # Disequality decompositions : 0
% 0.15/0.43 # Total rewrite steps : 70
% 0.15/0.43 # ...of those cached : 56
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 109
% 0.15/0.43 # Positive orientable unit clauses : 21
% 0.15/0.43 # Positive unorientable unit clauses: 0
% 0.15/0.43 # Negative unit clauses : 7
% 0.15/0.43 # Non-unit-clauses : 81
% 0.15/0.43 # Current number of unprocessed clauses: 93
% 0.15/0.43 # ...number of literals in the above : 457
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 110
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 3420
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 912
% 0.15/0.43 # Non-unit clause-clause subsumptions : 27
% 0.15/0.43 # Unit Clause-clause subsumption calls : 169
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 2
% 0.15/0.43 # BW rewrite match successes : 2
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 12456
% 0.15/0.43 # Search garbage collected termcells : 2182
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.020 s
% 0.15/0.43 # System time : 0.001 s
% 0.15/0.43 # Total time : 0.021 s
% 0.15/0.43 # Maximum resident set size: 2084 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.022 s
% 0.15/0.43 # System time : 0.003 s
% 0.15/0.43 # Total time : 0.025 s
% 0.15/0.43 # Maximum resident set size: 1764 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E exiting
%------------------------------------------------------------------------------