TSTP Solution File: NUM547+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM547+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:17 EDT 2023
% Result : Theorem 0.16s 0.47s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 107 ( 22 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 142 ( 59 ~; 57 |; 19 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 1 sgn; 22 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/tmp/tmp.EJVL259Mu9/E---3.1_3053.p',m__) ).
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.EJVL259Mu9/E---3.1_3053.p',mDefSub) ).
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.EJVL259Mu9/E---3.1_3053.p',mDefSel) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( aSet0(X1)
& ~ ? [X2] : aElementOf0(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.EJVL259Mu9/E---3.1_3053.p',mDefEmp) ).
fof(m__2227,hypothesis,
( aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk))
& slbdtsldtrb0(xS,xk) != slcrc0 ),
file('/export/starexec/sandbox2/tmp/tmp.EJVL259Mu9/E---3.1_3053.p',m__2227) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/tmp/tmp.EJVL259Mu9/E---3.1_3053.p',m__2202) ).
fof(m__2202_02,hypothesis,
( aSet0(xS)
& aSet0(xT)
& xk != sz00 ),
file('/export/starexec/sandbox2/tmp/tmp.EJVL259Mu9/E---3.1_3053.p',m__2202_02) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,plain,
! [X12,X13,X14,X15] :
( ( aSet0(X13)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( ~ aElementOf0(X14,X13)
| aElementOf0(X14,X12)
| ~ aSubsetOf0(X13,X12)
| ~ aSet0(X12) )
& ( aElementOf0(esk2_2(X12,X15),X15)
| ~ aSet0(X15)
| aSubsetOf0(X15,X12)
| ~ aSet0(X12) )
& ( ~ aElementOf0(esk2_2(X12,X15),X12)
| ~ aSet0(X15)
| aSubsetOf0(X15,X12)
| ~ aSet0(X12) ) ),
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)],[mDefSub])])])])])]) ).
fof(c_0_9,plain,
! [X40,X41,X42,X43,X44,X45] :
( ( aSet0(X42)
| X42 != slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( aSubsetOf0(X43,X40)
| ~ aElementOf0(X43,X42)
| X42 != slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( sbrdtbr0(X43) = X41
| ~ aElementOf0(X43,X42)
| X42 != slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( ~ aSubsetOf0(X44,X40)
| sbrdtbr0(X44) != X41
| aElementOf0(X44,X42)
| X42 != slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( ~ aElementOf0(esk5_3(X40,X41,X45),X45)
| ~ aSubsetOf0(esk5_3(X40,X41,X45),X40)
| sbrdtbr0(esk5_3(X40,X41,X45)) != X41
| ~ aSet0(X45)
| X45 = slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( aSubsetOf0(esk5_3(X40,X41,X45),X40)
| aElementOf0(esk5_3(X40,X41,X45),X45)
| ~ aSet0(X45)
| X45 = slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,szNzAzT0) )
& ( sbrdtbr0(esk5_3(X40,X41,X45)) = X41
| aElementOf0(esk5_3(X40,X41,X45),X45)
| ~ aSet0(X45)
| X45 = slbdtsldtrb0(X40,X41)
| ~ aSet0(X40)
| ~ aElementOf0(X41,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,
! [X5] : ~ aElementOf0(X5,slbdtsldtrb0(xS,xk)),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])]) ).
fof(c_0_11,plain,
! [X8,X9,X10] :
( ( aSet0(X8)
| X8 != slcrc0 )
& ( ~ aElementOf0(X9,X8)
| X8 != slcrc0 )
& ( ~ aSet0(X10)
| aElementOf0(esk1_1(X10),X10)
| X10 = 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])])])])])]) ).
cnf(c_0_12,plain,
( aSet0(X1)
| ~ aSubsetOf0(X1,X2)
| ~ aSet0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
inference(split_conjunct,[status(thm)],[m__2227]) ).
cnf(c_0_14,plain,
( aSet0(X1)
| X1 != slbdtsldtrb0(X2,X3)
| ~ aSet0(X2)
| ~ aElementOf0(X3,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(X1,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( aElementOf0(esk1_1(X1),X1)
| X1 = slcrc0
| ~ aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
slbdtsldtrb0(xS,xk) != slcrc0,
inference(split_conjunct,[status(thm)],[m__2227]) ).
cnf(c_0_18,hypothesis,
( aSet0(slbdtsldtrb0(xS,xk))
| ~ aSet0(slbdtsldtrb0(xT,xk)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
( aSet0(slbdtsldtrb0(X1,X2))
| ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X1) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_20,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_21,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[m__2202_02]) ).
cnf(c_0_22,negated_conjecture,
~ aSet0(slbdtsldtrb0(xS,xk)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_23,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[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]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM547+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n009.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 2400
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Oct 2 14:48:14 EDT 2023
% 0.12/0.32 % CPUTime :
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.EJVL259Mu9/E---3.1_3053.p
% 0.16/0.47 # Version: 3.1pre001
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # sh5l with pid 3134 completed with status 0
% 0.16/0.47 # Result found by sh5l
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # SAT001_MinMin_p005000_rr_RG with pid 3142 completed with status 0
% 0.16/0.47 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.16/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.47 # Starting sh5l with 300s (1) cores
% 0.16/0.47 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.47 # Search class: FGHSF-FSMM31-MFFFFFNN
% 0.16/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.47 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.16/0.47 # Preprocessing time : 0.002 s
% 0.16/0.47 # Presaturation interreduction done
% 0.16/0.47
% 0.16/0.47 # Proof found!
% 0.16/0.47 # SZS status Theorem
% 0.16/0.47 # SZS output start CNFRefutation
% See solution above
% 0.16/0.47 # Parsed axioms : 65
% 0.16/0.47 # Removed by relevancy pruning/SinE : 3
% 0.16/0.47 # Initial clauses : 112
% 0.16/0.47 # Removed in clause preprocessing : 5
% 0.16/0.47 # Initial clauses in saturation : 107
% 0.16/0.47 # Processed clauses : 191
% 0.16/0.47 # ...of these trivial : 0
% 0.16/0.47 # ...subsumed : 2
% 0.16/0.47 # ...remaining for further processing : 189
% 0.16/0.47 # Other redundant clauses eliminated : 29
% 0.16/0.47 # Clauses deleted for lack of memory : 0
% 0.16/0.47 # Backward-subsumed : 0
% 0.16/0.47 # Backward-rewritten : 0
% 0.16/0.47 # Generated clauses : 57
% 0.16/0.47 # ...of the previous two non-redundant : 42
% 0.16/0.47 # ...aggressively subsumed : 0
% 0.16/0.47 # Contextual simplify-reflections : 12
% 0.16/0.47 # Paramodulations : 31
% 0.16/0.47 # Factorizations : 0
% 0.16/0.47 # NegExts : 0
% 0.16/0.47 # Equation resolutions : 29
% 0.16/0.47 # Total rewrite steps : 29
% 0.16/0.47 # Propositional unsat checks : 0
% 0.16/0.47 # Propositional check models : 0
% 0.16/0.47 # Propositional check unsatisfiable : 0
% 0.16/0.47 # Propositional clauses : 0
% 0.16/0.47 # Propositional clauses after purity: 0
% 0.16/0.47 # Propositional unsat core size : 0
% 0.16/0.47 # Propositional preprocessing time : 0.000
% 0.16/0.47 # Propositional encoding time : 0.000
% 0.16/0.47 # Propositional solver time : 0.000
% 0.16/0.47 # Success case prop preproc time : 0.000
% 0.16/0.47 # Success case prop encoding time : 0.000
% 0.16/0.47 # Success case prop solver time : 0.000
% 0.16/0.47 # Current number of processed clauses : 57
% 0.16/0.47 # Positive orientable unit clauses : 15
% 0.16/0.47 # Positive unorientable unit clauses: 0
% 0.16/0.47 # Negative unit clauses : 7
% 0.16/0.47 # Non-unit-clauses : 35
% 0.16/0.47 # Current number of unprocessed clauses: 65
% 0.16/0.47 # ...number of literals in the above : 293
% 0.16/0.47 # Current number of archived formulas : 0
% 0.16/0.47 # Current number of archived clauses : 107
% 0.16/0.47 # Clause-clause subsumption calls (NU) : 2499
% 0.16/0.47 # Rec. Clause-clause subsumption calls : 507
% 0.16/0.47 # Non-unit clause-clause subsumptions : 13
% 0.16/0.47 # Unit Clause-clause subsumption calls : 34
% 0.16/0.47 # Rewrite failures with RHS unbound : 0
% 0.16/0.47 # BW rewrite match attempts : 0
% 0.16/0.47 # BW rewrite match successes : 0
% 0.16/0.47 # Condensation attempts : 0
% 0.16/0.47 # Condensation successes : 0
% 0.16/0.47 # Termbank termtop insertions : 9125
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.021 s
% 0.16/0.47 # System time : 0.002 s
% 0.16/0.47 # Total time : 0.023 s
% 0.16/0.47 # Maximum resident set size: 2064 pages
% 0.16/0.47
% 0.16/0.47 # -------------------------------------------------
% 0.16/0.47 # User time : 0.023 s
% 0.16/0.47 # System time : 0.003 s
% 0.16/0.47 # Total time : 0.026 s
% 0.16/0.47 # Maximum resident set size: 1748 pages
% 0.16/0.47 % E---3.1 exiting
% 0.16/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------