TSTP Solution File: NUM576+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUM576+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n023.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:26 EDT 2023
% Result : Theorem 49.66s 6.89s
% Output : CNFRefutation 49.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 8 unt; 0 def)
% Number of atoms : 56 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 62 ( 27 ~; 24 |; 6 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 15 ( 0 sgn; 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cZyW4pUjbo/E---3.1_20855.p',mLessTotal) ).
fof(m__,conjecture,
( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
file('/export/starexec/sandbox2/tmp/tmp.cZyW4pUjbo/E---3.1_20855.p',m__) ).
fof(mLessASymm,axiom,
! [X1,X2] :
( ( aElementOf0(X1,szNzAzT0)
& aElementOf0(X2,szNzAzT0) )
=> ( ( sdtlseqdt0(X1,X2)
& sdtlseqdt0(X2,X1) )
=> X1 = X2 ) ),
file('/export/starexec/sandbox2/tmp/tmp.cZyW4pUjbo/E---3.1_20855.p',mLessASymm) ).
fof(m__3856,hypothesis,
( aElementOf0(xi,szNzAzT0)
& aElementOf0(xj,szNzAzT0) ),
file('/export/starexec/sandbox2/tmp/tmp.cZyW4pUjbo/E---3.1_20855.p',m__3856) ).
fof(c_0_4,plain,
! [X72,X73] :
( ~ aElementOf0(X72,szNzAzT0)
| ~ aElementOf0(X73,szNzAzT0)
| sdtlseqdt0(X72,X73)
| sdtlseqdt0(szszuzczcdt0(X73),X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])]) ).
fof(c_0_5,negated_conjecture,
~ ( xi != xj
=> ( sdtlseqdt0(szszuzczcdt0(xj),xi)
| sdtlseqdt0(szszuzczcdt0(xi),xj) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X67,X68] :
( ~ aElementOf0(X67,szNzAzT0)
| ~ aElementOf0(X68,szNzAzT0)
| ~ sdtlseqdt0(X67,X68)
| ~ sdtlseqdt0(X68,X67)
| X67 = X68 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])]) ).
cnf(c_0_7,plain,
( sdtlseqdt0(X1,X2)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xj,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
fof(c_0_9,negated_conjecture,
( xi != xj
& ~ sdtlseqdt0(szszuzczcdt0(xj),xi)
& ~ sdtlseqdt0(szszuzczcdt0(xi),xj) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( X1 = X2
| ~ aElementOf0(X1,szNzAzT0)
| ~ aElementOf0(X2,szNzAzT0)
| ~ sdtlseqdt0(X1,X2)
| ~ sdtlseqdt0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3856]) ).
cnf(c_0_12,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xj),X1)
| sdtlseqdt0(X1,xj)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_13,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xj),xi),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,hypothesis,
( X1 = xi
| ~ sdtlseqdt0(xi,X1)
| ~ sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,hypothesis,
sdtlseqdt0(xi,xj),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_13]) ).
cnf(c_0_16,negated_conjecture,
xi != xj,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,hypothesis,
( sdtlseqdt0(szszuzczcdt0(xi),X1)
| sdtlseqdt0(X1,xi)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(spm,[status(thm)],[c_0_7,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ sdtlseqdt0(szszuzczcdt0(xi),xj),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,hypothesis,
~ sdtlseqdt0(xj,xi),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_8])]),c_0_16]) ).
cnf(c_0_20,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_8]),c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM576+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n023.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 2400
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Mon Oct 2 13:43:52 EDT 2023
% 0.15/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 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.cZyW4pUjbo/E---3.1_20855.p
% 49.66/6.89 # Version: 3.1pre001
% 49.66/6.89 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.66/6.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.66/6.89 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.66/6.89 # Starting new_bool_3 with 300s (1) cores
% 49.66/6.89 # Starting new_bool_1 with 300s (1) cores
% 49.66/6.89 # Starting sh5l with 300s (1) cores
% 49.66/6.89 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 20954 completed with status 0
% 49.66/6.89 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 49.66/6.89 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.66/6.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.66/6.89 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.66/6.89 # No SInE strategy applied
% 49.66/6.89 # Search class: FGHSF-SMLM32-MFFFFFNN
% 49.66/6.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 49.66/6.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 49.66/6.89 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 49.66/6.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 49.66/6.89 # Starting new_bool_3 with 136s (1) cores
% 49.66/6.89 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 49.66/6.89 # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 20965 completed with status 0
% 49.66/6.89 # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 49.66/6.89 # Preprocessing class: FSLSSMSMSSSNFFN.
% 49.66/6.89 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 49.66/6.89 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 49.66/6.89 # No SInE strategy applied
% 49.66/6.89 # Search class: FGHSF-SMLM32-MFFFFFNN
% 49.66/6.89 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 49.66/6.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 811s (1) cores
% 49.66/6.89 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 49.66/6.89 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 49.66/6.89 # Starting new_bool_3 with 136s (1) cores
% 49.66/6.89 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 49.66/6.89 # Preprocessing time : 0.157 s
% 49.66/6.89 # Presaturation interreduction done
% 49.66/6.89
% 49.66/6.89 # Proof found!
% 49.66/6.89 # SZS status Theorem
% 49.66/6.89 # SZS output start CNFRefutation
% See solution above
% 49.66/6.89 # Parsed axioms : 85
% 49.66/6.89 # Removed by relevancy pruning/SinE : 0
% 49.66/6.89 # Initial clauses : 4186
% 49.66/6.89 # Removed in clause preprocessing : 7
% 49.66/6.89 # Initial clauses in saturation : 4179
% 49.66/6.89 # Processed clauses : 6143
% 49.66/6.89 # ...of these trivial : 1
% 49.66/6.89 # ...subsumed : 607
% 49.66/6.89 # ...remaining for further processing : 5535
% 49.66/6.89 # Other redundant clauses eliminated : 1940
% 49.66/6.89 # Clauses deleted for lack of memory : 0
% 49.66/6.89 # Backward-subsumed : 9
% 49.66/6.89 # Backward-rewritten : 10
% 49.66/6.89 # Generated clauses : 2059
% 49.66/6.89 # ...of the previous two non-redundant : 2016
% 49.66/6.89 # ...aggressively subsumed : 0
% 49.66/6.89 # Contextual simplify-reflections : 44
% 49.66/6.89 # Paramodulations : 312
% 49.66/6.89 # Factorizations : 0
% 49.66/6.89 # NegExts : 0
% 49.66/6.89 # Equation resolutions : 1941
% 49.66/6.89 # Total rewrite steps : 154
% 49.66/6.89 # Propositional unsat checks : 2
% 49.66/6.89 # Propositional check models : 2
% 49.66/6.89 # Propositional check unsatisfiable : 0
% 49.66/6.89 # Propositional clauses : 0
% 49.66/6.89 # Propositional clauses after purity: 0
% 49.66/6.89 # Propositional unsat core size : 0
% 49.66/6.89 # Propositional preprocessing time : 0.000
% 49.66/6.89 # Propositional encoding time : 0.040
% 49.66/6.89 # Propositional solver time : 0.001
% 49.66/6.89 # Success case prop preproc time : 0.000
% 49.66/6.89 # Success case prop encoding time : 0.000
% 49.66/6.89 # Success case prop solver time : 0.000
% 49.66/6.89 # Current number of processed clauses : 182
% 49.66/6.89 # Positive orientable unit clauses : 40
% 49.66/6.89 # Positive unorientable unit clauses: 0
% 49.66/6.89 # Negative unit clauses : 16
% 49.66/6.89 # Non-unit-clauses : 126
% 49.66/6.89 # Current number of unprocessed clauses: 3631
% 49.66/6.89 # ...number of literals in the above : 42109
% 49.66/6.89 # Current number of archived formulas : 0
% 49.66/6.89 # Current number of archived clauses : 3608
% 49.66/6.89 # Clause-clause subsumption calls (NU) : 6899682
% 49.66/6.89 # Rec. Clause-clause subsumption calls : 71957
% 49.66/6.89 # Non-unit clause-clause subsumptions : 647
% 49.66/6.89 # Unit Clause-clause subsumption calls : 447
% 49.66/6.89 # Rewrite failures with RHS unbound : 0
% 49.66/6.89 # BW rewrite match attempts : 5
% 49.66/6.89 # BW rewrite match successes : 5
% 49.66/6.89 # Condensation attempts : 0
% 49.66/6.89 # Condensation successes : 0
% 49.66/6.89 # Termbank termtop insertions : 781398
% 49.66/6.89
% 49.66/6.89 # -------------------------------------------------
% 49.66/6.89 # User time : 6.267 s
% 49.66/6.89 # System time : 0.045 s
% 49.66/6.89 # Total time : 6.312 s
% 49.66/6.89 # Maximum resident set size: 13432 pages
% 49.66/6.89
% 49.66/6.89 # -------------------------------------------------
% 49.66/6.89 # User time : 30.331 s
% 49.66/6.89 # System time : 0.140 s
% 49.66/6.89 # Total time : 30.472 s
% 49.66/6.89 # Maximum resident set size: 1808 pages
% 49.66/6.89 % E---3.1 exiting
% 49.66/6.89 % E---3.1 exiting
%------------------------------------------------------------------------------